Matching works

8 works

math.NT — Number Theory

Degeneracy and the level-one Maass spectrum: a measured verdict on arithmetic quantum chaos

Contributed by Zeng Chunping

We isolate the spectral axis of a seven-world program: the length spectrum of the modular surface, its degeneracy, and the statistics of the level-one Maass spectrum. (1) The true degeneracy of a closed geodesic of discriminant DD equals the narrow class number h+(D)h^{+}(D), i.e. the number of ρ\rho-orbits of Zagier-reduced indefinite binary quadratic forms; on all 36 fundamental discriminants 5≤D≤1205\le D\le 120 the equality holds as an exact integer. (2) With the corrected counting (all non-square discriminants D≡0,1(mod4)D\equiv 0,1 \pmod 4, primitive forms, ρ\rho-orbits), the prime geodesic theorem has error exponent 1/21/2: N(X)/li(eX)=0.9963N(X)/\mathrm{li}(e^X)=0.9963 at X=12X=12 with ∣err∣/eX/2|\mathrm{err}|/e^{X/2} bounded and decreasing overall. (3) The level-one Maass spectrum is long-range GOE and short-range non-Wigner: on 1110 even levels, Σ2(20)=1.203 [1.02,1.26]\Sigma_2(20)=1.203\ [1.02,1.26] against Poisson 20 and compatible with GOE 1.049, while the spacing distribution fails the Wigner surmise with a 17×17\times small-gap excess. This is the standard signature of arithmetic quantum chaos: rigidity without local Wigner repulsion. We also record the archimedean parity law Γ2ka=2Γ2k+1a∼r−2k\Gamma^{a}_{2k}=2\Gamma^{a}_{2k+1}\sim r^{-2k}, synthetic-spectrum pipeline self-certification, and the corrected upper-envelope saturation criterion. Every measured number carries a confidence interval; corrections applied are recorded in an appendix.

Primarily human-written textHuman understanding: all partsMaass formsarithmetic quantum chaosclass numberslength spectrumlevel repulsionprime geodesic theorem
Nov 06, 20269 pages
PDFView work

math.NT — Number Theory

Class numbers, square roots and quadratic non-residues in time 2O(n/log⁡n)2^{O(n/\sqrt{\log n})}, assuming the new #SAT algorithms

Contributed by Vaibhav Tulsyan

Basic counting problems of computational number theory have proven deterministic bounds that are fixed powers of the input. The class number h(D)h(D) of an imaginary quadratic discriminant takes ∣D∣1/2+o(1)|D|^{1/2+o(1)} steps unconditionally and ∣D∣1/5+o(1)|D|^{1/5+o(1)} under the generalised Riemann hypothesis (GRH); exact divisor sums ∑m≤xτ(m)\sum_{m\le x}\tau(m) take x1/3+o(1)x^{1/3+o(1)}. However, none of these bounds is of the form Xo(1)X^{o(1)}, even conditionally. We present deterministic algorithms in time 2O(n/log⁡n)2^{O(n/\sqrt{\log n})}, where nn is the input bit length, for the number of reduced forms of discriminant −N-N (for fundamental discriminants, h(−N)h(-N)) and for ∑m≤xτ(m)\sum_{m\le x}\tau(m), ∑m≤xσ(m)\sum_{m\le x}\sigma(m) and the Gauss circle count. Our approach writes each answer as a count of solutions of equations with one or two products and evaluates it with Anthropic's counting engine through one network library with O(n)O(n) shared bits. The same library gives the least square root modulo any mm and the least quadratic non-residue modulo a prime. These are not new bounds (OpenAI's results on the quasi-Riemann hypothesis and on deterministic polynomial factorisation over Fp\mathbb{F}_p give polynomial time modulo a prime), but they are machine-checked. We prove the seven resulting theorems in Lean 4 (for example hForm_TM_rate; axioms propext, Classical.choice, Quot.sound): a finite-alphabet Mathlib Turing machine outputs the answer within ⌊C⋅2Cn/log⁡2(n+2)⌋\lfloor C\cdot2^{Cn/\sqrt{\log_2(n+2)}}\rfloor steps on every input. Lean proves the count of Gauss's reduced forms; its equality with the ideal class number is classical and not formalised. The constants are astronomical, the machines use exponential space, and every result rests on Anthropic's Lean development of its claimed refutation of the Exponential Time Hypothesis, which is under review. Version 2 corrects the claims of version 1 about non-residues and square roots.

Primarily AI-generated textHuman understanding: some parts
Nov 05, 202612 pages
PDFView work

