Browse

All works

Browse the Hexagon catalog.

Newest works

1110 works

cs.LO — Logic in Computer Science

A Lean 4 formalization of the area law for three-dimensional U(1) lattice gauge theory with the Wilson action

Contributed by Tejasvi Singh Tomar

In three-dimensional U(1)U(1) lattice gauge theory with the Wilson action, static charges are confined at every coupling: rectangular Wilson loops obey an area law, uniformly in the finite box. This was proved recently by the author in a separate paper; the proof runs to over three hundred pages with its supplement and adapts the Debye-screening analysis of Brydges and Federbush and the multiscale expansion of Göpfert and Mack. We describe a formalization of this proof in Lean 4 with Mathlib, which also covers the paper's corollaries and its appendix on comparing Wilson and Villain loops. The formal theorems take no hypotheses and use only the standard axioms of Lean. The proof became formalizable through explicit interfaces between its parts, written-out versions of the steps that the paper adapts from the literature or leaves out, and certified values for every numerical constant. The formalization also yielded 70 corrections and improvements to the paper, none of which changes its main results.

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

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

cs.LO — Logic in Computer Science

Formal Verification of a Computer-Assisted Proof in Celestial Mechanics

Contributed by Tejasvi Singh Tomar

Albouy, Fu and Sun conjectured in 2008 that four positive masses admit, for each cyclic order of the bodies, exactly one convex central configuration up to similarity; the question is Problem 10 of a 2012 list of open problems on the nn-body problem. We recently proved the conjecture by reducing it to an inequality for a trace at the real zeros of an equation in four variables; a branch and bound that starts from a grid of 136,448 boxes establishes the inequality. In this paper we describe a formalization of the whole proof in Lean 4 and Mathlib in which Lean's kernel checks the computation, using decide +kernel, so that no compiler has to be trusted. Our checker stores an interval as two natural numbers in a biased fixed-point format. The kernel can then hand all the arithmetic to GMP. Functions are enclosed over boxes by first-order slopes. An unverified search records the decisions for each box in one natural number, and the checker replays them. We write each formula once over a type class; evaluating it at a type that pairs a real number with an interval then proves the enclosure correct. Checking the 3418 certificate theorems takes 7.6 hours of processor time, and the independent type checker nanoda accepts the proof. A version rebuilt on one eighth of the boxes passed three type checkers in 2.9 hours on a public registry of formal proofs.

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

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

cs.DS — Data Structures and Algorithms

Sorting networks on 13 inputs need at least 44 comparators

Contributed by Tejasvi Singh Tomar

Let S(N)S(N) be the least number of comparators in a sorting network on NN inputs. We prove S(13)≥44S(13)\ge44, one more than the previously best proved lower bound. We also prove P(2,N)=⌈log⁡2F(N)⌉P(2,N)=\lceil \log_2 F(N)\rceil for 3≤N≤323\le N\le32, where P(2,N)P(2,N) is the least worst-case number of comparators met by the two largest inputs in a network that delivers them to fixed outputs and FF is an explicit function of Van Voorhis; the lower bound comes from a finite search based on the structure of the paths of these two values. Starting from Harder's S(11)=35S(11)=35 and S(12)=39S(12)=39, these values of P(2,N)P(2,N), the two-value bound S(N)≥S(N−2)+P(2,N)S(N)\ge S(N-2)+P(2,N) and the one-value bound S(N)≥S(N−1)+⌈log⁡2N⌉S(N)\ge S(N-1)+\lceil \log_2 N\rceil give the twenty lower bounds on S(N)S(N) for 13≤N≤3213\le N\le32 in Dobbelaere's table; these bounds rested on Van Voorhis's inequality P(2,N)≥⌈log⁡2F(N)⌉P(2,N)\ge\lceil \log_2 F(N)\rceil, whose published proof is invalid. The bound S(13)≥44S(13)\ge44 is also proved in Lean 4, with every step checked by Lean's kernel.

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

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 12, 202620 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

math.CO — Combinatorics

Subplanes of order 3 and maximal arcs in projective planes of order 12

Contributed by Tejasvi Singh Tomar

Whether a projective plane of order 12 exists is open. A subplane of order 3 of such a plane is a case of equality in Bruck's bound n≥m2+mn\ge m^2+m; the 27 points on no line of the subplane then form a maximal arc of degree 3, and together with the subplane a maximal arc KK of degree 4. We show that every line of a subplane of order 3 contained in KK lies in at most two such subplanes, whereas in PG(3,3)\mathrm{PG}(3,3), which like KK has 40 points, a line lies in four planes; the proof uses Egan and Wanless's classification of triples of mutually orthogonal Latin squares of order 9. We also show that AG(3,3)\mathrm{AG}(3,3) is not the design of any maximal arc of degree 3 in a plane of order 12, and that a permutation of the points that maps a subplane of order 3 onto itself and each line meeting it onto a line cannot have prime order other than 3. The proofs are computer-assisted, and their SAT refutations are certified.

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

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

cs.CC — Computational Complexity

Which Fine-Grained Lower Bounds Survive the Refutation of 3SUM and APSP?

Contributed by Tejasvi Singh Tomar

Alman and Vassilevska Williams have refuted the 3SUM and APSP hypotheses. Their algorithms rest on counting the triangles through prescribed edges of lopsided tripartite graphs, whose middle part has nεn^{\varepsilon} vertices for a small ε\varepsilon. Majdoddin extended the method to every ε<ln⁡4/(5ln⁡5)≈0.172\varepsilon<\ln4/(5\ln5)\approx0.172. We determine which of the main conditional lower bounds derived from the refuted hypotheses survive. We also prove that the method extends to every ε<0.17843\varepsilon<0.17843 when the prescribed edges are known in advance and there are at most n2−ε/2n^{2-\varepsilon/2} of them, which confirms Majdoddin's numerical estimate. Whether a bound survives depends mostly on the instances that its reduction produces. The reductions behind most bounds produce instances outside the range of the new algorithms: balanced graphs, or lopsided graphs with a larger middle part. Most of the set-disjointness, dynamic-graph and triangle bounds therefore follow from hypotheses that no known algorithm contradicts. These hypotheses, however, concern mainly such instances, and for several bounds the hypothesis is the bound itself, stated for these instances. Their evidence came largely from the refuted hypotheses. A few bounds are false, among them a lower bound of Goldstein, Lewenstein and Porat for Set Disjointness over small universes; the Strong SetDisjointness Conjecture also fails at small polynomial query times. Other bounds have lost their support, such as the Set Disjointness trade-offs of Kopelowitz, Pettie and Porat over small universes apart from constant query time. Finally, we collect the known obstacles to a larger closed-form range with a different base identity and use border-rank lower bounds to exclude several natural candidates.

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

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

quant-ph — Quantum Physics

On the minimal dimension of range-criterion counterexamples to the PPT² conjecture

Contributed by Tejasvi Singh Tomar

The PPT2^2 conjecture asserts that the composition of two completely positive and completely copositive (PPT) maps is entanglement breaking. A recently announced counterexample, with PPT maps M10→M6→M10\mathrm{M}_{10}\to\mathrm{M}_6\to\mathrm{M}_{10}, is certified by the range criterion: the range of the composite Choi matrix contains no nonzero product vector. We ask how small a counterexample certified in this way can be. For PPT maps Φ ⁣:Mm→Mk\Phi\colon\mathrm{M}_m\to\mathrm{M}_k and Ψ ⁣:Mk→Mn\Psi\colon\mathrm{M}_k\to\mathrm{M}_n with Ψ∘Φ≠0\Psi\circ\Phi\neq0 and max⁡(m,k,n)≤6\max(m,k,n)\le6 we prove that the range of the Choi matrix of Ψ∘Φ\Psi\circ\Phi contains a nonzero product vector whenever k≤5k\le5 or min⁡(m,n)≤5\min(m,n)\le5. Hence the range criterion cannot certify a counterexample on M4\mathrm{M}_4 or M5\mathrm{M}_5, and among the types with all three dimensions at most six only (6,6,6)(6,6,6) remains open. Since the range is spanned by products of Kraus operators, the question is when such a span can avoid the matrices of rank one. The computer-assisted proof combines rank bounds for PPT maps with Chern class and excess intersection computations; its computed facts are checked in Lean 4, modulo classical, quoted or hand-proved inputs. The announced counterexample lifts through exterior powers a map on M4\mathrm{M}_4 built from a pencil of real matrices (a map of pencil type). When the map of pencil type loses rank transversally at finitely many points, its lifts through any Schur functor, exterior powers included, put product vectors into the kernel of the composite Choi matrix. When the composite is also nonzero, these product vectors form an unextendible product set only for exterior powers, and then one of the three dimensions is at least ten.

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

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

quant-ph — Quantum Physics

The PPT² conjecture holds for spin-factor maps

Contributed by Tejasvi Singh Tomar

