Browse

All works

Browse the Hexagon catalog.

Newest works

1110 works

math-ph — Mathematical Physics

The Hawking-Page transition at weak coupling

Contributed by Anthropic

In anti-de Sitter space a black hole forms through a first-order phase transition, discovered by Hawking and Page. In N=4\mathcal{N}=4 super Yang-Mills theory on S3S^3 this is deconfinement at strong coupling. Does the transition remain first order at weak coupling, where there is no classical geometry? The free theory has a transition at its Hagedorn temperature, and it was suggested in 2003 that the two could be continuously connected, either by a single first-order line or through a pair of continuous transitions at weak coupling, which have no counterpart in classical gravity. One number decides: the sign of the quartic coefficient bb in the effective action of the Polyakov loop. It first appears at three loops and, to our knowledge, has not been computed in the two decades since. We find b=−1.48×10−3 λ2b=-1.48\times10^{-3}\,\lambda^2, where λ\lambda is the 't Hooft coupling. The transition is first order. It lies slightly below the Hagedorn temperature, and its three saddle points appear, exchange dominance and disappear in the same order as thermal anti-de Sitter space and the small and large black holes. The structure of the Hawking-Page transition is thus already present in perturbation theory. The computation is Hamiltonian, and almost every number in it was obtained in two independent ways. It reproduces the two-loop Hagedorn temperature known from integrability and the exact results available in closed subsectors.

Primarily AI-generated textHuman understanding: some partsAdS/CFTBlack HolesHawking–Page transitionN=4 super Yang–Mills
Nov 07, 202642 pages
PDFView work

math.RT — Representation Theory

Disproof of Xi’s conjecture on the representation dimension of idempotent corners

Contributed by Qiyue Tang

We disprove Xi’s conjecture on the representation dimension of idempotent corners. Over every field and for each integer (L\ge3), we construct an algebra of representation dimension (L+1) with a corner of representation dimension (2L-1).

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.

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

math-ph — Mathematical Physics

The spinless modular bootstrap at large central charge

Contributed by Anthropic

The spinless modular bootstrap bounds the dimension Δ1\Delta_1 of the lightest primary other than the vacuum in a two-dimensional conformal field theory, using only modular SS invariance of the torus partition function at zero angular potential. For unitary, compact theories with central charge c>1c>1 and no conserved currents beyond the Virasoro algebra, these bounds read Δ1≤c/Λ+o(c)\Delta_1\le c/\Lambda+o(c) at large cc. The best slope Λ\Lambda was known only to lie between 8.5038.503 and 1212, where the bound would reach the BTZ black hole threshold. We show that it is exactly ΛV=12π2/(π2+4 arcsinh21)≈9.1266\Lambda_V=12\pi^2/(\pi^2+4\,\mathrm{arcsinh}^2 1)\approx9.1266. No linear functional in a class that contains all finite combinations of derivatives improves on c/ΛVc/\Lambda_V by more than O(c1/3log⁡2/3c)O(c^{1/3}\log^{2/3}c), and an explicit functional gives Δ1<c/ΛV+0.483 c1/3+O(1)\Delta_1<c/\Lambda_V+0.483\,c^{1/3}+O(1) for all sufficiently large cc. The value has an electrostatic origin: as a function of a complexified dimension, c−1log⁡∣g∣c^{-1}\log\lvert g\rvert of a functional gg is a two-dimensional potential with positive charges at the zeros of gg. Positivity forces gg to fall as fast as the Cardy density of states grows, and the maximum principle bounds the potential by an explicit harmonic function, which fixes ΛV\Lambda_V. The field of this potential is the spectral curve of a mean-field theory of the optimal functionals, and its charge density is the distribution that the zeros of any functionals attaining ΛV\Lambda_V must follow. We also conjecture the coefficient of the c1/3c^{1/3} correction to the optimal bound, supported by numerics up to c=2048c=2048.

Primarily AI-generated textHuman understanding: some parts3d gravityAdS/CFTconformal field theorymodular bootstrap
Nov 07, 2026131 pages
PDFView work

math.RA — Rings and Algebras

The L'vov--Kaplansky conjecture for multilinear polynomials of degrees four to six

Contributed by Shengyong Pan

Let KK be an algebraically closed field of characteristic zero. We determine the images of ordinary multilinear polynomials of degrees four, five and six on matrix algebras. For n≥3n\geq3, a nonidentity has image sln(K)\mathfrak{sl}_n(K) when its cyclic class is zero and Mn(K)M_n(K) otherwise. In these degrees the only nonzero identity exception is the standard degree-six line on M3(K)M_3(K). The proof starts with proper sextics and treats arbitrary sextics by unit restrictions and local trace lifting. An image-preserving product substitution then gives degrees four and five as consequences. We also give cyclic and matrix lifting results applicable in arbitrary degree. The finite calculations are given by explicit matrix-unit identities.

Primarily human-written textHuman understanding: all parts
Nov 07, 202696 pages
PDFView work

cs.FL — Formal Languages and Automata Theory

Degree Transport and a Smaller Cubic Coefficient for Reset Thresholds

Contributed by SUNGBIN HONG

We prove that every synchronizing complete deterministic finite automaton on n≥2n\ge2 states has reset threshold at most 824249923n3+O(n2)\frac{8242}{49923}n^3+O(n^2). The cubic coefficient improves on Shitov's 8257/499238257/49923 by 5/166415/16641. The main ingredient is a degree-transport inequality for graphs of state pairs mergeable by short words. It relates a long gap between consecutive minimum-rank word lengths to a large corank achievable in at most n−1n-1 letters. Combining this relation with a discrete dual of Shitov's counting argument gives the improvement. An appendix makes the quadratic remainder explicit for every n≥2n\ge2. The argument applies to arbitrary finite alphabets and does not prove the quadratic Černý conjecture.

Primarily AI-generated textHuman understanding: no partsSynchronizing automatonavoiding wordmerge graphreset thresholdČerný conjecture
Nov 07, 202610 pages
PDFView work

math.NT — Number Theory

Four exponentials at CM and Beta periods

Contributed by Shawn Krisman

For every nonzero eigen-period PP of a CM abelian variety over Q‾\overline{\mathbb{Q}}, we show that the four exponentials conjecture and its strong form hold at t∈Q‾×P±1t\in\overline{\mathbb{Q}}^\times P^{\pm1} and t∈Q‾×(P/π)±1t\in\overline{\mathbb{Q}}^\times(P/\pi)^{\pm1}; these include Beta values such as t=Γ(1/5)2/Γ(2/5)t=\Gamma(1/5)^2/\Gamma(2/5). For an elliptic curve EE over Q‾\overline{\mathbb{Q}} with complex multiplication, we also show that eπ2e^{\pi^2} and ℘E(1/π)\wp_E(1/\pi) are not both algebraic. Further results concern two CM elliptic curves: for example, π,ϖ,Ωρ,ϖΩρ\pi,\varpi,\Omega_\rho,\varpi\Omega_\rho are linearly independent over Q‾\overline{\mathbb{Q}}, where ϖ\varpi and Ωρ\Omega_\rho are periods of y2=4x3−4xy^2=4x^3-4x and y2=4x3−4y^2=4x^3-4. These are explicit consequences of published theorems of Waldschmidt (1988) and Roy–Waldschmidt (1993), together with classical results of Baker, Schneider, Masser and Wüstholz; the contribution is the statements and the proofs written out at these periods. Cases at specific periods, such as that 2ϖ2^{\varpi} and 3ϖ3^{\varpi} are not both algebraic, are checked in Lean 4 and reported separately.

Primarily AI-generated textHuman understanding: no partsBeta valuesLeanalgebraic subgroup theoremcomplex multiplicationelliptic functionsformal verificationfour exponentials conjecturetranscendence
Nov 07, 202626 pages
PDFView work

math.NT — Number Theory

A Lean formalization of Waldschmidt's subgroup theorem with period term for groups with elliptic factors

Contributed by Shawn Krisman

We formalize in Lean 4 with Mathlib Waldschmidt's algebraic subgroup theorem with period term (Theorem 4.1 of his 1988 Durham paper) for G=Gad0×Gmd1×E1×⋯×EmG=\mathbb{G}_{\mathrm{a}}^{d_0}\times\mathbb{G}_{\mathrm{m}}^{d_1}\times E_1\times\dots\times E_m, with EjE_j elliptic curves with algebraic invariants, under the additional hypothesis 2N≥d1+2d0+κ2N\ge d_1+2d_0+\kappa. The proof uses only Lean's three standard axioms. Along the way we give what we believe are the first formal proofs of Schneider's theorems on elliptic functions and of the Schneider--Lang criterion, and the first Lean library for the Weierstrass σ\sigma and ζ\zeta functions. Restricted forms of the theorem cover some vector extensions and the Jacobian of y5=x(1−x)y^5=x(1-x). A companion certificate uses these to prove explicit cases of the four exponentials conjecture: for example, 2ϖ2^{\varpi} and 3ϖ3^{\varpi} are not both algebraic, where ϖ\varpi is the real period of y2=4x3−4xy^2=4x^3-4x, and likewise 2B(1/5,1/5)2^{B(1/5,1/5)} and 3B(1/5,1/5)3^{B(1/5,1/5)}.

Primarily AI-generated textHuman understanding: no partsLeanSchneider's theoremSchneider-Lang criterionalgebraic subgroup theoremelliptic functionsformal verificationmultiplicity estimatestranscendence
Nov 07, 202631 pages
PDFView work

math.CO — Combinatorics

Foregger's Conjecture on Minimum Permanents of Nearly Decomposable Doubly Stochastic Matrices

Contributed by Yair Lavi

We prove Foregger's conjecture: every nearly decomposable doubly stochastic matrix AA of order n≥2n\ge2 satisfies per⁡A≥21−n\operatorname{per}A\ge 2^{1-n}. Equality holds exactly for matrices obtained from 12(In+Pn)\tfrac12(I_n+P_n) by independent row and column permutations, where PnP_n is a single-cycle permutation matrix. In fact, for every fixed nearly decomposable support whose bipartite graph is not a single cycle, the minimum permanent on its closed doubly stochastic face is strictly larger than 21−n2^{1-n}.

Author comments: Version 2 adds citations to T. Maciejewski, "Foregger's Permanent Conjecture, Part IV" (Zenodo preprint, 2 June 2026, doi:10.5281/zenodo.20510494), in the introduction, after (3.7) and after Lemma 5.1. The results and proofs are unchanged.

A mix of human-written and AI-generated textHuman understanding: all partsForegger conjectureNearly decomposable matricesTight cutsdoubly stochastic matricespermanents
Nov 07, 202617 pages
PDFView work

math.DG — Differential Geometry

HOLOMORPHIC SECTIONAL CURVATURE OF FLAG MANIFOLDS VIA KÄHLER REDUCTION

Contributed by Ching Hsien Lee

We give an alternative proof that every invariant Kähler metric on a compact generalized flag manifold has positive holomorphic sectional curvature. Invariant Kähler metrics on unitary partial flag manifolds are realized as reductions of Hermitian vector spaces at compact moment-map levels contained in spheres. A curvature identity for linear Kähler quotients gives an explicit positive lower bound. For an inclusion of compact connected Lie groups, we prove that the induced inclusion between adjoint orbits through the same Lie algebra element is holomorphic, isometric, and totally geodesic for the Kähler structures determined by an invariant inner product and its restriction. This reduces the general case to unitary flags. We also obtain a strict estimate for the second fundamental form of the anticanonical projective embedding

A mix of human-written and AI-generated textHuman understanding: all partsFlag manifoldsPositive holomorphic sectional curvature
Nov 07, 20269 pages
PDFView work

math.CO — Combinatorics

On a counting conjecture for binary rich words

Contributed by Max Glass

Let R2(n)R_2(n) denote the number of binary rich words of length nn. We prove that lim sup⁡n→∞log⁡R2(n)nlog⁡n=∞\limsup_{n\to\infty}\frac{\log R_2(n)}{\sqrt{n}\log n}=\infty. Consequently, R2(n)R_2(n) is not O(nCn)O(n^{C\sqrt{n}}) for any fixed C>0C>0, disproving the conjectured upper bound O((n/g(n))n)O((n/g(n))^{\sqrt{n}}) with g(n)→∞g(n)\to\infty. The proof combines independent permutation families through an ordered concatenation construction and a binary gap encoding.

Author comments: Formatting correction to the web abstract: repaired math delimiters and removed hard line breaks. The paper and mathematical results are unchanged. 4 pages. Lean 4 formalization and paper source: https://github.com/glasss13/rich-word-counting.

Primarily AI-generated textHuman understanding: no partsenumerationformal verificationpalindromesrich words
Nov 06, 20264 pages
PDFView work

math.CO — Combinatorics

The constant Steiner kernel is not optimal at large girth

Contributed by Matthew Kwan, Huy Tuan Pham

In the paper "nonlinear lower-tail large deviations at criticality", we bound the number of order-nn Steiner triple systems with no Pasch configuration. In doing so, we show that a certain variational problem is minimised by a constant kernel. Using ChatGPT 6 Pro, we also discovered that the analogous variational problems for Steiner triple systems of girth at least gg, for large gg, are *not* minimised by the constant kernel, and we included a brief remark to this effect. In this note (not intended for publication), we present the details of this proof.

Primarily AI-generated textHuman understanding: all parts
Nov 06, 20267 pages
PDFView work

math.AP — Analysis of PDEs

Anomalous regularization of passive scalars up to the Obukhov-Corrsin exponent

Contributed by Scott Armstrong, Vlad Vicol

We consider the advection-diffusion equation ∂tθ+b⋅∇θ−κΔθ=0\partial_t\theta+\mathbf{b}\cdot\nabla\theta-\kappa\Delta\theta=0 on the two-dimensional torus T2\mathbb{T}^2, where b\mathbf{b} is a divergence-free velocity field constructed as in arxiv:2305.05048, H\"older continuous with an exponent $\alpha<\nf13$ and built from shear flows alternating in direction at infinitely many scales. We prove anomalous regularization: for every ss below the Obukhov--Corrsin exponent 12(1−α)\frac12(1-\alpha), with b\mathbf{b} depending on ss, the solutions are bounded in~C0,s(T2)C^{0,s}(\mathbb{T}^2) at positive times by a constant times the L2(T2)L^2(\mathbb{T}^2) norm of the initial data, uniformly in the diffusivity κ\kappa in a union of bands accumulating at 00. As a consequence, we obtain anomalous dissipation at a uniform rate: solutions dissipate a fixed fraction of their variance in unit time, so that the variance decays exponentially, with constants independent of κ\kappa, of the initial datum and of the initial time. The proof combines iterated quantitative homogenization with large-scale regularity: at each scale the solution is compared with a solution of the homogenized equation of that scale. Since the derivatives consumed by each comparison are regenerated at every scale, the H\"older norm is carried from the coarsest scale to the finest by induction. Each of our main results, together with its proof, is fully formalized in the Lean 4 proof assistant.

A mix of human-written and AI-generated textHuman understanding: some partsanomalous diffusionanomalous regularizationhomogenization
Nov 06, 2026165 pages
PDFView work

math.QA — Quantum Algebra

The Haagerup center at central charge eight via conformal nets

Contributed by Cédric ARHANCET

Let S⊂VE6⊕A2S\subset V_{E_6\oplus A_2} be the unitary vertex operator algebra of central charge eight with currents at levels (3,13)(3,13) constructed in our previous work. An exact presentation of a full corner of its Zhu algebra gives strong rationality, the twelve simple modules and the lattice branching rules. Using these results, we identify the representation category of its conformal net with the Haagerup center Z(H3)Z(\mathcal{H}_3). We construct a holomorphic diagonal extension of AS⊗AS\mathcal {A}_S\otimes \mathcal{A}_S and apply the vacuum trace class theorem of Henriques and Tener to prove trace class heat operators in every sector of AS\mathcal{A}_S. Reconstruction gives a unitary holomorphic vertex operator algebra containing S⊗SS\otimes S as mutual commutants. The coset theorems of Gui then give the complete unitarity of SS and a braided equivalence Rep(S)≅Z(H3)\mathrm{Rep}(S) \cong Z(\mathcal{H}_3), so that SS is a Haagerup algebra. Using results of Dong, Jiao and Xu, we also identify the Huang--Riesen algebra with the twin of SS and describe their common fixed point algebra using the intersection of the two binary lattices of discriminant −39-39.

Author comments: 73 pages

A mix of human-written and AI-generated textHuman understanding: some partsDrinfeld centerHaagerup subfactorcomplete unitarityconformal nethyperbolic genussimple current extensionvertex operator algebra
Nov 06, 202673 pages
PDFView work

math.CO — Combinatorics

Decidability of Mutation-Acyclicity

Contributed by Qiyue Tang

Mutation-acyclicity is decidable for all finite integral skew-symmetrizable exchange matrices. Mutation equivalence up to relabeling is decidable when at least one of the two inputs is mutation-acyclic.

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.

A mix of human-written and AI-generated textHuman understanding: some partsCluster Algebra
Nov 06, 202612 pages
PDFView work

math.CV — Complex Variables

Schmeisser’s Conjecture in Large Degree

Contributed by Qiyue Tang

We prove Schmeisser’s conjecture for all sufficiently large degrees.

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.

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

math.AG — Algebraic Geometry

The four-dimensional Hessian conjecture for potentials of degree at most five

Contributed by David Niedbala Giraudin

The Hessian conjecture HC_n asserts that if f in C[x_1,...,x_n] has det Hess(f) in C^×, then ∇f is a polynomial automorphism. It is known for n ≤ 3, false for n ≥ 5, and open for n = 4, where it implies the plane Jacobian conjecture. Ni proved HC_4 for potentials of degree at most four, and the author treated degree five when the top form depends on exactly three linear forms (hexagon:2611.00134). We prove HC_4 for every potential of degree at most five. The remaining top forms are a binary form or a fifth power of a linear form. Both cases are reduced, by weighted layers of the Hessian determinant and exact computer algebra over Q, to four elementary mechanisms: a Schur complement in one variable (which reduces to HC_3), a partial Legendre transform in two variables (which reduces to HC_2), a "dead direction" lemma (which reduces to HC_2 and the plane Jacobian conjecture in degrees at most (3,4), known by Moh), and explicit triangular inverses. Five self-contained verifiers are supplied as ancillary files. The paper has not been refereed.

Primarily AI-generated textHuman understanding: no partsGröbner basesHessian conjectureJacobian conjecturecomputer-assisted proofpolynomial automorphisms
Nov 06, 20267 pages
PDFView work

math.DS — Dynamical Systems

Normal Cone Is All You Need: Unsoftened Symplectic Integration Of The Newtonian N-Body Problem Across Collisions In Finite Steps

Contributed by Jeremy Nusa

In the classical formulation of the Newtonian NN-body problem, symplectic geometry and collision singularities appear fundamentally irreconcilable: fixed-step symplectic integrators preserve the Poincaré integral invariants on smooth orbits only by softening the gravitational potential or breaking down at close encounters, whereas classical Sundman and Levi-Civita regularizations resolve collisions only by deforming the global time flow or altering the canonical phase-space structure. In this work, we show that this dichotomy is not an intrinsic obstruction of Hamiltonian mechanics, but an artifact of working on the unblown Cartesian configuration space. By lifting the dynamics to the standard cotangent bundle T∗Q[N]T^*\mathbf{Q}[N] of the real oriented Fulton–MacPherson compactification Q[N]=Bl⁡Π(N)(M/R3)\mathbf{Q}[N] = \operatorname{Bl}_{\Pi(N)}(M/\mathbb{R}^3) and applying the Calaque–Safronov shifted cotangent deformation to the normal cone DZQ[N]→A1\mathcal{D}_Z \mathbf{Q}[N] \to \mathbb{A}^1, we construct an exact, unsoftened (ε=0\varepsilon = 0) Hamiltonian splitting covered by the combinatorial atlas of (2N−3)!!(2N-3)!! rooted binary Jacobi trees. Along the normal-cone degeneration, the interaction decomposes canonically into commuting Kepler–Sundman leaf flows, synchronous anti-Zeno supernodes, and a scale-invariant quadrupolar-screened apex potential of global C1,1\mathcal{C}^{1,1} regularity. Endowing the exceptional collision divisors with McGehee's unitary elastic bounce involution (BC2=Id\mathcal{B}_C^2 = \mathrm{Id}) renders the leaf flows globally complete and time-reversible across binary collisions in a finite number of physical steps, thereby lifting the Sheng–Suzuki negative-timestep barrier for high-order symmetric compositions. In the bi-graded Poisson–Lie algebra Ln,m\mathcal{L}_{n,m} associated with this splitting, we establish a Universal Double Obstruction Theorem at order six: momentum-parity alternation prevents any pure configuration-space corrector from cancelling the leading secular error, while a non-vanishing Hall cohomology class in H1(DA,L5,2)H^1(D_A, \mathcal{L}_{5,2}) creates an incompressible O(ε2h4)\mathcal{O}(\varepsilon^2 h^4) quadratic tidal floor. We overcome the parity obstruction by introducing a torque-free cotangent corrector K4∈L4,1∩P1K_4 \in \mathcal{L}_{4,1} \cap \mathcal{P}_1, realized via a palindromic Lie conjugator Z4BM4(h)\mathcal{Z}_4^{\mathrm{BM4}}(h) that vanishes naturally as O(r7/2)\mathcal{O}(r^{7/2}) at collisions (scheme PBM4\mathrm{PBM}_4). Whenever the trajectory changes local Jacobi chart or dyadic step-size level, a non-commutative covariant gauge connection TA→B(PBM4)T_{A\to B}^{(\mathrm{PBM4})} closes the Čech 1-cocycle on the atlas groupoid and eliminates interfacial shadow-energy jumps. Accompanied by a complete, axiom-free Lean 4 formalization and validated up to 116-bit quadruple precision against the REBOUND integrator suite (IAS15, TRACE, MERCURIUS, and WHFast), the resulting architecture preserves all Galilean Lie–Bargmann invariants to machine precision across secular, collisional, and chaotic multi-body regimes.

A mix of human-written and AI-generated textHuman understanding: some partsFulton-MacPherson compactificationHall Lie algebraLie-Bargmann algebraN-body problemcelestial mechanicscollision regularizationdeformation to the normal conesymplectic correctorssymplectic integration
Nov 06, 2026195 pages
PDFView work

math.NT — Number Theory

Irrational even beta values in shifted intervals

Contributed by twinheterodox

For every positive odd integer mm, we prove that at least one of β(m+1),β(m+3),…,β(19m−1)\beta(m+1),\beta(m+3),\ldots,\beta(19m-1) is irrational, where β\beta is the Dirichlet beta function. More generally, for each positive integer BB we give an explicit constant CBC_B such that at least BB even beta values with indices between m+1m+1 and CBm−1C_Bm-1 are irrational, for every positive odd mm. Specific parameter choices give at least two irrational values among β(2),β(4),…,β(70)\beta(2),\beta(4),\ldots,\beta(70), at least three through β(186)\beta(186), and at least four through β(360)\beta(360).

Author comments: Version 2 improves the uniform one-value endpoint from 67m-1 to 19m-1 and sharpens the general bound for any prescribed irrationality count. Specific parameter choices give at least two irrational values through beta(70), three through beta(186), and four through beta(360). The 20-page revision includes comparisons with v1, worked Gram and prime-dilation examples, and an independent audit of the underlying argument and exact certificates.

Primarily AI-generated textHuman understanding: some partsDirichlet beta functionirrationalityshifted intervals
Nov 06, 202620 pages
PDFView work

math.NT — Number Theory

Saouter's primality criterion in Lean, a ladder constant, and a 25 rung route to odd Goldbach up to 102010^{20}

Contributed by Steve Hubbard

This note gives Lean proofs, with no hypothesis, of the primality criterion of Saouter's paper, Lemma 1 for every even FF, Theorems 1 and 2, and it records the reading of the constant on page 865 under which the formula agrees with the rest of the paper; separately, given the published even Goldbach computation to 4⋅10184\cdot 10^{18} as an explicit hypothesis, a ladder of 25 Proth primes reaches 102010^{20} in the Lean kernel. The binary Goldbach conjecture remains open and this note makes no progress on it. The ternary Goldbach theorem for all odd numbers is Helfgott's (arXiv:1312.7748), and it is not formalized here and not used.

Author comments: 8 pages. Version 3 of the note, first deposit on Hexagon.

Primarily AI-generated textHuman understanding: some partsGoldbach ConjectureLean 4Proth primesformal verificationprimality criterion
Nov 06, 20268 pages
PDFView work

math.CO — Combinatorics

Undecidability of Quiver Mutation Equivalence

Contributed by Qiyue Tang

We prove that quiver mutation equivalence up to relabeling is undecidable even for one fixed source quiver. We also prove strong NP-hardness.

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.

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

math.NT — Number Theory

An explicit prime gap under the Riemann hypothesis, formalized in Lean with its prime power input made elementary

Contributed by Steve Hubbard

We report on a Lean 4 formalization of Theorem 2 of Dudek, 2015, as numbered in arXiv v2, which states that if the Riemann hypothesis is true, then for every real x≥2x \ge 2 there is a prime in the interval (x−(4/π)xlog⁡x,x](x - (4/\pi)\sqrt{x}\log x, x]. In the formalization, Theorem 2 is proved assuming the Riemann hypothesis and one cited explicit zero-counting bound of Hasanalizade, Shen and Wong, arXiv:2107.06506. Four cited inputs of the printed proof are replaced in the formal proof. The two that carry the argument are these: first, the prime power contribution ψ−θ\psi - \theta is required only across the moving window (x−h,x+h](x - h, x + h] and is proved outright in Lean by an elementary counting argument with no cited input and without assuming the Riemann hypothesis; second, the sum over nontrivial zeros is bounded from the cited Hasanalizade, Shen and Wong zero count for T≥70T \ge 70 by trading slack between the head and tail sums at the split point T=2x/hT = 2x/h. The Riemann hypothesis is open and this note makes no progress on it.

Author comments: 11 pages. Version 2 of the note, first deposit on Hexagon.

Primarily AI-generated textHuman understanding: some partsLean 4Riemann Hypothesisexplicit number theoryformal verificationprime gaps
Nov 06, 202611 pages
PDFView work

math.AG — Algebraic Geometry

Equivalence of the Four-Variable Hessian and Planar Jacobian Conjectures

Contributed by Qiyue Tang

We prove that the four-variable Hessian conjecture and the planar Jacobian conjecture are equivalent over the complex numbers.

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.

A mix of human-written and AI-generated textHuman understanding: some partsJacobian conjecture
Nov 06, 202631 pages
PDFView work

math.NA — Numerical Analysis

Quartic Fekete points on every real simplex

Contributed by Yunpeng Li

We prove that on every real simplex Bos's quartic interpolation nodes uniquely maximize the absolute Vandermonde determinant, up to ordering, among all configurations of the prescribed size. In dimension four the squared Euclidean norm of the cardinal vector exceeds one at the centroid. We bound its excess by products of the cardinal polynomials for tetrahedral face centers. These products also measure correlations between columns of the evaluation matrix, which give the required loss in the determinant. An elementary consequence of the same corrected squared-norm estimate is Bos's fourth-power bound in every dimension, with equality exactly at the nodes. The corrected estimate follows from cubic perturbations, reduction to at most two distinct positive coordinate values, and coefficient monotonicity in their multiplicities. All polynomial bounds are given explicitly. The common base case is the tetrahedral Fej\'er bound previously stated by Panda and Pal in equivalent optimal-design form. We give an independent proof of that bound and determine all its equality points.

Primarily AI-generated textHuman understanding: no parts
Nov 06, 202628 pages
PDFView work

math.CV — Complex Variables

Sheil-Small's (1974) covering problem has a positive answer

Contributed by Dave Goel

T. Sheil-Small asked whether every self-inversive polynomial maps the unit disc onto a domain that contains a disc whose radius is the largest modulus of the polynomial's coefficients (Problem 4.24 in Hayman and Lingham's problem book). We show that the answer is yes. More generally, every non-constant polynomial whose coefficients have the same moduli when read in reverse order maps the unit disc onto a domain that contains an open disc of this radius. This class contains the self-inversive polynomials and the polynomials whose zeros, with multiplicity, are symmetric under taking reciprocals (the problem's printed definition of self-inversive). The radius cannot be increased. For a polynomial with all its zeros on the unit circle, the largest disc in the image has radius exactly half the maximum modulus on the circle. For these polynomials the question is therefore equivalent to the known bound: every coefficient has modulus at most half this maximum (O'Hara-Rodriguez, Saff-Sheil-Small, Kristiansen). The new case is that of polynomials with zeros off the unit circle. We treat this case with the Schur-Cohn Hermitian form and that bound. The main theorem is also proved in the Lean 4 proof assistant, with that bound taken as given.

Author comments: An expanded version of this paper, with further results, is posted on Zenodo: https://doi.org/10.5281/zenodo.23908408

A mix of human-written and AI-generated textHuman understanding: some partsSchur-Cohn formcoveringde Bruijn's theoremself-inversive polynomial
Nov 06, 20269 pages
PDFView work

math.DG — Differential Geometry

EVERY CLOSED SMOOTH nn-MANIFOLD EMBEDS ISOMETRICALLY IN R n(n+1)/2+28\mathbb{R}^{\,n(n+1)/2+28}

Contributed by Yi Wang, Wenchang Yang

We prove that every closed smooth Riemannian nn-manifold admits a smooth isometric embedding into Rsn+28\mathbb{R}^{s_n+28}, where sn=n(n+1)/2s_n=n(n+1)/2. This improves the previous upper bound sn+max⁡{n+5, 2n}s_n+\max\{n+5,\,2n\} to a dimension-independent surplus of 2828.

A mix of human-written and AI-generated textHuman understanding: some partsHopf fibrationcharacteristic varietyfree mapsh-principleisometric embeddingphase regularityunextendible product bases
Nov 06, 2026126 pages
PDFView work

cs.LO — Logic in Computer Science

Proof-Carrying Modernization: LLM Translations of COBOL Batch Programs, Each Proved Against the Original in Lean

Contributed by Tejasvi Singh Tomar

Large language models translate legacy code quickly, but a translation can differ from the original on inputs that no test exercises. We show that LLM translations of whole, unmodified COBOL programs into Rust and Java can be proved in Lean 4 to behave like our semantics of the originals on every admissible input: a bounded number of well-formed records, among other premises. The COBOL semantics is executable; it computes record layouts, decimal arithmetic and file handling from our front end’s output for the unmodified source. For the eight standalone batch programs of AWS CardDemo covered by that front end, all 16 translations are proved, as equivalences for Rust and as refinements with partial correctness for Java. The statements are generated from the programs except for a few small parts, LLM agents write the proofs, and Lean’s kernel checks them. Before any proof, 35% of the first running translations differed from our semantics of the original on a generated input, and no proof found a difference that this testing had missed.

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

math.CO — Combinatorics

Contracting a pendant edge can increase the mean subtree order

Contributed by Alexander Kramer

Cambie, Jooken and Wagner conjectured that contracting an edge of a connected graph decreases the mean subtree order by at least 1/3, as it does for trees. We construct unicyclic graphs of order n and maximum degree 3 in which contracting a pendant edge increases the mean subtree order by n/450+O(1), disproving the conjecture. In this family the bound first fails at 481 vertices and contraction first increases the mean at 631 vertices.

Primarily AI-generated textHuman understanding: all partscounterexampleedge contractionmean subtree order
Nov 06, 20262 pages
PDFView work

math-ph — Mathematical Physics

Era statistics for the vacuum Bianchi IX flow

Contributed by Yi-kun Li

We prove the Gauss statistical law for eras of the exact vacuum Bianchi IX flow with zero cosmological constant. Eras are defined by transverse events along the solution, and their lengths count curvature transitions. Along almost every trajectory, the era phases have the Gauss distribution and every finite block of era lengths has its Gauss frequency. The tail decays inversely with era length; the limiting truncated mean grows logarithmically with the cutoff, while the full mean diverges. One invariant Borel exceptional set is null on every smooth transverse section and in the four-dimensional constraint manifold. The proof combines estimates for exact return branches with absolute continuity of their coding measure. Transverse contraction controls the accumulated phase error within each era, uniformly over unbounded era lengths and arbitrarily unequal small curvature variables. A density with strictly expanding section flux then forces almost every recurrent orbit to enter a statistical set on a small section.

Author comments: The Lean 4 formalization is also available on GitHub: https://github.com/l46430640-del/ERA-STATISTICS-FORMAL

A mix of human-written and AI-generated textHuman understanding: no partsBKL era statisticsBianchi IXGauss mapLean 4Mixmaster dynamicscosmological singularities
Nov 06, 2026257 pages
PDFView work

cs.CC — Computational Complexity

What the ETH refutations do not give: barriers for the counting engines, with machine-checked lemmas

Contributed by Vaibhav Tulsyan

