Browse

Number Theory

math.NT — Number Theory

math.NT RSS feed

Works in math.NT

339 works

math.NT — Number Theory

Consecutive primes at distances 123,662 and 125,318

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We exhibit consecutive-prime gaps of exactly 123 662123\,662 and 125 318125\,318, with endpoints of 8 4168\,416 and 6 4546\,454 decimal digits, respectively. Covering congruences certify most interior integers as composite. For the second gap, the remaining integers are certified by proper divisors or Fermat witnesses. Elliptic-curve certificates prove all four endpoints prime. We give the elementary arguments that turn these finite arithmetic checks into a proof. The proof is computer-assisted.

Author comments: 4 pages. The supplementary arithmetic appendix supplies the exact covering tables, additional compositeness witnesses, four endpoint primality chains, and elementary order certificates for the terminal primes.

Primarily AI-generated textHuman understanding: all parts
Nov 16, 20264 pages
PDFView work

math.AG — Algebraic Geometry

Essential dimension of geometric local systems

Contributed by Mark Kisin

Let f : X → B be a smooth projective family over a smooth complex variety, and let H = (Rmf∗Z)/tors. We prove that there is an integer N such that, whenever pn ≥N, the essential dimension at p of H/pn is at least the dimension of its period image. This proves the Brosnan–Fakhruddin conjecture for these local systems. The proof compares the geometric Sen operator with the Higgs field. Integral Hodge–Tate theory gives a bound uniform in large primes. For each remaining prime, a bounded rational comparison at one geometric point suffices when n is large.

A mix of human-written and AI-generated textHuman understanding: all partsEssential dimension
Nov 16, 202614 pages
PDFView work

math.NT — Number Theory

Smooth Numbers in Arithmetic Progressions with Uniformity in the Residue Class

Contributed by Sarvagya Jain

We improve the level of distribution of smooth numbers in arithmetic progressions to x5/8−ϵx^{5/8-\epsilon}, with uniformity in the residue class. In particular, for every ϵ,A>0\epsilon,A>0 and integer k≥1k\geq1, there exist δ,C>0\delta,C>0 such that $$ \sum_{\substack{q\leq x^{5/8-\epsilon}\\(q,a_1a_2)=1}}\tau_k(q)\sup_{0\leq z\leq x} \Biggl|\Psi(z,y;a_1\overline{a_2},q) -\frac{1}{\phi(q)}\Psi_q(z;y)\Biggr| \ll_{\epsilon,A,k}\frac{\Psi(x;y)}{(\log x)^A}, $$ uniformly for x≥2x\geq2, (log⁡x)C≤y≤x1/C(\log x)^C\leq y\leq x^{1/C}, and a1,a2∈Z∖{0}a_1,a_2\in\Z\setminus\{0\} satisfying $$ |a_1|\leq x^{1+\delta},\qquad |a_2|\leq x^\delta,\qquad (a_1,a_2)=1. $$ Here Ψ(z;y)\Psi(z;y) counts the yy-smooth integers up to zz, Ψq(z;y)\Psi_q(z;y) counts those coprime to qq, and Ψ(z,y;a,q)\Psi(z,y;a,q) counts those congruent to aa modulo qq; τk\tau_k is the kk-fold divisor function. The proof combines dispersion with second and fourth spectral moments.

Author comments: This work is an extension to author's work submitted to arxiv concerning an improvement to a prior work of Balog concerning writing positive integers as a sum of two smooth numbers.

Primarily AI-generated textHuman understanding: some parts
Nov 16, 202632 pages
PDFView work

math.NT — Number Theory

Three Properties of Markov–Hurwitz Equations

Contributed by Qiyue Tang

We prove Laurent positivity for pure Markov–Hurwitz mutations, density-one uniqueness by the largest coordinate for positive integral solutions of the symmetric generalized equation, and labelled Vieta connectivity for the pure equation on points with at most one zero coordinate over sufficiently large prime fields.

Author comments: The ideas behind this work came primarily from the author and were developed through discussions with ChatGPT.

Primarily AI-generated textHuman understanding: some parts
Nov 16, 202639 pages
PDFView work

math.NT — Number Theory

A narrower admissible 234 360 000-tuple and H_5 <= 4 891 341 734

Contributed by David Niedbala Giraudin

Let H_m = liminf (p_{n+m} - p_n). Kapila proved DHL[234360000,6] and deduced H_5 <= 5040082836, the diameter of the tuple formed by the 234360000 smallest primes larger than 234360000. We construct an admissible 234360000-tuple of diameter 4891341734, which gives H_5 <= 4891341734 with Kapila's theorem. The tuple consists of +-1 and of +-q for primes q in a symmetric window, with 1746831 primes removed; its admissibility is checked by two independent programs.

Primarily AI-generated textHuman understanding: no partsMaynard-Tao sieveadmissible tuplesbounded gapscomputer-assisted proofgaps between primes
Nov 16, 20263 pages
PDFView work

math.NT — Number Theory

A lower bound 0.11096505 for Romanoff's constant

Contributed by David Niedbala Giraudin

Let d be the lower density of the integers of the form p + 2^a with p prime and a >= 1. We prove d >= 0.11096505, unconditionally. The previous best unconditional bound is d >= 0.110825, due to Tomar. The proof is Tomar's method, with the same analytic inputs, applied to a different modulus of the same period 27720; the bound is certified in exact rational arithmetic by Tomar's checking program, with changes that only make the computation faster and that we verify against the original program.

Primarily AI-generated textHuman understanding: no partsPintz inequalityRomanoff's constantSelberg sievecomputer-assisted proofprimes and powers of two
Nov 16, 20263 pages
PDFView work

math.NT — Number Theory

Consecutive primes at distance 122,290

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We exhibit two consecutive primes whose difference is exactly 122 290122\,290. Both primes have 8 2628\,262 decimal digits. Every integer strictly between them has a prime divisor at most 32 46732\,467. We give the covering argument and the elliptic-curve criterion that certify the result. The proof is computer-assisted and uses finite arithmetic checks to establish endpoint primality and the compositeness of every interior integer.

Author comments: 3 pages. The supplementary arithmetic appendix supplies the full covering table and both endpoint primality chains.

Primarily AI-generated textHuman understanding: all parts
Nov 16, 20263 pages
PDFView work

math.NT — Number Theory

A DETAILED FINITE-CARRY PROOF OF A CONJECTURE ON PERMUTATION BINOMIALS IN CHARACTERISTIC TWO

Contributed by yi li

Let q = 2m, where m ≥ 5 is odd and 3 | m. Tu, Zeng, Jiang and Li formulated a conjecture asserting that if a family of Hermite-type sums Sr,α(y), attached to the binomial xr(a+ x3(q−1)), vanishes for every α with 3 | (1 + α), then y3 = 1. We give a detailed proof, including all exceptional and boundary cases. In fact, seven indices suffice: α ∈ {2,8,14,20,26,32,38}. The first two indices reduce a hypothetical counterexample to a primitive seventh root of unity. Lucas’s theorem then turns the remaining equations into six-bit conditions, and an explicit finite carry elimination completes the proof. The paper records the complete residue tables, their derivation, and a short SageMath verification certificate.

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 16, 202611 pages
PDFView work

math.NT — Number Theory

Pair correlation of LL-zeros and Hooley's conjecture

Contributed by Travor Zihao Liu

In this article, we study the form factor for zeros of Dirichlet LL-functions, pairing zeros of the same LL-function and then averaging over primitive characters modulo a prime conductor. Unconditionally, we show for ∣α∣<1|\alpha|<1 that the form factor agrees with the random matrix prediction from the Circular Unitary Ensemble (CUE). Under GRH and the Hardy--Littlewood twin primes conjecture, we extend this agreement to ∣α∣<2|\alpha|<2. For ∣α∣≥1|\alpha|\ge1, we prove that the CUE prediction is equivalent to Hooley's conjecture for the variance of primes in arithmetic progressions with prime moduli. We also explore applications of these form-factor results to the simplicity of zeros.

Primarily human-written textHuman understanding: all parts
Nov 16, 202622 pages
PDFView work

math.NT — Number Theory

Geometric Equivalence of the Riemann Hypothesis

Contributed by FELIPE MARTINS SANTOS

We study the complex rational extensions of two sequences, called SeqImpar and SeqPar, and the way their geometric images relate to the nontrivial zeros of the Riemann zeta function. We prove that I(z) = 5 − 4/(z − 1) maps the critical line Re(z) = 1/2 to the circle |w − 9| = 4, and that, for w = I(ρ), rational inversion recovers exactly the coordinates Re(ρ) and γ = Im(ρ). We show that SeqPar induces a second rational curve and that its extension is injective in the half-plane Re(z) > 0. To distinguish points corresponding to zeta zeros from the other points on these curves, we use a Dirichlet series weighted by the convergence errors of the sequences and prove the correspondence between its poles and the nontrivial zeros. This yields a geometric criterion rigorously equivalent to the Riemann Hypothesis: all relevant poles of the transformed function must lie on the indicated circle. We present formulas for extracting ordinates using residues and contour integrals, together with numerical checks involving the first five known zeros. The results constitute an exact reformulation of the hypothesis, not a proof of its truth or an independent algorithm for computing new zeros.