cs.CC — Computational Complexity

Class Numbers of Imaginary Quadratic Orders in the Polynomial Hierarchy

Contributed by Frank Vega

For d≥3d \geq 3 with −d≡0,1(mod4)-d \equiv 0, 1 \pmod 4, let h(−d)h(-d) be the number of classes of primitive positive definite binary quadratic forms of discriminant −d-d. We prove that d↦h(−d)d \mapsto h(-d) is computable in deterministic polynomial time with an oracle for a language in the second level Σ2P\Sigma_2^{\text{P}} of the polynomial hierarchy. The proof uses only reduction theory of binary quadratic forms, Lagrange's theorem and Hermite normal forms; it does not assume the generalized Riemann hypothesis, does not take a generating set of the class group as input, and uses no randomness. A Σ2P\Sigma_2^{\text{P}} oracle finds a generating set of O(log⁡d)O(\log d) forms, and an NP oracle then determines the lattice of relations, whose index is h(−d)h(-d). Consequently, if P=NP\text{P} = \text{NP}, class numbers of imaginary quadratic fields are computable in polynomial time. As an application, the number DnD_n of representations of nn by the ternary form 8x2+2y2+16z28x^2 + 2y^2 + 16z^2 in Tunnell's congruent number criterion equals 2h(−4n)2h(-4n) for square-free n≡2(mod8)n \equiv 2 \pmod 8 and vanishes for square-free n≡6(mod8)n \equiv 6 \pmod 8; hence DnD_n lies in FPΣ2P\text{FP}^{\Sigma_2^{\text{P}}} on even square-free nn, and an exact counting reduction from #SAT\#\text{SAT} to DnD_n would collapse the polynomial hierarchy to Δ3P\Delta_3^{\text{P}}.

Author comments: In this new version, we have added a computer-based numerical verification.

Primarily AI-generated textHuman understanding: all partsHermite normal formTunnell's theorembinary quadratic formsblack-box groupsclass numberscongruent numberscounting complexitypolynomial hierarchy
Nov 04, 20269 pages
PDFView work

math.NT — Number Theory

A proof Gauss might have found

Contributed by Roelof van Dijk

Ben Green’s historical variant of Tao’s recent tenth discriminant challenge [5] asks how early Gauss’s class-number-one conjecture could have been proved using mathematics then in print. Through discussions with GPT-6 Astra and Opus 5.5, we construct a proof of Gauss’s class-number-one conjecture [1] from ingredients published by 1808, specializing the Frobenius determinant argument [6]. Counting values of the principal form and summing factorial valuations reduce the proof to a residue sieve below 17000.

A mix of human-written and AI-generated textHuman understanding: no parts
Oct 26, 20265 pages
PDFView work

math.NT — Number Theory

Forced 33-adic anomalies of S3S_3 cubic fields

Contributed by Shawn Krisman

Let kk be a totally real cubic field and pp a prime unramified in kk. The pp-adic regulator of kk is a 2×22\times2 determinant of pp-adic logarithms of units and is always divisible by p2p^2; call kk anomalous at pp if it is divisible by p3p^3. Among all 592421 totally real cubic fields of discriminant up to 10710^7, the proportion of anomalous fields matches a random-matrix prediction at every prime 5≤p≤315\le p\le 31, but at p=3p=3 it is 0.3810.381 instead of the predicted 0.4070.407. We explain this. For cubic fields of fundamental discriminant DD prime to 3, we show that the 3-class group and the ray class group modulo 9 of the quadratic field Q(D)\mathbb{Q}(\sqrt{D}) can force every cubic field of discriminant DD to be anomalous at 3. When the 3-class group of Q(D)\mathbb{Q}(\sqrt{D}) is cyclic, we decide exactly when kk is anomalous, in terms of one invariant for which we give an explicit formula by cubic residue and Hilbert symbols. The phenomenon comes from the failure of semisimplicity of F3[S3]\mathbb{F}_3[S_3] and has no analogue for p≥5p\ge 5. The results fix one or two 3-adic digits of the regulator and say nothing about Leopoldt's conjecture itself.

Primarily AI-generated textHuman understanding: no partsGalois cohomologyLeopoldt conjecturePoitou-Tate dualityS3 extensionscup productsp-adic regulatorp-rationalityray class groupsrestricted ramificationtotally real cubic fields
Oct 26, 202613 pages
PDFView work

math.NT — Number Theory

The generalized Fermat equation x2+y5=z7x^2+y^5=z^7

Contributed by Manvir Jaswal