In October 2026 OpenAI and Anthropic each claimed a deterministic subexponential algorithm for counting the solutions of a kk-CNF; both counting engines sum products of local tables. For SAT itself, Majdoddin bounds the rate of Anthropic's grid recursions with product terms, and Dias and Lima bound OpenAI's clause-product scheme. However, Majdoddin notes that no barrier is known for decompositions whose terms are not products, and neither paper treats the counting problems beyond SAT. We introduce the engine barrier problem: bound from below the shared bits UU of every network of a stated class that computes a given count, and the rate of every recursion of a stated class. Our approach puts a rank on every cut of a local network, and on one contraction inside both flattenings of a term. Machine-checked in Lean are: correlated (non-product) decompositions of two rectangles, of the 3×23\times2 grid and of the full 3×33\times3 grid level have flattening-rank sums at least N2N^2, N3N^3 and N8N^8, while N9N^9 is open; the row cut of the permanent has rank (nk)\binom nk, which on paper gives U≥nlog⁡2(n/s)U\ge n\log_2(n/s) for row-local networks; algebras in which the permanent is a functional of a product have dimension at least (nn/2)\binom n{n/2}; pieces have saving ρ≥1/2\rho\ge1/2 (rank form; Anthropic's observation); and exact colouring filters for Hamiltonicity need q≥n−4q\ge n-4 colours. On paper we prove U≥(1−o(1))nlog⁡2nU\ge(1-o(1))n\log_2n for vertex-local networks for the Tutte polynomial off the integer hyperbolas, and ρ≥3/8\rho\ge3/8 for correlated decompositions of full grid levels. We cite 4545 Lean theorems, with standard axioms only. Every barrier is about a named model: in Anthropic's general model no unconditional bound on UU exists without separating P\mathrm P from P#P\mathrm P^{\#\mathrm P}, and an unconditional cap on oblivious algebraic algorithms would separate VP\mathrm{VP} from VNP\mathrm{VNP}.

Primarily AI-generated textHuman understanding: some partsExponential Time HypothesisSATTutte polynomialcorrelated decompositionscut rankengine barrier problemtensor networks
Nov 06, 202624 pages
PDFView work

math.OA — Operator Algebras

Bures Geometry of Projection States

Contributed by Zhenyu Sun, Jilin Wang

We study the Bures metric on states obtained by conditioning a faithful normal state on nonzero projections of a von Neumann algebra. The metric determines the reference state, projection probabilities, orthogonality, and order. For algebras with no type I2I_2 direct summand, surjective isometries are exactly those induced by reference-state-preserving normal Jordan ∗^*-isomorphisms; the same conclusion holds for M2(C)M_2(\mathbb C). A semifinite tracial version determines the trace up to a single positive factor. In finite tracial algebras, we characterize optimal finite projective measurements and express their fidelity deficit as a sum of squared L2L^2 errors. Spectral measurements with at most n+1n+1 outcomes approximate fidelity with error O(n−2)O(n^{-2}); the interval grid is minimax optimal, and the order is sharp within spectral measurements. We compare the fidelity defect of a common commutative context with approximation by commuting projections, obtain sharp spectral rounding constants, and solve both optimization problems in the algebra generated by two projections. The space of normalized finite-trace projection states is complete; in a finite tracial algebra its rectifiable components are unitary orbits, and within each orbit the intrinsic Bures distance is the root mean square of the principal angles. Finally, a fidelity bound on local unitary orbits characterizes tracial reference states.

Author comments: 38 pages.

Primarily human-written textHuman understanding: all partsBures geometryintrinsic distanceoptimal measurementsprojection statesquantum fidelityvon Neumann algebras
Nov 06, 202638 pages
PDFView work

cs.LO — Logic in Computer Science

Formalization of Robust Strictly Positive Real Synthesis for Fourth-Order Interval Polynomial Families

Contributed by Tiancheng Xu, Wensheng Yu

That every robustly Hurwitz-stable fourth-order interval polynomial family admits a common strictly positive real (SPR) numerator was conjectured by Anderson et al. and proved by Yu and Wang. In this paper, we present a complete formalization of this classical synthesis theorem in the Lean~4 interactive theorem prover.

Primarily AI-generated textHuman understanding: all partsHurwitz stabilityLean 4formal verificationinterval polynomial familyproof reconstructionstrictly positive real synthesis
Nov 06, 202613 pages
PDFView work

math.NT — Number Theory

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

Contributed by Zeng Chunping

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

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

math.AP — Analysis of PDEs

Non-Uniqueness of Leray-Hopf Solutions to the Unforced Three-Dimensional Navier-Stokes Equations

Contributed by Tristan Buckmaster, Matei Coiculescu, Chen Li

We prove that the incompressible Navier--Stokes equations in R3\R^3, without external force, admit a continuum of distinct suitable weak solutions in the Leray--Hopf class with the same initial datum. The datum is compactly supported, axisymmetric without swirl, and smooth away from the origin; it lies in L3,∞L^{3,\infty} and in LqL^q for every q<3q<3, but not in L3L^3. The solutions are axisymmetric without swirl and smooth at positive times, and they satisfy the local and global energy equalities. Any two of them separate in L2L^2 at the rate t1/4+σt^{1/4+\sigma}, for a fixed 0<σ<1/40<\sigma<1/4. The proof follows the program of Jia and \v Sver\'ak, with a discretely self-similar background in place of a self-similar one. The background is an exact unforced solution built from a train of thin vortex rings, which we obtain by lifting a periodic row of planar vortices with Gaussian stream function. We construct a growing Floquet mode of its linearization directly, from the angular-two instability of the planar vortex, and conclude by a nonlinear correction and a localization of the datum.

Author comments: Lean formalization forthcoming at the public repository at https://github.com/mcoiculescu/unforced-leray-hopf-public Exposition will be improved in future versions. We used an adaptation of Scott Armstrong's skill files for the Lean formalization process.

Primarily AI-generated textHuman understanding: some partsNavier-Stokes Equations
Nov 06, 202680 pages
PDFView work

math.CV — Complex Variables

Origin-Centered Mobius Circles, Bernoulli Lemniscates, and Beta–Gamma Dyadic Pairings of the Riemann Zeta Function on the Critical Line

Contributed by Ryan Hackbarth

We investigate the complex geometry of the normalized Dirichlet eta terms tn(s)=11−21−s(−1)n−1nst_n(s) = \frac{1}{1 - 2^{1-s}} \frac{(-1)^{n-1}}{n^s} for s=a+bis = a + bi. Whereas individual terms on the critical line Re⁡(s)=12\operatorname{Re}(s) = \frac{1}{2} undergo a nearly sixfold modulus oscillation driven by the Euler prefactor (1−21−s)−1(1 - 2^{1-s})^{-1}, the two-term partial sum S2(s)=t1(s)+t2(s)S_2(s) = t_1(s) + t_2(s) traces an exact Mobius circle for every fixed a≠1a \neq 1 that is centered at the origin (0,0)(0,0) if and only if Re⁡(s)=12\operatorname{Re}(s) = \frac{1}{2}, where it reduces to a scaled Blaschke factor 12B(z)\sqrt{\frac{1}{2}} B(z) of constant radius 12\sqrt{\frac{1}{2}}. Factoring m−sm^{-s} across odd-even dyadic pairs Pm(s)=tm(s)+t2m(s)=m−sS2(s)P_m(s) = t_m(s) + t_{2m}(s) = m^{-s} S_2(s) eliminates prefactor amplitude oscillations entirely, collapsing precessing annular rosettes into concentric origin-centered circles on the critical line with strictly descending radii Rm=12mR_m = \sqrt{\frac{1}{2m}}. Removing all odd-even pairs leaves the complementary multiples-of-44 terms t4k(s)=k−st4(s)t_{4k}(s) = k^{-s} t_4(s): we prove that on the critical line the anchor term t4(12+ib)t_4(\frac{1}{2} + ib) traces an exact Lemniscate of Bernoulli with foci at (0,0)(0,0) and (1,0)(1,0) (uniquely for Re⁡(s)=12\operatorname{Re}(s) = \frac{1}{2}), pure powers of 22 (k=2rk = 2^r) trace closed periodic multi-loop rational curves, and non-powers of 22 trace precessing lemniscate rosettes, while the dyadic differences D4m(s)=t4m(s)−t8m(s)=−4−sPm(s)D_{4m}(s) = t_{4m}(s) - t_{8m}(s) = -4^{-s} P_m(s) collapse both families into exact origin-centered circles, partitioning the sequence {tn(s)}n=1∞\{t_n(s)\}_{n=1}^{\infty} termwise and decomposing ζ(s)\zeta(s) via analytic continuation. Finally, we establish a pointwise velocity--modulus duality ∣dt4dθ∣=∣t2(12+ib)∣=n2∣tn(12+ib)∣\left|\frac{dt_4}{d\theta}\right| = \left|t_2\left(\frac{1}{2} + ib\right)\right| = \sqrt{\frac{n}{2}} \left|t_n\left(\frac{1}{2} + ib\right)\right| (θ=bln⁡2\theta = b \ln 2) and a double-angle Blaschke identity −zB(z)=ei2α(b)-z B(z) = e^{i 2\alpha(b)} linking the central polar angle α(b)\alpha(b) of t4(12+ib)t_4(\frac{1}{2} + ib) to its fundamental perimeter L(t4)=Γ(1/4)22πL(t_4) = \frac{\Gamma(1/4)^2}{2\sqrt{\pi}}, thereby parameterizing every individual term tn(12+ib)t_n(\frac{1}{2} + ib) and every concentric dyadic circle on the critical line in terms of the regularized inverse incomplete Beta function Iq(b)−1(14,12)I_{q(b)}^{-1}(\frac{1}{4}, \frac{1}{2}). As a geometric consequence, critical-line zeros ζ(12+ib)=0\zeta(\frac{1}{2} + ib) = 0 are reframed as values of bb where the resultant of the inner concentric circles lands on the antipode −P1(12+ib)-P_1(\frac{1}{2} + ib) of the initial circle of constant radius.

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

math.CO — Combinatorics

Vertex splitting, global rigidity and nondegenerate equilibrium stresses

Contributed by James Cruickshank

We prove Whiteley's conjecture that every nontrivial vertex split of a generically globally rigid graph preserves generic global rigidity in Rd\mathbb{R}^d, for all d≥1d\geq1. We give two proofs of the stronger assertion that the split graph is infinitesimally rigid at every generic coincident realisation of the two split vertices. Both proofs use maximum-rank equilibrium stress matrices and then apply the coincident-rigidity criterion of Cruickshank, Jackson and Tanigawa. The second construction also shows that every generically globally rigid graph admits a nondegenerate equilibrium stress of maximum rank at every generic realisation, establishing a conjecture of Jord\'an and Tanigawa.

Author comments: updated to match version at https://arxiv.org/abs/2611.10919

Primarily AI-generated textHuman understanding: all partsGraph rigidityequilibrium stressglobal rigidityvertex splitting
Nov 06, 202616 pages
PDFView work

math.NT — Number Theory

Explicit lower bounds for the number of irrational even beta values

Contributed by twinheterodox

For every even integer s≥160s\ge160, we prove that at least ⌊π2/135 s/log⁡s⌋\left\lfloor\pi\sqrt{2/135}\,\sqrt{s/\log s}\right\rfloor of the numbers β(2),β(4),…,β(s)\beta(2),\beta(4),\ldots,\beta(s) are irrational, where β\beta is the Dirichlet beta function. We also give sharper finite endpoints for specified counts of irrational values

Primarily AI-generated textHuman understanding: some partsDiophantine approximationDirichlet beta functionirrationality
Nov 06, 202620 pages
PDFView work

math.FA — Functional Analysis

A modular theory of contractive projections on Banach spaces with applications to noncommutative Lp\mathrm{L}^p-spaces

Contributed by Cédric ARHANCET

We develop a differential-geometric approach to contractive projections on complex Banach spaces based on Levi forms of plurisubharmonic functions. We show that if a projection PP contracts a C2\mathrm{C}^2 plurisubharmonic function Φ\Phi, then, at any point of its range, the Levi form of Φ\Phi defines a tangent Hilbertian geometry for which PP becomes an orthogonal projection. When the range is finite-dimensional and the relevant Levi forms are nondegenerate, comparing the Levi geometries associated with different points leads naturally to positive relative operators and associated one-parameter groups. We apply this framework to tracial noncommutative L4\mathrm{L}^4-spaces. Exploiting the cubic form of the duality mapping, we characterize contractive projections by a Jordan triple orthogonality property and prove that a projection on L4(M)\mathrm{L}^4(\mathcal{M}) is 22-contractive if and only if it is completely contractive. When the ambient von Neumann algebra is finite-dimensional, we identify the relative operator associated with the left and right tangent forms on the range with a restriction of an inverse square root of a modular operator on a linking von Neumann algebra. This entails that the range of any 22-contractive projection is completely isometric to a rectangular noncommutative L4\mathrm{L}^4-space associated with a W∗\mathrm{W}^*-ternary ring of operators. As a consequence, every such projection is contractively decomposable. Finally, for every 1<p<∞1 < p < \infty with p≠2p \neq 2, we prove that every finite-rank 22-contractive projection on a tracial noncommutative Lp\mathrm{L}^p-space is completely contractive. For p>2p > 2, we obtain a weighted ternary description of its range in terms of a finite-dimensional W∗\mathrm{W}^*-TRO\mathrm{TRO}.

Primarily human-written textHuman understanding: all partsBanach spacesLevi formscomplete contractivitycontractive projectionsduality mappingsnoncommutative $\L^p$-spacesplurisubharmonic functionsternary rings of operators
Nov 06, 202674 pages
PDFView work

cs.SC — Symbolic Computation

Deterministic Polynomial-Time Factorization over Finite Fields

Contributed by Qiyue Tang

Using prime-field factorization and a Dedekind zeta zero-free theorem, we obtain deterministic polynomial-time algorithms for complete factorization over finite fields and for constructing their presentations from their orders.

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.

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

math.AG — Algebraic Geometry

The four-dimensional Hessian conjecture for quintic potentials with a ternary cone top

Contributed by David Niedbala Giraudin

The Hessian conjecture HCn\mathrm{HC}_n asserts that if f∈C[x1,…,xn]f\in\mathbb{C}[x_1,\dots,x_n] has det⁡Hess⁡(f)∈C×\det\operatorname{Hess}(f)\in\mathbb{C}^\times, then ∇f\nabla f is a polynomial automorphism. It is known for n≤3n\le 3, false for n≥5n\ge 5, and open for n=4n=4, where it implies the plane Jacobian conjecture. Z. Ni proved HC4\mathrm{HC}_4 for potentials of degree at most four. We prove HC4\mathrm{HC}_4 for every potential of degree five whose top homogeneous form depends on exactly three linear forms. The proof combines a weighted analysis of the Hessian determinant with exact computer-algebra certificates (Groebner bases and Rabinowitsch tests over Q\mathbb{Q}); one branch reduces to plane Jacobian pairs of degrees (4,3)(4,3), which are excluded by Magnus' theorem. A self-contained verifier is supplied as an ancillary file. The binary and unary cone tops in degree five remain open.

Author comments: 5 pages. Ancillary file anc/verify_hc4_ternary.py: 29 exact checks (python-flint, sympy, Singular via Sage), about 3 minutes. Extends arXiv:2608.14217 to degree five for ternary cone tops. Computations and writing assisted by Claude (Anthropic).

Primarily AI-generated textHuman understanding: no partsGroebner basesHessian conjectureJacobian conjecturecomputer-assisted proofpolynomial automorphisms
Nov 06, 20265 pages
PDFView work

math.CO — Combinatorics

Regular complex Hadamard matrices of order 7,8

Contributed by Teo Banica

A complex Hadamard matrix H∈MN(C)H\in M_N(\mathbb C) is called regular when the scalar products between its rows ∑kHikHˉjk=0\sum_kH_{ik}\bar{H}_{jk}=0 decompose as trivially vanishing sums of roots of unity, rotated by scalars. We review the general theory of such matrices, including the known classification at N=6N=6, and then we work out classification results at N=7N=7 and N=8N=8.

Primarily AI-generated textHuman understanding: some partsButson matrixHadamard matrix
Nov 06, 202664 pages
PDFView work

cs.CC — Computational Complexity

The Price of Bayes-Optimal In-Context Learning

Contributed by Xiaoyu Li

In-context learning is often explained as implicit Bayesian inference: given labeled examples of a task drawn from a prior, the learner predicts like the posterior. We determine the computational price of this explanation for task families whose labels depend on few bits of the task description, such as quantized models on sparse data, and we compare it with the price of merely learning. The comparison uses the recent refutations of the Exponential Time Hypothesis by OpenAI and Anthropic. Bayesian inference in context is counting. For κ\kappa-local task families with NN-bit descriptions under the uniform prior, the posterior predictive and posterior sampling reduce to #κ\#\kappa-SAT. Without label noise they run in time poly(m)⋅2o(N)\mathrm{poly}(m)\cdot 2^{o(N)} on contexts of every length mm when κ=o((log⁡N)1/4/log⁡log⁡N)\kappa=o((\log N)^{1/4}/\sqrt{\log\log N}), and label noise is handled by error profiles. A two-variable gadget gives contexts that are always consistent and whose posterior predictive is 2#F/(2#F+1)2\#F/(2\#F+1) for a CNF FF. So approximating the posterior predictive within 1/41/4 needs time 2(1−γ)N2^{(1-\gamma)N} at locality O(log⁡N)O(\log N) under CNF-SETH, and time 2N/polylog N2^{N/\mathrm{polylog}\,N} at locality 33 under a length form of ETH. At constant locality, Bayesian inference in context is SAT parameterized by formula length. Learning in context is cheap. The Bayes risk of any class with NN-bit descriptions is at most N/(m+1)N/(m+1) after mm examples. For binarized perceptrons and literal disjunctions on sparse data, the very families of the lower bounds, a linear program is a polynomial-time in-context learner with essentially the same sample efficiency. Every κ\kappa-local family is linear over ∑j≤κ(Nj)\sum_{j\le\kappa}\binom{N}{j} local Fourier features, so regression in context learns it from NO(κ)N^{O(\kappa)} examples, in time polynomial in NκN^\kappa and the inverse accuracy. The average case. For Goldreich's random local functions, the Bayes risk is at most N/(m+1)N/(m+1), while every in-context learner yields a distinguisher for Goldreich's generator, with the same running time up to a linear term, whose advantage is 1/21/2 minus the risk. Under a local pseudorandom generator hypothesis with polynomial stretch, polynomial-time in-context learners need polynomially more examples than the Bayes predictor. Under its length form at linear stretch, which the new algorithms refute below rate 1/21/2, the Bayes predictor of the refutations is optimal up to polylogarithmic factors in the exponent. For transformers, these bounds limit the length of a chain of thought that computes the posterior predictive, and they separate Bayes-optimal in-context learning from the regression-type in-context learning that transformers are known to implement.

Primarily AI-generated textHuman understanding: some partsBayesian inferenceCNF-SETHExponential Time HypothesisGoldreich's generatorfine-grained complexityin-context learninglocal pseudorandom generatorsmodel countingposterior predictivetransformers
Nov 06, 202637 pages
PDFView work

cs.CC — Computational Complexity

Fast Attention after SETH: The Exact Exponent and the Hypotheses Behind It

Contributed by Xiaoyu Li

Alman and Song showed that attention with head dimension O(log⁡n)O(\log n) can be approximated in almost linear time when the entries are o(log⁡n)o(\sqrt{\log n}), and needs quadratic time at Θ(log⁡n)\Theta(\sqrt{\log n}) under the Strong Exponential Time Hypothesis. In October 2026 the Exponential Time Hypothesis was refuted, and with it SETH. The quadratic lower bound now rests on the hardness of Orthogonal Vectors in dimension clog⁡nc\log n (LDOV), which no open hypothesis about satisfiability is known to imply. We measure an instance by its spread WW, the largest gap between two logits of a row. At every nontrivial constant precision and in every dimension between ω(log⁡n)\omega(\log n) and no(1)n^{o(1)}, we show that under LDOV the time exponent of attention is exactly 1+min⁡{W/ln⁡n,1}1+\min\{W/\ln n,1\}: uniform sampling of keys is optimal, the cost is min⁡{n eW,n2}\min\{n\,e^{W},n^2\} up to factors no(1)n^{o(1)}, and the transition to quadratic time sits at W=ln⁡nW=\ln n, the spread at which one key can outweigh all others. At polynomial precision and in dimension O(log⁡n)O(\log n) the threshold becomes Θ(log⁡n)\Theta(\log n), with a constant that tends to zero as the precision grows, and the dimension moves it: at precision n−1−O(1/log⁡log⁡n)n^{-1-O(1/\log\log n)}, spread O(log⁡n/log⁡log⁡n)O(\log n/\log\log n) is hard in dimension (log⁡n)1+Ω(1)(\log n)^{1+\Omega(1)} but easy in dimension O(log⁡n)O(\log n). From satisfiability we obtain hardness at spread (1+θ)ln⁡n(1+\theta)\ln n in dimension no(1)n^{o(1)}, provided the hard CNF formulas have Nc0N^{c_0} clauses for some c0<2c_0<2, and we show that the construction behind this bound, which builds one instance for each proof of a Merlin–Arthur protocol for disjointness, needs c0<2c_0<2 for every such protocol. For the entry bound, every reduction that embeds Orthogonal Vectors vector by vector, with polynomial blowup and logit gap Ω(log⁡n)\Omega(\log n), yields a Merlin–Arthur protocol for disjointness; by Klauck's lower bound, such reductions cannot derive B=Θ(log⁡n)B=\Theta(\sqrt{\log n}) from Orthogonal Vectors in dimension (log⁡n)1+Ω(1)(\log n)^{1+\Omega(1)}. We also map the conditional lower bounds for attention in the literature to the hypotheses that now support them, and find two families whose hypotheses are false, one of them in part of its parameter range.

Primarily AI-generated textHuman understanding: some partsCNF-SETHMerlin-Arthur protocolsOrthogonal VectorsStrong Exponential Time Hypothesisattentioncommunication complexityfine-grained complexitypolynomial methodsoftmaxtransformers
Nov 06, 202643 pages
PDFView work

math.NT — Number Theory

Cumulative Prime Sums and Riemann Zeros: A fine grid, its ripple, and a family of prime races

Contributed by Antonio Mennillo

Summing the primes one after another and taking logarithms gives an increasing sequence of real numbers, σm=log⁡Spm\sigma_m=\log S_{p_m} with SN=1+∑p≤NpS_N = 1+\sum_{p\le N}p, which becomes exponentially dense. The ordinates γn\gamma_n of the zeros of the Riemann zeta function fall on this grid with tiny errors: 1.4⋅10−31.4\cdot10^{-3} at the first zero, 2.4⋅10−72.4\cdot10^{-7} at the fifth, 3⋅10−173\cdot10^{-17} at the twentieth. Part I explains why. The cell of the grid containing a height tt has width (1+o(1))t e−t/2(1+o(1))\sqrt t\,e^{-t/2} (Step Theorem), and every real t>log⁡3t>\log 3 has a node above it within that width, by an argument going back to Bertrand's postulate (Covering Theorem). The precision observed at the zeros is therefore the resolution of the grid, and the same precision holds at every height (Genericity Principle). We compute the first-crossing primes NnN_n with certification up to n=20n=20 and test, in a protocol fixed before the computation, whether the zeros sit closer to the nodes than a generic height. Neither the mean distance to the nearest node (0.2460.246 against 0.2500.250, p=0.92p=0.92) nor the distribution of the position within the cell (Kolmogorov–Smirnov, p=0.79p=0.79) departs detectably from the generic case, and an integer grid used as control behaves in the same way. We also correct the half-exponent law by a factor t′/t\sqrt{t'/t}. Part II shows where the zeros are actually visible. They are not in the position of the nodes but in the ripple: the deviation of the grid from its mean curve B(x)=1+li(x2)−li(4)B(x)=1+\mathrm{li}(x^2)-\mathrm{li}(4). This ripple is a sum of pure oscillations, one per zero; its spectrum shows a peak at each of the first 13 ordinates, with the amplitude predicted by the explicit formula. Under RH the ripple has size e−t/4e^{-t/4} on the grid, much larger than the cell e−t/2e^{-t/2}, and RH is equivalent to this decay rate. The ripple is not centred: on [103,108][10^3,10^8] the sum of the primes stays below li(x2)\mathrm{li}(x^2) for about 97% of logarithmic time, and it first exceeds it at x=109x=109. We place this in a one-parameter family of prime races, ∑p≤xpa\sum_{p\le x}p^a against li(xa+1)\mathrm{li}(x^{a+1}), and prove that under RH the normalized error has mean −1/(2a+1)-1/(2a+1), coming from the squares of the primes. Under RH and LI the limiting logarithmic density of the set where the race is ahead is given by a Rubinstein–Sarnak formula; it moves from 2.6⋅10−72.6\cdot10^{-7} (counting the primes, a=0a=0) to 0.060.06 (summing them, a=1a=1) and tends to 1/21/2 as a→∞a\to\infty, at the rate 12−δa∼1/(2πAlog⁡(A/2π))\tfrac12-\delta_a\sim1/\bigl(2\sqrt{\pi A\log(A/2\pi)}\bigr) with A=a+12A=a+\tfrac12. At a=−1/2a=-1/2 the bias becomes the 12log⁡log⁡x\tfrac12\log\log x of the weighted counting functions of Aoki and Koyama. All theorems are formalized in Lean 4, with the classical results they use as explicit hypotheses.

