Browse

All works

Browse the Hexagon catalog.

Newest works

1229 works

math-ph — Mathematical Physics

Algebra-Valued Yang-Mills-Type Theories: Polynomial Obstructions and Holonomy Reductions

Contributed by Yuri Ximenes Lecca, Willian Goulart Gomes Velasco

We study algebra-valued Yang-Mills-type (AA-YMT) theories over a smooth nn-manifold MM, where connections take values in a general (not necessarily associative, commutative, or Lie) m\mathfrak{m}-graded algebra (A,∗)(A, *) and descend to an associated algebra bundle EA=P×ρA→ME_A = P \times_\rho A \to M over a principal GG-bundle π:P→M\pi : P \to M. We first derive the variational field equations, infinitesimal gauge transformations, and generalized Bianchi identities, showing that affine Ehresmann compatibility forces the vertical image of g\mathfrak{g} into the Lie nucleus NLie(A)\mathcal{N}_{\mathrm{Lie}}(A) of the commutator [x,y]∗=x∗y−y∗x[x,y]_* = x*y - y*x, and proving that non-linear gauge covariance and the differential Bianchi identity are obstructed precisely by the Jacobiator Jac[⋅,⋅]∗\mathrm{Jac}_{[\cdot,\cdot]_*} (leaving principal GG-gauge transformations universally anomaly-free). We then establish polynomial and geometric obstructions in three settings. First, we prove a vanishing theorem for internal-product Chern-Weil and self-dual AA-YMT functionals in weak (2,s)(2,s)-solvable algebras, invariant under (Q,S)(Q,S)-splitting extensions. Second, in reductive Cartan-Yang-Mills theories valued in A=Rk⊕hA = \mathbb{R}^k \oplus \mathfrak{h}, we compare quartic-block against recursive binary-tree parenthesization, proving a strict dimensional cutoff at n≥8n \ge 8 for quartic blocks and an exact Jacobsthal-number cutoff (n−4∉⋃r≥3{2Jr,Jr+1}n - 4 \notin \bigcup_{r \ge 3}\{2 J_r, J_{r+1}\}, plus coframe-rank vanishing for n≥k+5n \ge k + 5) for binary trees. We also catalog the admissible Berger holonomy reductions for 4≤n≤74 \le n \le 7, establishing an on-shell vanishing (torsion-free) versus off-shell survival (torsionful) dichotomy both in 4D for U(2)U(2) and SU(2)SU(2) connections---via e⋏⋊(e⋏⋊Ωω)=12(e⋏⋊e)⋏⋊Ωωe \curlywedge_\rtimes (e \curlywedge_\rtimes \Omega_\omega) = \frac{1}{2}(e \curlywedge_\rtimes e) \curlywedge_\rtimes \Omega_\omega and the first Bianchi identity---and in 7D for G2G_2-connections. Third, we prove an associator-quotient collapse and Jacobiator vertex-dichotomy theorem for odd-dimensional internal AA-Chern-Simons theories, with applications to AA-BFBF theories, octonionic and reductive Yang-Mills-Higgs Proca mass spectra, and reductive dualities.

Primarily human-written textHuman understanding: all parts$(k,s)$-solvable graded algebrasAlgebra-valued differential formsAssociated algebra bundlesBerger holonomy reductionsChern-Simons and Yang-Mills-Higgs theoriesJacobiator and associator anomaliesYang-Mills-type functionals
Nov 13, 202630 pages
PDFView work

math.RT — Representation Theory

Class-two Lie algebras and quadratic-dual current constructions

Contributed by Ammar Husain