The PPT2^2 conjecture asserts that the composition of two completely positive and completely copositive maps is entanglement breaking. A counterexample in dimension ten has recently been announced, and for maps on M4\mathrm{M}_4 the conjecture is open. Let S⊂M4\mathcal{S}\subset\mathrm{M}_4 be the real span of the identity γ0\gamma_0 and five pairwise anticommuting Hermitian unitaries γ1,…,γ5\gamma_1,\dots,\gamma_5. It is a spin factor whose positive cone is a Lorentz cone. We prove the conjecture for all compositions Ψ∘Φ\Psi\circ\Phi of completely positive maps Φ ⁣:M4→Mk\Phi\colon\mathrm{M}_4\to\mathrm{M}_k and Ψ ⁣:Mk→M4\Psi\colon\mathrm{M}_k\to\mathrm{M}_4, with kk arbitrary, such that the ranges of Ψ\Psi and of the adjoint Φ∗\Phi^{*} lie in invertible congruences of the complex span of S\mathcal{S}. Such maps are automatically completely copositive, and the class contains maps whose Choi matrices are entangled. A theorem of Hildebrand on separability for pairs of Lorentz cones reduces the claim to one trace inequality between the coefficient matrices of the two Choi matrices. We derive this inequality from the operator inequality ∑j=15FjF0−1Fj⪯F0\sum_{j=1}^{5}F_jF_0^{-1}F_j\preceq F_0, valid whenever ∑μ=05Fμ⊗γμ⪰0\sum_{\mu=0}^{5}F_\mu\otimes\gamma_\mu\succeq 0 and F0≻0F_0\succ 0, which in turn follows from the Kadison–Schwarz inequality. As a corollary, Ψ∘Φ\Psi\circ\Phi is entanglement breaking whenever Ψ\Psi is such a map and Φ\Phi is a completely positive map with Kraus operators of rank at most two.

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

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

math.PR — Probability

The L¹ Poincaré constant of the Hamming cube

Contributed by Tejasvi Singh Tomar

Let CC be the smallest constant such that E∣f−Ef∣≤C E∣∇f∣\mathbb{E}|f-\mathbb{E} f|\le C\,\mathbb{E}|\nabla f| for every real-valued function ff on every Hamming cube {−1,1}n\{-1,1\}^n, where ∣∇f∣|\nabla f| is the Euclidean length of (D1f,…,Dnf)(D_1f,\dots,D_nf) and Djf(x)=(f(x)−f(x(j)))/2D_jf(x)=(f(x)-f(x^{(j)}))/2. Ben Efraim and Lust-Piquard proved C≤π/2C\le\pi/2, the Gaussian case gives C≥π/2C\ge\sqrt{\pi/2}, and Ivanisvili, Li, van Handel and Volberg asked whether C=π/2C=\sqrt{\pi/2}. We prove that it is, with an explicit constant cn<π/2c_n<\sqrt{\pi/2} in dimension nn. The proof turns on an integral of first absolute moments of sums of independent biased random signs: we compute it exactly when the coefficients are nonnegative, and show, with a sampled Fejér kernel, that it can only grow when the coefficients are replaced by their absolute values. The equality C=π/2C=\sqrt{\pi/2} is also proved in Lean 4 with Mathlib.

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

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

math.CO — Combinatorics

A thrackle on n vertices has fewer than 4n/3 edges

Contributed by Tejasvi Singh Tomar

A thrackle is a drawing of a graph in the plane in which every two edges meet exactly once, either at a common endpoint or at a proper crossing. Conway conjectured that a thrackle with nn vertices has at most nn edges. We prove that a thrackle with n≥4n\ge4 vertices has at most 43(n−1)\frac43(n-1) edges, improving the bound 1813(n−1)\frac{18}{13}(n-1) obtained by Tóth and, independently, by Scoppetto. The proof combines Xu's discharging argument with two computer searches, by the method of Fulek and Pach, showing that two generalized dumbbells in the sense of Fulek and Pach are not thrackleable: DB(6,8,−1)\mathrm{DB}(6,8,-1) is a 66-cycle and an 88-cycle sharing one edge; DB(6,10,−3)\mathrm{DB}(6,10,-3) is a 66-cycle and a 1010-cycle sharing a path of three edges. A formal proof in Lean 4 derives the bound from five properties of thrackles and checks the computational facts it uses; Section 6 states what this proof trusts.

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

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

math.MG — Metric Geometry

A lower bound of 0.8366 for Lebesgue's universal covering problem

Contributed by Tejasvi Singh Tomar

A universal cover is a convex set in the plane that contains a congruent copy of every set of diameter at most 11. Lebesgue asked in 1914 for a universal cover of least area; before this work, the infimum Λ\Lambda of the areas of universal covers was known to satisfy 0.83474≤Λ≤0.84410.83474\le\Lambda\le0.8441. Lower bounds come from test sets: Λ\Lambda is bounded below by the least area of a convex hull of congruent copies of given sets of diameter at most 11. The best earlier lower bounds used the disk, the Reuleaux triangle and the Reuleaux pentagon, but these three bodies are known to admit a placement with hull area below 0.834790.83479, so they cannot give a much better bound. Adding the regular Reuleaux heptagon and nonagon of width 11, we improve the lower bound to Λ≥0.8366\Lambda\ge0.8366. Without the nonagon, the other four bodies already give Λ≥0.836\Lambda\ge0.836. The proof is a computer-assisted branch and bound over the relative placements of the bodies. Its certificates are checked in interval arithmetic, and separate proofs of both bounds in Lean 4, with their own certificates, are checked entirely by Lean's kernel.

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

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

math.PR — Probability

Lower bounds for the Beardwood–Halton–Hammersley constant

Contributed by Tejasvi Singh Tomar

Let β\beta be the Beardwood–Halton–Hammersley constant: the shortest tour through nn independent uniform random points in the unit square has length asymptotic to βn\beta\sqrt n almost surely. Dong and Cao proved β≥0.6421\beta\ge0.6421 from an inequality β≥5/8+∑k=3KCk\beta\ge5/8+\sum_{k=3}^{K}C_k, where CkC_k is an integral over configurations of kk points in the plane that form a connected graph when points at distance at most 11 are joined. For C3C_3, C4C_4 and C5C_5, sharper bounds come from a first-order expansion of the area of the union of the unit disks on boxes of configurations. For C6+⋯+C22C_6+\dots+C_{22}, which Dong and Cao did not use, a lower bound comes from comparing each point only with the three points before it in the order of their first coordinates. We obtain β≥0.6496\beta\ge0.6496, and β≥0.6508\beta\ge0.6508 if the exponential function of the C library used to evaluate the bound for C6+⋯+C22C_6+\dots+C_{22} has a relative error below 10−910^{-9}. The proofs are computer-assisted; the bound 0.64960.6496 is proved in Lean 4, with finite checks evaluated by compiled code, from the inequality of Dong and Cao and two statements about unions of disks that we prove but do not formalize.

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

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

cs.IT — Information Theory

The automorphism group of an extremal [72,36,16] code is trivial

Contributed by Tejasvi Singh Tomar

Whether a binary doubly-even self-dual [72,36,16][72,36,16] code exists is a question raised by Sloane in 1973. A series of papers, surveyed by Borello, shows that the automorphism group of such a code is trivial or isomorphic to C2C_2, C3C_3, C2×C2C_2\times C_2 or C5C_5. We prove that such a code has no automorphism of order 22, 33 or 55, and hence no nontrivial automorphism. Each such automorphism reduces the problem to a finite computer search. For order 22 the search runs over symmetric bilinear forms on the 4141 self-dual [36,18,8][36,18,8] codes. An automorphism of order 33 leads to a search over labellings of the Hermitian self-dual [24,12,8][24,12,8] codes over F4\mathbb{F}_4 by the extended Golay code. Order 55 reduces to 7×77\times7 unitary matrices over F16\mathbb{F}_{16}. Along the way we classify the Hermitian self-dual [24,12,8][24,12,8] codes over F4\mathbb{F}_4: there are 26 924 93126\,924\,931 of them up to monomial equivalence.

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

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

math.CO — Combinatorics

The Steiner ratio is at least 0.8564

Contributed by Tejasvi Singh Tomar

The Steiner ratio is the infimum, over finite sets of points in the Euclidean plane, of the length of a Steiner minimal tree divided by the length of a minimum spanning tree. Gilbert and Pollak conjectured in 1968 that it equals 3/2≈0.8660\sqrt3/2\approx0.8660, and the conjecture is open. We prove that it is at least 2141/2500=0.85642141/2500=0.8564, improving the bound 0.85590.8559 of Ke, Huang, Shu, He, Gai and Wang. Their method reduces the induction step of Du and Hwang's 1983 proof of the bound 0.80.8 to finitely many inequalities on boxes in a space of local configurations of a Steiner minimal tree, which are checked by computer. These inequalities use estimates for the positions of terminals outside the local configuration. We prove all the geometric lemmas that our certificate uses, filling gaps in two proofs of Ke et al., and we add two such estimates that hold for more parameter values than the published ones. Within this method some new estimate is necessary: with the published estimates, no certificate of this kind reaches 0.8560.856, whatever the boxes. The computer-assisted part is also verified in Lean 4, by a proof whose checks all run in Lean's kernel; the rest of the argument enters the formal proof as hypotheses.

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

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

math.DS — Dynamical Systems

The number of planar central configurations of four bodies

Contributed by Tejasvi Singh Tomar

For four positive masses in the plane we determine the number NN of central configurations, counted up to rotation, translation and scaling, in terms of one fold surface, whose certified enclosures decide NN for all masses outside a closed null set. Of these configurations, 1212 are collinear, by Moulton's theorem, and 66 are convex, by the existence theorem of MacMillan and Bartky and the uniqueness proved in the author's preprint arXiv:2609.35632. Through Dziobek's relations, the concave configurations with inner body ii form the fibre of a proper mass map of degree 22. Their number cic_i, counted up to reflection, is 11, 22, 33 or 44, and we read it off from the position of the mass ratios relative to this surface. Altogether N=18+2(c1+c2+c3+c4)N=18+2(c_1+c_2+c_3+c_4), an even number with 32≤N≤5032\le N\le50. Moreover N=32N=32 exactly at Palmore's masses, and every even value in this range occurs. For four equal masses we recover Albouy's count N=50N=50. The proof shows with interval certificates that the mass map is injective where its Jacobian is not positive, obtains its degree from the restricted problem, and analyses its folds, cusps and Palmore's umbilic. A formalization in Lean also proves these results.

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

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