We show that the equation x2+y5=z7x^2+y^5=z^7 has no solution in nonzero coprime integers, assuming a classification theorem from Putz's thesis, which has not appeared in a refereed journal. Equivalently, none of the equations x2+y5=z7x^2+y^5=z^7, x2+y7=z5x^2+y^7=z^5, x5+y7=z2x^5+y^7=z^2 has a solution in nonzero coprime integers. Putz attaches to a solution an octic algebra, the fibre of a Belyi map of degree 88, and proves that it is always isomorphic to one fixed octic field L8L_8. We prove unconditionally that no solution has fibre isomorphic to L8L_8, by a fifth-power descent over a field L24L_{24} of degree 2424 that Putz introduced, completed by fifth-power residue symbols at five auxiliary primes. We also prove, without assuming the generalized Riemann hypothesis, that L24L_{24} has class number 11, using a criterion of Belabas, Diaz y Diaz and Friedman.

Primarily AI-generated textHuman understanding: no parts
Oct 08, 202636 pages
PDFView work

math.NT — Number Theory

The generalized Fermat equation x3+y3=znx^3+y^3=z^n

Contributed by Manvir Jaswal

We prove that the equations x3+y3=znx^3+y^3=z^n and x3+y3=3znx^3+y^3=3z^n have no solution in coprime nonzero integers for any n≥3n\ge3. For the first equation the open cases were prime exponents p≡1(mod3)p\equiv1\pmod 3 above 10910^9 outside a set of congruence classes treated by Chen and Siksek; in these cases the solution 13+23=321^3+2^3=3^2 blocks the modular method. We replace Kraus's Frey curve by a hypergeometric motive of rank three over K=Q(−3)K=\mathbb{Q}(\sqrt{-3}), whose parameter at a solution is 33-adically close enough to a point of maximally unipotent monodromy for inertia at −3\sqrt{-3} to act unipotently; the parameter of 13+23=321^3+2^3=3^2 is not. By a theorem of Calegari, Emerton and Gee, the mod pp representation of the fiber, twisted by a cubic character, is the reduction of a member of a compatible system of minimal ramification, and we show that the member at a prime above 33 is irreducible and ordinary at −3\sqrt{-3}. Ramification and unconditional discriminant bounds show that its reductions have trivial semisimplification, and as the Galois group of the maximal pro-33 extension of KK unramified outside −3\sqrt{-3} is generated by one inertia group, the member stabilizes its ordinary line, a contradiction. For x3+y3=3znx^3+y^3=3z^n the same argument also works at the primes p≡2(mod3)p\equiv2\pmod3, which are inert in KK, and Frey curves and descents treat the remaining exponents.

Primarily AI-generated textHuman understanding: no partsFrey representationscompatible systems of Galois representationsgeneralized Fermat equationhypergeometric motivesmodular method
Oct 07, 2026105 pages
PDFView work

math.CO — Combinatorics

An Exponent of 1.043 for the Unit Distance Problem

Contributed by Eric Naslund

Let u(U)u(U) count the unordered pairs at distance one in a finite planar set UU. We construct finite sets UjU_j with ∣Uj∣→∞|U_j|\to\infty and u(Uj)/∣Uj∣1.043171→∞u(U_j)/|U_j|^{1.043171}\to\infty. The largest exponent previously claimed, apart from preliminary versions of the present work, is 1.03581.0358, in the author's unpublished manuscript. The method is the number-field construction of OpenAI and Sawin. Here unit distances come from elements of relative norm one in quadratic extensions K/FK/F in which FF has both real and complex places, and the fields come from an infinite pro-22 tower over $\Q(\sqrt{241})$, ramified only above 22, 33 and 55, with Frobenius conditions at the two primes above 2929 and at one prime above 4141. The relative zeta value is bounded through the dihedral quotients of the tower group: the tower group has 2727 quotients isomorphic to the dihedral group of order~88; fifteen of them detect, by a census, the residue degree of the primes that split completely in the Kummer field up to norm 4⋅10134\cdot10^{13}, and seven of them generate a field EW′′E_{W''} of degree 81928192 contained in every field of the tower. We write ζEW′′\zeta_{E_{W''}} as a product of LL-functions of degrees 22, 44 and~88, evaluate the 576576 of degrees 44 and 88 rigorously at 2121 real points near~11, and combine the values through a kernel inequality with coefficients of both signs. Finite facts and numerical inequalities are certified by exact computation and interval arithmetic. Partial formalization PALOMAR-2026-10-01-000018 v2

Primarily AI-generated textHuman understanding: some parts
Oct 02, 2026101 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations