SearcharxivSearch

arXiv subjects

Asif Zaman

Publications and source records attributed to Asif Zaman.

At least 19 recordsLinked to original sources

A Clustering-Based Framework for Identifying Suspicious Trading Patterns in Capital Market

Market manipulation is the dubious practice of manipulating stock prices in order to make a quick profit, which truly degrades confidence on trading platforms. We implemented an unsupervised fraud-detection toolkit that begins with K-Means++ clustering to address this issue. A dataset of roughly one million financial transactions from 2012 to 2024 is used. In order to identify fraudulent trades and categorize them using market practice heuristic thresholds, the study suggests a clustering-based pipeline. The method highlights 2.02% of trades as suspicious where 51.10% clearly indicate spoofing, 0.10% indicate pump and dump, 0.55% indicate insider trading, 1.43% indicate a fake breakout, and 46.83% are unclassified. Despite the lack of ground truth, the model's performance is confirmed by a Silhouette Score of 0.561.

cs.AI

Dynamical stability and multifunctional properties of Ni2+/Pr3+ co-doped CsPbCl3 perovskite: insights from first-principles lattice dynamics and carrier transport

All inorganic halide perovskites offer promising optoelectronic properties at low cost, but their structural softness and thermal instability limit applications. Density functional theory using the FP-LAPW method (WIEN2k) was used to study Ni2+/Pr3+ co-doping in CsPbCl3. Results show Ni2+ substitutes for Pb2+ at the B-site and Pr3+ for Cs at the A-site, keeping charge balance. Co-doping stabilizes the lattice, raises formation energies of halogen and metal vacancies, and reduces deep defect levels in the band gap. Phonon dispersion confirms that both pristine and co-doped CsPbCl3 are dynamically stable. Ni2+/Pr3+ co-doping suppresses low-energy vibrations and causes mode splitting in the 3 to 5 THz range, increasing phonon scattering and lowering lattice thermal conductivity. Mechanical analysis reveals higher elastic constants and bulk modulus, while ductility remains unchanged. Electronic structure calculations reveal Ni-3d and Pr-4f states at the band edges, reducing effective carrier mass and passivating vacancy states. Optical absorption is red-shifted, and the high-frequency ({\epsilon} = 2.4) and low-frequency ({\epsilon} = 7.4) dielectric constants are distinct. Transport analysis finds higher carrier mobility due to lighter effective masses. Altogether, Ni2+/Pr3+ co-doping reduces defect concentrations and improves the optoelectronic properties of CsPbCl3.

cond-mat.mtrl-sci

Numerical Computations Concerning Landau-Siegel Zeros

We computationally verify that if $L(s,\chi)$ is a quadratic Dirichlet $L$-function modulo $q \leq 10^{10}$ then $L(\sigma,\chi) \neq 0$ for real $\sigma \ge 1-1/(5\log q)$. The number of verified moduli exceeds benchmarks due to Watkins (2004), Platt (2016), and Languasco (2023) by a factor between 66 and 25,000. Our new algorithm draws from zero-free region arguments.

math.NT

The least prime with a given cycle type

Let $G$ be a finite group. Let $K/k$ be a Galois extension of number fields with Galois group isomorphic to $G$, and let $C \subseteq \mathrm{Gal}(K/k) \simeq G$ be a conjugacy invariant subset. It is well known that there exists an unramified prime ideal $\mathfrak{p}$ of $k$ with Frobenius element lying in $C$ and norm satisfying $\mathrm{N}\mathfrak{p} \ll |\mathrm{Disc}(K)|^{\alpha}$ for some constant $\alpha = \alpha(G,C)$. There is a rich literature establishing unconditional admissible values for $\alpha$, with most approaches proceeding by studying the zeros of $L$-functions. We give an alternative approach, not relying on zeros, that often substantially improves this exponent $\alpha$ for any fixed finite group $G$, provided $C$ is a union of rational equivalence classes. As a particularly striking example, we prove that there exist absolute constants $c_1,c_2 > 0$ such that for any $n\geq 2$ and any conjugacy class $C \subset S_n$, one may take $\alpha(S_n,C) = c_1 \exp(-c_2n)$. Our approach reduces the core problem to a question in character theory.

math.NT

Central limit theorems for random multiplicative functions over function fields

We provide a sufficient characterization for subsets $\mathcal{A}$ of the polynomial ring $\mathbb{F}_q[t]$ for which partial sums of Steinhaus random multiplicative functions approach a complex standard normal distribution. This extends recent work of Soundararajan and Xu to the function field setting. We apply this characterization to deduce central limit theorems in four cases: polynomials in short intervals, polynomials with few prime factors, shifted primes, and rough polynomials. In doing so, we also establish an explicit Hildebrand inequality for smooth polynomials in short intervals, a function field form of Shiu's theorem for multiplicative functions, and an explicit Chebyshev bound for rough polynomials in short intervals.