math.DS — Dynamical Systems

Smale's sixth problem for six bodies in the plane: finiteness of central configurations for generic masses, with a proof formalized in Lean

Contributed by Tejasvi Singh Tomar

Smale's sixth problem asks whether, for every choice of positive masses, the number of central configurations up to similarity is finite. We prove that it is finite for six bodies in the plane and all positive masses outside a proper algebraic subset of the mass space. This subset, which we describe only in part, contains every mass vector with three equal masses or with one mass equal to the sum of two others. Finiteness for all positive masses remains open. Infinitely many central configurations would give a curve of complex solutions; following Albouy and Kaloshin, we exclude such a curve using the valuations of the mutual distances at its points at infinity. The proof is computer-assisted and uses linear programs, Gröbner bases and interval arithmetic. The theorem is proved in the Lean proof assistant, whose kernel checks the computations as well.

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

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

math.MG — Metric Geometry

The kissing numbers in dimensions five and seven are at most 43 and 132

Contributed by Tejasvi Singh Tomar

The kissing number τn\tau_n is the largest number of non-overlapping unit balls in Rn\mathbb{R}^n that can touch a common unit ball. The best bounds so far were 40≤τ5≤4440\le\tau_5\le44 and 126≤τ7≤134126\le\tau_7\le134; both upper bounds come from high-precision floating-point computations of the three-point bound by Mittelmann and Vallentin. We prove τ5≤43\tau_5\le 43 and τ7≤132\tau_7\le132. Each proof is an exact rational solution of the second level of the Lasserre hierarchy for spherical codes at degrees (d1,d2,δ)=(14,20,20)(d_1,d_2,\delta)=(14,20,20). We use the formulation of de Laat, Leijenhorst and de Muinck Keizer and check the solutions with their verification program. Each certificate is obtained by rounding a convex combination of two dual iterates of the interior-point method, one on each side of the target value. Exact certificates for the same hierarchy also give A(4,arccos⁡13)≤14A(4,\arccos\frac13)\le14, A(5,arccos⁡13)≤22A(5,\arccos\frac13)\le22 and A(6,arccos⁡13)≤34A(6,\arccos\frac13)\le34 for spherical codes, improving the previous bounds 1515, 2323 and 3535; with a known code, A(4,arccos⁡13)=14A(4,\arccos\frac13)=14. The largest number of points at angle π/3\pi/3 from a point of a kissing configuration in Rn\mathbb{R}^n equals A(n−1,arccos⁡13)A(n-1,\arccos\frac13), so in R5\mathbb{R}^5 this number is 1414. We also prove the five bounds in the Lean proof assistant, assuming only the positivity of the zonal kernels given by the zonal polynomial files: once by checking the exact certificates with compiled code, and once, with every computation done by Lean's kernel, from the certificates rounded to 3030 decimal places.

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

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

math.RA — Rings and Algebras

Local optimality of rank-47 schemes for 4×4 matrix multiplication over F2

Contributed by Tejasvi Singh Tomar

The tensor ⟨4,4,4⟩\langle 4,4,4\rangle of 4×44\times4 matrix multiplication has rank at most 47 over F2\mathbb{F}_2, and as it is not known whether 47 is optimal, we ask how far the known decompositions of rank 47 are from one of rank 46. A decomposition is locally optimal to depth DD if no DD or fewer of its rank-one terms can be replaced by fewer rank-one terms. We prove that five pairwise inequivalent decompositions of rank 47 over F2\mathbb{F}_2 are locally optimal to depth 18, as is every decomposition equivalent to one of them, so a decomposition of rank 46 over F2\mathbb{F}_2 shares at most 28 terms with any decomposition in these five classes. The five classes include the scheme of Fawzi et al. and every public decomposition of rank 47 over F2\mathbb{F}_2 known to us; one of them, found in our flip-graph searches, is new. The proof rests on a peeling lemma and, for four sets of terms that resist the other bounds, on a refinement of the substitution method, which we call substitution over subspaces with lifting. Local optimality to depth 18 is also proved in Lean 4.

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

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

cs.DS — Data Structures and Algorithms

Exact sizes of networks that select the three or four largest of n elements

Contributed by Tejasvi Singh Tomar

We study (t,n)(t,n)-selection networks, which move the tt largest of nn inputs to tt given lines in any order, and the least number U^t(n)\hat U_t(n) of comparators in such a network. Alekseev showed that U^t(n)≥(n−t)⌈lg⁡(t+1)⌉\hat U_t(n)\ge(n-t)\lceil\lg(t+1)\rceil. For t=2k≥4t=2^k\ge 4 we raise this bound by k−1k-1 for every n>tn>t, and by 2k−52k-5 when t≥32t\ge 32; as far as we know, these are the first improvements at powers of two. The proofs follow the weights of the lines, and a pruning step of Yao extends the gain to every t≥3t\ge 3. For t=3t=3, Yao's upper bound 2n−5+⌊lg⁡(n−3)⌋2n-5+\lfloor\lg(n-3)\rfloor is exact for 4≤n≤184\le n\le 18. For t=4t=4 the new bound is 3n−113n-11 for all n≥5n\ge 5, and the value 3n−103n-10 that Knuth expected is exact for 6≤n≤126\le n\le 12. Their lower bounds rest on exhaustive searches at a few sizes and on the fact that one more input costs at least two more comparators. Most of the results are also proved in Lean 4, some through compiled checks.

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

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

cs.LO — Logic in Computer Science

Re-proving native_decide facts in Lean's kernel: a study of 16 public packages and a converter

Contributed by Tejasvi Singh Tomar

Lean's native_decide proves a decidable proposition by running compiled code and records the result as an axiom. Mathlib forbids such axioms, and lake check and Comparator in Lean 4.35 reject them, as do the independent proof checkers. NativeTrust re-proves the recorded facts in Lean's kernel, with only the standard axioms and without editing the projects that contain them. Where a definition blocks kernel evaluation and NativeTrust has a version proved equal to it (for example, a fuel-indexed form of well-founded recursion), the converter evaluates a copy that uses that version. It then proves the copy equal to the original, usually by congruence. With its default settings it converts 98.2% of 52,821 native facts in 16 public packages. The three largest packages hold 94% of these facts; outside them it converts 68.5%. Nearly every converted fact needed nothing beyond plain kernel evaluation. Two tools remove the native axioms that the kernel can prove within a budget: a single import that makes each call of the tactic try the kernel first, and a source rewriter.

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

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

math.RA — Rings and Algebras

The rank of 4×4 matrix multiplication over F2 is at least 35

Contributed by Tejasvi Singh Tomar

We prove that the rank of the 4×44\times4 matrix multiplication tensor over F2\mathbb{F}_2 is at least 3535; the previous lower bound was 3434. The bound follows by substitution from RF2(⟨3,3,4⟩)≥27\mathrm{R}_{\mathbb{F}_2}(\langle 3,3,4\rangle)\ge27, which also gives RF2(⟨3,4,4⟩)≥31\mathrm{R}_{\mathbb{F}_2}(\langle 3,4,4\rangle)\ge31. Each of the three bounds is one more than what follows from RF2(⟨3,3,3⟩)=23\mathrm{R}_{\mathbb{F}_2}(\langle 3,3,3\rangle)=23. A flattening argument reduces the bound for ⟨3,3,4⟩\langle 3,3,4\rangle to lower bounds for two quotients of the tensor, by the span of a matrix of rank two and by the span of a matrix of rank three. These come from exhaustive searches over the possible patterns of a short decomposition, pruned by lower bounds for quotients by larger subspaces. The whole argument, including every step of the searches, is checked in the proof assistant Lean 4, with one compiled evaluation of a verified certificate checker.

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

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

quant-ph — Quantum Physics

Certified lower bounds on the optimal-decoding threshold of the surface code

Contributed by Tejasvi Singh Tomar

Under independent bit flips, rigorous lower bounds on the threshold of the surface code from earlier work stay below 0.040.04, while numerical estimates place the optimal threshold near 0.1090.109. By counting labelled failure paths with exact transfer-matrix certificates, we prove without sampling that every minimum-weight decoder has threshold at least 0.04650.0465 on the planar and rotated codes. We then give statistical certificates that, with confidence 1−10−91-10^{-9} each, the optimal threshold of the planar code is at least 0.1030.103 under bit flips and at least 0.020.02 under phenomenological noise. Each statistical certificate bounds the failure probability of an auxiliary decoder that divides the code into blocks and corrects each block using a window around it; optimal decoding does at least as well, so the bound also holds for optimal decoding. A deterministic lemma shows that the auxiliary decoder fails only if bad blocks, in which the window corrections leave a defect or a long residual path, form a sparse hierarchy that joins the two rough boundaries. This gives an explicit bound once every block is bad with probability below a limit, about 4×10−44\times10^{-4} under bit flips, and a pre-registered Monte Carlo experiment bounds these probabilities. The confidence rests on a binomial model of the counts of bad blocks and on two tested properties of each decoding program. All these results are proved in the proof assistant Lean 4, the statistical ones with the binomial model and the two properties as hypotheses.

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

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

quant-ph — Quantum Physics

Entanglement from the Diósi–Penrose Model: An Exact Criterion, and Why It Stays Small at Any Distance

Contributed by Marc Sperzel