For a reductive Lie algebra $\s$, a finite-dimensional $\s$-module RR and an $\s$-submodule K⊆⋀2RK\subseteq\bigwedge^2R, the class-two radical R⊕(⋀2R/K)R\oplus(\bigwedge^2R/K) carries an $\s$-action. For semisimple $\s$ the semidirect products $\s\ltimes(R\oplus(\bigwedge^2R/K))$ are, up to isomorphism, all Lie algebras whose radical has class at most two. We study the isomorphisms that fix the acting algebra pointwise, including their central mixing and shear terms. On the locus where central mixing vanishes, the resulting groupoid admits a description by invariant Grassmannians and equivariant linear groups. We express the wild matrix-pair construction as a functor into class-two Lie algebras and give its equivariant square in $\s$-modules. We work out single-isotypic slices, signed multiplicity-free tensor squares, and explicit low-dimensional multiplicity-space examples. The acting algebra may be zero and its central action need not be semisimple. Finally, we study pairs of Lie brackets on one object whose mixed composites vanish. Tensoring them with algebras carrying two independent commutative associative products, for instance pointwise multiplication and convolution exchanged by Fourier transform, produces further Lie algebras. For these pairs, in representations of $\s$, we define the groupoid of objects that are isomorphic to their bracket exchange σX\sigma X; we give the structure of the switches X→σXX\to\sigma X, the obstruction to an involutive switch, and its indecomposable objects in small dimension for semisimple $\s$.

Author comments: The choices of structures are on the author. So them being maximally unhelpful is due to them. The structures can be too weak or too strong to be of any use and that is retained as the author's responsibility.

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

math.NT — Number Theory

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

Contributed by Elleard Felix Webster Heffern

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

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

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

math.NT — Number Theory

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

Contributed by Pedro Caceres

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

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

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

math.AG — Algebraic Geometry

The Shapiro–Shapiro conjecture for ordered positive flags

Contributed by Qiyue Tang

We prove the Shapiro–Shapiro conjecture for ordered totally positive flags in Grassmannians.

Author comments: 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 13, 202615 pages
PDFView work

math.RT — Representation Theory

A proof of the scheme-theoretic Humphreys conjectures

Contributed by Qiyue Tang

We prove the relative and traditional scheme-theoretic Humphreys conjectures for connected reductive groups over algebraically closed fields of positive characteristic exceeding the Coxeter number of every simple factor. We also prove that the self-extension support scheme of every finite-dimensional tilting module is reduced.

Author comments: 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 13, 202623 pages
PDFView work

math.PR — Probability

The Wasserstein cost of the Girsanov Theorem

Contributed by Simon Coste

This is an expository note on the asymptotics of the Wasserstein distance between the empirical measure of infinite-dimensional random paths and their common distribution. We present the classical proof for these asymptotics in the case of the Wiener measure, unifying quantization arguments from Dereich and coauthors or Boissard and Le Gouic, and we adapt it for It\^o diffusions sampled through the Girsanov theorem. More precisely, let Q\mathbb{Q} be the law of the solution of a stochastic differential equation with a bounded Lipschitz drift. Let W1,…,WnW_1,\ldots,W_n be independent Brownian paths, and let ZiZ_i be their Girsanov weights for Q\mathbb{Q}. The reweighted empirical measure $$\widehat\mu_n=\frac{\sum_{i=1}^n Z_i\delta_{W_i}}{\sum_{i=1}^n Z_i}$$ approximates Q\mathbb{Q} when nn is large. We prove that the Wasserstein cost Wpp(μ^n,Q)W_p^p(\widehat\mu_n,\mathbb{Q}) is of order (log⁡n)−p/2(\log n)^{-p/2}, in expectation and almost surely, for every fixed p⩾1p\geqslant1. In the Brownian case where Zi=1Z_i=1 these results show that log⁡nWp(μ^n,Q)\sqrt{\log n}W_p(\widehat\mu_n,\mathbb{Q}) is asymptotically sandwiched between 2λd\sqrt{2\lambda_d} and 42λd4\sqrt{2\lambda_d}, where λd\lambda_d is the first eigenvalue of the Laplacian operator in the unit ball. We provide numerical experiments to estimate the (conjectured) limiting constant in dimension d=1d=1.