math.NT

CodeR3: A GenAI-Powered Workflow Repair and Revival Ecosystem

Scientific workflows encode valuable domain expertise and computational methodologies. Yet studies consistently show that a significant proportion of published workflows suffer from decay over time. This problem is particularly acute for legacy workflow systems like Taverna, where discontinued services, obsolete dependencies, and system retirement render previously functional workflows unusable. We present a novel legacy workflow migration system, called CodeR$^3$ (stands for Code Repair, Revival and Reuse), that leverages generative AI to analyze the characteristics of decayed workflows, reproduce them into modern workflow technologies like Snakemake and VisFlow. Our system additionally integrates stepwise workflow analysis visualization, automated service substitution, and human-in-the-loop validation. Through several case studies of Taverna workflow revival, we demonstrate the feasibility of this approach while identifying key challenges that require human oversight. Our findings reveal that automation significantly reduces manual effort in workflow parsing and service identification. However, critical tasks such as service substitution and data validation still require domain expertise. Our result will be a crowdsourcing platform that enables the community to collaboratively revive decayed workflows and validate the functionality and correctness of revived workflows. This work contributes a framework for workflow revival that balances automation efficiency with necessary human judgment.

cs.SE

Effective Brauer-Siegel theorems for Artin $L$-functions

Given a number field $K \neq \mathbb{Q}$, in a now classic work, Stark pinpointed the possible source of a so-called Landau-Siegel zero of the Dedekind zeta function $\zeta_K(s)$ and used this to give effective upper and lower bounds on the residue of $\zeta_K(s)$ at $s=1$. We extend Stark's work to give effective upper and lower bounds for the leading term of the Laurent expansion of general Artin $L$-functions at $s=1$ that are, up to the value of implied constants, as strong as could reasonably be expected given current progress toward the generalized Riemann hypothesis. Our bounds are completely unconditional, and rely on no unproven hypotheses about Artin $L$-functions.

math.NT

Enhancement of non-Markovianity due to environment-induced indirect interaction

Non-Markovian effects are often significant when the system-environment coupling is not weak. Indeed, we find that the non-Markovianity is negligible for a single two-level system undergoing pure dephasing via a weak interaction with a harmonic-oscillator environment. In this paper, we show that, within the framework of pure dephasing, the non-Markovianity displayed by a two-level system can, in fact, be far more pronounced. To demonstrate that this is indeed the case, we consider a pure dephasing model where a collection of two-level systems interacts with a common environment. We obtain analytically the dynamics of the collection of the two-level systems, and then take a partial trace over all the two-level systems except one. This remaining single two-level system exhibits markedly non-Markovian dynamics, even when the system-environment coupling is weak. This is due to the indirect interaction between the two-level systems, induced by their interaction with the common environment. In fact, this indirect interaction can not only increase the non-Markovianity by orders of magnitude, but also qualitatively change the characteristics of the non-Markovian behavior. For instance, for a single two-level system undergoing pure dephasing, the dynamics are Markovian for both Ohmic and sub-Ohmic environments. This is markedly not the case when we consider multiple two-level systems. These findings provide insights into controlling decoherence in multi-qubit quantum systems and have implications for quantum technologies where non-Markovianity can be a resource rather than a limitation.

quant-ph

Privacy Preserving Machine Learning Model Personalization through Federated Personalized Learning

The widespread adoption of Artificial Intelligence (AI) has been driven by significant advances in intelligent system research. However, this progress has raised concerns about data privacy, leading to a growing awareness of the need for privacy-preserving AI. In response, there has been a seismic shift in interest towards the leading paradigm for training Machine Learning (ML) models on decentralized data silos while maintaining data privacy, Federated Learning (FL). This research paper presents a comprehensive performance analysis of a cutting-edge approach to personalize ML model while preserving privacy achieved through Privacy Preserving Machine Learning with the innovative framework of Federated Personalized Learning (PPMLFPL). Regarding the increasing concerns about data privacy, this study evaluates the effectiveness of PPMLFPL addressing the critical balance between personalized model refinement and maintaining the confidentiality of individual user data. According to our analysis, Adaptive Personalized Cross-Silo Federated Learning with Differential Privacy (APPLE+DP) offering efficient execution whereas overall, the use of the Adaptive Personalized Cross-Silo Federated Learning with Homomorphic Encryption (APPLE+HE) algorithm for privacy-preserving machine learning tasks in federated personalized learning settings is strongly suggested. The results offer valuable insights creating it a promising scope for future advancements in the field of privacy-conscious data-driven technologies.

cs.LG

A guide to Tauberian theorems for arithmetic applications