Trillo and Navascués showed that the Diósi–Penrose model, in the Tilloy–Diósi form with the same smearing length σ\sigma in force and noise, entangles two masses in superposition when they are closer than about 2.2 σ2.2\,\sigma, and asked whether gravitationally induced entanglement can be observed beyond that distance. We answer for two rigid bodies whose branches are position eigenstates on finite sets, without kinetic term, for noise strength CC. One kernel, the Coulomb energy of the smeared bodies, sets both the Newtonian coupling and the correlated noise, and the question becomes a single geometric comparison: a product state becomes entangled if and only if the largest canonical correlation between neutral charge patterns on the two branch sets exceeds C/1+C2C/\sqrt{1+C^2}. Below this threshold the evolution is a separable operation at all times. The published critical distances are two-branch cases of the criterion: for parallel two-branch superpositions the supremum is 2.21 σ2.21\,\sigma at C=1C=1, and a straddling geometry reaches 2.74 σ2.74\,\sigma. With many branches there is no critical distance. What limits the effect is the model's own dephasing, which sits in the same quadratic form. For bodies of effective size σeff\sigma_{\rm eff} (σ\sigma for point masses) separated by a slab of width d≫σd\gg\sigma, the entangling rate at C=1C=1 is at most 0.12 σeff/d0.12\,\sigma_{\rm eff}/d times the single-body dephasing rate. The entanglement is therefore transient and, for well-separated branches, a fraction of order σeff/d\sigma_{\rm eff}/d of what unitary Newtonian gravity gives. Entanglement of the size unitary gravity predicts still excludes the model; the inference from any detected entanglement beyond a fixed multiple of σ\sigma does not hold.

Author comments: Revised presentation: the idea is stated first, a contents page is added, and the numerical values are collected in an appendix. Results and title are unchanged.

Primarily AI-generated textHuman understanding: all parts
Nov 12, 202619 pages
PDFView work

math.NT — Number Theory

Euler's 1747 conjecture on sums of integers with restricted prime factors

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

We prove that every positive integer congruent to 22 modulo 44 is a sum of two positive integers whose prime factors are all congruent to 11 modulo 44, with 11 admitted as a summand. Euler proposed this statement in a letter to Goldbach dated May 6, 1747. The proof counts representations by four squares and bounds those containing a common prime divisor congruent to 33 modulo 44 in either coordinate pair. An average over a nonsplit torus normalizer converts the quaternionic Hecke bound into an error independent of the sieving prime. Elementary estimates then give the explicit threshold 64464^4. An exact finite arithmetic certificate covers the remaining 4,194,3044{,}194{,}304 integers in the required residue class.

Primarily AI-generated textHuman understanding: some partsEuler conjectureHecke operatorsHurwitz quaternionsadditive number theorysums of squares
Nov 12, 20268 pages
PDFView work

math-ph — Mathematical Physics

Osterwalder–Schrader axioms for scalar QED3_3 in the Coulomb phase

Contributed by Mark Goldstein, Alfredo Guevara

King constructed the continuum, infinite-volume limit of three-dimensional scalar quantum electrodynamics, the U(1)U(1) (abelian) Higgs model, along Neumann–Dirichlet cubes. For his state at fixed photon mass we prove the Osterwalder–Schrader axioms: regularity E0′′\mathrm{E0}'' with absolute constants, invariance under the full Euclidean group, reflection positivity about every plane, symmetry, and the measure with its ergodic decomposition, on whose components the cluster axiom holds in all its forms. Rotation invariance is proved by comparing King's cubes with periodic tori carrying a smooth mass wall on two lattices whose orientations differ by arctan⁡(3/4)\arctan(3/4). With real scalar sources, the joint field of the curvature and the renormalised Wick square satisfies, on a tube of small Wick amplitudes, the axioms: regularity, invariance under translations and the lattice point group, Euclidean invariance of the joint field outside an exceptional set of couplings, reflection positivity for Wick amplitudes below a threshold, symmetry, and the measure with the cluster axiom in its weak form; above the threshold the Euclidean clause is open. The curvature results hold on King's whole coupling range; the Wick results hold under a one-sided sign clause of the Wick leg, which we prove on explicit coupling regions. The limit of vanishing photon mass is treated in a subsequent paper.

Author comments: Companion paper: Osterwalder–Schrader axioms for scalar QED$_3$ in the Higgs phase (hexagon:2611.00321). Project: https://github.com/marikgoldstein/scalar-qed-existence

Primarily AI-generated textHuman understanding: some parts
Nov 12, 2026291 pages
PDFView work

math.PR — Probability

Supersymmetric Analysis of a Random Band Matrix at Criticality, Volume I

Contributed by Patrick Lopatto

We study the N×NN \times N complex Hermitian Gaussian band matrix whose variance profile is the inverse of I−W2ΔI - W^2 \Delta, where Δ\Delta is the Neumann Laplacian on {1,…,N}\{1, \dots, N\}, in the critical regime W2≍NW^2 \asymp N. We prove that, for energies EE in a neighborhood of zero, the unfolded eigenvalue process converges to a stationary point process, whose law depends only on the limit XX of N/((4−E2)W2)N/((4 - E^2) W^2) and is given by the partition functions of a supersymmetric sigma model on an interval. We also determine the macroscopic law of the mass of an eigenvector selected near a given energy. Its density is the normalized exponential of a Brownian motion with drift, under the law tilted by its total mass; the same law describes the eigenvectors of the critical one-dimensional random Schrödinger operator. Further, we compute the limits of the two-energy correlations of the local densities of states at all pairs of interior sites, of the mean eigenvector profile at the scale of single sites, and of NN times the mean inverse participation ratio, which is 2+2X/32 + 2X/3. As X→0X \to 0 and X→∞X \to \infty, we recover the pair statistics of the GUE and of a Poisson process, and in the localized limit we obtain an explicit random shape for the eigenvectors. The number variance in a window of length LL grows like XL\sqrt{XL} as L→∞L \to \infty at every fixed XX, and we describe the crossover to Poisson statistics in windows of length of order XX. Several of these results confirm predictions that physicists obtained from the sigma model. The proof starts from the supersymmetric representation of averages of ratios of characteristic polynomials, which for this profile is a transfer operator on a one-dimensional chain. We show that the transfer chain converges to the heat semigroup of the sigma model, whose noncompact direction produces the Brownian motion in the eigenvector law.

Primarily AI-generated textHuman understanding: no parts
Nov 12, 2026179 pages
PDFView work

math.PR — Probability

Supersymmetric Analysis of a Random Band Matrix at Criticality, Volume II

Contributed by Patrick Lopatto

We study the N×NN \times N complex Hermitian Gaussian band matrix whose variance profile is the inverse of I−W2ΔI - W^2 \Delta, where Δ\Delta is the Neumann Laplacian on {1,…,N}\{1, \dots, N\}, in the critical regime W2≍NW^2 \asymp N. We prove that, for energies EE in a neighborhood of zero, the unfolded eigenvalue process converges to a stationary point process, whose law depends only on the limit XX of N/((4−E2)W2)N/((4 - E^2) W^2) and is given by the partition functions of a supersymmetric sigma model on an interval. We also determine the macroscopic law of the mass of an eigenvector selected near a given energy. Its density is the normalized exponential of a Brownian motion with drift, under the law tilted by its total mass; the same law describes the eigenvectors of the critical one-dimensional random Schrödinger operator. Further, we compute the limits of the two-energy correlations of the local densities of states at all pairs of interior sites, of the mean eigenvector profile at the scale of single sites, and of NN times the mean inverse participation ratio, which is 2+2X/32 + 2X/3. As X→0X \to 0 and X→∞X \to \infty, we recover the pair statistics of the GUE and of a Poisson process, and in the localized limit we obtain an explicit random shape for the eigenvectors. The number variance in a window of length LL grows like XL\sqrt{XL} as L→∞L \to \infty at every fixed XX, and we describe the crossover to Poisson statistics in windows of length of order XX. Several of these results confirm predictions that physicists obtained from the sigma model. The proof starts from the supersymmetric representation of averages of ratios of characteristic polynomials, which for this profile is a transfer operator on a one-dimensional chain. We show that the transfer chain converges to the heat semigroup of the sigma model, whose noncompact direction produces the Brownian motion in the eigenvector law.

Primarily AI-generated textHuman understanding: no parts
Nov 12, 2026422 pages
PDFView work

math.RT — Representation Theory

Lusztig's Fourier matrix conjecture for finite noncrystallographic Coxeter groups

Contributed by Qiyue Tang

We give a computer-assisted proof of Lusztig's Fourier matrix conjecture for all finite noncrystallographic Coxeter groups. For every two-sided cell, the normalized SS-matrix of the Drinfeld center of its asymptotic Hecke category, equipped with the inherited pivotal structure, equals the corresponding Fourier matrix in the modular convention. In particular, we establish the exact 74×7474\times74 matrix identity for the middle cell of type H4H_4.

Author comments: 37 pages. Supplementary computational data and verification materials are available at https://github.com/tqyqiqi1509/lusztig-fourier-conjecture 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: no parts
Nov 12, 202631 pages
PDFView work

math.NT — Number Theory

Divisors of Mersenne numbers under doubling

Contributed by Sunay Venkat

This paper studies a question of Erdős about how the total number of divisors of Mersenne numbers grows when the range is doubled. We prove that the doubling ratio is always at least 3, sharp, and nearly 4 whenever the relevant Fermat numbers are composite, as all known ones are. We also reduce the open question of whether the ratio tends to infinity to a statement about indices with few divisors. This leads to a new conjecture on the prime factors of Mersenne numbers next to near-Wagstaff numbers, which we study through implications, barrier results and a proven polynomial analogue.

Primarily AI-generated textHuman understanding: some parts
Nov 12, 202613 pages
PDFView work

math.NA — Numerical Analysis

A polynomial-time algorithm to compute Theta functions of Schottky groups

Contributed by Marc Masdeu

Abelian integrals, holomorphic differentials, period matrices and the Schottky--Klein prime function of a Riemann surface uniformized by a classical Schottky group are given by Poincar\'e theta series, which are sums over the elements of a free group. The algorithms that evaluate these series sum a truncated, possibly adaptively pruned, portion of the Cayley tree of the group, and the number of terms needed grows exponentially with the number of correct digits. We observe that the sum over all group elements starting with a fixed generator is a holomorphic function on the complement of a disc, and that these functions satisfy an exact linear functional equation coming from the self-similarity of the Cayley tree, given by a transfer operator built from the generators. Representing them by truncated Taylor expansions turns the evaluation of the series into a finite-dimensional linear problem, which we solve iteratively. The resulting algorithm computes the integrals Ωn\Omega_n, the period matrix and the prime function to PP bits of precision; for a fixed Schottky datum the number of arithmetic operations is cubic in PP and in the genus. We prove that it converges geometrically under a standard Schottky-type hypothesis on the group, which is closely related to the absolute convergence of the series. Along the way we give a complete proof of the cross-ratio formula for the period matrix, including a term that is missing from one version of it in the literature. We compare with the existing algorithms, and illustrate the method by reproducing a published value of the prime function and computing it to 3030 digits, and by computing period matrices of genus up to six to about 2525 digits.

Primarily AI-generated textHuman understanding: some partsKlein functionSchottky groupsalgorithms
Nov 12, 202624 pages
PDFView work

math.NT — Number Theory

Explicit Weak abc Inequalities and the Discrete Obstruction to Full abc in the DIC Framework

Contributed by Zeng Chunping

Independent audit and coefficient verification of C. Soulé's preprint "On the abc conjecture" (arXiv:2611.05217, 2026). This work neither proves nor disproves the abc conjecture; all No-Go statements are internal to the audited construction, and every statement that uses Soulé's Theorem A is explicitly tagged as conditional on it. We axiomatise the DIC framework and prove three stratified groups of results on Kodaira–Parshin arithmetic surface fibrations. (i) Unconditional geometric theorems: the adjunction identity Z⋅ωX/B=−Z2Z\cdot\omega_{\mathcal{X}/B}=-Z^{2}, the Riemann–Hurwitz intersection numbers, the invariants of the general (g0,r,b)(g_0,r,b) construction, and a Deligne–Riemann–Roch decomposition c=2b2+2b−112+(D0−T)/ω2c=\frac{2b^{2}+2b-1}{12}+(D_0-T)/\omega^{2} of the arithmetic coefficient. (ii) A meta-theorem: integrality of torsion lengths forces the coefficient of Theorem A onto the discrete set t=12/Nt=12/N, N≡1(mod3)N\equiv 1\pmod 3 (at the literature point (q,λ)=(5,3)(q,\lambda)=(5,3); for varying qq this is an arithmetic coincidence, not a structural barrier). A local hyperelliptic model gives T=8kT=8k, t=12t=12 as the unique transverse output; second-order torsion gives n1=n2n_1=n_2, hence Θ=T/k∈2Z\Theta=T/k\in 2\mathbb{Z}, leaving (Θ,q)=(12,27)(\Theta,q)=(12,27) as the sole lattice candidate. The unified criterion E=12(q−1)/(qNγ)E=12(q-1)/(qN\gamma) has the unique solution (N,Θ,q,γ)=(13,12,27,8/9)(N,\Theta,q,\gamma)=(13,12,27,8/9); the height is the canonical-bundle height of a fixed genus-22 curve (γ=2/5\gamma=2/5, confirmed by 12/γ=3012/\gamma=30 in Section 7.3.2 of the source), so (12,27)(12,27) requires genus 1313 and lies outside the theorem's hypotheses: the last cell is empty. (iii) Controlled weak abc: all unconditional bounds known for abc are of exponential type (log⁡c≪N1/3(log⁡N)3\log c\ll N^{1/3}(\log N)^{3}; Stewart–Yu); the exponent below is of polynomial type, and its existence is what Theorem A supplies. We derive η(q)=(q−1)/q\eta(q)=(q-1)/q, unify the exponent as E=tη/γE=t\eta/\gamma, and obtain Emax⁡=12q−1q⌈2q−2ℓ⌉E_{\max}=12\frac{q-1}{q}\lceil\frac{2q-2}{\ell}\rceil. A discriminant stratification sharpens this to c≤Aε(N/M5)24+εc\le A_{\varepsilon}(N/M_5)^{24+\varepsilon}; bootstrapping to exponent 11 is impossible (inf⁡θ=0\inf\theta=0); the discriminant-to-degree ratio is tower-monotone; 4/54/5 is an Artin conductor identity; and the isometry step (32) of the source contributes only O(d′)O(d'), derived unconditionally from a finite Čech complex, leaving 32=m⋅c\frac32=m\cdot c, 3636, 1212, 2424 and E(c)=12/(5−18c)E(c)=12/(5-18c) unchanged. A verbatim check of the source confirms twelve items, including the statement and scope of Theorem A; the constant 1212 decomposes as 13⋅mρ−mc\frac13\cdot\frac{m}{\rho-mc}, and Route 1 is closed. Appendices N–Z complete the audit: changing the type of external inequality yields a trichotomy; enlarging the prime set restores the bridge unconditionally but the resulting bound is vacuous, and a fixed finite SS is logically impossible by SS-unit finiteness; the five degrees of freedom are exhaustive, with the δp\delta_p/Λ\Lambda-ring loophole closed at the bridging layer; a complete self-contained proof of density-one abc is given; the Szpiro-side verbatim check (Theorem 3, Moret-Bailly 6.4, Robin constants, and the Section 7.2/Section 7.3 partition) repairs the zero-degree-class applications of Corollary 1; and the remaining geometric gap is resolved: ψ1\psi_1 is a Prym map, k=2jk=2^j, the 22-torsion ambiguity is completely classified, and translation invariance forces all Harder–Narasimhan slopes to coincide. Consequently Θ=12\Theta=12 is excluded unconditionally, with C≥36/7>3C\ge 36/7>3 and uf=3u_f=3 inside the construction; on the Szpiro side EE, CBMYC_{\mathrm{BMY}} and CSzpC_{\mathrm{Szp}} are three scalings of the same discrete lattice, and the only remaining room is a single discrete factor 77 at Θ=10\Theta=10. There are twelve independent No-Go reasons; after Appendices G–Z only two conditional items remain: Theorem A∗^* (unremovable) and the strict isometry in (32) (no coefficient consequences). No Diophantine conjecture enters the derivations. We neither prove nor disprove the abc conjecture; all conclusions are internal to the construction under its listed hypotheses.

A mix of human-written and AI-generated textHuman understanding: all partsArakelov geometryKodaira-Parshin fibrationabc conjecturediscrete obstructiontorsion sheaves and determinant cohomologyweak abc inequality
Nov 12, 2026111 pages
PDFView work

cs.LO — Logic in Computer Science

Expressiveness, Verifiability, Tractability: Toward a Computational Thermodynamics

Contributed by Benjamin Kaminsky

An investigation into the existence of a conservation law governing computational behaviour, in the form of the Expressiveness, Verifiability, Tractability (EVT) Hypothesis, is undertaken. The hypothesis is motivated by a simple observation: mechanisms that increase what a system can directly express, powerful control, effects, reflection, meta-programming, and self-interpretation, tend to undermine what can be verified uniformly and mechanically, while regimes that maximize static guarantees typically do so by restricting expressiveness or relocating effort into compilers, proof artifacts, or human interpretation. We analyze canonical failure modes that arise when one attempts to push beyond this frontier, distinguishing collapse of correctness, collapse of compilability, and collapse of comprehensibility. We then develop an order-theoretic model for comparing languages and verification disciplines and define an “E/V boundary” as a Pareto frontier in a partially ordered design space. Finally, we sketch how analogous tradeoffs appear in other computational domains, suggesting that “thermodynamic” boundary behaviour may be a recurring feature of expressive formalisms that demand strong global guarantees and within physical methods of information processing.

A mix of human-written and AI-generated textHuman understanding: all partsEVT hypothesiscomputationprogramming languagesresource theory
Nov 12, 202639 pages
PDFView work

math.DG — Differential Geometry

Gysin Sequences in Supergeometry

Contributed by Sebastian Denton

We study spectral sequences in supergeometry and construct the Gysin sequence within the supermanifold framework. First, the foundational definitions are established and utilized to develop differential forms and de Rham cohomology on supermanifolds. We then apply a standard de Rham-to-Cech cohomology isomorphism to assemble a spectral sequence that accounts for the ˇ Z2-graded nature of supermanifolds. Finally, we explore additional properties arising from this construction, leading directly into Gysin sequences.

Author comments: Comments and suggestions are welcome. Please direct any correspondence to the author.

Primarily human-written textHuman understanding: some partsSupergeometry
Nov 12, 20268 pages
PDFView work

math.CO — Combinatorics

The Cranston–Li–Su–Wang–Xu (2026) conjecture is true

Contributed by Dave Goel