Author comments: 16 pages. Full Lean formalization publicly available at gitlab.com/SimonCoste/wasserstein

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

math.RT — Representation Theory

Domino insertion and cells in type B

Contributed by Qiyue Tang

We prove Conjectures A, A+^{+}, and B of Bonnafé, Geck, Iancu, and Lam on Kazhdan–Lusztig cells in type BB.

Author comments: 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, 202614 pages
PDFView work

math.PR — Probability

Causal prediction of rare recovery responses and the optimal scale of observation time

Contributed by Man Huang

We determine the information and physical waiting needed to predict a rare intervention response with error smaller than its occurrence probability in a one-dimensional growth process with renewed Poisson interval catastrophes. Deletions of initial sources in macroscopic intervals define a mixed response, with all intervention arms sharing the same stationary past and future forcing. A fixed number of growing submacroscopic gaps determines its rare-event probability scale. We identify the response probability and amplitude, characterize when terminal extinction bits lose predictive information, and construct a gate that recovers this information from the recovery trajectory. For absolute and squared loss, a deterministic-age Bayes-risk expansion holds uniformly with additive error smaller than the rare-event probability. Our main waiting theorem covers every honest causal stopping rule, allowing the complete realized catastrophe history. Its average-time benchmark is the sum of each ordered gap length weighted by the extinction probabilities of preceding gaps. Prediction error smaller than the rare-event probability requires mean waiting divided by this benchmark to diverge; every prescribed diverging multiplier is achievable using actual recovery records. With gap scales n2/5n^{2/5} and n4/5n^{4/5} and integrated catastrophe tail Ax∼C/xA_x\sim C/x, deterministic observation requires age larger than the n4/5n^{4/5} scale, whereas a stopping rule achieves mean waiting O(n2/5log⁡n)O(n^{2/5}\log n). The proofs preserve the rare-event scale through weighted response approximation, risk transfer over arbitrary information fields, and posterior lower bounds on rare history branches.

Author comments: Complete English manuscript with Technical Supplement Appendices A–E. Full English–Chinese edition, sources and original MIT-licensed diagnostic code: https://doi.org/10.5281/zenodo.24138927. Mathematical content version 2026-11-11.2. Companion preprints: https://doi.org/10.5281/zenodo.23911961 and https://doi.org/10.5281/zenodo.23912425.

Primarily AI-generated textHuman understanding: some partscausal predictioninteracting particle systemsrare eventssequential observationspatial catastrophesstopping times
Nov 12, 202641 pages
PDFView work

math.AG — Algebraic Geometry

Stability conditions on twisted derived categories I: Existence and full numerical support

Contributed by Zhirui Li

We prove that for every nonempty smooth projective variety XX over an arbitrary field and every Brauer class α\alpha, the twisted derived category Db(X,α)\mathrm{D}^b(X,\alpha) admits a Bridgeland stability condition with full numerical support. Based on Chunyi Li's construction and its extension to arbitrary fields, we establish uniform phase control under tensoring by an Azumaya algebra and calibrate the resulting slicing to the induced central charge. We further show that the constructed stability condition is geometric and satisfies a mass-Hom bound, which persists throughout its connected component.

Author comments: 26 pages. Comments and suggestions are welcome.

Primarily human-written textHuman understanding: all partsBridgeland stability conditions; twisted derived categories
Nov 12, 202626 pages
PDFView work

math.NT — Number Theory

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

Contributed by Boyang Hu

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

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

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

math.MG — Metric Geometry

Fixed points of the polar projection body operator and its square

Contributed by Sihan Chen