Author comments: A parallel construction holds for SeqPar’s curve CP . These characterizations do not prove RH; they make the geometric equivalence explicit and locate the remaining difficulty in independently determining the poles of the transform. https://doi.org/10.5281/zenodo.24247902

A mix of human-written and AI-generated textHuman understanding: all partsRiemann Hypothesis
Nov 15, 202610 pages
PDFView work

math.NT — Number Theory

Vieta invariants and Markoff–Hurwitz orbits

Contributed by Qiyue Tang

We classify rational Vieta invariants for Guéritaud's family in characteristic zero, including every nonzero fiber. For each positive integer coefficient and each dimension residue class, we construct infinitely many Markoff–Hurwitz equations with infinitely many maxima shared by at least any prescribed number of distinct positive integer orbits.

Author comments: The ideas in this article originated in the author’s own work and in discussions with ChatGPT.

Primarily AI-generated textHuman understanding: some parts
Nov 15, 20266 pages
PDFView work

math.NT — Number Theory

The reciprocal cube sums of Lucas sequences of quadratic units are irrational

Contributed by Shawn Krisman

Let η>1\eta>1 be a unit of a real quadratic order and Un=(ηn−ηˉn)/(η−ηˉ)U_n=(\eta^n-\bar\eta^n)/(\eta-\bar\eta) its Lucas sequence. We prove that ∑n≥1Un−3\sum_{n\ge1}U_n^{-3} is irrational. Equivalently, ∑n≥1Un(P,Q)−3∉Q\sum_{n\ge1}U_n(P,Q)^{-3}\notin\mathbb{Q} for the Lucas sequences with Q=−1Q=-1, P≥1P\ge1, and with Q=1Q=1, P≥3P\ge3. In particular the sums of the reciprocal cubes of the Pell numbers and of the numbers FknF_{kn}, for every k≥1k\ge1, are irrational. The case of the Fibonacci numbers was treated in earlier work of the author; the proof here is the same Hankel-determinant construction, carried out for a general unit and for both signs of its norm. The constants of the argument do not depend on η\eta once they are measured in units of log⁡η\log\eta. The whole argument is formalised in Lean 4 with Mathlib.

Primarily AI-generated textHuman understanding: no partsFibonacci numbersHankel determinantsLeanLucas sequencesPell numbersirrationalityq-series
Nov 15, 202613 pages
PDFView work

math.NT — Number Theory

Density-One Uniqueness for Markoff–Hurwitz Solutions

Contributed by Qiyue Tang

For each fixed integer n≥4n\ge4, we prove that almost every positive integer solution of ∑i=1nxi2=n∏i=1nxi\sum_{i=1}^n x_i^2=n\prod_{i=1}^n x_i is determined up to permutation by its largest coordinate. The density is taken over sorted solutions with largest coordinate at most RR, as R→∞R\to\infty.