Let A be a finite abelian group. A nowhere-zero A-flow of a graph can be changed along a cycle: going around the cycle, add a fixed non-zero element of A to the value of every edge that points forward and subtract it from the value of every edge that points backward. The Cranston–Li–Su–Wang–Xu (2026) conjecture on the reconfiguration of nowhere-zero flows states that if A has at least four elements, then in every graph in which all degrees are even, any two nowhere-zero A-flows are joined by a chain of such changes through nowhere-zero A-flows. It also states that, for every integer k ≥ 4, the same holds for integer flows whose values are between 1 and k − 1 in absolute value, where each change adds a non-zero integer. We prove this conjecture. The proof is by induction on the number of edges. If a flow enters a vertex along one edge and leaves it along another edge with the same value, the two edges can be replaced by a single edge; this gives a smaller graph. The main step is to change every flow into a flow with such a pair of edges. For A-flows we do this when all degrees are at most 4; repeatedly replacing a vertex of degree at least 6 by a triangle, following Cranston et al., reduces the general case to this one. For integer flows, we show that, in a graph in which all degrees are even, any two nowhere-zero flows with values in the cyclic group Z_k, k ≥ 4, are joined by changes that add only 1, −1, 2 or −2, and that such changes lift to integer flows. All theorems of this paper are also proved in the Lean 4 proof assistant.

Author comments: An expanded version of this paper is posted on Zenodo: https://doi.org/10.5281/zenodo.23605838

A mix of human-written and AI-generated textHuman understanding: some partsEulerian graphflow-connected graphgroup flownowhere-zero flowreconfiguration
Nov 12, 202615 pages
PDFView work

math.RT — Representation Theory

The Humphreys support conjecture

Contributed by Qiyue Tang

We prove the Humphreys support conjecture for connected reductive groups over algebraically closed fields of characteristic p>hp>h.

Author comments: 98 pages. Computational code and data are available at https://github.com/tqyqiqi1509/humphreys-support-conjecture 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: no parts
Nov 12, 202698 pages
PDFView work

math.AG — Algebraic Geometry

Bootstrapping GAGA Theorems

Contributed by Aniruddh Venkatesan

Let XX be a noetherian scheme with affine diagonal, and let λ:X→X\lambda : \mathcal{X} \to X be a morphism of locally ringed spaces from a qcqs locally strongly noetherian analytic adic space. We prove that an equivalence on coherent sheaves, together with comparison of their cohomology, extends to every proper XX-scheme. As an application, we obtain GAGA for proper schemes over the Fargues--Fontaine curve in equal and mixed characteristic.

Primarily human-written textHuman understanding: all parts
Nov 12, 202672 pages
PDFView work

math.NT — Number Theory

A unimodular continued fraction for cubic irrationals

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

We construct a single algorithm that assigns to every real number a recoverable sequence of positive integers which is eventually periodic exactly when the input is a cubic irrational. Its matrix digits are positive unimodular transformations on the two-dimensional simplex. Their products determine nested rational triangles whose diameters decrease by at least a factor of two at each step. An effectively specified partition combines Euclidean reduction with the dominant eigenvectors of cubic units. In both cubic signatures the matrix expansion eventually repeats a single matrix, whose Perron eigenvalue is a unit generating the input field.

Primarily AI-generated textHuman understanding: some partsHermite's problemcubic irrationalsmultidimensional continued fractionsunits
Nov 12, 20266 pages
PDFView work

math.NT — Number Theory

A congruence obstruction to Ibn al-Khawwām’s eleventh problem

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

We prove that there are no two rational squares whose sum is ten and such that adding its own square root to each gives another rational square. This is the existence question in Ibn al-Khawwām’s eleventh arithmetic problem. The proof uses only the residues of squares modulo three and a divisibility argument.

Primarily AI-generated textHuman understanding: some partsDiophantine equationsIbn al-Khawwamcongruencesrational squares
Nov 12, 20262 pages
PDFView work

math.CO — Combinatorics

Optimal Packing of Eleven Unit Squares: The Formalized Voronoi-Cell Proof

Contributed by Manasseh Ahmed

We explain the computer-assisted proof that eleven independently rotated unit squares require a square container of side at least T = 3.8770835900228141773 . . ., the side attained by the known construction attributed to Walter Trump. The proof reduces arbitrary packings to 2,184 patterns of occupied closed Voronoi cells. Exact geometric certificates exclude 2,180 patterns, a square-symmetry argument reduces the remaining four to one, and a complete subdivision of that case places every possible smaller packing inside an explicitly certified isolation neighborhood. We give the geometric definitions, prove the continuous soundness rules underlying the finite calculations, and explain the common-cone local isolation argument used in the Lean development. The large certificate instances are identified by pinned source references; they are not replaced by numerical experiments. The reported formal verification uses Lean’s kernel together with its native compiler for specified numerical certificates.

Primarily AI-generated textHuman understanding: some parts
Nov 12, 202628 pages
PDFView work

math.CO — Combinatorics

The independence number of the generalized Johnson graph J(13,5,3)J(13,5,3)

Contributed by Mustafa Stanikzai

Let J(13,5,3)J(13,5,3) be the graph on the 5-element subsets of a 13-element set, two subsets being adjacent when they share exactly 3 elements. We prove that α(J(13,5,3))=33\alpha(J(13,5,3)) = 33. The graph is an explicit unit-distance graph in R12\mathbb{R}^{12}, so χ(R12)≥⌈1287/33⌉=39\chi(\mathbb{R}^{12}) \ge \lceil 1287/33 \rceil = 39; earlier bounds from explicit finite graphs give at most 38. A recent preprint of Davies gives much larger bounds, none from an explicit finite graph. An explicit independent set gives α≥33\alpha \ge 33. For the upper bound, a symmetry reduction splits the problem into 200 clique subproblems, and a certifying solver refutes each one with a proof log that the checker VeriPB accepts. An uncertified computation reproduces the value α(J(13,6,4))=46\alpha(J(13,6,4)) = 46 reported by Exoo and Ismailescu, which gives χ(R12)≥38\chi(\mathbb{R}^{12}) \ge 38.

Author comments: 16 pages. Programs, certificates and proof logs: https://doi.org/10.5281/zenodo.24145863 Changes from version 1: 28 cross-references to lemmas, propositions, claims, definitions and corollaries were printed with the word "Theorem" (for example "Theorem 2.4" for Lemma 2.4). They now carry the correct names. The reference numbers were already correct. Statements, proofs, results and bibliography are unchanged.

A mix of human-written and AI-generated textHuman understanding: all partschromatic number of Euclidean spacegeneralized Johnson graphindependence numbermaximum cliqueproof loggingunit-distance graph
Nov 12, 202616 pages
PDFView work

math.NT — Number Theory

A Fibonacci Analogue of the Fifteen Theorem

Contributed by Scott Kominers

We prove that a positive-definite quadratic form with integral Gram matrix represents every Fibonacci number if and only if it represents the first forty-two of them. The unique minimal criterion set consists of ten Fibonacci numbers, the largest of which is F42=267914296F_{42}=267914296.

A mix of human-written and AI-generated textHuman understanding: all partsFibonacci numberscongruence coversescalation methodquadratic formsternary quadratic formsuniversal formsuniversality criteria
Nov 12, 202637 pages
PDFView work

math.GR — Group Theory

Finite-length permutation modules for\\free-amalgamation structures of arbitrary arity

Contributed by Dr. András Pongrácz

Let $\A$ be the countable homogeneous limit of a free-amalgamation class in a finite relational language, expanded by a generic linear order. We prove that its tuple permutation modules have finite composition length over every field, also after naming finitely many points. More precisely, each orbit of increasing dd-tuples disjoint from the named points has a permutation module of length 2d2^d. This extends the theorem of Yang--Boja\'nczyk--Klin from unary and binary relations to relations of arbitrary arity. The main step shows that every finitely supported array whose sums over each single coordinate vanish is a linear combination of alternating sums obtained by independently doubling its coordinates. Its proof combines a Ramsey separation theorem with a construction that moves finite configurations into prescribed order intervals. Over a finite field, we also obtain finitely many closed invariant linear subspaces of $\F^{A^k}$; each is generated, in the product topology, by functions definable using at most kk additional parameters.

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

math.CO — Combinatorics

The Maximum of per⁡(I−A)\operatorname{per}(I-A) in Odd Order

Contributed by Yair Lavi

Let ΩnΩ_n denote the set of n×nn\times n doubly stochastic matrices. Kim and Roush conjectured in 1981 that, for n=2k+1>1n=2k+1>1, max⁡A∈Ω2k+1per⁡(I−A)=3⋅2k−2 \max_{A\inΩ_{2k+1}}\operatorname{per}(I-A)=3\cdot 2^{k-2}. They proposed the block construction A⋆=12(J3−I3)⊕P2⊕(k−1)A_\star=\frac12(J_3-I_3)\oplus P_2^{\oplus(k-1)}, where P2=(0110)P_2=\begin{pmatrix}0&1\\1&0\end{pmatrix}. Here J3J_3 is the 3×33\times3 all-ones matrix. They did not claim uniqueness. We fully prove their conjecture and classify equality: the maximizers are exactly the simultaneous-permutation conjugates of A⋆A_\star.

A mix of human-written and AI-generated textHuman understanding: all partsDoubly stochastic matrixFunctional digraphpermanent
Nov 12, 202611 pages
PDFView work

math.CO — Combinatorics

A counterexample to the Foregger-Sinkhorn tie-point conjecture

Contributed by Yair Lavi

The Foregger-Sinkhorn tie-point conjecture asserts that if a nearly decomposable doubly stochastic matrix minimizes the permanent on a face and the permanental cofactor at a prescribed zero is larger than its permanent, then that zero is a tie point. We give a counterexample in dimension eight.