Let TK=(ΠK)∘TK=(\Pi K)^\circ be the polar projection body of a convex body KK in Rn\R^n. In dimension n≥3n\ge3, we prove that TKTK is a positive dilate of KK exactly when KK is an origin-centred ellipsoid, settling Petty's polar projection conjecture. The same classification holds under the weaker assumption that T2KT^2K is a positive dilate of KK. The proof uses a distributional Laplacian identity to compare two integrals of central section volumes. Equality supplies contractive hyperplane projections with every kernel direction, and James's theorem gives ellipsoidal rigidity. The argument applies to arbitrary convex bodies and yields the translative constant volume conjecture of Horv\'ath and L\'angi.

Primarily AI-generated textHuman understanding: some partsFixed and Periodic PointsPetty’s Polar Projection ProblemPolar Projection Bodies
Nov 12, 20265 pages
PDFView work

math.CT — Category Theory

Isomorphism Loci and Coherence in Equivalence Extension

Contributed by Zhenyu Sun

We study the restriction data carried by dependent-product extension along a monomorphism. In a locally cartesian closed category, the extended map is an isomorphism after a change of base if and only if the input map is an isomorphism on the restricted base. In a topos, its isomorphism locus is therefore the universal quantification of the input locus. A terminal characterization gives coherent comparisons for base change and successive extension, together with formulas for intersections and unions. Under explicit homotopical, cartesian, and universe hypotheses, this construction gives equivalence extension and preserves the boundary identifications used to prove fibrancy of a universe. Graph comparisons and strict fillers of a fixed universe boundary are represented by trivially fibrant objects. A single realignment over the comparison object induces a weak equivalence between these parameter objects, and both admit extensions of every finite cubical boundary. A finite-groupoid example shows that graph comparisons cannot be selected naturally under all isomorphisms of unstructured input.

Primarily human-written textHuman understanding: all partsBeck–Chevalleydependent productequivalence extensionfibrant universeisomorphism locusrealignment
Nov 12, 202624 pages
PDFView work

math.NT — Number Theory

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

Contributed by Boyang Hu

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

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

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

math.NT — Number Theory

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

Contributed by Boyang Hu

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

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

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

math.DS — Dynamical Systems

Limit Cycles under Concave Per-Capita Growth

Contributed by Zhenyu Sun

We study predator--prey systems with a fixed globally linear functional response and a strictly concave prey per-capita growth rate. For every N≥1N\ge1 and K≥2K\ge2, we construct a growth polynomial of degree 2N+2⌈K/2⌉+22N+2\lceil K/2\rceil+2 with exactly NN positive periodic orbits, all hyperbolic. The construction retains a chosen center KK-jet and the low-density growth rate and carrying capacity of its limiting profile, subject to an explicit relation between the center height and curvature. A limiting Lyapunov function and return-map estimates at three amplitude scales exclude additional cycles. A dissipative extension gives exact global counts with prescribed limiting center energies. We also prove that profiles with at least NN hyperbolic cycles are C2C^2-dense in the admissible class, while preserving the entire germ at the maximum and both ecological endpoint values. The first nonzero canonical odd term determines the sharp differentiability threshold. Further results give parity restrictions for fixed focus jets, degree lower bounds, quantitative polynomial approximation under concavity and interpolation constraints, and amplitude and multiplicity interpolation by Abelian integrals. Finally, a single smooth strictly concave profile has infinitely many nested hyperbolic cycles converging to coexistence.

Author comments: 45 pages, 3 figures. Symbolic and numerical verification scripts and data are included in anc/.

A mix of human-written and AI-generated textHuman understanding: some partsAbelian integralsdifferentiabilityfinite jetslimit cyclespolynomial degreepredator-prey systemstrict concavity
Nov 12, 202645 pages
PDFView work

math.OC — Optimization and Control

Quadratic Strictly Positive Real Factors of Stable Transfer Functions

Contributed by Jinlin Wang, Zhenyu Sun