A Tauberian theorem deduces an asymptotic for the partial sums of a sequence of non-negative real numbers from analytic properties of an associated Dirichlet series. Tauberian theorems appear in a tremendous variety of applications, ranging from well-known classical applications in analytic number theory, to new applications in arithmetic statistics, group theory, and the intersection of number theory and algebraic geometry. The goal of this article is to provide a useful reference for practitioners who wish to apply a Tauberian theorem. We explain the hypotheses and proofs of two types of Tauberian theorems: one with and one without an explicit remainder term. We furthermore provide counterexamples that illuminate that neither theorem can reach an essentially stronger conclusion unless its hypothesis is strengthened.

math.NT

Improving the trivial bound for $\ell$-torsion in class groups

For any number field $K$ with $D_K=|\mathrm{Disc}(K)|$ and any integer $\ell \geq 2$, we improve over the commonly cited trivial bound $|\mathrm{Cl}_K[\ell]| \leq |\mathrm{Cl}_K| \ll_{[K:\mathbb{Q}],\varepsilon} D_K^{1/2+\varepsilon}$ on the $\ell$-torsion subgroup of the class group of $K$ by showing that $|\mathrm{Cl}_K[\ell]| = o_{[K:\mathbb{Q}],\ell}(D_K^{1/2})$. In fact, we obtain an explicit log-power saving. This is the first general unconditional saving over the trivial bound that holds for all $K$ and all $\ell$.

math.NT

Explicit Deuring-Heilbronn phenomenon for Dirichlet $L$-functions

Assuming the existence of a Landau-Siegel zero, we establish an explicit Deuring-Heilbronn zero repulsion phenomenon for Dirichlet $L$-functions modulo $q$. Our estimate is uniform in the entire critical strip, and improves over the previous best known explicit estimate due to Thorner and Zaman.

math.NT

Moments of random multiplicative functions over function fields

Granville-Soundararajan, Harper-Nikeghbali-Radziwill, and Heap-Lindqvist independently established an asymptotic for the even natural moments of partial sums of random multiplicative functions defined over integers. Building on these works, we study the even natural moments of partial sums of Steinhaus random multiplicative functions defined over function fields. Using a combination of analytic arguments and combinatorial arguments, we obtain asymptotic expressions for all the even natural moments in the large field limit and large degree limit, as well as an exact expression for the fourth moment.

math.NT

An explicit version of Bombieri's log-free density estimate and S\'ark\"ozy's theorem for shifted primes

We make explicit Bombieri's refinement of Gallagher's log-free "large sieve density estimate near $\sigma = 1$" for Dirichlet $L$-functions. We use this estimate and recent work of Green to prove that if $N\geq 2$ is an integer, $A\subseteq\{1,\ldots,N\}$, and for all primes $p$ no two elements in $A$ differ by $p-1$, then $|A|\ll N^{1-1/10^{18}}$. This strengthens a theorem of S\'ark\"ozy.

math.NT

A zero density estimate for Dedekind zeta functions

Given a nontrivial finite group $G$, we prove the first zero density estimate for families of Dedekind zeta functions associated to Galois extensions $K/\mathbb{Q}$ with $\mathrm{Gal}(K/\mathbb{Q})\cong G$ that does not rely on unproven progress towards the strong form of Artin's conjecture. We use this to remove the hypothesis of the strong Artin conjecture from the work of Pierce, Turnage-Butterbaugh, and Wood on the average error in the Chebotarev density theorem and $\ell$-torsion in ideal class groups.

math.NT

Refinements to the prime number theorem for arithmetic progressions

We prove a version of the prime number theorem for arithmetic progressions that is uniform enough to deduce the Siegel-Walfisz theorem, Hoheisel's asymptotic for intervals of length $x^{1-δ}$, a Brun-Titchmarsh bound, and Linnik's bound on the least prime in an arithmetic progression as corollaries. Our proof uses the Vinogradov-Korobov zero-free region, a log-free zero density estimate, and the Deuring-Heilbronn zero repulsion phenomenon. Improvements exist when the modulus is sufficiently powerful.

math.NT

A conjectural asymptotic formula for multiplicative chaos in number theory

We investigate a special sequence of random variables $A(N)$ defined by an exponential power series with independent standard complex Gaussians $(X(k))_{k \geq 1}$. Introduced by Hughes, Keating, and O'Connell in the study of random matrix theory, this sequence relates to Gaussian multiplicative chaos (in particular "holomorphic multiplicative chaos'' per Najnudel, Paquette, and Simm) and random multiplicative functions. Soundararajan and Zaman recently determined the order of $\mathbb{E}[|A(N)|]$. By constructing an algorithm to calculate $A(N)$ in $O(N^2 \log N)$ steps, we produce computational evidence that their result can likely be strengthened to an asymptotic result with a numerical estimate for the asymptotic constant. We also obtain similar conclusions when $A(N)$ is defined using standard real Gaussians or uniform $\pm 1$ random variables. However, our evidence suggests that the asymptotic constants do not possess a natural product structure.

math.NT