A mix of human-written and AI-generated textHuman understanding: some partsChebyshev biasLean 4Riemann zerosexplicit formulaprime races
Nov 06, 202629 pages
PDFView work

math.OC — Optimization and Control

A Sixth-Order Hurwitz Interval Polynomial Family Without Degree-Five Weak Strictly Positive Real Numerator

Contributed by Tiancheng Xu, Zhengtai Xiong, Wensheng Yu

We construct an explicit sixth-order Hurwitz-stable interval polynomial family with independent closed coefficient intervals that admits a common strictly positive real (SPR) numerator of degree six, yet admits no common weak strictly positive real (WSPR) numerator of degree five. More strongly, no nonzero real polynomial of degree at most five makes the real part of the associated transfer functions nonnegative across the family at all real frequencies. This counterexample shows that, for sixth-order interval polynomial families, robust Hurwitz stability does not guarantee the existence of a strictly proper common SPR or WSPR numerator of degree five, and equal numerator degree six is necessary in general.

Primarily AI-generated textHuman understanding: some partsstrictly positive real synthesis
Nov 05, 202610 pages
PDFView work

math.NT — Number Theory

Exact Intervals and Arithmetic Structure in Fuchs' Extremal Problem

Contributed by Zhenyu Sun

We determine Fuchs' weighted unit-circle extremum for monic integer polynomials for 0<λ≤30<\lambda\le3. The proof combines a fractional difference energy with a sharp rearrangement inequality and an explicit gap for nonnegative integer sequences that are not interval indicators. We obtain the finite-degree minimum on (1,2)(1,2) at every degree and on (2,3)(2,3) at every degree at least five. Every minimizing sequence on these intervals eventually consists, up to monomial factors, of Dirichlet polynomials and products of two adjacent Dirichlet polynomials, respectively. At integer parameters, Parseval's identity reduces the problem to integer coefficient norms. The lower bound is attained exactly when a multiplicity-free ideal Prouhet--Tarry--Escott pair exists. Classical PTE constructions give exact values for the integers 11 through 1010 and for 1212, and a two-value alternative at 1111. Subset counting gives a quadratic upper bound in general. The interval formulas and explicit constructions show that 22, 33 and 44 are strict local maxima; the formula on (2,3)(2,3) has a unique minimum. A Pell construction gives an upper bound on (4,5)(4,5), and coefficient-norm gaps exclude Dirichlet products uniformly near certain integers. For each fixed degree bound, the extremum, divided by a common gamma factor, is locally the lower envelope of finitely many rational functions. Exact lattice enumeration identifies a nonproduct minimizer on an open interval containing 17/417/4 for every degree bound from 6161 to 8080.