A mix of human-written and AI-generated textHuman understanding: all partsDoubly stochastic matrixNearly decomposable matrixcounterexamplepermanent
Nov 12, 202610 pages
PDFView work

math.CO — Combinatorics

The Maximum Permanent of a Stochastic Matrix of Bounded Rank

Contributed by Yair Lavi

Let AA be a stochastic n×nn\times n matrix with rank⁡A≤k\operatorname{rank}A\leq k, where 1≤k≤n1\leq k\leq n. Write n=qk+sn=qk+s, where 0≤s<k0\leq s<k. The author conjectured in 2018 that per⁡A≤(q!/qq)k−s((q+1)!/(q+1)q+1)s\operatorname{per}A\leq (q!/q^q)^{k-s}((q+1)!/(q+1)^{q+1})^s, with equality if and only if A=P(Jq⊕(k−s)⊕Jq+1⊕s)QA=P(J_q^{\oplus(k-s)}\oplus J_{q+1}^{\oplus s})Q, where P,QP,Q are permutation matrices and JtJ_t is the t×tt\times t matrix with every entry 1/t1/t. We prove this conjecture in full.

A mix of human-written and AI-generated textHuman understanding: all partsBounded rankStochastic matrixpermanent
Nov 12, 202614 pages
PDFView work

math.CO — Combinatorics

The Marcus-Minc Transform Inequality

Contributed by Yair Lavi

We prove the Marcus-Minc conjecture: let n be any integer at least 2, and let A be a nonnegative n by n matrix whose row and column sums are all one. Form a new matrix by subtracting A from the n by n matrix of ones and dividing by n minus one. Then the permanent of A is at least the permanent of the new matrix. We also determine all equality cases.

A mix of human-written and AI-generated textHuman understanding: all partsDoubly stochastic matrixMarcus-MincMatrix inequalitypermanent
Nov 12, 202611 pages
PDFView work

math.NT — Number Theory

Cross-Energy of Dirichlet Partial Sums. Part 38: The energy of the Chebyshev race: an explicit unconditional floor for the prime race between the lanes 6k±16k\pm1

Contributed by Pedro Caceres

