Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer
We exhibit consecutive-prime gaps of exactly 123662 and 125318, with endpoints of 8416 and 6454 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
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
We improve the level of distribution of smooth numbers in arithmetic progressions to x5/8−ϵ, with uniformity in the residue class. In particular, for every ϵ,A>0 and integer k≥1, there exist δ,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≥2, (logx)C≤y≤x1/C, and a1,a2∈Z∖{0} satisfying
$$
|a_1|\leq x^{1+\delta},\qquad |a_2|\leq x^\delta,\qquad (a_1,a_2)=1.
$$
Here Ψ(z;y) counts the y-smooth integers up to z, Ψq(z;y) counts those coprime to q, and Ψ(z,y;a,q) counts those congruent to a modulo q; τk is the k-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
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
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
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
Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer
We exhibit two consecutive primes whose difference is exactly 122290. Both primes have 8262 decimal digits. Every integer strictly between them has a prime divisor at most 32467. 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
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
In this article, we study the form factor for zeros of Dirichlet L-functions, pairing zeros of the same L-function and then averaging over primitive characters modulo a prime conductor. Unconditionally, we show for ∣α∣<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. For ∣α∣≥1, 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
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
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
Let η>1 be a unit of a real quadratic order and Un=(ηn−ηˉn)/(η−ηˉ) its Lucas sequence. We prove that ∑n≥1Un−3 is irrational. Equivalently, ∑n≥1Un(P,Q)−3∈/Q for the Lucas sequences with Q=−1, P≥1, and with Q=1, P≥3. In particular the sums of the reciprocal cubes of the Pell numbers and of the numbers Fkn, for every k≥1, 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 η once they are measured in units of logη. The whole argument is formalised in Lean 4 with Mathlib.
Primarily AI-generated textHuman understanding: no partsFibonacci numbersHankel determinantsLeanLucas sequencesPell numbersirrationalityq-series
For each fixed integer n≥4, we prove that almost every positive integer solution of ∑i=1nxi2=n∏i=1nxi is determined up to permutation by its largest coordinate. The density is taken over sorted solutions with largest coordinate at most R, as R→∞.
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
Let p be an odd prime and let k be a finite extension of Qp. 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
Pritsker's areal analog ∥P∥0 of the Mahler measure replaces the integral of log∣P∣ over the unit circle by its integral over the unit disc with respect to normalized area. For an algebraic number α of degree n with minimal polynomial P∈Z[x], taken primitive with positive leading coefficient, let N0(α)=∥P∥01/n. Flammang proved that N0(α)≥1.380047 for every totally positive algebraic integer α outside an explicit finite set. We prove that the smallest limit point of the values of N0 on totally positive algebraic integers and their essential minimum lie between 1.3830134 and 1.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.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
Let ℓ+ be the smallest limit point of the values of the absolute Mahler measure Ω(α)=M(α)1/degα on totally positive algebraic integers α. Smyth's work gives ℓ+≤ℓ2=1.72731…, where ℓ=1.31427… is the limit point that he found for totally real algebraic integers. We prove ℓ+≤1.7239501, and that infinitely many totally positive algebraic integers satisfy Ω(α)<1.7239501. Together with the lower bound ℓ+>1.7234615 of a companion paper, this places ℓ+ in an interval of length less than 4.9⋅10−4. The proof exhibits a measure μ on [0,9] with a piecewise linear density on 3,481 rational nodes. Its logarithmic potential is bounded below by a combination of log∣Q∣ for 21 irreducible polynomials Q, namely x and polynomials taken from Flammang's work. By a criterion of Smith, μ, normalized to mass 1, is a limit of distributions of conjugates of totally positive algebraic integers, and its integral of 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
Let ℓ+ be the smallest limit point of the absolute Mahler measures Ω(α)=M(α)1/degα of totally positive algebraic integers α. By work of Smyth, ℓ+≤1.7274, and the best lower bound was Flammang's ℓ+≥1.722069. We prove that all but finitely many totally positive algebraic numbers α satisfy Ω(α)>1.7234615, and that ℓ+>1.7234615. We also prove that all but finitely many totally real algebraic numbers β have absolute logarithmic Weil height logΩ(β)>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
For an algebraic number α let h(α) be its absolute logarithmic Weil height, and let hZ(α)=h(α)+h(1−α). The essential minimum of hZ is the supremum of the numbers H for which only finitely many algebraic numbers satisfy hZ(α)≤H. Zagier showed that it is at least 21log21+5=0.2406059…, and the best lower bound so far is 0.24874, due to Flammang. We prove that the essential minimum is at least 0.24982933. The proof combines Smyth's method of auxiliary functions, here with five integer polynomials in z(1−z), with a logarithmic energy term relative to a measure on the circles ∣z∣=1 and ∣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
We prove that ζF(3)=∑n≥1Fn−3 is irrational, where Fn are the Fibonacci numbers. To our knowledge the only odd value of the Fibonacci zeta function previously known to be irrational was ζF(1). The proof is a Hankel-determinant construction over Z[φ], φ=(1+5)/2, adapted from a recent unrefereed construction for the q-zeta value ∑n2/(pn−1) at integers p≥2. Four estimates are combined: a real decay of size exp(−92K3logφ), a smallness exp(−K3logφ) 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.
Romanoff proved in 1934 that the integers of the form p+2a, with p prime and a≥1, have positive lower density d. We prove that d≥0.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.119178; the best lower bound so far was 0.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
The Schur–Siegel–Smyth trace constant C86 is the lower limit of tr(α)/deg(α) over totally positive algebraic integers α. We prove 1.8022225<C86<1.8070809. For the upper bound we exhibit a measure on [0,6] that satisfies the hypotheses of Smith's theorem on limits of distributions of conjugates, which we check with the help of 21 integer polynomials. This improves the upper bounds 1.8216 of Orloski and Talebizadeh Sardari and 1.8117251 of Pinho. The lower bound comes from the method of Orloski, Talebizadeh Sardari and Smith with fifteen polynomials, three of them of degree 10 found by McKee and Smyth. It is larger than the bound 1.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
For finite sets A,B of real numbers and G⊆A×B, Katz and Tao proved in 1999 that {a−b:(a,b)∈G} has at most N11/6 elements whenever A, B and {a+b:(a,b)∈G} have at most N elements; by an argument of Bourgain, bounds of this kind give lower bounds for the dimension of Kakeya sets. We lower the exponent 11/6 to 1.8273, and to 1.8295 in every abelian group. We also prove ∣X−Y∣≤∣X+Y∣1.4209 for all finite sets X,Y of integers, improving the exponent 1.4543 of Kleinwaks; through his transfer theorem, this lowers the upper bound for the sum-difference constant of Gyarmati, Hennecart and Ruzsa from 1.3124 to 1.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
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
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
(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
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
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
Robin's criterion states that the Riemann Hypothesis holds if and only if σ(n)<eγnloglogn for every n>5040. Nicolas' second criterion, in the form given by Broughan, states that it holds if and only if n/φ(n)<eγloglogn+eγ(2+τ)/logn for every n≥N120569, where Nk is the k-th primorial and τ=2+γ−log(4π); for Nk this inequality reads c(pk)<E(pk). Let N be a colossally abundant number, let q=pk be the largest prime not exceeding the number ξ(N) associated with N by Nicolas, and write Δ(N)=log(σ(N)/N)−γ−logloglogN. For logq≥31 we prove unconditionally that 1.317/(qlog2q)≤Δ(N)−c(q)+E(q)+(22−2−τ)/(qlogq)≤3.973/(qlog2q). Consequently, the second inequality for Nk implies Δ(N)<−0.654/(qlogq). We also prove that the primorials are the extremal cases of the second inequality, and that if it holds for every Nk with e31≤pk≤X, then Robin's inequality holds for every n>5040 with logn≤X(1−log−3X)−logX. A computation over the primes up to X=100,000,008,765,439 verifies this hypothesis, so Robin's inequality holds unconditionally for 5040<n≤101013.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.11485 of Morrill and Platt.
Primarily AI-generated textHuman understanding: all partsChebyshev functionColossally abundant numbersNicolas' inequalityNicolas' second criterionRiemann HypothesisRobin's inequalitySuperabundant numbersprimorial
Let U(n,m) be the maximum number of incidences between n distinct points and m distinct unit circles in the plane. We give two constructions and an explicit upper bound for this function. Writing s=min(n,m) and M=max(n,m), the first construction gives a four-piece monomial lower bound for all cardinalities, with balanced exponent 1.041169920. The second gives balanced configurations along an unbounded sequence with exponent 1.0431722305539701, and further unbalanced configurations. The upper bound is U(n,m)≪M+s2/3−2δM2/3+δ, where δ=2−2664/514560000000>2−2665. 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
Let f be completely multiplicative with independent fair signs at primes. We count starts of constant runs of length at least L in [N,2N), with L=log2N+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/3, with a coefficient depending on N2−L and Lmod3. After retaining the exact mean and second factorial cumulant, the quadratic Poisson–Charlier approximation has optimal error power 4/3: for every fixed ε>0, its ℓ1 error lies between constant multiples of N−4/3−ε and N−4/3+ε, uniformly in each fixed critical band. The leading correction comes from rational pairs. Keeping all channels up to a fixed height h gives an explicit distance equivalent with power h/(h+1), determined by the first omitted height. The third factorial cumulant has optimal power 41/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.
We show that every automorphism of a modular curve XΔ(N) of genus at least 2, where Γ1(N)⊆ΓΔ(N)⊆Γ0(N), is induced by the normalizer of ΓΔ(N) in PSL2(R), except for five curves, namely X0(37), X0(63), X0(108), a curve of level 37 found by Jeon, Kim and Schweizer, and a curve of level 63 whose non-modular automorphisms had, to our knowledge, not been noticed before. In particular every automorphism of X1(N) normalizes the group of diamond operators, as claimed for square-free N 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.
Fix nonincreasing positive integer weights w0,…,wd−1 and define c>1 by (c−1)2∑j=0d−1wjcj=w0. If the total weight is at least two, we prove irrationality of ∑n≥11/(anw0⋯an+d−1wd−1) whenever the positive integers an are strictly increasing and limsupn→∞(logan)/cn=∞. 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) the base becomes 34; staircase weights (d,d−1,…,1) give (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
Contributed by Ramin Takloo-Bighash, Sarthak Chimni
We study unital finite-index subrings of Rn=Z[t]/(tn).
We compute the cubic cotype function and the quartic total and cocyclic
functions at every prime, including the exceptional factors at 2,
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,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≥4. 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
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 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
Let χ2(z)=∑n≥0z2n+1/(2n+1)2 be Legendre's chi function and Ti2(z)=∑n≥0(−1)nz2n+1/(2n+1)2 the inverse tangent integral. We prove three theorems: χ2(1/q) is irrational for every integer q≥3 with q=4; Ti2(1/q) is irrational for every integer q≥5; and χ2(2/q) is irrational for every odd integer q≥175. All three come from one construction: the Hankel determinants of a moment functional with half-integer poles and geometric weight w, read at w=q−2, w=−q−2 and w=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 2, where each needs its own lemma, in the certificates, and in how the nonvanishing lemma is transferred. For large q 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
An Euler triple is a Diophantine triple {a,b,c} with a<b<c=a+b+2ab+1. It extends to the regular Diophantine quadruple {a,b,c,d+}, and it is conjectured that it has no other extension d>c. We prove that an irregular extension forces c<4⋅1048, against c<1098 in recent work of He and Togb\'e. The proof squeezes the index m of the extension, which locates a common term of two Pell sequences, between a floor from congruences, c<8m4, 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/a, which confines irregular extensions to 1+15381<b/a<33552; 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:k with jk≤300. As applications, the three-parameter family of Cipu, Fujita and Mignotte extends only regularly when νA≥2 and K≥643, and when K=1, A∈{2,3} and ν≥2; the latter contains the Hoggatt--Bergum triples, for which this recovers Dujella's theorem for extensions d>c.
A mix of human-written and AI-generated textHuman understanding: some partsDiophantine quadruplesEuler triples
Let A⊆{1,…,N} contain no two distinct elements whose
difference is a nonzero square, and let s(N) be the largest possible
size of such a set. We prove
\[
s(N)\le CN^{0.9999873}
\]
with an absolute constant C.
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 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 72 slots (positions at which
the Fourier transform is evaluated) in
place of (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) would be too weak, we
prove bounds of order 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), exact counts
at p≡3(mod4), 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.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
To an arithmetic system (prime elements, norms, weights, L-functions) we attach the central charge Cν=∑p(logNp)ν/(Np(Npν−1))⋅(weight of Frobp)−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 1013, tropical skeletons to 1031). (II) Critical law Cν∼Φ⋅(ν−1)!/Δν, with Δ the distance to the controlling singularity: a pole (Tate) or the natural boundary (cuspidal); Φ measures reachability (≈0.7 Tate, ≈0.07 cusp). (III) Diagonal main-term theorem: L 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 Δ = rising diagonal fraction = approaching the semicircle (free) = setting η24=1. The core dichotomy (horizontal coordinate σ=1+κ universal, amplitude fingerprinted) is checked on moments. The 24 network (Δ=qη24, Yau--Zaslow, L(11a1,1)/Ω=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.
We prove that ∑n≥11/(an2an+1) is irrational for every strictly increasing sequence of positive integers satisfying limsupn→∞logan/(3)n=∞. This lowers the sufficient growth base from 2 to 3 in the criterion of Barreto, Kang, Kim, Kovač and Zhang (Bull. Lond. Math. Soc. 58 (2026), e70457, Theorem 3) for weights (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
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
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
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 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
We prove that every even integer N≥4 can be written as N=p+η with p prime and η≥2 a product of at most 18 primes, counted with multiplicity. The best previously stated unconditional value we have located is due to Johnston and Starichkova: 395 in the latest version of their paper, which revised the 369 of its first two arXiv versions. Assuming that no Dirichlet L-function vanishes in the half-plane Res>7/8, the same holds with at most 14 primes, and under the generalised Riemann hypothesis for Dirichlet L-functions with at most 9. The improvement comes from counting rather than bounding: an explicit lower bound for the number of primes p with N−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 logn=∑d∣nΛ(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 1155, 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
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
The Polymath project reduced upper bounds for the de Bruijn--Newman constant Λ to three verifiable hypotheses: the Riemann hypothesis up to height X/2, a zero-free region for Ht0 to the right of X, and a barrier at X. With the verification of the Riemann hypothesis up to 3⋅1012 by Platt and Trudgian, this gave Λ≤0.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∗ whose weights are chosen by solving an ℓ1-regression problem, so that any choice of weights still yields a valid lower bound. At the same height X≈6⋅1012 and t0=0.155, y0=0.2, the lower bound for the mollified sum improves from −0.12 (our Lemma~\ref{lem:moll} evaluated with the Euler mollifier on the primes up to 13) to +0.05 with D=120; with D=240 it is still +0.04 at t0=0.154. We cover all x≥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=240 do not reach 0.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
Let G be a split semisimple group whose simple factors are of classical type, over a global function field F of arbitrary positive characteristic. We prove that every semisimple elliptic Langlands parameter ΓF→G(Qℓ) is the parameter of a cusp form on G, in the sense of V. Lafforgue's excursion operators; we call such a form an automorphic realization of the parameter. Neither F 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 F, 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.
Let G be a split simply connected semisimple group over a global function field F whose characteristic does not divide the order of the Weyl group of G. We prove that every semisimple elliptic Langlands parameter ΓF→G(Qℓ) is the parameter of a cusp form on G, 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 F 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−ϕ) 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.
Let G be a split connected reductive group over a global function field F. V. Lafforgue decomposed the space of cusp forms on G 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 G over F itself, which we call an automorphic realization of the parameter. This holds in every positive characteristic for classical groups, in characteristic greater than 3 for G2 and F4, greater than 5 for E6, and greater than 7 for E7 and E8. 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.
Let C1 be the largest constant such that sup∣t∣≤1/2∫f(t−x)f(x)dx≥C1(∫−1/41/4f)2 for every nonnegative function f on the real line. We prove C1≥1.337, improving the bound 1.2937 of Kim and Pilanci, by a spatial branch-and-bound over the masses of f on equal bins. Consequently, for every large g, every g-Sidon set in {1,…,N} has fewer than 1.2231gN elements once N is large enough in terms of g. For real-valued f supported in [−1/4,1/4], let C3 and C3′ be the analogous constants for the essential suprema of ∣f∗f∣ and of f∗f; no lower bound better than the trivial bound 1 was recorded for them. We prove C3≥C3′≥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
The 24-cell conjecture states that every Voronoi cell of a packing of unit balls in R4 has volume at least 8, the volume of the regular 24-cell. It implies that no packing of equal balls in R4 is denser than the lattice packing D4. We prove the conjecture for two classes of cells; in each class, equality holds only for the D4 root configuration. The first consists of the cells whose ball touches every ball centred at distance less than 22 from its centre, and its proof uses a certificate at the second level of the Lasserre hierarchy. The second consists of the cells whose 24 nearest centres lie in an explicit neighbourhood of the D4 configuration, whatever the other centres are. For them the volume is at least 8 plus a fixed multiple of the total outward displacement of the 24 centres, which we prove by a quantitative rigidity estimate and a second-order expansion of the volume about D4. 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