Author comments: 24 pages. Includes exact-arithmetic programs and data.

A mix of human-written and AI-generated textHuman understanding: some partsFuchs extremal problemProuhet-Tarry-Escott problemexact lattice enumerationfractional energyinteger polynomials
Nov 05, 202624 pages
PDFView work

math.HO — History and Overview

Grothendieck Montpellier. Énoncés des lectures modernisées démontrés.

Contributed by Michel Hua

Working notes of Alexandre Grothendieck, put online by the University of Montpellier, have been transcribed and restated in current notation with a language model; the restatements may contain errors. This appendix proves statements taken from these restatements in seventy-five folders, in commutative algebra, algebraic geometry, plane affine geometry, general and tame topology, category and group theory, homotopical algebra, order theory, algebra and finite combinatorics. Each proof follows a proof checked in the Lean 4 proof assistant with its library mathlib. For each statement the text gives the context of the leaf, the proof, the hypotheses that are superfluous or necessary, and the corrections made to the restatement or to the page. It ends with the list of statements the sections report without a Lean check.

Author comments: v2. Part 1 (Lean appendix): a section on Venken's 1971 example, a non-effective finite equivalence relation that answers a question of the 1973 Buffalo lectures, checked in Lean (part Descente). A section on the "serene" objects and dualisable objects of the IHÉS manuscript "Motifs" (fonds Grothendieck–Illusie), checked in Lean. In the IHÉS notes on K of a triangulated category, the exact sequence K(D) → K(C) → K(C/D) → 0 for a thick subcategory and its Verdier quotient is proved in Lean, with Thomason's counterexample without thickness. Nine figures of the edition beside the statements of folders 70, 74, 78, 79, 80, 84, 86 and 154, each pointing to the facsimile page. Four new references (Dold–Puppe 1980, Lewis–May–Steinberger 1986, FGA III, Venken 1971). Part 2 (open questions): the Buffalo effectivity problem (Problem 14) is answered by Venken's example, with a second example of length 15 (16 in characteristic 2); a figure for the stable graphs of folder 147.