Author comments: The author initiated this project to extend the density-one uniqueness results in William Y. Chen’s *Almost all Markoff numbers are unique* and the author’s earlier *Almost all \(k\)-Markov numbers are unique* to the standard Markoff–Hurwitz equation in \(n\ge 4\) variables. Both preprints appeared on Hexagon. [Chen, 2610.00281v2](https://hexagonmath.org/2610.00281v2) · [Tang, 2611.00216v1](https://hexagonmath.org/2611.00216v1) I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

Primarily AI-generated textHuman understanding: some parts
Nov 15, 202620 pages
PDFView work

math.RT — Representation Theory

Unramified multiplicity one spherical pairs

Contributed by Rui Chen

Let pp be an odd prime and let kk be a finite extension of Qp\mathbb{Q}_{p}. We study the distinction between multiplicity one for unramified representations and multiplicity one for irreducible unitary representations. We prove that (G2, SL3) has the former property but not the latter. The unramified multiplicity one assertion uses spherical functions and the spherical Hecke module. For the failure of multiplicity one property, we use Weil representations and theta lifting to obtain an irreducible unitarizable representation with at least two independent SL3(k)-invariant linear forms.

A mix of human-written and AI-generated textHuman understanding: some partsGelfand pairsmultiplicity one property
Nov 15, 202618 pages
PDFView work

math.NT — Number Theory

Bounds for the smallest limit point of the areal Mahler measure of totally positive algebraic integers

Contributed by Tejasvi Singh Tomar

Pritsker's areal analog ∥P∥0\|P\|_0 of the Mahler measure replaces the integral of log⁡∣P∣\log|P| over the unit circle by its integral over the unit disc with respect to normalized area. For an algebraic number α\alpha of degree nn with minimal polynomial P∈Z[x]P\in\mathbb{Z}[x], taken primitive with positive leading coefficient, let N0(α)=∥P∥01/nN_0(\alpha)=\|P\|_0^{1/n}. Flammang proved that N0(α)≥1.380047N_0(\alpha)\ge1.380047 for every totally positive algebraic integer α\alpha outside an explicit finite set. We prove that the smallest limit point of the values of N0N_0 on totally positive algebraic integers and their essential minimum lie between 1.38301341.3830134 and 1.38395791.3839579. The lower bound improves on Flammang's constant: it holds for all but finitely many totally positive algebraic numbers, not only integers, although the exceptions are not determined. Infinitely many totally positive algebraic integers satisfy N0(α)<1.3839579N_0(\alpha)<1.3839579. The lower bound comes from an auxiliary function with a logarithmic energy term, and the upper bound from an explicit measure that, by a criterion and a theorem of Smith, is a limit of distributions of conjugates of totally positive algebraic integers. The inequalities behind both bounds are verified in ball arithmetic, and both bounds are also proved in Lean, the upper one assuming Smith's theorem.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23715993

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202610 pages
PDFView work

math.NT — Number Theory

An upper bound for the smallest limit point of the absolute Mahler measure of totally positive algebraic integers

Contributed by Tejasvi Singh Tomar

Let ℓ+\ell_+ be the smallest limit point of the values of the absolute Mahler measure Ω(α)=M(α)1/deg⁡α\Omega(\alpha)=M(\alpha)^{1/\deg\alpha} on totally positive algebraic integers α\alpha. Smyth's work gives ℓ+≤ℓ2=1.72731…\ell_+\le\ell^2=1.72731\ldots, where ℓ=1.31427…\ell=1.31427\ldots is the limit point that he found for totally real algebraic integers. We prove ℓ+≤1.7239501\ell_+\le1.7239501, and that infinitely many totally positive algebraic integers satisfy Ω(α)<1.7239501\Omega(\alpha)<1.7239501. Together with the lower bound ℓ+>1.7234615\ell_+>1.7234615 of a companion paper, this places ℓ+\ell_+ in an interval of length less than 4.9⋅10−44.9\cdot10^{-4}. The proof exhibits a measure μ\mu on [0,9][0,9] with a piecewise linear density on 3,4813{,}481 rational nodes. Its logarithmic potential is bounded below by a combination of log⁡∣Q∣\log|Q| for 2121 irreducible polynomials QQ, namely xx and polynomials taken from Flammang's work. By a criterion of Smith, μ\mu, normalized to mass 11, is a limit of distributions of conjugates of totally positive algebraic integers, and its integral of log⁡+x\log^{+} x gives the bound. Two separately written programs verify the conditions in ball arithmetic. Both results are also proved in the Lean proof assistant, assuming Smith's theorem and a lower bound for the potential of the arcsine measure, with the checks of the certificate run either as compiled code or by Lean's kernel.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23544556

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 20269 pages
PDFView work

math.NT — Number Theory

A lower bound for the smallest limit point of the absolute Mahler measure of totally positive algebraic integers

Contributed by Tejasvi Singh Tomar

Let ℓ+\ell_+ be the smallest limit point of the absolute Mahler measures Ω(α)=M(α)1/deg⁡α\Omega(\alpha)=M(\alpha)^{1/\deg\alpha} of totally positive algebraic integers α\alpha. By work of Smyth, ℓ+≤1.7274\ell_+\le1.7274, and the best lower bound was Flammang's ℓ+≥1.722069\ell_+\ge1.722069. We prove that all but finitely many totally positive algebraic numbers α\alpha satisfy Ω(α)>1.7234615\Omega(\alpha)>1.7234615, and that ℓ+>1.7234615\ell_+>1.7234615. We also prove that all but finitely many totally real algebraic numbers β\beta have absolute logarithmic Weil height log⁡Ω(β)>0.2721673\log\Omega(\beta)>0.2721673. The proof adds to Smyth's method of auxiliary functions the logarithmic energy term that Orloski, Talebizadeh Sardari and Smith derived from the integrality of discriminants for the Schur–Siegel–Smyth trace problem. The resulting inequality is verified rigorously by computer, and the lower bounds are also proved in the Lean proof assistant.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23715956

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202612 pages
PDFView work

math.NT — Number Theory

A lower bound for the essential minimum of the Zhang–Zagier height

Contributed by Tejasvi Singh Tomar

For an algebraic number α\alpha let h(α)h(\alpha) be its absolute logarithmic Weil height, and let hZ(α)=h(α)+h(1−α)h_Z(\alpha)=h(\alpha)+h(1-\alpha). The essential minimum of hZh_Z is the supremum of the numbers HH for which only finitely many algebraic numbers satisfy hZ(α)≤Hh_Z(\alpha)\le H. Zagier showed that it is at least 12log⁡1+52=0.2406059…\frac12\log\frac{1+\sqrt5}{2}=0.2406059\ldots, and the best lower bound so far is 0.248740.24874, due to Flammang. We prove that the essential minimum is at least 0.249829330.24982933. The proof combines Smyth's method of auxiliary functions, here with five integer polynomials in z(1−z)z(1-z), with a logarithmic energy term relative to a measure on the circles ∣z∣=1|z|=1 and ∣1−z∣=1|1-z|=1. Resultants and discriminants of minimal polynomials are nonzero integers. They bound the polynomial terms and the energy term, and a condition on the degrees absorbs the leading coefficients, so the argument applies to all algebraic numbers. A superharmonicity argument reduces the positivity of the auxiliary function to the unit circle, where two separately written programs verify it in ball arithmetic for a certificate with exact rational data. We also prove this lower bound in Lean.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23552587

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202611 pages
PDFView work

math.NT — Number Theory

The sum of the reciprocal cubes of the Fibonacci numbers is irrational

Contributed by Shawn Krisman

We prove that ζF(3)=∑n≥1Fn−3\zeta_F(3)=\sum_{n\ge1}F_n^{-3} is irrational, where FnF_n are the Fibonacci numbers. To our knowledge the only odd value of the Fibonacci zeta function previously known to be irrational was ζF(1)\zeta_F(1). The proof is a Hankel-determinant construction over Z[φ]\mathbb{Z}[\varphi], φ=(1+5)/2\varphi=(1+\sqrt5)/2, adapted from a recent unrefereed construction for the qq-zeta value ∑n2/(pn−1)\sum n^2/(p^n-1) at integers p≥2p\ge2. Four estimates are combined: a real decay of size exp⁡(−29K3log⁡φ)\exp(-\tfrac29K^3\log\varphi), a smallness exp⁡(−K3log⁡φ)\exp(-K^3\log\varphi) at the Galois conjugate, which replaces the base-prime content gain of the integer case, local cyclotomic denominator bounds at the twisted roots of unity that occur, and nonvanishing by rational interpolation. The whole argument is formalised in Lean 4 with Mathlib.

Primarily AI-generated textHuman understanding: no partsCyclotomic PolynomialsFibonacci zeta functionHankel determinantsLambert seriesLean 4Padé approximationformal verificationirrationalityq-zeta valuesreciprocal Fibonacci sums
Nov 15, 202613 pages
PDFView work

math.NT — Number Theory

New lower bounds for Romanoff's constant

Contributed by Tejasvi Singh Tomar

Romanoff proved in 1934 that the integers of the form p+2ap+2^a, with pp prime and a≥1a\ge1, have positive lower density dd. We prove that d≥0.110825d\ge0.110825 and, conditionally on an upper bound for prime pairs that Johnston and Trudgian derive from Lichtman's work on primes in arithmetic progressions, that d≥0.119178d\ge0.119178; the best lower bound so far was 0.107880.10788. The proof refines the method of Elsholtz and Schlage-Puchta, which bounds the second moment of the number of representations in each residue class modulo a fixed integer. Both bounds are certified by computer and also proved in the Lean proof assistant, with the analytic inputs as hypotheses.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23715954

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202613 pages
PDFView work

math.NT — Number Theory

Upper and lower bounds for the Schur–Siegel–Smyth trace problem

Contributed by Tejasvi Singh Tomar

The Schur–Siegel–Smyth trace constant C86C_{86} is the lower limit of tr⁡(α)/deg⁡(α)\operatorname{tr}(\alpha)/\deg(\alpha) over totally positive algebraic integers α\alpha. We prove 1.8022225<C86<1.80708091.8022225<C_{86}<1.8070809. For the upper bound we exhibit a measure on [0,6][0,6] that satisfies the hypotheses of Smith's theorem on limits of distributions of conjugates, which we check with the help of 2121 integer polynomials. This improves the upper bounds 1.82161.8216 of Orloski and Talebizadeh Sardari and 1.81172511.8117251 of Pinho. The lower bound comes from the method of Orloski, Talebizadeh Sardari and Smith with fifteen polynomials, three of them of degree 1010 found by McKee and Smyth. It is larger than the bound 1.802201.80220 reported by Giraudin, whose verification evaluates its bounds in floating-point arithmetic with fixed safety margins; ours encloses every rounding error. For each bound, two separately written programs check the certificate in ball arithmetic. Both bounds are also proved in Lean 4, the upper bound under the assumption of Smith's theorem, also in a version in which all checks on the certificates are carried out by Lean's kernel. We also give evidence that certificates of this kind cannot lower the upper bound much further without integer polynomials of high degree.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23563968

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202615 pages
PDFView work

math.CO — Combinatorics

Certified upper bounds for two sum-difference exponents

Contributed by Tejasvi Singh Tomar

For finite sets A,BA,B of real numbers and G⊆A×BG\subseteq A\times B, Katz and Tao proved in 1999 that {a−b:(a,b)∈G}\{a-b:(a,b)\in G\} has at most N11/6N^{11/6} elements whenever AA, BB and {a+b:(a,b)∈G}\{a+b:(a,b)\in G\} have at most NN elements; by an argument of Bourgain, bounds of this kind give lower bounds for the dimension of Kakeya sets. We lower the exponent 11/611/6 to 1.82731.8273, and to 1.82951.8295 in every abelian group. We also prove ∣X−Y∣≤∣X+Y∣1.4209|X-Y|\le|X+Y|^{1.4209} for all finite sets X,YX,Y of integers, improving the exponent 1.45431.4543 of Kleinwaks; through his transfer theorem, this lowers the upper bound for the sum-difference constant of Gyarmati, Hennecart and Ruzsa from 1.31241.3124 to 1.29621.2962. Both proofs add up entropy inequalities among integer combinations of coordinates of several copies of a random pair, with rational weights found by linear programming; all four bounds are also proved in Lean 4.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23716680

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202616 pages
PDFView work

math.NT — Number Theory

Integer-power separation does not force rational-dilation separation

Contributed by Sunay Venkat

We construct an algebraically independent set with divergent reciprocal-logarithmic weight, arbitrary prescribed proximity to selected integers and growing integer-power separation on tails. Nevertheless, every tail contains arbitrarily close rational-dilation pairs for each member of a dense family. The necessary integer-power finite-state lemmas and their proofs are included. This supplies a contrasting construction to the bounded-denominator rational-power example in the companion paper.

Primarily AI-generated textHuman understanding: some partsDiophantine approximationalgebraic independenceinteger-power separationrational dilations
Nov 15, 20267 pages
PDFView work

math.NT — Number Theory

Algebraically independent counterexamples with rational-power separation

Contributed by Sunay Venkat

Starting from Apicella’s private-prime construction, we give a proof draft of divergent reciprocal-logarithmic-weight examples that are algebraically independent, admit any prescribed positive integer-anchor error and have growing mixed-power gaps for rational dilations with bounded denominators. The integer numerator remains unrestricted. We record transcendence and field consequences and retain an elementary reconstruction of Apicella’s rational example in an appendix, with its prior-work attribution explicit.

Primarily AI-generated textHuman understanding: some partsDiophantine approximationalgebraic independencemultiplicative combinatorics
Nov 15, 202610 pages
PDFView work

math.NT — Number Theory

A Central-Commutator Regge Seed: BCC Sublattices, Face-Matched Hinges, and Quaternionic Spectral Gaps

Contributed by Changxia Lin

(i) At the arithmetic parameter \delta = 1/3, the three short face diagonals of the negative-cycle ternary Gram form become mutually orthogonal and generate a simple-cubic sublattice of index two; the full lattice is body-centered cubic. (ii) The positive- and negative-cycle Gram tetrahedra admit matching hinge faces. A four-tetrahedron Regge star consisting of one negative-cycle tetrahedron and three positive-cycle tetrahedra has an exactly computable positive deficit angle. (iii) A figure-eight graph with quaternionic cycle holonomies i and j has a nonzero spectral gap; its characteristic polynomial is computed exactly and its smallest eigenvalue is isolated by rational bounds. (iv) The commutator [i, j] = -1 identifies the graph's central Z_2 obstruction with the negative signed-cycle class of the Gram construction. The statements are finite-dimensional results about lattices, piecewise-Euclidean complexes, and unitary graph connections. They do not construct a closed shell, a Lorentzian spacetime, or a solution of the Einstein-matter equations; they do not prove the dominant energy condition or dynamical stability. The term "negative-cycle" refers only to a sign invariant and has no implication of negative physical energy.

Primarily human-written textHuman understanding: all partsSigned Gram matrices
Nov 15, 20268 pages
PDFView work

math.NT — Number Theory

Realizer Bounds and Repetition Constraints at the First Coefficient Crossing in the 3x + 1 Problem

Contributed by Elias De Jesús

Terras’s coefficient stopping time conjecture asks whether the shortcut Collatz orbit of every integer n ≥ 2 lies below n when its coefficient ρk = 3d/2k first falls below one. Here k counts shortcut steps and d counts their odd inputs. We prove that every eligible realizer descends when the first-crossing word has at most 75 maximal runs of odd inputs. Any counterexample requires at least 76 such runs, 10 439 860 591 steps and 6 586 818 670 odd inputs. The proof uses a lower bound on the seed from the length of its odd runs, rational approximations to log2 3, the verified range of Rozier and Terracol, and Rhin’s estimate for a linear form in logarithms. We also prove descent for a family with arbitrarily many odd runs. Two further restrictions narrow the remaining words. An initial square U U in a failing word satisfies |U | < 35 log2 k. For a counterexample of shortest crossing length, the reciprocal-sum estimate of Nikzad, Frinkle and Bagherzadeh gives a lower bound on ρk whose value begins 0.9441733669 . . .. The open inequality compares the least eligible starting value in each remaining parity class with an explicit threshold.

A mix of human-written and AI-generated textHuman understanding: some parts2-adic congruencesCollatz conjectureDiophantine approximationTerras conjecturecoefficient stopping timefirst coefficient crossingleast positive realizersodd-run decompositionparity vectorsreciprocal sums
Nov 15, 202612 pages
PDFView work

math.NT — Number Theory

SeqImpar and SeqPar: Analytic Characterizations of the Zeros of the Riemann Zeta and Dirichlet Beta Functions and a Criterion Equivalent to the Riemann Hypothesis

Contributed by FELIPE MARTINS SANTOS

We study two rational sequences, called SeqImpar and SeqPar, originally defined by recurrences and converging to the common limit 5. The ratio of their convergence errors tends to 1/2. Using this ratio, we construct two Dirichlet series weighted by the von Mangoldt function and associated with the Riemann zeta function and the Dirichlet beta function. We prove that these series admit meromorphic continuations whose poles in the critical strip correspond exactly to the zeros of the respective functions, with residues equal to minus one-half of their multiplicities. We then prove that an estimate for the partial sum weighted by SeqImpar and SeqPar is equivalent to the Riemann Hypothesis, and state a parallel criterion for the Dirichlet beta function. The paper rigorously distinguishes proved identities, equivalences, and open problems: the coincidence of the number 1/2 with the critical line does not, by itself, constitute a proof of the Riemann Hypothesis.

Author comments: DOI 10.5281/zenodo.24145199

A mix of human-written and AI-generated textHuman understanding: all partsRiemann Hypothesis
Nov 15, 20267 pages
PDFView work

math.NT — Number Theory

Colossally Abundant Numbers and Nicolas' Second Criterion

Contributed by Frank Vega

Robin's criterion states that the Riemann Hypothesis holds if and only if σ(n)<eγnlog⁡log⁡n\sigma(n) < e^{\gamma} n \log\log n for every n>5040n > 5040. Nicolas' second criterion, in the form given by Broughan, states that it holds if and only if n/φ(n)<eγlog⁡log⁡n+eγ(2+τ)/log⁡nn/\varphi(n) < e^{\gamma} \log\log n + e^{\gamma}(2 + \tau)/\sqrt{\log n} for every n≥N120569n \geq N_{120569}, where NkN_{k} is the kk-th primorial and τ=2+γ−log⁡(4π)\tau = 2 + \gamma - \log(4\pi); for NkN_{k} this inequality reads c(pk)<E(pk)c(p_{k}) < E(p_{k}). Let NN be a colossally abundant number, let q=pkq = p_{k} be the largest prime not exceeding the number ξ(N)\xi(N) associated with NN by Nicolas, and write Δ(N)=log⁡(σ(N)/N)−γ−log⁡log⁡log⁡N\Delta(N) = \log(\sigma(N)/N) - \gamma - \log\log\log N. For log⁡q≥31\log q \geq 31 we prove unconditionally that 1.317/(qlog⁡2q)≤Δ(N)−c(q)+E(q)+(22−2−τ)/(qlog⁡q)≤3.973/(qlog⁡2q)1.317/(\sqrt{q}\log^{2} q) \leq \Delta(N) - c(q) + E(q) + (2\sqrt{2} - 2 - \tau)/(\sqrt{q}\log q) \leq 3.973/(\sqrt{q}\log^{2} q). Consequently, the second inequality for NkN_{k} implies Δ(N)<−0.654/(qlog⁡q)\Delta(N) < -0.654/(\sqrt{q}\log q). We also prove that the primorials are the extremal cases of the second inequality, and that if it holds for every NkN_{k} with e31≤pk≤Xe^{31} \leq p_{k} \leq X, then Robin's inequality holds for every n>5040n > 5040 with log⁡n≤X(1−log⁡−3X)−log⁡X\log n \leq X(1 - \log^{-3} X) - \log X. A computation over the primes up to X=100,000,008,765,439X = 100{,}000{,}008{,}765{,}439 verifies this hypothesis, so Robin's inequality holds unconditionally for 5040<n≤101013.63775040 < n \leq 10^{10^{13.6377}}. To the author's knowledge, this is the largest range for which Robin's inequality has been verified: it extends the range 5040<n≤101013.114855040 < n \leq 10^{10^{13.11485}} of Morrill and Platt.

Primarily AI-generated textHuman understanding: all partsChebyshev functionColossally abundant numbersNicolas' inequalityNicolas' second criterionRiemann HypothesisRobin's inequalitySuperabundant numbersprimorial
Nov 15, 202623 pages
PDFView work

math.CO — Combinatorics

Constructions and explicit power savings for point--unit-circle incidences

Contributed by Yuda Chen, Yifei Wang

Let U(n,m)\mathcal U(n,m) be the maximum number of incidences between nn distinct points and mm distinct unit circles in the plane. We give two constructions and an explicit upper bound for this function. Writing s=min⁡(n,m)s=\min(n,m) and M=max⁡(n,m)M=\max(n,m), the first construction gives a four-piece monomial lower bound for all cardinalities, with balanced exponent 1.0411699201.041169920. The second gives balanced configurations along an unbounded sequence with exponent 1.04317223055397011.0431722305539701, and further unbalanced configurations. The upper bound is U(n,m)≪M+s2/3−2δM2/3+δ\mathcal U(n,m)\ll M+s^{2/3-2\delta}M^{2/3+\delta}, where δ=2−2664/514560000000>2−2665\delta=2^{-2^{664}}/514560000000>2^{-2^{665}}. The constructions use two windows in a relative-norm-one number-field lattice, strengthened arithmetic estimates, and interpolation between local profiles. The upper bound uses finite incidence regularization, prediction, arithmetic heights, and a six-by-five rigidity obstruction. The resulting bounds for the unit-distance problem follow as corollaries.

Primarily AI-generated textHuman understanding: some partsPoint--unit-circle incidencesarithmetic heightsclass field towersincidence boundsnumber-field latticespolynomial partitioningunit distances
Nov 15, 2026178 pages
PDFView work

math.PR — Probability

Sharp Poisson approximation and second-order correction for long multiplicative runs

Contributed by Brice Pouly

Let ff be completely multiplicative with independent fair signs at primes. We count starts of constant runs of length at least LL in [N,2N)[N,2N), with L=log⁡2N+O(1)L=\log_2N+O(1) and both signs included. The total variation distance to the Poisson law with nominal or exact mean has an explicit equivalent of order LN−2/3LN^{-2/3}, with a coefficient depending on N2−LN2^{-L} and L mod 3L\bmod3. After retaining the exact mean and second factorial cumulant, the quadratic Poisson–Charlier approximation has optimal error power 4/34/3: for every fixed ε>0\varepsilon>0, its ℓ1\ell^1 error lies between constant multiples of N−4/3−εN^{-4/3-\varepsilon} and N−4/3+εN^{-4/3+\varepsilon}, uniformly in each fixed critical band. The leading correction comes from rational pairs. Keeping all channels up to a fixed height hh gives an explicit distance equivalent with power h/(h+1)h/(h+1), determined by the first omitted height. The third factorial cumulant has optimal power 41/3041/30. The proof expands around the exact Bernoulli marginals and stops at the first excluded dependent configuration. Arithmetic bounds for fixed configurations and a separate uniform tail estimate control the resulting positive boundary mass. Short square relations and a common algebraic curve bound the triple interactions; a fourth Charlier test detects the two-pair contribution that makes the quadratic exponent optimal.

Author comments: Initial Hexagon deposit of the published Zenodo edition (https://doi.org/10.5281/zenodo.24220727), including its technical companion in the same PDF. Lean formalization and reproducibility archive: https://doi.org/10.5281/zenodo.24220800. Mathematical source text is preserved; source packaging and navigation are adapted.

Primarily AI-generated textHuman understanding: no partsLean formalizationPoisson approximationPoisson–Charlier approximationarithmetic dependenciesfactorial cumulantslong runsrandom multiplicative functionstotal variation
Nov 15, 2026118 pages
PDFView work

math.NT — Number Theory

Automorphisms of the modular curves XΔ(N)X_\Delta(N)

Contributed by Filip Najman

We show that every automorphism of a modular curve XΔ(N)X_\Delta(N) of genus at least 22, where Γ1(N)⊆ΓΔ(N)⊆Γ0(N)\Gamma_1(N)\subseteq \Gamma_\Delta(N)\subseteq \Gamma_0(N), is induced by the normalizer of ΓΔ(N)\Gamma_\Delta(N) in PSL2(R)\mathrm{PSL}_2(\mathbb{R}), except for five curves, namely X0(37)X_0(37), X0(63)X_0(63), X0(108)X_0(108), a curve of level 3737 found by Jeon, Kim and Schweizer, and a curve of level 6363 whose non-modular automorphisms had, to our knowledge, not been noticed before. In particular every automorphism of X1(N)X_1(N) normalizes the group of diamond operators, as claimed for square-free NN in an unpublished preprint of Momose. The proof combines a twisted Hecke relation, which comes from the Galois action on the Tate module of the Jacobian, with a uniform bound for the dimension of the CM part of the Jacobian and with computations for finitely many levels.

Author comments: 30 pages. Code and logs: https://github.com/F-Najman/automorphisms_XDelta. Lean formalization: https://github.com/F-Najman/normalizer-lean

Primarily AI-generated textHuman understanding: some partsautomorphism groupsintermediate modular curvesmodular curves
Nov 15, 202630 pages
PDFView work

math.NT — Number Theory

Growth criteria for reciprocal series with nonincreasing weights

Contributed by twinheterodox

Fix nonincreasing positive integer weights w0,…,wd−1w_0,\ldots,w_{d-1} and define c>1c>1 by (c−1)2∑j=0d−1wjcj=w0(c-1)^2\sum_{j=0}^{d-1}w_jc^j=w_0. If the total weight is at least two, we prove irrationality of ∑n≥11/(anw0⋯an+d−1wd−1)\sum_{n\ge1}1/(a_n^{w_0}\cdots a_{n+d-1}^{w_{d-1}}) whenever the positive integers ana_n are strictly increasing and lim sup⁡n→∞(log⁡an)/cn=∞\limsup_{n\to\infty}(\log a_n)/c^n=\infty. For every nonconstant nonincreasing weight profile, this lowers the sufficient base in the general criterion of Barreto, Kang, Kim, Kovač and Zhang (Bull. Lond. Math. Soc. 58 (2026), e70457, Theorem 3), with the classical base-2 criterion included in the comparison. For weights (3,2,1)(3,2,1) the base becomes 43\sqrt[3]{4}; staircase weights (d,d−1,…,1)(d,d-1,\ldots,1) give (d+1)1/d(d+1)^{1/d}. Irregular growth is allowed. A more general form permits nondecreasing sequences and positive integer numerators under polynomial size bounds.

Author comments: 9 pages. Extends the two-weight result in Hexagon 2611.00428v1 to all fixed nonincreasing positive integer weight profiles. Includes a general numerator criterion and a comparison with finite-product substitutions. Source and build instructions: https://github.com/twinheterodox/weighted-reciprocal-growth

Primarily AI-generated textHuman understanding: some partsgrowth criteriairrationalityreciprocal series
Nov 15, 20269 pages
PDFView work

math.NT — Number Theory

Subrings and cotypes of truncated polynomial rings

Contributed by Ramin Takloo-Bighash, Sarthak Chimni

We study unital finite-index subrings of Rn=Z[t]/(tn)R_n=\Z[t]/(t^n). We compute the cubic cotype function and the quartic total and cocyclic functions at every prime, including the exceptional factors at 22, and prove the corresponding global counting theorems in degrees three, four, and five. Explicit Hermite sums with determinantal weights give full cotype formulas for n=4,5n=4,5, without an asserted closed rational evaluation. We extend these calculations by a linear lifting recursion for every degree and by a two-parameter description of every cocyclic subring for n≥4n\ge4. The latter gives $2-2/(n-1)\le\alpha_n^{\cc}\le2$ for the global cocyclic convergence abscissa, and hence $\alpha_n^{\cc}\to2$. An exact quadratic family of quintic diagonal counts gives absolute convergence of the residual Dirichlet series for $\Rea s>19/13$. All asymptotics are obtained by elementary summation and absolutely convergent convolution.

A mix of human-written and AI-generated textHuman understanding: all partsIntegral ringsp-adic integration
Nov 15, 202636 pages
PDFView work

math.NT — Number Theory

Aigner's Three Monotonicities from Fibonacci Matrices and Six Snake Pieces

Contributed by Elleard Felix Webster Heffern

Starting from the established fact that Markov numbers count perfect matchings of their Markov snake graphs, we give a self-contained proof of the fixed-sum, fixed-numerator, and fixed-denominator orderings proposed by Aigner. The author's Fibonacci-matrix normalization begins with (AC)11−(B2)11=2(AC)_{11}-(B^2)_{11}=2 for consecutive odd-indexed Fibonacci blocks. Fibonacci matrices prove normalization and fixed-numerator monotonicity. The author's six-piece decomposition proves the remaining fixed-sum comparison and fixed-denominator monotonicity. We credit the matching correspondence to its original 2002–2003 REACH development and distinguish that history from the later ordering theorems.

Author comments: Standalone v4, 6 pages, 2 figures. The normalization and three ordering proofs also appear in Section 5 of Meridians; this standalone presentation makes them easier to find and cite. Earlier proofs of the orderings and the 2002–2003 matching correspondence retain their citations. The general Markov uniqueness conjecture remains open. Linked chronology: 8 November 2026: standalone v3: https://zenodo.org/records/24053747 11 November 2026: standalone v4, source, figures and finite-check reports: https://zenodo.org/records/24146546 12 November 2026: v4 PDF mirrored on ResearchGate: https://www.researchgate.net/publication/417809122_Aigner's_Three_Monotonicities_from_Fibonacci_Matrices_and_Six_Snake_Pieces 12 November 2026: corrected Meridians v22: https://zenodo.org/records/24167894 ; its Aigner arguments and figures are unchanged. The v4 source's version note records its original synchronization with v21. 13 November 2026: Meridians published on Hexagon: https://hexagonmath.org/2611.00410 Related computational supplements (2 November 2026): https://zenodo.org/records/23874075 ; current trillion-verification evidence accompanies the corrected Meridians archive above. Earlier project announcements, not announcements of this standalone proof: 21 October 2026, 15:18:25 UTC: X, earlier billion-scale verification: https://x.com/webystar/status/2112926487091282350 23 October 2026, 14:54:57.771 UTC: LinkedIn, earlier 9.3-billion verification: https://www.linkedin.com/posts/elleard-felix-webster-heffern-joseph-by-confirmation-2953a3104_markovnumbers-activity-7519411048115003392-4NaJ No separate social announcement for this paper has been independently verified.

A mix of human-written and AI-generated textHuman understanding: all partsAigner's conjecturesFibonacci matricesMarkoff numbersMarkov numberscombinatorial number theoryfixed-denominator monotonicityfixed-numerator monotonicityfixed-sum monotonicityperfect matchingssnake graphs
Nov 15, 20266 pages
PDFView work

math.NT — Number Theory

Irrationality of χ2(1/q)\chi_2(1/q), Ti2(1/q)\mathrm{Ti}_2(1/q) and χ2(2/q)\chi_2(2/q)

Contributed by Shawn Krisman

Let χ2(z)=∑n≥0z2n+1/(2n+1)2\chi_2(z)=\sum_{n\ge0}z^{2n+1}/(2n+1)^2 be Legendre's chi function and Ti2(z)=∑n≥0(−1)nz2n+1/(2n+1)2\mathrm{Ti}_2(z)=\sum_{n\ge0}(-1)^nz^{2n+1}/(2n+1)^2 the inverse tangent integral. We prove three theorems: χ2(1/q)\chi_2(1/q) is irrational for every integer q≥3q\ge3 with q≠4q\ne4; Ti2(1/q)\mathrm{Ti}_2(1/q) is irrational for every integer q≥5q\ge5; and χ2(2/q)\chi_2(2/q) is irrational for every odd integer q≥175q\ge175. All three come from one construction: the Hankel determinants of a moment functional with half-integer poles and geometric weight ww, read at w=q−2w=q^{-2}, w=−q−2w=-q^{-2} and w=4q−2w=4q^{-2}. Their denominators are bounded prime by prime, their size by a discrete log-gas argument against explicit dual certificates, and their nonvanishing by a reduction modulo an auxiliary prime. The three cases differ at the prime 22, where each needs its own lemma, in the certificates, and in how the nonvanishing lemma is transferred. For large qq the three statements follow from the linear independence criteria of David, Hirata-Kohno and Kawashima; for the first two, a 1990 criterion of Hata, which we could not consult, also applies from a threshold unknown to us. Below these ranges the results are new as far as we know. All three theorems are formalised in Lean 4 with Mathlib and checked by the Lean kernel, using only Lean's three standard axioms.

Primarily AI-generated textHuman understanding: no partsHankel determinantsLeanLegendre chi functionPadé approximationdilogarithmformal verificationinverse tangent integralirrationalitylogarithmic potential theory
Nov 13, 202646 pages
PDFView work

math.NT — Number Theory

Regularity criteria and an effective bound for irregular extensions of Euler triples

Contributed by Sinisa Slijepcevic, Andrej Dujella

An Euler triple is a Diophantine triple {a,b,c}\{a,b,c\} with a<b<c=a+b+2ab+1a<b<c=a+b+2\sqrt{ab+1}. It extends to the regular Diophantine quadruple {a,b,c,d+}\{a,b,c,d_+\}, and it is conjectured that it has no other extension d>cd>c. We prove that an irregular extension forces c<4⋅1048c<4\cdot10^{48}, against c<1098c<10^{98} in recent work of He and Togb\'e. The proof squeezes the index mm of the extension, which locates a common term of two Pell sequences, between a floor from congruences, c<8m4c<8m^4, valid for every irregular extension, and ceilings from linear forms in logarithms. The same squeeze, with other bounds, gives three regularity criteria: by the size of b/ab/a, which confines irregular extensions to 1+11538<b/a<335521+\frac1{1538}<b/a<3355^2; by pair coordinates, through the hypergeometric method; and by coprime divisors of the index combinations, which settles every Euler triple with two elements in a ratio j:kj:k with jk≤300jk\le300. As applications, the three-parameter family of Cipu, Fujita and Mignotte extends only regularly when νA≥2\nu A\ge2 and K≥643K\ge643, and when K=1K=1, A∈{2,3}A\in\{2,3\} and ν≥2\nu\ge2; the latter contains the Hoggatt--Bergum triples, for which this recovers Dujella's theorem for extensions d>cd>c.

A mix of human-written and AI-generated textHuman understanding: some partsDiophantine quadruplesEuler triples
Nov 13, 202672 pages
PDFView work

math.CO — Combinatorics

An Upper Bound Exponent of 0.9999873 for Square-Difference-Free Sets

Contributed by Eric Naslund

Let A⊆{1,…,N}A\subseteq\{1,\ldots,N\} contain no two distinct elements whose difference is a nonzero square, and let s(N)s(N) be the largest possible size of such a set. We prove \[ s(N)\le CN^{0.9999873} \] with an absolute constant CC. A recent preprint of OpenAI proves $s(N)\le CN^{1-\eps}$ for some absolute $\eps>0$. Their proof utilizes a certain average of the Fourier transform over (24!)161(24!)^{161} points, and for the parameter choices displayed there we calculate that they obtained $\eps\approx \exp_{10}(-\exp_{10}(\exp_{10}(5782.77)))$, in the sense that $\log_{10}\log_{10}\log_{10}(1/\eps)\approx5782.77$. We follow the same overall strategy, with new work at almost every quantitative step. The largest gain is the use of 7272 slots (positions at which the Fourier transform is evaluated) in place of (24!)161(24!)^{161}: the exponent is roughly a fixed constant divided by the number of slots, so this alone gains many orders of magnitude, but leaves far less room for loss elsewhere. Other savings come from the local construction at each prime. Small primes are handled jointly rather than one by one; and errors are measured in the actual half-distributions of the laws being compared, not bounded term by term against a product model. Where sums over the primes of a block of Weil-type error terms of size O(p−1/2)O(p^{-1/2}) would be too weak, we prove bounds of order O(p−1)O(p^{-1}) for the same error terms using \'etale cohomology over finite fields (Deligne's theorems and Katz--Sarnak monodromy for families of curves), the representation theory of GL2(Fp)\mathrm{GL}_2(\mathbf F_p), exact counts at p≡3(mod4)p\equiv3\pmod4, and a modular evaluation of Ahlgren and Ono. Dependence in our distributions is controlled by the correlation inequalities of Peyre and Kassabov. The remaining finitely many numerical inequalities are verified by exact computer arithmetic, listed in the appendices; all analytic steps are proved in the text. The companion repository \cite{NaslundUpperRepository2026} contains a partial Lean 4 formalization, totaling over 600,000 lines of lean. It establishes s(N)≤CN0.99999s(N)\le C N^{0.99999}, conditional on five named analytic inputs and explicit numerical hypotheses. This formalizes the most critical parts of the proof.

Primarily AI-generated textHuman understanding: some parts
Nov 13, 2026603 pages
PDFView work

math.NT — Number Theory

The central charge of an arithmetic system: a seven-world framework

Contributed by Zeng Chunping

To an arithmetic system (prime elements, norms, weights, LL-functions) we attach the central charge Cν=∑p(log⁡Np)ν/(Np(Npν−1))⋅(weight of Frobp)−1C_\nu=\sum_{\mathfrak p}(\log N\mathfrak p)^\nu/(N\mathfrak p(N\mathfrak p^\nu-1))\cdot(\text{weight of }\mathrm{Frob}_{\mathfrak p})^{-1}. Seven worlds share it: number fields, function fields, graphs, finite-type dynamics, knots, tropical geometry, and arithmetic dynamics. We record four universal laws with their exact status. (I) Index-set identity in all seven worlds (number fields to 101310^{13}, tropical skeletons to 103110^{31}). (II) Critical law Cν∼Φ⋅(ν−1)!/ΔνC_\nu\sim\Phi\cdot(\nu-1)!/\Delta^\nu, with Δ\Delta the distance to the controlling singularity: a pole (Tate) or the natural boundary (cuspidal); Φ\Phi measures reachability (≈0.7\approx 0.7 Tate, ≈0.07\approx 0.07 cusp). (III) Diagonal main-term theorem: LL entire iff cuspidal iff no diagonal main term iff vanishing connected/remainder ratio; item (v) (never-saturating spectral form factor) is at conjecture level, the bridge closed by a companion paper's recurrence-peak criterion. (IV) Law of forgetting in six formulations, unified: forgetting = increasing Δ\Delta = rising diagonal fraction = approaching the semicircle (free) = setting η24=1\eta^{24}=1. The core dichotomy (horizontal coordinate σ=1+κ\sigma=1+\kappa universal, amplitude fingerprinted) is checked on moments. The 24 network (Δ=qη24\Delta=q\eta^{24}, Yau--Zaslow, L(11a1,1)/Ω=1/5L(11a1,1)/\Omega=1/5) and the Neron wild tables are included; everything carries a status label and a corrections register. We prove neither abc, Szpiro, RH, nor BSD.

Primarily human-written textHuman understanding: all partsCatalan numbersSato-TateTemperley-Liebarithmetic quantum chaoscentral chargeeta productmirror symmetrynatural boundary
Nov 13, 202613 pages
PDFView work

math.NT — Number Theory

A √3 growth criterion for weighted reciprocal series

Contributed by twinheterodox

We prove that ∑n≥11/(an2an+1)\sum_{n\ge1}1/(a_n^2a_{n+1}) is irrational for every strictly increasing sequence of positive integers satisfying lim sup⁡n→∞log⁡an/(3)n=∞\limsup_{n\to\infty}\log a_n/(\sqrt{3})^n=\infty. This lowers the sufficient growth base from 22 to 3\sqrt{3} in the criterion of Barreto, Kang, Kim, Kovač and Zhang (Bull. Lond. Math. Soc. 58 (2026), e70457, Theorem 3) for weights (2,1)(2,1). Irregular growth is allowed. The result also extends to nondecreasing sequences and positive integer numerators subject to polynomial size bounds.

Author comments: 6 pages. Includes a general criterion with positive integer numerators. Source and build instructions: https://github.com/twinheterodox/weighted-reciprocal-growth

Primarily AI-generated textHuman understanding: some partsgrowth criteriairrationalityreciprocal series
Nov 13, 20266 pages
PDFView work

math.NT — Number Theory

Landau's problems through ratios of LL-functions

Contributed by Haozhe Gou, Victor Wang, Max Wenqiang Xu

Very recently, Lee announced a proof of the Twin Prime Conjecture assuming the Ratios Conjecture for the Riemann zeta function. We obtain conditional asymptotic formulas with power-saving errors for each of Landau's four prime problems. Similar results may be possible for other problems in analytic number theory.

Author comments: 36 pages

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 13, 202636 pages
PDFView work

math.NT — Number Theory

Joint marked moments and optimized zero-free half-planes for unitary Hecke L-functions

Contributed by Baiying Liu

In this paper, we improve the uniform zero-free bound for the Quasi-Riemann Hypothesis and obtain the half-plane LK (s,ω) ̸= 0 (Re s>B∗ = 0.8733458561067185768...) for every continuous unitary Hecke character ω over every number field K, with the possible norm-character pole permitted. We prove joint moment estimates for inverse and ordinary character sums and apply them to zero detection and the averaged Mellin numerator. The proof uses the earlier number-field theta and moment theorems and the unitary estimates of Hu and Gao. The same half-plane holds for finite-dimensional continuous unitary Weil representations, with pole orders equal to the multiplicities of their norm-character constituents. We determine B∗ asanalgebraicnumberofdegreenineandastheinfimumofthespecifiedpositivecomparison, allowing unequal ordinary moments and variable comparison lengths.

A mix of human-written and AI-generated textHuman understanding: some partsRiemann Zeta Functionquasi Riemann Hypothesiszero-free half-planes
Nov 13, 202654 pages
PDFView work

math.LO — Logic

Bounded Presentations and Normalization in Arithmetic Reconstruction

Contributed by Zhenyu Sun

We study bounded presentations of selected constructions in absolute anabelian geometry and Frobenioid theory. In bounded Zermelo set theory with Choice, we prove uniform recursion for a common state space and a uniformly supplied transition rule. Under explicit index bounds, membership-table codes place the states and their histories at the same finite type level. We construct coherent comparisons for representative quotients, fiberwise full skeletons, isofibrational base changes, and countable towers, and verify the lifting properties for model Frobenioids and angular presentations. For nonzero numerical observables transforming by positive scalars, compatible normalization exists exactly when the associated character is trivial on every isotropy group. A self-equivalence of the realified arithmetic Frobenioid over Q\mathbb{Q} preserves degree and every object isomorphism class but does not lift to the unit-trivialized perfection. The structural results give a relative uniform interpretation theorem: the weak theory constructs the bounded presentations and comparison maps, and specified arithmetic recognition theorems identify the resulting structures.

Author comments: 25 pages.

A mix of human-written and AI-generated textHuman understanding: some partsFrobenioidsarithmetic reconstructionbounded recursioncategorical equivalencenormalizationweak set theory
Nov 13, 202625 pages
PDFView work

math.NT — Number Theory

Every even integer greater than 2 is a prime plus a product of at most 18 primes

Contributed by Wren Aquila

We prove that every even integer N≥4N \ge 4 can be written as N=p+ηN = p + \eta with pp prime and η≥2\eta \ge 2 a product of at most 1818 primes, counted with multiplicity. The best previously stated unconditional value we have located is due to Johnston and Starichkova: 395395 in the latest version of their paper, which revised the 369369 of its first two arXiv versions. Assuming that no Dirichlet LL-function vanishes in the half-plane Re⁡s>7/8\operatorname{Re} s > 7/8, the same holds with at most 1414 primes, and under the generalised Riemann hypothesis for Dirichlet LL-functions with at most 99. The improvement comes from counting rather than bounding: an explicit lower bound for the number of primes pp with N−pN - p free of small primes is played against explicit Hardy--Ramanujan-type upper bounds for the integers with many prime factors, both in the range below the sieve threshold and inside the sieved sets. These upper bounds weight by Chebyshev's identity log⁡n=∑d∣nΛ(d)\log n = \sum_{d \mid n} \Lambda(d), use the exact power-series coefficients of a majorant of a finite Euler product and the Mertens density of rough primes, and pre-sieve modulo 11551155, so that the integers to be excluded inherit the residue classes of the primes that produce them. All numerical steps are certified in interval or ball arithmetic, except some discrete convolutions with nonnegative terms, which are evaluated in binary64 under an explicit rounding-error bound and were also recomputed independently in ball arithmetic.

Primarily AI-generated textHuman understanding: no parts
Nov 13, 202619 pages
PDFView work

math.NT — Number Theory

Verification of the Markov Uniqueness Conjecture for the First One Trillion Markov Values: Meridians on the Markov Surface and Farey Addresses

Contributed by Elleard Felix Webster Heffern

The Markov unicity problem asks whether the largest entry of a positive integer solution determines the other two. We organize the triples into families called Meridians, with compact addresses and explicit evaluation rules. The construction starts with catenary profiles: a fixed host sets the curve, and two heights one unit apart solve the Markov equation with that host. Selected positions give integer triples. Reversing geometric descent gives an exact indexing of these triples. Remainder patterns, growth bounds, corridor paths, and Fibonacci-matrix and snake-graph arguments then restrict possible collisions. The Meridian description of starting scales and logarithmic spacing guided the organization of a large verification into magnitude bands. The implementation uses Farey addresses and certified matrix bounds to select each band; its correctness does not require the Meridian collision theorems. Production finished on 10 November 2026 at 03:54:13 UTC (9 November, 21:54:13 CST). The combined computation compared 1,101,388,071,945 configurations and certified uniqueness of the first one trillion Markov values in numerical order. The trillionth value has 1,021,609 decimal digits. All 12 repeated 64-bit residue groups were resolved by exact arithmetic, with no equal maxima. On eight workers, retained active band processing took 23 h 57 min 23.146 s, including the inherited 500-billion certificate; the maximum recorded temporary key-file footprint was 1,065,664,392 bytes (0.992 GiB). This elapsed processing time is distinct from summed CPU time and the calendar span. Both final replays passed. A separate computer-checked certificate covers all 5,067,077 Meridians of degree at most 10,000, at every integer phase. The general unicity problem remains open.

Author comments: Version 22 (12 November 2026), 44 pages: revised title and abstract, including the 1,021,609-digit trillionth value; added Arthur Baragar's 1996 benchmark (M < 10^140). The proofs, figures and verification evidence are unchanged. Chronology (distinct announcements and deposits): 21 October 2026, 15:18:25 UTC: X announcement of an earlier search exceeding one billion values: https://x.com/webystar/status/2112926487091282350 23 October 2026, 14:54:57.771 UTC: LinkedIn announcement of the earlier 9.3-billion search in 24 minutes: https://www.linkedin.com/posts/elleard-felix-webster-heffern-joseph-by-confirmation-2953a3104_markovnumbers-activity-7519411048115003392-4NaJ 2 November 2026: 50-billion verification and degree-10,000 computational supplements: https://zenodo.org/records/23874075 9 November 2026: selected full decimal expansions first deposited: https://zenodo.org/records/24093257 10 November 2026: v21 trillion-verification deposit (publication-date field: 9 November): https://zenodo.org/records/24096109 12 November 2026: corrected v22 manuscript; Zenodo DOI reserved (deposit pending): https://doi.org/10.5281/zenodo.24167894 12 November 2026: ResearchGate full-text mirroring began: https://www.researchgate.net/publication/417066856_Meridians_on_the_Markov_Surface_Growth_Structure_and_Verification_of_One_Trillion_Markov_Values_Using_Farey_Addresses The earlier X and LinkedIn announcements are not announcements of the trillion result. The source releases preserve the original verification timestamps and separate software licenses. The general unicity conjecture remains open.

A mix of human-written and AI-generated textHuman understanding: all partsFarey fractionsFrobenius conjectureMarkoff numbersMarkov numbersMarkov treeMarkov uniqueness conjectureMeridianscertified computationcomputational number theorysnake graphs
Nov 13, 202644 pages
PDFView work

math.NT — Number Theory

Cross-Energy of Dirichlet Partial Sums. Part 33: Optimised mollifiers and the bound Λ≤0.174\Lambda\le0.174 for the de Bruijn--Newman constant

Contributed by Pedro Caceres

The Polymath project reduced upper bounds for the de Bruijn--Newman constant Λ\Lambda to three verifiable hypotheses: the Riemann hypothesis up to height X/2X/2, a zero-free region for Ht0H_{t_0} to the right of XX, and a barrier at XX. With the verification of the Riemann hypothesis up to 3⋅10123\cdot10^{12} by Platt and Trudgian, this gave Λ≤0.2\Lambda\le0.2. The bottleneck is the zero-free region, which Polymath established with Euler-product mollifiers. We replace the Euler product by a mollifier ∑d≤Dλdd−s∗\sum_{d\le D}\lambda_d d^{-s_*} whose weights are chosen by solving an ℓ1\ell^1-regression problem, so that any choice of weights still yields a valid lower bound. At the same height X≈6⋅1012X\approx6\cdot10^{12} and t0=0.155t_0=0.155, y0=0.2y_0=0.2, the lower bound for the mollified sum improves from −0.12-0.12 (our Lemma~\ref{lem:moll} evaluated with the Euler mollifier on the primes up to 1313) to +0.05+0.05 with D=120D=120; with D=240D=240 it is still +0.04+0.04 at t0=0.154t_0=0.154. We cover all x≥Xx\ge X by a short chunking argument together with a tail estimate, verify the barrier with Polymath's Taylor scheme, and obtain \[ \Lambda\le 0.174 . \] The certificates are computer-assisted. They use Arb ball arithmetic for all transcendental functions and outward-rounded floating-point arithmetic for the large sums. The code, the weights and the logs are included, and the certificate was reproduced on a second platform. We also report that at this height the weights we found with D=240D=240 do not reach 0.1730.173, and we compare with Polymath's table of conditional results. We do not prove the Riemann hypothesis.

Author comments: Revised 10 Nov 2026 after external examination (see CHANGES_v2.md). 20 pages, 3 figures. The ancillary scripts are those of the original part (ancillary zip in the part folder). Part 33 of the book-series Cross-Energy of Dirichlet Partial Sums (47 parts, Parts 0-46); formerly Part 13. Renumbered 2 Nov 2026; mathematics unchanged. The paper states once, in its discussion, that it does not prove the Riemann hypothesis.

A mix of human-written and AI-generated textHuman understanding: all partsArb interval arithmeticRiemann xi-functioncomputer-assisted proofde Bruijn-Newman constantheat flowmollifier
Nov 13, 202620 pages
PDFView work

math.NT — Number Theory

Automorphic realization of Langlands parameters for split groups over global function fields, III. Classical groups

Contributed by Boyang Hu

Let GG be a split semisimple group whose simple factors are of classical type, over a global function field FF of arbitrary positive characteristic. We prove that every semisimple elliptic Langlands parameter ΓF→G^(Q‾ℓ)\Gamma_F\to\widehat G(\overline{\mathbb Q}_\ell) is the parameter of a cusp form on GG, in the sense of V. Lafforgue's excursion operators; we call such a form an automorphic realization of the parameter. Neither FF nor its field of constants is extended. We start from L. Lafforgue's theorem for general linear groups and use automorphic descent and the theta correspondence. The work is to prove that the descent does not vanish over FF, to carry out the computations with root subgroups in small characteristic, in particular in characteristic two, and to identify the parameter itself and not only its unramified Hecke eigenvalues. This is the third of three papers. Together with the first, which contains the arithmetic foundations, and the second, which treats the exceptional types by a geometric method, it gives automorphic realizations of semisimple parameters on all split reductive groups, with a restriction on the characteristic for the exceptional types only.

Author comments: Part III of a series of three papers; Parts I (Arithmetic foundations and the main theorems) and II (The geometric construction) are deposited separately. The folder anc/ contains the Python programs described in the appendix on computer checks.

Primarily AI-generated textHuman understanding: some partsEisenstein seriesLanglands parametersautomorphic descentcharacteristic twofunction fieldstheta correspondence
Nov 12, 202668 pages
PDFView work

math.NT — Number Theory

Automorphic realization of Langlands parameters for split groups over global function fields, II. The geometric construction

Contributed by Boyang Hu

Let GG be a split simply connected semisimple group over a global function field FF whose characteristic does not divide the order of the Weyl group of GG. We prove that every semisimple elliptic Langlands parameter ΓF→G^(Q‾ℓ)\Gamma_F\to\widehat G(\overline{\mathbb Q}_\ell) is the parameter of a cusp form on GG, in the sense of V. Lafforgue's excursion operators; we call such a form an automorphic realization of the parameter. The parameter may be ramified at finitely many places and may have finite monodromy, and neither FF nor its field of constants is extended. The starting point is the geometric Langlands correspondence in characteristic zero. It provides a sheaf, and the function which the trace of Frobenius attaches to a nonzero sheaf can vanish identically. The main point of the construction is to arrange that the trace in question is a determinant det⁡(1−ϕ)\det(1-\phi) with no zero factor, and that it stays nonzero under specialization to the given field. This is the second of three papers. Together with the first, which contains the arithmetic foundations, and the third, which treats classical groups in every characteristic, it gives automorphic realizations of semisimple parameters on all split reductive groups, with a restriction on the characteristic for the exceptional types only.

Author comments: Part II of a series of three papers; Parts I (Arithmetic foundations and the main theorems) and III (Classical groups) are deposited separately. The folder anc/ contains the Python programs described in the appendix on computer checks.

Primarily AI-generated textHuman understanding: some partsHecke eigensheavesLanglands parametersexcursion operatorsfunction fieldsgeometric Langlands correspondencenearby cycles
Nov 12, 202693 pages
PDFView work

math.NT — Number Theory

Automorphic realization of Langlands parameters for split groups over global function fields, I. Arithmetic foundations and the main theorems

Contributed by Boyang Hu

Let GG be a split connected reductive group over a global function field FF. V. Lafforgue decomposed the space of cusp forms on GG according to semisimple Langlands parameters. This is the first of three papers which prove a converse: every semisimple elliptic parameter is the parameter of a cusp form on GG over FF itself, which we call an automorphic realization of the parameter. This holds in every positive characteristic for classical groups, in characteristic greater than 33 for G2G_2 and F4F_4, greater than 55 for E6E_6, and greater than 77 for E7E_7 and E8E_8. A parameter that is not elliptic is the parameter of an automorphic form which is not cuspidal, under the bound for the smallest Levi subgroup through which the parameter factors. The form has the prescribed eigenvalue for every excursion operator, and we determine for which lattices in the centre it can be taken invariant. The present paper contains the arithmetic part of the proof. It defines excursion operators on functions that are not assumed cuspidal, proves their compatibility with constant terms, shows that a function on which they act through an elliptic parameter is a cusp form, and passes from simply connected groups to isogenous groups and from Levi subgroups to the group. This reduces the theorems to the existence of a cusp form with a given elliptic parameter on a simply connected simple group. That is proved in the second paper by a geometric method, when the characteristic does not divide the order of the Weyl group, and in the third paper for classical groups, by descent from general linear groups.

Author comments: Part I of a series of three papers; Parts II (The geometric construction) and III (Classical groups) are deposited separately. The theorems of this part depend on the two existence theorems proved in Parts II and III.

Primarily AI-generated textHuman understanding: some partsLanglands parametersconstant termscusp formsexcursion operatorsfunction fieldsshtukas
Nov 12, 202670 pages
PDFView work

math.CA — Classical Analysis and ODEs

Certified lower bounds for the first and the signed third autocorrelation constants

Contributed by Tejasvi Singh Tomar

Let C1C_1 be the largest constant such that sup⁡∣t∣≤1/2∫f(t−x)f(x) dx≥C1(∫−1/41/4f)2\sup_{|t|\le 1/2}\int f(t-x)f(x)\,dx\ge C_1\bigl(\int_{-1/4}^{1/4}f\bigr)^2 for every nonnegative function ff on the real line. We prove C1≥1.337C_1\ge 1.337, improving the bound 1.29371.2937 of Kim and Pilanci, by a spatial branch-and-bound over the masses of ff on equal bins. Consequently, for every large gg, every gg-Sidon set in {1,…,N}\{1,\dots,N\} has fewer than 1.2231gN1.2231\sqrt{gN} elements once NN is large enough in terms of gg. For real-valued ff supported in [−1/4,1/4][-1/4,1/4], let C3C_3 and C3′C_3' be the analogous constants for the essential suprema of ∣f∗f∣|f*f| and of f∗ff*f; no lower bound better than the trivial bound 11 was recorded for them. We prove C3≥C3′≥4/3C_3\ge C_3'\ge 4/3 with the argument principle. Both proofs are computer-assisted, and both theorems are also proved in Lean 4.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23715655

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 12, 202619 pages
PDFView work

math.MG — Metric Geometry

The 24-cell conjecture in the all-contact case and near D4

Contributed by Tejasvi Singh Tomar

The 24-cell conjecture states that every Voronoi cell of a packing of unit balls in R4\mathbb{R}^4 has volume at least 88, the volume of the regular 24-cell. It implies that no packing of equal balls in R4\mathbb{R}^4 is denser than the lattice packing D4D_4. We prove the conjecture for two classes of cells; in each class, equality holds only for the D4D_4 root configuration. The first consists of the cells whose ball touches every ball centred at distance less than 222\sqrt2 from its centre, and its proof uses a certificate at the second level of the Lasserre hierarchy. The second consists of the cells whose 2424 nearest centres lie in an explicit neighbourhood of the D4D_4 configuration, whatever the other centres are. For them the volume is at least 88 plus a fixed multiple of the total outward displacement of the 2424 centres, which we prove by a quantitative rigidity estimate and a second-order expansion of the volume about D4D_4. Our proofs for both classes are computer-assisted and partly formalised in Lean.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23720963

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 12, 202624 pages
PDFView work