Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.36588

Square-root logarithmic bounds for the arithmetic complexity of factorial multiples

Liang Zhang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Assume that the Riemann zeta function has no zeros in $\Re(s)>1-δ$, $s\neq1$, for some fixed $0<δ\leq1/2$. We prove that, for every sufficiently large integer $k$, a positive multiple $m_k k!$ has arithmetic complexity $τ(m_k k!)\leq\exp(C\sqrt{\log k\log\log k})$, where $C$ depends only on $δ$. We first establish a smooth-number asymptotic at every sufficiently large center $x$ in intervals of length at least $x^{3/4}$. Combining this estimate with an established genus-two construction yields the arithmetic bound without Cheng's conjecture on smooth numbers in elliptic Hasse intervals. The bound includes the cost of constructing all integer parameters. This work was carried out with assistance from the UniMath model, developed by UniDT (Shanghai) Co., Ltd., and OpenAI's GPT-6.1 Sol and GPT-6 Astra.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Liang Zhang. 2026-10-27. Square-root logarithmic bounds for the arithmetic complexity of factorial multiples. https://arxiv.org/abs/2610.36588

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Effective Chebotarev-Sato-Tate distribution for Abelian varieties with applications

We establish a uniform effective Chebotarev-Sato-Tate estimate for abelian varieties, conditional on the Mumford-Tate conjecture and the standard analytic conjectures for L-functions attached to the irreducible representations of the Chebotarev-Sato-Tate group. The proof uses spectral majorants and minorants of indicator functions. For regions whose boundaries have finite upper (d-1)-dimensional Minkowski content, the resulting exponent improves that in Bucur et al. (Theorem 1.1, 2024) whenever the Sato-Tate group has rank greater than one. We establish uniform estimates for regions and finite Galois extensions that vary with the counting parameter, and for prime-dependent regions satisfying an explicit variation condition. As an application, we obtain a conditional upper bound for the number of primes at which a weight-two newform with a quadratic coefficient field has a rational Fourier coefficient. We also formulate a discrepancy conjecture, motivated by a probabilistic model, that implies the asymptotic predicted by Murty (Conjecture 3.4, 1999).

math.NT↗
arXiv2026

Archimedean zeta integrals on $ {\rm SO}_{2n} \times {\rm GL}_n$ and $ {\rm Sp}_{2n} \times {\rm GL}_n $

We evaluate the archimedean Rankin-Selberg zeta integrals associated with spherical principal series representations of ${\rm SO}_{2n}(\mathbf R) \times {\rm GL}_n(\mathbf R) $ and $ {\rm Sp}_{2n}(\mathbf R) \times {\rm GL}_n(\mathbf R) $, where $ {\rm SO}_{2n} $ is split and $n\ge2$. We obtain explicit formulas expressing these integrals as quotients of products of gamma functions. Our approach uses Mellin-Barnes representations of spherical Whittaker functions, together with new integral identities for their Mellin transforms and transformations of Barnes integrals. In the even orthogonal case, we establish a recurrence in the rank and evaluate the integral by induction. The symplectic case then follows from an explicit identity relating the two families of zeta integrals.

math.NT↗
arXiv2026

Resolvent Components of Completely Normal Elements and the Morgan-Mullen Conjecture

We study completely normal elements of $\mathbb{F}_{q^n}$ over $\mathbb{F}_q$, that is, elements that are normal over every intermediate field, through partial Lagrange resolvents. In these coordinates, complete normality splits into independent components, in a way closely related to Hachenberger's decomposition theory. Our main tool is a structure theorem for the components; together with a finite computation, it shows that every component has weight (the sum of the probabilities that its conditions fail) at most $3/4$, uniformly in $n$. Combined with the classical character-sum method, this gives an explicit sufficient criterion for the existence of a primitive completely normal element. We verify the criterion for all $n>q$ except $70$ pairs $(q,n)$, which we settle with explicit elements found by computer. Since the case $n\le q$ is due to Garefalakis and Kapetanakis, this confirms the conjecture of Morgan and Mullen (1996) that every $\mathbb{F}_{q^n}$ contains a primitive element that is completely normal over $\mathbb{F}_q$. The same estimates give two further results. First, Hachenberger's conjectured lower bound $(q-1)^{n'}q^{(p^a-1)n'}$ for the number of completely normal elements, where $p$ is the characteristic and $n=p^an'$ with $p\nmid n'$, holds for all pairs $(q,n)$; it was known for regular pairs. Second, primitivity and complete normality are asymptotically independent: as $q^n\to\infty$, the number of primitive completely normal elements is $(1+o(1))\,φ(q^n-1)/(q^n-1)$ times the number of completely normal elements (for fixed $n$ this was known). Our arguments for $n>q$ and for both further results, including every computer-assisted step, are formalised in Lean 4 with Mathlib; the formalisation takes the case $n\le q$ and an explicit bound of Rosser and Schoenfeld as axioms and relies on Lean's compiler and interpreter for the large computations.

math.NT↗