We characterize factorizations G=G0∘HG=G_0\circ H in which GG and G0G_0 are stable, minimum-phase, biproper real-rational functions with simple poles and zeros and positive gains at infinity, and HH is a quadratic strictly positive real function. Classical rational decomposition identifies the quadratic right-factor classes with real Möbius involutions fixing GG. Within each class, we parameterize all normalized representatives and eliminate the scaling parameter and the frequency variable. The resulting sign conditions involve univariate polynomials of degree at most four. They determine all feasible denominator intervals and all factorizations in the class; for real-algebraic input, they give an exact decision procedure. We also give a scaling that maximizes the smaller of the inner positive-real margin and the outer spectral margin for a fixed denominator. For quadratic input, existence is equivalent to strict positive realness of GG and to an explicit coefficient inequality. Examples exhibit a disconnected feasible parameter set, separate algebraic and analytic obstructions, and a quartic input with exactly three admissible classes.

Primarily human-written textHuman understanding: all partsHurwitz polynomialsMöbius involutionsRational decompositionstrictly positive real functionstransfer function substitution
Nov 12, 202618 pages
PDFView work

math.CA — Classical Analysis and ODEs

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

Contributed by Tejasvi Singh Tomar

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

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

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

cs.LO — Logic in Computer Science

A formal proof in Lean of the finiteness of planar five-body central configurations for all positive masses

Contributed by Tejasvi Singh Tomar

Smale's sixth problem asks whether, for every choice of positive masses, there are finitely many central configurations up to similarity. For five bodies in the plane, Albouy and Kaloshin proved finiteness outside a set of masses of codimension two. In a companion paper the author proved finiteness for every choice of five positive masses by their method, adding steps that cannot be checked by hand: exact computer algebra, rational certificates and a branch and bound. We formalize this theorem in Lean 4 with Mathlib without assuming the results of Albouy and Kaloshin that the informal proof uses. Instead we prove what the proof needs of their rules on limit diagrams, of their classification of these diagrams and of their mass conditions. We do so at places of complex algebraic curves, taken as valuations of the function field rather than points of a projective model. Almost every computation becomes data for a checker that we write in Lean, prove sound with respect to Mathlib's real and complex numbers, and run in the kernel (proof by reflection). The main theorem depends on about 680,000680{,}000 theorems proved in this way, and Mathlib's tactics prove the few other computations. The proof uses only Lean's three standard axioms, and two independent Lean kernels, nanoda and lean4lean, accept it.

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

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

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, to leading order in σ/d\sigma/d. For branches more than σeff\sigma_{\rm eff} apart the entanglement is therefore transient and, if well separated, a fraction of order σeff/d\sigma_{\rm eff}/d of what unitary Newtonian gravity gives; below σ\sigma it can last for days. 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: Version 2 corrects statements that a re-examination of version 1 found to be wrong or too broad; the criterion and all tabulated values are unchanged. (1) Lattice branch counts (Sec. 5.3, Sec. 7, App. C): the smallest counts found are 15.2 and 14.1 d/sigma for hexagonal patches and 10.5 and 13.2 d/sigma for disc-shaped cuts, at d = 12 and 24 sigma; version 1 gave "at least about 15 d/sigma", and no lower bound is claimed now. (2) Abstract, Sec. 1, 5.2 and 6: the bounds 0.12 sigma_eff/d (rate ratio) and 0.19 sigma_eff/d (negativity) are leading order in sigma/d; finite-sigma values are given. (3) "Transient" is now scoped to branches further apart than sigma_eff. For superpositions smaller than sigma, the regime plotted by Trillo and Navascues, the criterion holds exactly and the entanglement can last for hours to days; this is now stated and cited. (4) Sec. 4.1: s is not monotone in L in every family; the transversal L -> 0 distance 1.547 sigma is an infimum, and Table 1 is relabelled. (5) Theorem 4.3: the disc bound is for continuous uniform discs (dense-lattice limit), and the far copies must face each other at the same gap. (6) The collective rate R_coll is defined explicitly. References are renumbered from [15].

Primarily AI-generated textHuman understanding: all parts
Nov 12, 202620 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