Let R(x)=π(x;3,2)−π(x;3,1)R(x)=\pi(x;3,2)-\pi(x;3,1) be the Chebyshev race between the two prime lanes 6k∓16k\mp1 (the prime 22 counted, by the congruence 2≡−12\equiv-1 mod 33, in the 6k−16k-1 lane). We study the race as an \emph{energy} and establish three things (the energy law uses two estimates imported from the ζ\zeta case; see Proposition~\ref{prop:cramer}). First, an elementary ledger identity: the entire bias of the race is the bookkeeping of prime squares, which all land in the lane 6k+16k+1; subtracting the ledger 12π(x)\tfrac12\pi(\sqrt x) turns a walk with \emph{zero} sign changes up to 10810^8 into one with 15,32915{,}329 (21,32921{,}329 if every passage between D>0D>0 and D≤0D\le0 at a prime is counted). Second, the mean energy of the normalized race signal e(u)=e−u/2ψ(eu,χ3)e(u)=e^{-u/2}\psi(e^u,\chi_3) admits an explicit unconditional lower bound for its upper limit, which we call the floor, \[ \limsup_{U\to\infty}\frac1U\int_0^U e(u)^2\,du\;\ge\;\kappa_3 :=\sum_{\rho}\frac{1}{\rho(1-\rho)} =\log\frac3\pi-\gamma_E+2\,\frac{L'}{L}(1,\chi_3) =0.113229969857\ldots, \] the sum running over the nontrivial zeros of L(s,χ3)L(s,\chi_3) with multiplicity, and the limit exists and attains the floor if and only if the Riemann hypothesis holds for L(s,χ3)L(s,\chi_3) with all zeros simple. The constant is known: under GRH it is the variance of the limiting distribution of Rubinstein and Sarnak for (log⁡x/x)R(x)(\log x/\sqrt x)R(x) (four times smaller than in their normalization E(x;3,2)−E(x;3,1)E(x;3,2)-E(x;3,1)), and its closed form is that of Fiorilli and Martin (there under GRH); it is also the variance VχV_\chi of Part~37, on the 6k±16k\pm1 race, where the prime-square mechanism of the bias is identified; what is added here is the unconditional floor with its equality case and exponential-growth law, the ledger correction of the counting race, and the exact measurement. The constant κ3\kappa_3 is the exact analogue, for the prime race, of the B\'aez-Duarte constant 2+γE−log⁡4π2+\gamma_E-\log4\pi of the Nyman--Beurling criterion. Third, we measure: from all prime powers up to 10810^8, by exact piecewise integration, the cumulative mean energy is 0.12010.1201 at x=108x=10^8 and lies 44 to 12%12\% above κ3\kappa_3 for 104≤x≤10810^4\le x\le10^8. This is consistent with the theorem and does not test it: the floor is a statement about an upper limit, obtained from the dichotomy between GRH and its failure, and means over single decades fall below κ3\kappa_3 (0.1020.102 on [104,105][10^4,10^5], 0.1130.113 on [107,108][10^7,10^8]). The second-order term is (mean−κ3)⋅U≈0.11(\text{mean}-\kappa_3)\cdot U\approx0.11 (between 0.090.09 and 0.130.13), the race analogue of the second-order constant K=2.5124797…K=2.5124797\ldots of the prime energy. The proofs of the energy law transplant the C2C_2 energy law for ζ\zeta to L(s,χ3)L(s,\chi_3), where the absence of a pole simplifies every step.

Author comments: Revised 10 Nov 2026 after external examination (see CHANGES_v2.md). 12 pages, 1 figures. Ancillary scripts in ancillary/ reproduce the computations. Part 38 of the book-series Cross-Energy of Dirichlet Partial Sums (47 parts, Parts 0-46); formerly the standalone note 'The energy of the Chebyshev race' (revised 1 Nov 2026). 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 partsChebyshev's biasDirichlet L-function of conductor 3Generalized Riemann Hypothesisenergyprime race
Nov 12, 202612 pages
PDFView work

math.NT — Number Theory

Cross-Energy of Dirichlet Partial Sums. Part 37: The 6k±16k\pm1 race: sieve structure, Chebyshev's bias and a GRH-equivalent inequality

Contributed by Pedro Caceres

Every prime p>3p>3 is 6k+16k+1 or 6k−16k-1. We collect what can be proved about the two resulting sequences and add three results. The races are those modulo 33 (the prime 22 counts for the class 22); the race modulo 66 differs by that one prime. (i) In the weighting n−1/2log⁡(N/n)n^{-1/2}\log(N/n) of the Ces\`aro margin, the race between the prime powers ≡2\equiv2 and ≡1(mod3)\equiv1\pmod3 is an exact identity. The 6k−16k-1 side leads by 2L′L(12,χ−3)log⁡N−12ψ′(34)=1.1320log⁡N−1.27092\frac{L'}L(\frac12,\chi_{-3})\log N-\frac12\psi'(\frac34)=1.1320\log N-1.2709 plus the margin Mχ(N)M_\chi(N) of L(s,χ−3)L(s,\chi_{-3}). The generalized Riemann hypothesis (GRH) for L(s,χ−3)L(s,\chi_{-3}) is equivalent to Mχ≥0M_\chi\ge0 for all large NN, and under GRH the weighted race is never lost after N=2N=2. This is a criterion of the type of Hardy--Littlewood and Landau (1918) for Chebyshev's assertion, here with the Ces\`aro weight and with explicit constants. (ii) We verify 0.1024≤Mχ(N)≤0.35490.1024\le M_\chi(N)\le0.3549 for 2≤N≤2272\le N\le2^{27}, inside the window [0,0.4536][0,0.4536] that GRH predicts. We also check the formula against the first 271271 zeros of L(s,χ−3)L(s,\chi_{-3}). (iii) For the unweighted race, the bias is 1/Vχ=2.971/\sqrt{V_\chi}=2.97 standard deviations, with Vχ=∑ρ1ρ(1−ρ)=0.113230V_\chi=\sum_\rho\frac1{\rho(1-\rho)}=0.113230 (equal to ∑ρ∣ρ∣−2\sum_\rho|\rho|^{-2} under GRH); under GRH and linear independence, a recomputation with 271271 zeros gives the density 0.999060.99906, in agreement with the 0.99900.9990 of Rubinstein and Sarnak. Along the way we prove the sieve characterization of 6k±16k\pm1 and of twin primes, explain why Legendre-type counting cannot give the error term, compare twin primes and Goldbach representations modulo 66 with the Hardy--Littlewood predictions, and prove the formula for gcd⁡p(p2n−1)\gcd_p(p^{2n}-1) (the sequence 24,240,504,480,…24,240,504,480,\dots). Version~2 adds the generating function 12[ζ6(s)2±L(s,χ6)2]\frac12[\zeta_6(s)^2\pm L(s,\chi_6)^2] of the three forms 6xy±x±y6xy\pm x\pm y, and a duality theorem: averaged over the zeros of ζ\zeta, the cross-energy C2(N,12,γ)\mathcal C_2(N,\frac12,\gamma) of Part~1 returns log⁡N/N\log N/N; averaged over the zeros of L(s,χ−3)L(s,\chi_{-3}) it returns 1N∑d∣Nχ−3(d)Λ(d)\frac1N\sum_{d\mid N}\chi_{-3}(d)\Lambda(d); and M\"obius inversion separates the primes of the two lanes. Version~3 makes this exact at finite height and without RH: with a Gaussian weight on the zeros, the cross-energy satisfies an explicit formula whose pole term is C2\mathcal C_2 itself at s=0s=0, whose prime term is log⁡N\log N exactly plus a nonnegative remainder from the near coincidences nj≈Nnj\approx N, and which returns every prime power up to 6060 from the 15171517 zeros below 20002000. Nothing here proves RH, GRH, or the twin prime or Goldbach conjectures.

Author comments: Revised 10 Nov 2026 after external examination (see CHANGES_v2.md). 25 pages, 11 figures; version 3 (2 November 2026) adds Section 11.3, an exact explicit formula for the cross-energy at finite height (unconditional), with a term-by-term explanation of how C_2 hears the primes through the zeros; version 2 added Section 11, the cross-energy as a two-way detector. Ancillary scripts in ancillary/ reproduce the computations. Part 37 of the book-series Cross-Energy of Dirichlet Partial Sums (47 parts, Parts 0-46); formerly the standalone note 'The 6k±1 race'. Renumbered 2 Nov 2026; version 2 adds Section 11. 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 partsCesàro marginChebyshev's biasDirichlet L-function of conductor 3primes 6k±1sieve
Nov 12, 202625 pages
PDFView work

math.NT — Number Theory

Cross-Energy of Dirichlet Partial Sums. Part 16: How many positive directions does the Archimedean place have? A counting law with a boundary phase

Contributed by Pedro Caceres

Restrict the archimedean part of Weil's quadratic form, for ζ\zeta or for a primitive real Dirichlet LL-function of conductor qq and parity κ\kappa, to test functions supported in an interval of length aa, and let n+(a)n_+(a) be the number of its positive directions, the directions that the pole and the primes must absorb. A Szeg\H{o}-type argument gives n+(a)=t0a/π+o(a)n_+(a)=t_0a/\pi+o(a), where t0t_0 is the zero of ϑ′\vartheta'. We observe that the form is Λ−ψκ(−Δ)\Lambda-\psi_\kappa(-\Delta) with ψκ\psi_\kappa a complete Bernstein function (proved) and, using the boundary phase of Kaleta, Kwa\'snicki and Ma{\l}ecki, we state, as a conjecture, the asymptotic law \[ n_+(a)=\Big\lfloor\frac{t_0a}\pi+\frac{2\varpi_\kappa(t_0)}\pi\Big\rfloor , \] with an explicit phase ϖκ\varpi_\kappa that depends only on the parity, the conductor entering only through t0t_0. We test it in seven cases, ζ\zeta and χ−3,χ−4,χ5,χ−7,χ8,χ−8\chi_{-3},\chi_{-4},\chi_5,\chi_{-7},\chi_8,\chi_{-8}. On the finest mesh the shifts of the jumps m=2,…,12m=2,\dots,12 bracket the prediction 2ϖκ(t0)/π2\varpi_\kappa(t_0)/\pi, which ranges from 0.180.18 to 0.590.59, to within 11 to 3⋅10−33\cdot10^{-3} for the characters and 3⋅10−23\cdot10^{-2} for ζ\zeta. A second, independent implementation extrapolates in the mesh on three to nine jumps per case; the extrapolated shifts lie above the prediction by 0.20.2 to 2.3⋅10−42.3\cdot10^{-4} in every case, a one-sided offset of the size of the extrapolation error, which we have checked to be a bias in one case only. The first jump is an exception, and for ζ\zeta the shift reaches its limit only after about ten jumps. A smoothed count removes the integer part and leaves ``degree plus constant'' with the boundary phase as constant; on a circle the constant is carried by the end points and cancels between an arc and its complement; and treating −log⁡q-\log q as a degree, q↔1/qq\leftrightarrow1/q acts on the band edge as t0↦4π2/t0t_0\mapsto4\pi^2/t_0 to leading order, with ζ\zeta at the self-dual point t0≈2πt_0\approx2\pi. We record what the law implies for the signature of Weil's form and where it stands with respect to the Riemann--Roch formulas for Spec⁡Z‾\overline{\operatorname{Spec}\mathbb Z}. The law is a conjecture supported by these computations. The Bernstein structure is proved here; the first-order count is quoted from Part~14 and its proof is not repeated.

Author comments: Revised 10 Nov 2026 after external examination (see CHANGES_v2.md). 9 pages, 1 figure; Part 16 of the 47-part book-series Cross-Energy of Dirichlet Partial Sums (Parts 0-46), block III (The margin and the constant B-hat); formerly a standalone note (v1.0). Part 0 is the guide.

A mix of human-written and AI-generated textHuman understanding: all partsDirichletRiemann--Siegel theta functionWeil's quadratic formarchimedean place
Nov 12, 20269 pages
PDFView work

math.NT — Number Theory

Cross-Energy of Dirichlet Partial Sums. Part 10: The Caceres Prime Function. A square-root damped prime weight, its exact Prime Zeta structure, and a dual spectrum of the Riemann zeros

Contributed by Pedro Caceres

\sloppy We study the \emph{Caceres Prime Function} \[ \C(s)=\sum_{n\ge 2}\frac{a(n)}{n^{s}},\qquad a(n)=\sum_{p^k\,\|\,n}\frac{\log p}{\sqrt{p^{k}}}, \] the Dirichlet series of the additive function that weights each prime factor pp of nn by log⁡p\log p divided by the square root of the exact power of pp dividing nn. \emph{Structure.} We prove that $\C=\zeta\K$, where the \emph{prime kernel}, $\K(s)=\sum_p\log p\,(1-p^{-s})/(p^{s+1/2}-1)$, is an exact telescoping series of shifted derivatives of the Prime Zeta function. So $\K$ is meromorphic in ℜs>−14\Re s>-\frac14, and the line ℜs=−14\Re s=-\frac14 is a natural boundary. Every zero 12+iγ\frac12+i\gamma of ζ\zeta produces two singular points of $\K$, at iγi\gamma and iγ/2i\gamma/2, which are poles unless 2γ2\gamma is again an ordinate with twice the multiplicity (respectively γ/2\gamma/2 an ordinate with half the multiplicity, for iγ/2i\gamma/2); the exponent 12\frac12 is the normalization that puts both families on the imaginary axis. More precisely, $\K(s)=-\frac{\zeta'}\zeta(s+\frac12)+\frac{\zeta'}\zeta(2s+\frac12)-\frac1{12s}+H(s)$, with HH holomorphic in a neighbourhood of ℜs≥0\Re s\ge0. \emph{RH criteria.} RH is equivalent to the holomorphy of $\K(s)-\frac1{s-1/2}+\frac1{2(s-1/4)}$ in ℜs>0\Re s>0. It is also equivalent to a bound O(xε)O(x^\varepsilon), or even a one-sided bound, for the remainder RbR_b of the kernel's partial sums. Both are exact reformulations of RH, not proofs. \emph{Mean value and explicit formula.} Unconditionally, $\sum_{n\le x}a(n)=\K(1)x+2\zeta(\frac12)\sqrt x+O(\sqrt x\,e^{-c_\ast\sqrt{\log x}})$, with the explicit bound 5.51x5.51\sqrt x for the error after the first term when x≥106x\ge10^6. Under RH, the Riesz mean of aa has an explicit formula in which every zero contributes the pure phases xiγx^{i\gamma} and xiγ/2x^{i\gamma/2} at constant amplitude. \emph{The Ces\`aro margin.} The kernel is Suzuki's one-variable margin MM seen at two scales. Unconditionally, Rb(x)=α(x)−α(x)+o(1)R_b(x)=\alpha(x)-\alpha(\sqrt x)+o(1), where α\alpha is the slope of the margin. Under RH, the kernel's Riesz margin is M(N)−2M(N)M(N)-2M(\sqrt N). Its fluctuation has energy 2(log⁡ξ)′′(12)2(\log\xi)''(\frac12), reduced by 2γ−22\gamma^{-2} for every pair of ordinates with γ′=2γ\gamma'=2\gamma; the near pair γ14≈2γ4\gamma_{14}\approx2\gamma_4 is visible in the data. \emph{Zeros of $\C$.} A computer-assisted proof shows that $\C$ has a zero near 1.379+8.639 i1.379+8.639\,i, in the half-plane of absolute convergence, and Bohr's theory gives ≫T\gg T such zeros up to height TT. So $\C$ is not an LL-function. The theorems are proved here, except that Section~\ref{sec:margin} uses the formula for the margin and the almost periodicity of the slope from Part~11. Uncertified computations are labelled as numerical observations.

Author comments: Revised 10 Nov 2026 after external examination (see CHANGES_v2.md). 26 pages, 7 figures. Part 10 of a series of forty-seven on the cross-energy of Dirichlet partial sums (book edition of 2 November 2026, block II: Primes and Euler products; Part 0 is the guide, Part 1 the plan). Formerly a standalone note ("The Caceres Prime Function", October 2026); in the book it builds on Part 9 (the prime zeta function), Part 1 (the C-transform) and Part 11 (the Cesaro margin), and is used by Parts 11 and 37. All theorems are proved; uncertified computations are labelled as numerical observations. The ancillary archive (core.py, explicit.py, zeros.py, step*, rigor_meanvalue.py, rigor_rouche.py, ctransform.py, laplace.py, bridge_M*.py, variogram.py, slope_b.py) is the one of the standalone note, Caceres_Prime_Function_ancillary.zip.

A mix of human-written and AI-generated textHuman understanding: all partsRiemann hypothesis; Cesaro; Mobius; Landau; Nyman; Dirichlet; Weil; Davenport
Nov 12, 202626 pages
PDFView work