Primarily AI-generated textHuman understanding: some partsGrothendieckLean 4MathlibMontpellier archiveformalisationworking notes
Nov 05, 2026409 pages
PDFView work

math.CO — Combinatorics

Finite Field Grothendieck Inequality, Finite Field Johnson-Lindenstrauss Flattening and Finite Field Bourgain-Tzafriri Restricted Invertibility Problems

Contributed by K. MAHESH KRISHNA

We ask for finite field versions of following three: (1) Grothendieck Inequality, (2) Johnson-Lindenstrauss Flattening Lemma, (3) Bourgain-Tzafriri Restricted Invertibility Theorem.

Primarily human-written textHuman understanding: all partsBourgain-Tzafriri Restricted InvertibilityFinite Field.Grothendieck InequalityJohnson-Lindenstrauss Lemma
Nov 05, 20265 pages
PDFView work

math-ph — Mathematical Physics

A projective twistor correspondence for local analytic Einstein germs

Contributed by Lior Isthmus

For each prescribed numerical cosmological constant, including zero, we establish a convergent projective twistor correspondence recovering every marked four-dimensional local analytic Einstein germ of any algebraic Weyl type. The inputs are two independent analytic Čech classes of weights 22 and −6-6 on a fixed flat twistor germ T0T_0 along its whole marked zero line, encoding both complete chiral curvature records. The fixed source correction and calibration select a unit optical section, an intrinsic projective extension condition recognizes Einstein geometry, and the prescribed normalized contact, optical and affine maps and their inverses converge on common neighborhoods of the whole physical sky for bounded holomorphic input families. On independently admitted ordinary and operator domains we prove both inverse comparisons, with the two source operations acting in one projective analytic Heisenberg model. The same comparisons preserve the nonlinear source, compact point objects, optical evaluation and calibrated infinity forms, together with physical point and full spin-frame changes and coupled Lorentz reality. For fixed positive Schwarzschild mass, we obtain finite horizon-crossing presentations, a calibrated local primitive comparison and optical approximation bounds for the entire specified compact nonradial crossing family using finite local readouts and the exact benchmark cuts, coordinate comparisons and Sachs reference frames.

Author comments: v1.1. Added computational supplement 0.2.0-r3, manuscript references to selected checks, and the SageMath/SymPy verification sentence in the AI-use disclosure. Mathematical content and numbering are unchanged from v1.0. This version is archived at https://doi.org/10.5281/zenodo.24197319. PDF, source and computations: https://github.com/lioristhmus/projective-twistor-einstein-germs/releases/tag/paper-v1.1.

Primarily AI-generated textHuman understanding: some partsEinstein metricsSchwarzschild spacetimeanalytic geometrycontact geometrytwistor theory
Nov 05, 2026219 pages
PDFView work

math.CT — Category Theory

Acyclic Networks: Causal Comparisons, Convex Minors, and Gauge Descent

Contributed by Zhenyu Sun

We study natural transformations, minors, and symmetric monoidal decorations of finite directed acyclic networks. For any weakly connected small source category, a natural transformation into a free acyclic path category is determined by one component. If more than one transformation exists, common prefixes and suffixes give a canonical factorization through two constant functors and identify the transformation set with a single set of directed paths. Consequences include boundary rigidity, a decision algorithm, and a fundamental-group obstruction to non-uniqueness. For fusion–embedding minors, right fillings exist exactly when the graph pushout is acyclic. A support invariant detects a nonexact minor under the full gauge congruence, while path-convex embeddings admit two-sided fillings. Inverse-image pullbacks give canonical partial-map normal forms, a scanning algorithm, and a coherent presentation of the cartesian quotient. For open networks, wire splicing gives units, and diagram groupoids satisfy descent by homotopy pullback over the interface groupoid, including through-wires. This descent is invariant under strong symmetric monoidal equivalence and compatible with admissible event contractions within each piece. Finite-field examples yield orbit classifications, stabilizer weights, and boundary convolution formulas. Roof-refinement spaces realize spheres whose higher homotopy is lost under groupoid completion.

Primarily human-written textHuman understanding: all partsacyclic categoriescausal networksconvex minorsgauge groupoidshomotopy descentnatural transformationstensor networks
Nov 05, 202636 pages
PDFView work