Browse

All works

Browse the Hexagon catalog.

Newest works

1102 works

math.NT — Number Theory

On the Diophantine equation ab+bc+ca=Nab + bc + ca = N and Euler's idoneal numbers

Contributed by Xuebin Liang

In this paper, it is proved that every natural number since 18491849 can be represented as ab+bc+caab+bc+ca with three distinct positive integers aa, bb and cc. A positive integer NN is an Euler's idoneal number if and only if it cannot be written as ab+bc+caab+bc+ca for distinct positive integers aa, bb and cc. Consequently, the number 18481848 is the largest Euler's idoneal number, which was conjectured by Euler in 1778 and Gauss in the Disquisitiones Arithmeticae.

Primarily human-written textHuman understanding: all partsAlgebraic Number Theory
Nov 17, 202647 pages
PDFView work

math.NT — Number Theory

Wieferich co-occurrence along exponential sequences: a weighted tail estimate and its application to (⋆′)

Contributed by Zeng Chunping

Let r≥2r\ge2 be a fixed integer and write be=re−a′b_e=r^e-a' for a′≤Aa'\le A coprime to rr. A recent preprint (hexagon:2610.00630, Zeng) reduces the abc conjecture, within a lattice-theoretic framework, to a single remaining hypothesis (⋆′)(\star'). We show that on the k=2k=2 slice the density-zero requirement on the exceptional set attached to (⋆′)(\star') follows from one summability condition Kr,a′<∞K_{r,a'}<\infty, where Kr,a′=∑q∈Cr,a′sqlog⁡q (1/D3(q)+1/e0(q))K_{r,a'}=\sum_{q\in\mathcal{C}_{r,a'}}s_q\log q\,(1/D_3(q)+1/e_0(q)), Cr,a′\mathcal{C}_{r,a'} is a three-filter congruence set, D3(q)=ordq3(r)D_3(q)=\mathrm{ord}_{q^3}(r), and e0(q)e_0(q) is the least solution of q3∣re−a′q^3\mid r^e-a'. The main result is unconditional: splitting the governing weight Ξr\Xi_r by the block d=ordq(r)d=\mathrm{ord}_q(r), the mass constraint ∏q2∣rd−1\prod q^2\mid r^d-1 and Stieltjes partial summation give Ξr(2)=∑sq=22log⁡q/(dqq)<∞\Xi_r^{(2)}=\sum_{s_q=2}2\log q/(d_qq)<\infty for every base rr, with explicit bound O(1+log⁡log⁡r)O(1+\log\log r); no abc, no GRH, and no count or density of the Wieferich primes Wr\mathcal{W}_r. The exact threshold of the first-moment route is Φr(E)=o(E)\Phi_r(E)=o(E), equivalently Ar(t)=∑d≤tMd/d=o(t)A_r(t)=\sum_{d\le t}M_d/d=o(t); the deep-layer condition Ξr(3)<∞\Xi_r^{(3)}<\infty sits strictly between Murata's finiteness conjecture P6aP_{6a} and the deep reciprocal sum, and the barrier analysis (one claimed radical barrier withdrawn as a bookkeeping artifact and replaced by an exact identity) shows it cannot be reached by block/radical/partial-summation methods. A Katz double-zero hypothesis (D4) yields Ξr(3)<∞\Xi_r^{(3)}<\infty and P6aP_{6a} almost surely (Borel--Cantelli); in the Haar ensemble (D4) is free with constant 11, while the diagonal embedding ι(Z)\iota(\mathbb{Z}) has measure zero, so the missing input is precisely pointwise rigidity of ι(r)\iota(r), equivalently the single-variable statement m(q)→∞m(q)\to\infty for the least nontrivial Teichmüller representative m(q)m(q) modulo q3q^3. The bad-set hypothesis (H-j) is supported by computation to 10610^6 (five hits, zero growth), while the same data correct the twin-Wieferich null hypothesis to the Teichmüller rate (q−1)/q2(q-1)/q^2. We prove (H-j) is not a GRH statement, locate it strictly between Katz's 2015 equidistribution conjecture and Murata's 1991 conjectures, record ancillary unconditional results (∑plog⁡p/(dp(p−1))<∞\sum_p\log p/(d_p(p-1))<\infty via Erdős--Murty; the exact identity Cr=SW+Sord+LTE2C_r=S_W+S_{\mathrm{ord}}+LTE_2; strict one-way comparisons), and specify what any new tool must look like (S1--S7). We prove no conjecture: the exact threshold, Ξr(3)\Xi_r^{(3)}, P6aP_{6a}, P4P_4, P1P_1 and (H-j) remain open.

Primarily human-written textHuman understanding: all partsBorel-Cantelli lemmaFermat quotientHensel liftingKatz equidistribution conjectureStieltjes partial summationTeichmuller subgroupWieferich primesabc conjecturemultiplicative ordersuper-Wieferich primes
Nov 17, 202627 pages
PDFView work

math.MP — Mathematical Physics

From Four-Dimensional Wilson Lattice Gauge Theory to Quantum Yang--Mills Theory, with a Conditional Mass-Gap Theorem

Contributed by Zeng Chunping

We present a complete formal paper compiling the Lean-verified construction of quantum Yang--Mills theory submitted on October 28, 2026, and independently validated by the Yang--Mills Shepherding Committee. Starting from the Wilson definition of lattice gauge theory on a four-dimensional torus, we give full proofs of every step that can be carried out from the definitions: the field-label algebra, the finite lattice theory, and--under an explicit, individually registered package of renormalization-group and analytic assumptions--the fixed-volume ultraviolet limit, the subsequential infinite-volume limit, the phase decomposition with clustering and full support, the Osterwalder--Schrader reconstruction satisfying the Wightman axioms, and the Yang--Mills identification: the stress tensor and its Ward identity, the trace anomaly with the verified constant 3 dim_R(g)/pi^4, the exclusion of a precise class of free-field descriptions, the one-loop running coupling, and the operator product expansion. For the mass gap we prove two logical boundaries: an explicit model satisfies all registered inputs with clustering, yet its Hamiltonian has no spectral gap; and a mass gap is equivalent to a uniform exponential rate in the clustering axiom, with the bridge from the volume-uniform transfer-matrix condition to the continuum gap proved. A uniform mass gap requires new infrared input; we develop one explicitly conditional route (semiclassical tunneling in the defining representation of SU(2)), and we prove that, with the registered input set fixed, removing the conditionality is equivalent to proving the mass gap itself. A positive mass gap is not proved.

Author comments: First version. Part I recompiles the validated Lean 4 construction of quantum Yang--Mills theory (OpenAI submission of October 28, 2026; independent validation by the Yang--Mills Shepherding Committee, release of November 10, 2026) into ordinary rigorous mathematics, expanding every proof that can be expanded from the definitions and the fifteen external inputs (RG1)-(RG3), (RG5), (UV1), (PH1)-(PH3), (AN1), (Y1)-(Y4), (B1), (C1), with (RG4) derived and (PH4) a proved spectral conclusion. Part II develops an explicitly conditional mass-gap theorem (tunneling certificate plus fiber reduction plus a one-dimensional Muckenhoupt analysis in the defining representation of SU(2)) and records a de-conditioning boundary: with the registered input set fixed, removing the conditionality is logically equivalent to proving the mass gap itself.

A mix of human-written and AI-generated textHuman understanding: all partsYang-Mills; mass gap; CQFT; LGT; OS reconstruction; RG; Wightman axioms
Nov 17, 202657 pages
PDFView work

math.FA — Functional Analysis

Orthogonal bases of symmetric unitary matrices in odd dimensions and the mixed-unitary rank of the symmetric Werner–Holevo channel

Contributed by Qiyuan Ma

Let Sym_n denote the space of complex symmetric n×n matrices with the Hilbert–Schmidt inner product. Girard, Leung, Levick, Li, Paulsen, Poon and Watrous showed that the symmetric Werner–Holevo channel on M_n has minimal mixed-unitary rank binom(n+1,2) if and only if Sym_n admits an orthogonal basis consisting of unitary matrices. They established this for even n and for n=3, and conjectured it for all odd n; Levick and Rahaman settled the case of primes n≡7 (mod 8). We introduce a family of symmetric unitaries (“chirped circulants”) for odd n and prove that, for this family, the pairwise orthogonality conditions reduce exactly to a square system of (n^2-1)/4 real equations in as many unknown phases. Using this reduction we give (i) a fully explicit basis for n=5, with all entries in an explicit degree-8 number field and an exact-arithmetic verification, and (ii) a computer-assisted proof, based on the Krawczyk operator evaluated in Arb ball arithmetic, that a symmetric unitary orthogonal basis exists for every odd n with 3≤n≤67. Consequently the conjecture of Girard et al. holds for all n≤68. We also record several obstructions to natural approaches for general odd n, and a further reduction for prime n.

Primarily AI-generated textHuman understanding: some parts
Nov 17, 20268 pages
PDFView work

math.CO — Combinatorics

The Hibi–Li (2016) conjecture is fully resolved, and other miscellanea

Contributed by Dave Goel

We prove the equality part of the Hibi–Li (2016) conjecture, its last open part: for every n-element poset P and every 2 ≤ k ≤ n−1, if the chain polytope 𝒞(P) and the order polytope 𝒪(P) have the same number of k-dimensional faces, then they are unimodularly equivalent. Its inequality part, that 𝒞(P) has at least as many k-dimensional faces as 𝒪(P), was first proved by Fourier; for edges the equality part fails, since the two polytopes always have the same number of edges. So the conjecture is now fully resolved. The second version of Fourier's preprint gives an independent proof of the equality part. Both parts follow from two theorems. First, the face numbers of a bounded marked chain-order polytope weakly increase when its chain part grows; the partition is arbitrary, and the marking may be real and degenerate. Its admissible case is also proved, independently, in the second version of Fourier's preprint. Second, for an ordinary n-element poset P whose order and chain polytopes are not unimodularly equivalent, we prove the sharp inequalities f_k(𝒞(P))−f_k(𝒪(P)) ≥ (n−3 choose k−2) for 2 ≤ k ≤ n−1. We characterize the posets for which all these bounds are attained at once, and the set of indices k at which the bound is attained. For posets whose order and chain polytopes differ by one in the number of 2-faces, we obtain a sharper bound that depends on the difference of the facet numbers. For nested chain parts C ⊆ C' in the bounded marked setting, equality of facet numbers is equivalent to affine equivalence; integral markings give lattice equivalence. We prove that regular marked posets have irredundant canonical facet descriptions for every partition, including when maximal elements are unmarked. In that unbounded setting, a switch, which adds one element to the chain part, weakly increases every face number if the element has an upper endpoint, and weakly decreases every face number otherwise. A nonzero change has its nonzero coefficients exactly in an interval of degrees that ends one below the dimension. Its quotient by (1+t)^2 for an increase, and by 1+t for a decrease, has coefficients of the sign of the change. A connected example shows that increases and decreases can cancel along a nested sequence. For bounded marked posets and several pairwise incomparable switched order elements, the alternating sum of face polynomials is a higher-order subdivision defect. It obeys a sign rule under mutual transversality, and for layered posets whose distinct lower and upper neighbourhoods form Berge-acyclic families; without these hypotheses the sign rule can fail, and the defect can have coefficients of both signs. When all these neighbourhoods have two elements, the defect is, up to sign, a power of 2+t times the chromatic polynomials of the lower and the upper neighbourhood graph, evaluated at −t; the sign rule then holds exactly when both graphs are forests. For neighbourhoods of any size, the defect of a layered poset is, up to sign and a power of 2+t, a product of two alternating sums of chromatic polynomials of hypergraphs at −t; for neighbourhoods with three or more elements, Berge-acyclicity is not necessary for the sign rule. The arguments combine fixed-height lifts and clipped markings with general transverse-subdivision results proved in the appendices.

Author comments: First version: October 23, 2026 (Zenodo record 23601976). The ancillary programs are in the Zenodo record of this paper. This is the expanded version, with further results, of the paper "The Hibi–Li (2016) conjecture is fully resolved": https://hexagonmath.org/2611.00512

A mix of human-written and AI-generated textHuman understanding: some partsHibi-Li conjecturechain polytopeface numbersorder polytopeposetsunimodular equivalence
Nov 17, 2026121 pages
PDFView work

math.CO — Combinatorics

The Hibi–Li (2016) conjecture is fully resolved

Contributed by Dave Goel

Hibi and Li conjectured that the order polytope 𝒪(P) of a finite poset P has at most as many faces of each dimension as its chain polytope 𝒞(P), and that equality in some dimension k with 1 ≤ k ≤ |P| − 1 forces the two polytopes to be unimodularly equivalent. Fourier proved the inequality in a 2026 preprint. Let X be the five-element poset in which an element lies above two incomparable elements and below two other incomparable elements. Using two results from Fourier's preprint, we show that if an n-element poset contains X as an induced subposet, then, for every k with 2 ≤ k ≤ n − 1, its chain polytope has at least (n−3 choose k−2) more k-dimensional faces than its order polytope, and that for every n ≥ 5 some n-element poset containing X attains all these bounds at once. Since Hibi and Li showed that 𝒪(P) and 𝒞(P) are unimodularly equivalent exactly when P does not contain X, this proves the equality statement for these values of k. The second version of Fourier's preprint gives an independent proof of this statement. For k = 1, the equality statement is false: the polytopes 𝒪(X) and 𝒞(X) have the same number of edges (Hibi, Li, Sahara and Shikama) but are not unimodularly equivalent. Together with Fourier's inequality, these results settle the conjecture. Our results are formalized in Lean 4, with one result of Fourier's preprint and three published results taken as hypotheses.

Author comments: This paper is arXiv:2610.40703 (first version: October 28, 2026). The expanded version of this paper was first posted on October 24, 2026, at https://doi.org/10.5281/zenodo.23601976 and its newest version is at https://doi.org/10.5281/zenodo.23601975

A mix of human-written and AI-generated textHuman understanding: some partsHibi-Li conjecturechain polytopeface numbersorder polytopeposetsunimodular equivalence
Nov 17, 202617 pages
PDFView work

math-ph — Mathematical Physics

Cohesive 2-Topoi: Foundational Aspects and Nonabelian Differential Cohomology

Contributed by Yuri Ximenes Lecca, Willian Goulart Gomes Velasco

We provide a self-contained exposition of cohesive (2,1)(2,1)-topos theory, its internal synthetic geometry, and its realization of intrinsic, modal, and differential nonabelian cohomology. Starting from the (2,1)(2,1)-categorical hierarchy, Grothendieck (2,1)(2,1)-topoi, effective internal groupoids, and $\E_k$-algebra objects over (2,1)(2,1)-operads, we develop a detailed comparison between \emph{internal} and \emph{external} deloopings in (2,1)(2,1)-presheaf and Grothendieck (2,1)(2,1)-topoi. Specifically, we formalize external delooping by transporting the canonical delooping transformation along the group, discrete, and groupoid Yoneda 2-embeddings, proving that it is 2-naturally equivalent to the internal delooping in any Grothendieck (2,1)(2,1)-topos. We then establish the 2-truncated Dunn--Lurie additivity, Baez--Dolan stabilization, and Eckmann--Hilton characterization of kk-tuply groupal objects as groupal $\E_k$-algebras stabilizing at k=3k=3, and clarify the truncation behavior of iterated deloopings BHkGB_{\mathbf{H}}^k G. Finally, we review Lawvere--Schreiber cohesive modalities, construct abstract principal kk-bundles, the flat de Rham modality $\flat_{\dR}$, universal Maurer--Cartan forms θk\theta_k, connection moduli stacks $B^k_{\con}G$, and sharp-adjusted internal connection moduli $G\Conn^k(X)$. The paper culminates in synthetic differential cohomology, where we discuss extensions of the Maurer--Cartan morphism to non-groupal coefficients via $\int_{\dR} \dashv \flat_{\dR}$, and internal classifying structures.

Primarily human-written textHuman understanding: all parts$\E_k$-algebrasCohesive 2-topoiGrothendieck $(2,1)$-topoiMaurer--Cartan formsalgebra-valued gauge theoriescohesive modalitiesinternal and external deloopingsnonabelian differential cohomology
Nov 17, 202640 pages
PDFView work

math.RA — Rings and Algebras

Improving Razmyslov's (1974) bound: the Nagata–Higman index is at most n² − 2 for n ≥ 3, and other miscellanea

Contributed by Dave Goel

Let d(n)d(n) be the least mm such that every associative algebra over a field of characteristic zero satisfying xn=0x^n=0 also satisfies x1x2⋯xm=0x_1x_2\cdots x_m=0 (the Nagata–Higman index). Razmyslov proved d(n)≤n2d(n)\le n^2 in 1974, and the Kuzmin (1975) conjecture is d(n)=n(n+1)/2d(n)=n(n+1)/2. We prove d(n)≤n2−1d(n)\le n^2-1 for n≥2n\ge2 and d(n)≤n2−2d(n)\le n^2-2 for n≥3n\ge3; in particular d(6)≤34d(6)\le34. The proof uses Formanek's criterion in cycle form and studies, one isotypic block of SNS_N at a time, the span of the NN-cycles inside the block: a block with two corners meets this span exactly when its shape is a self-conjugate hook, and for every k≥2k\ge2 the block of (k+1,2,1k−1)(k+1,2,1^{k-1}), which has three corners, meets it too. The next step, d(n)≤n2−3d(n)\le n^2-3, reduces to one statement about the block of (nn−2,n−1,n−2)(n^{n-2},n-1,n-2); for every n≥4n\ge4 we prove the part of it that concerns the constituents with at most two rows of length 33, and for n=5n=5 the whole statement (computer-assisted). Through the hook theorem the question becomes one about the polynomial identities of Kemer's superalgebras Mk,lM_{k,l} over the Grassmann algebra: lower bounds for their PI degrees give upper bounds for d(n)d(n), and the lower half of the Samoilov (2010) conjecture on these PI degrees would give d(n)<89n2d(n)<\frac89n^2 for n≥3n\ge3.

Author comments: First version: October 27, 2026. This is the expanded version of the paper "Improving Razmyslov's (1974) bound: the Nagata–Higman index is at most n² − 2 for n ≥ 3", which is at https://hexagonmath.org/2611.00526 on Hexagon. The ancillary files of this paper (programs and logs) are at https://doi.org/10.5281/zenodo.23624550 on Zenodo.

A mix of human-written and AI-generated textHuman understanding: some partsKuzmin's conjectureNagata-Higman theoremnil algebrasnilpotency indexpolynomial identitiessymmetric group
Nov 17, 2026211 pages
PDFView work

math.RA — Rings and Algebras

The relations of a Lie subalgebra considered by Tao: a complete presentation

Contributed by Qiyuan Ma

Let g be the Lie algebra over a field of characteristic 0 generated by D_i, E_i (i ≥ 1), subject to [D_i,D_j] = [E_i,E_j] = 0 and [D_i,E_j] = [D_j,E_i]. Let h be the subalgebra generated by the elements [D_i,E_j] and E_i. On MathOverflow (question 464808), T. Tao asked whether the obvious relations [D_i,E_j] = [D_j,E_i], [E_i,E_j] = 0 and [E_i,[D_j,E_k]] = [E_k,[D_j,E_i]] generate all relations of h. We prove that they do. The proof has four steps: (1) a polarisation argument reduces the problem to multilinear components; (2) we give a presentation of the ideal generated by the E_i; (3) an excess filtration, whose associated graded algebra we compute explicitly, reduces injectivity to an equality of dimensions; (4) that equality follows from the Hilbert series of g, which is given by Eulerian numbers. The Hilbert series in step 4 is equivalent to known results. The multilinear components of the enveloping algebra of the ideal generated by the E_i coincide with the homology of the Losev–Manin spaces: their Betti numbers are due to Losev and Manin (Michigan Math. J. 48 (2000)), and the algebra structure was presented by Dotsenko, Shadrin and Tamaroff (Comm. Math. Phys. 399 (2023)). The paper explains this relation precisely. It also gives an independent, self-contained derivation, using a PBW basis of U(g) obtained from Bergman’s diamond lemma and a sign-reversing involution. By-products: h is a semidirect product of a free Lie algebra and an abelian Lie algebra; the elements [D_i,E_j] (i ≤ j) freely generate a free Lie subalgebra of g; the multilinear components of g have dimensions given by Eulerian numbers (equivalent to known results). We were unable to find the affirmative answer to Tao's question or the freeness statement in the literature. Independent computer checks are included in the separate code archive.

Author comments: 17 pages, version 1.1. This work answers MathOverflow question 464808.

Primarily AI-generated textHuman understanding: some partsGröbner basisHilbert series / Eulerian numbersLie algebrasLosev–Manin spacesMathOverflowPBW basisdiamond lemmafree Lie algebraspresentations by generators and relationsuniversal enveloping algebra
Nov 17, 202617 pages
PDFView work

math.CO — Combinatorics

Wills' (1981) conjecture holds if and only if the dimension is at most 4, and other miscellanea

Contributed by Dave Goel

Let PP be a lattice polytope in Rn\mathbb R^n that is symmetric about the origin and has the origin as its only interior lattice point. In 1981 Wills conjectured that each coefficient gi(P)g_i(P) of the Ehrhart polynomial of PP is at most the corresponding coefficient of the cube [−1,1]n[-1,1]^n, that is, gi(P)≤2i(ni)g_i(P)\le 2^i\binom ni. Wills proved this for n≤3n\le3, and Henze showed in 2014 that it fails for every n≥7n\ge7; the dimensions 44, 55 and 66 remained open. We settle them. In dimension 44 the conjecture holds; the new bounds are g1(P)≤8g_1(P)\le8 and g2(P)≤24g_2(P)\le24, and, up to unimodular equivalence, g1(P)=8g_1(P)=8 only for the cube, one explicit 2424-cell and one explicit cross-polytope. In dimension 55 we give a polytope with 5050 vertices in [−1,1]5[-1,1]^5 whose linear Ehrhart coefficient is 101/10>10101/10>10; products with segments then give counterexamples in every dimension n≥6n\ge6. Hence Wills' conjecture holds in Rn\mathbb R^n if and only if n≤4n\le4. The proof in dimension 44 combines Ehrhart reciprocity, the lower bound theorem for triangulated 33-spheres and an exhaustive computer enumeration of about three million sets of lattice points, listed up to symmetry. This expanded version also gives a second proof of the case in which the integer functionals bounded by 11 on PP do not span R4\mathbb R^4, determines the second largest value of g2g_2 in dimension 44, discusses a width-two approach, describes the computer search for the counterexample, and describes all computations used in the proofs.

Author comments: First version: November 3, 2026. This is the expanded version of the paper "Wills' (1981) conjecture holds if and only if the dimension is at most 4", which is at https://hexagonmath.org/2611.00540 on Hexagon.

A mix of human-written and AI-generated textHuman understanding: some partsEhrhart polynomialWills' conjecturecentrally symmetric polytopeinterior lattice pointlattice polytope
Nov 16, 202626 pages
PDFView work

math.CO — Combinatorics

Wills' (1981) conjecture holds if and only if the dimension is at most 4

Contributed by Dave Goel

Let PP be a lattice polytope in Rn\mathbb R^n that is symmetric about the origin and has the origin as its only interior lattice point. In 1981 Wills conjectured that each coefficient gi(P)g_i(P) of the Ehrhart polynomial of PP is at most the corresponding coefficient of the cube [−1,1]n[-1,1]^n, that is, gi(P)≤2i(ni)g_i(P)\le 2^i\binom ni. Wills proved this for n≤3n\le3, and Henze showed in 2014 that it fails for every n≥7n\ge7; the dimensions 44, 55 and 66 remained open. We settle them. In dimension 44 the conjecture holds; the new bounds are g1(P)≤8g_1(P)\le8 and g2(P)≤24g_2(P)\le24, and, up to unimodular equivalence, g1(P)=8g_1(P)=8 only for the cube, one explicit 2424-cell and one explicit cross-polytope. In dimension 55 we give a polytope with 5050 vertices in [−1,1]5[-1,1]^5 whose linear Ehrhart coefficient is 101/10>10101/10>10; products with segments then give counterexamples in every dimension n≥6n\ge6. Hence Wills' conjecture holds in Rn\mathbb R^n if and only if n≤4n\le4. The proof in dimension 44 combines Ehrhart reciprocity, the lower bound theorem for triangulated 33-spheres and an exhaustive computer enumeration of about three million sets of lattice points, listed up to symmetry.

Author comments: First version: November 3, 2026. The expanded version of this paper, "Wills' (1981) conjecture holds if and only if the dimension is at most 4, and other miscellanea", is at https://doi.org/10.5281/zenodo.23955454 on Zenodo.

A mix of human-written and AI-generated textHuman understanding: some partsEhrhart polynomialWills' conjecturecentrally symmetric polytopeinterior lattice pointlattice polytope
Nov 16, 202613 pages
PDFView work

math.MP — Mathematical Physics

Phase Transition and Spontaneous Translation Symmetry Breaking in Negative Temperature Point Vortex Ensembles

Contributed by Francesco Grotto, Marco Romito

We establish a canonical phase transition and spontaneous translation symmetry breaking for balanced two-species point vortices on the square torus. A sharp inequality identifies the transition at β=4π2\beta=4\pi^2, below collapse at β=16π\beta=16\pi. In the intervening regime, all global minimizers form one translation orbit of an explicit dipole. We prove a large deviation principle below collapse and identify the uniform random phase, phase-centered Gaussian fluctuations, and precise partition asymptotics in the ordered regime. For general prescribed bounded strengths, we distinguish global ordering, local instability, and collapse.

Primarily AI-generated textHuman understanding: some partsNegative TemperaturePhase TransitionPoint vortexSpontaneous Symmetry Breaking
Nov 16, 202665 pages
PDFView work

math.CO — Combinatorics

The Zarankiewicz number z(13,15;3,4)

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

We establish z(13,15;3,4)=114z(13,15;3,4)=114: a 13×1513\times15 binary matrix with 115115 ones necessarily contains an all-one submatrix on three rows and four columns. The lower bound is attained by a previously published construction of Rosero. For the upper bound, we exclude dense eight-row column neighborhoods by a finite classification and a complete extension check. The resulting local inequality reduces a hypothetical counterexample to 6,0196{,}019 pairs of degree sequences. Each pair is excluded by an exact integer certificate for a system of neighborhood-type equations. The proof is computer-assisted; its mathematical reductions, finite search domains, classification representatives, and certificate conditions are given explicitly.

Author comments: Added a public, version-specific archive containing all 15 checked SAT refutations and CNF inputs, all 82 five-row extension inputs and outputs, and all 6,019 exact integer dual certificates, with generators and checking instructions. The manuscript now links release v1 and commit 10385847932cd2b61e25cb4e7d039633d108455b. The computational material was regenerated and independently checked on November 16, 2026.

Primarily AI-generated textHuman understanding: all partsZarankiewicz numbercomputer-assisted proofextremal bipartite graphforbidden submatrix
Nov 16, 202612 pages
PDFView work

math.NT — Number Theory

Consecutive primes at distances 123,662 and 125,318

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

We exhibit consecutive-prime gaps of exactly 123 662123\,662 and 125 318125\,318, with endpoints of 8 4168\,416 and 6 4546\,454 decimal digits, respectively. Covering congruences certify most interior integers as composite. For the second gap, the remaining integers are certified by proper divisors or Fermat witnesses. Elliptic-curve certificates prove all four endpoints prime. We give the elementary arguments that turn these finite arithmetic checks into a proof. The proof is computer-assisted.

Author comments: 4 pages. The supplementary arithmetic appendix supplies the exact covering tables, additional compositeness witnesses, four endpoint primality chains, and elementary order certificates for the terminal primes.

Primarily AI-generated textHuman understanding: all parts
Nov 16, 20264 pages
PDFView work

math.AG — Algebraic Geometry

Essential dimension of geometric local systems

Contributed by Mark Kisin

Let f : X → B be a smooth projective family over a smooth complex variety, and let H = (Rmf∗Z)/tors. We prove that there is an integer N such that, whenever pn ≥N, the essential dimension at p of H/pn is at least the dimension of its period image. This proves the Brosnan–Fakhruddin conjecture for these local systems. The proof compares the geometric Sen operator with the Higgs field. Integral Hodge–Tate theory gives a bound uniform in large primes. For each remaining prime, a bounded rational comparison at one geometric point suffices when n is large.

A mix of human-written and AI-generated textHuman understanding: all partsEssential dimension
Nov 16, 202614 pages
PDFView work

math.DG — Differential Geometry

Smooth isometric bending of a closed sphere

Contributed by Boyang Hu

We construct a smooth embedded sphere Σ⊂R3\Sigma\subset\mathbb R^3 together with a smooth one-parameter family of isometric embeddings of Σ\Sigma whose images are not all congruent. The family is periodic; an inner disk and a complementary cap stay fixed pointwise; and the area, the enclosed volume and the total mean curvature do not change. This gives a flexible closed surface in the smooth category. The mechanism is elementary. A disk whose metric is rotationally symmetric, but whose embedding is not, can be turned inside a fixed shell provided it is exactly planar near its rim. The whole difficulty is to produce such a disk. This reduces to a scalar equation of Monge–Ampère type on an annulus, the Darboux equation, for a height function which must be nonradial and yet constant to infinite order at both boundary circles. We solve this equation by a Nash–Moser argument around an infinitesimal bending of a radial profile. The profile is forced to change the sign of its curvature infinitely often near each boundary circle, so the linearized equation changes type on infinitely many circles accumulating at both ends. We build the profile from explicitly solvable one-dimensional models, describe its accumulating ends by an exact three-term recurrence, and invert the linearized operator on the whole annulus. Two modifications of the linearization, each proportional to an unsolved equation, keep the type-change circles and the characteristic return maps fixed during the iteration, so that all linearized operators act on one domain.

Author comments: 119 pages. The main theorem (Theorem A) has been formalized in Lean 4 with Mathlib: https://github.com/Rogerhu12/continuous-flexibility. The folder anc/ contains four Python scripts which check explicit identities of the text, and the script which draws Figure 2.

Primarily AI-generated textHuman understanding: some partsDarboux equationNash–Moser iterationflexible surfacesisometric deformations
Nov 16, 2026119 pages
PDFView work

math.CA — Classical Analysis and ODEs

Even Asymptotic Expansions and Uniform Hard-Edge Approximations for Wigner 3j3j and 6j6j Symbols at Fixed Rank

Contributed by Antony Lewis

We study Wigner 3j3j symbols with two large and one small angular momentum, and the 6j6j symbols with one small entry (Edmonds' limit), both at fixed rank: the small labels stay fixed while the large ones grow. Their classical limits are Wigner rotation matrix elements. Combining a Regge symmetry with the Weyl shift j↦j+12j\mapsto j+\tfrac12 singles out midpoint variables: for 3j3j, the large scale N=j−+j++1N=j_-+j_++1 (j∓j_\mp the two large angular momenta) and x=2μ/Nx=2\mu/N (2μ2\mu the difference of the two large magnetic indices), and, for 6j6j, large lengths A,B,CA,B,C shifted by offsets that depend on the small labels. Among constant shifts of the large labels and magnetic coordinate, and up to rank-independent gauge factors, these are the only centerings that remove the generic first-order term of the exact recurrences. In these variables the normalized symbols are values of analytic functions of the inverse square of the large scale, for integer and half-integer small labels alike (including spin–orbit coefficients): the expansions contain only even powers and converge. The first correction is a closed formula in one Wigner dd function and its derivative, improving the error from second to fourth order in the inverse large scale; all higher corrections are constructed as local differential operators. The exact finite problems are Hahn and Racah spectral systems with undeformed Wigner spectra. Near the ends of the physical lattice (the hard edges), an explicit product of Pochhammer factors carries the difference between the discrete and continuum weights; extracting it gives expansions that are uniform on the whole lattice, including the 6j6j corner where two large lengths nearly coincide (A≈BA\approx B). We also show that centered Hahn and Racah polynomials are even deformations of Jacobi polynomials.

Author comments: 55 pages, 1 figure.

Primarily AI-generated textHuman understanding: no partsHahn polynomialsRacah polynomialsRegge symmetryWigner 3j symbolsWigner 6j symbols
Nov 16, 202655 pages
PDFView work

math.GR — Group Theory

Which groups are automorphism groups of racks?

Contributed by G. Militaru

Every group is the automorphism group of a graph, of a magma, and even of a set-theoretic solution of the Yang-Baxter equation. We show that this fails for racks and quandles: the quaternion group of order eight is not the automorphism group of any rack, and it is the smallest group with this property. More generally, generalized quaternion groups and Hamiltonian groups are never automorphism groups of racks, and a dicyclic group is the automorphism group of a rack if and only if its order is not divisible by eight. On the positive side, dihedral, alternating and all finite abelian groups are automorphism groups of finite quandles.

Author comments: 19 pages + references. Comments are welcome.

A mix of human-written and AI-generated textHuman understanding: all partsHamiltonian groupautomorphism groupdicyclic groupquandlerackrepresentation problemset-theoretic Yang--Baxter equationuniversal categories
Nov 16, 202622 pages
PDFView work

math.NT — Number Theory

Smooth Numbers in Arithmetic Progressions with Uniformity in the Residue Class

Contributed by Sarvagya Jain

We improve the level of distribution of smooth numbers in arithmetic progressions to x5/8−ϵx^{5/8-\epsilon}, with uniformity in the residue class. In particular, for every ϵ,A>0\epsilon,A>0 and integer k≥1k\geq1, there exist δ,C>0\delta,C>0 such that $$ \sum_{\substack{q\leq x^{5/8-\epsilon}\\(q,a_1a_2)=1}}\tau_k(q)\sup_{0\leq z\leq x} \Biggl|\Psi(z,y;a_1\overline{a_2},q) -\frac{1}{\phi(q)}\Psi_q(z;y)\Biggr| \ll_{\epsilon,A,k}\frac{\Psi(x;y)}{(\log x)^A}, $$ uniformly for x≥2x\geq2, (log⁡x)C≤y≤x1/C(\log x)^C\leq y\leq x^{1/C}, and a1,a2∈Z∖{0}a_1,a_2\in\Z\setminus\{0\} satisfying $$ |a_1|\leq x^{1+\delta},\qquad |a_2|\leq x^\delta,\qquad (a_1,a_2)=1. $$ Here Ψ(z;y)\Psi(z;y) counts the yy-smooth integers up to zz, Ψq(z;y)\Psi_q(z;y) counts those coprime to qq, and Ψ(z,y;a,q)\Psi(z,y;a,q) counts those congruent to aa modulo qq; τk\tau_k is the kk-fold divisor function. The proof combines dispersion with second and fourth spectral moments.

Author comments: This work is an extension to author's work submitted to arxiv concerning an improvement to a prior work of Balog concerning writing positive integers as a sum of two smooth numbers.

Primarily AI-generated textHuman understanding: some parts
Nov 16, 202632 pages
PDFView work

math.NT — Number Theory

Three Properties of Markov–Hurwitz Equations

Contributed by Qiyue Tang

We prove Laurent positivity for pure Markov–Hurwitz mutations, density-one uniqueness by the largest coordinate for positive integral solutions of the symmetric generalized equation, and labelled Vieta connectivity for the pure equation on points with at most one zero coordinate over sufficiently large prime fields.

Author comments: The ideas behind this work came primarily from the author and were developed through discussions with ChatGPT. I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

Primarily AI-generated textHuman understanding: some parts
Nov 16, 202639 pages
PDFView work

math.OA — Operator Algebras

Quantitative similarities for amenable algebras of two-by-two matrix-valued functions

Contributed by Cédric ARHANCET

We study norm-closed subalgebras AA of C(X,M2)\mathrm{C}(X,\mathrm{M}_2) containing the scalar functions, where XX is a compact metrizable space. We characterize amenability of AA by semisimplicity of its fibres and a uniform bound on the norms of the elements 2p−I22p-\mathrm{I}_2 associated with their primitive idempotents. This bound is the exact similarity constant in the faithful representation given by the direct sum of all evaluations. In particular, an amenable algebra of this form admits a similarity to a nuclear C∗\mathrm{C}^*-algebra with cost at most 2AM⁡(A)−1\sqrt{2\operatorname{AM}(A)-1}. The estimate is sharp already for a two-dimensional algebra in M2\mathrm{M}_2. The similarity is constructed from positive matrix-valued functions which are continuous away from the scalar fibres. Although these functions need not be continuous everywhere, the induced algebra isomorphism preserves continuous sections. We also prove the corresponding results for locally trivial bundles of M2\mathrm{M}_2-algebras, and give a noncommutative example for which no continuous matrix-valued similarity is available.

A mix of human-written and AI-generated textHuman understanding: all partsamenable operator algebrascontinuous sectionsmatrix-valued functionsnuclear $\C^*$-algebrasprimitive idempotentssimilarity
Nov 16, 202612 pages
PDFView work

math.RA — Rings and Algebras

Improving Razmyslov's (1974) bound: the Nagata–Higman index is at most n² − 2 for n ≥ 3

Contributed by Dave Goel

Let d(n)d(n) be the least mm such that every associative (not necessarily unital) algebra over a field of characteristic zero satisfying the identity xn=0x^n=0 also satisfies x1x2⋯xm=0x_1x_2\cdots x_m=0; this is the Nagata–Higman index. Razmyslov proved d(n)≤n2d(n)\le n^2 in 1974; Kuzmin proved d(n)≥n(n+1)/2d(n)\ge n(n+1)/2 and conjectured equality; this is the Kuzmin (1975) conjecture. We prove d(n)≤n2−2d(n)\le n^2-2 for n≥3n\ge3 (and, by a simpler case of the same method, d(n)≤n2−1d(n)\le n^2-1 for n≥2n\ge2); in particular d(6)≤34d(6)\le34. To our knowledge, n=6n=6 is the first case in which the new bound improves the known bounds, and this is the first improvement of Razmyslov's bound for general nn. For m=n2−1m=n^2-1 and m=n2−2m=n^2-2, Formanek's criterion reduces d(n)≤md(n)\le m to the statement that no nonzero linear combination of (m+1)(m+1)-cycles lies in one particular isotypic block of the group algebra of Sm+1S_{m+1}. For m=n2−1m=n^2-1 this statement follows from the branching rule; for m=n2−2m=n^2-2 we prove it using the Jucys–Murphy elements and a theorem of Frobenius on the characters of the alternating group. These bounds have also been proved in the Lean proof assistant.

Author comments: First version: October 28, 2026. The expanded version of this paper, "Improving Razmyslov's (1974) bound: the Nagata–Higman index is at most n² − 2 for n ≥ 3, and other miscellanea", is at https://doi.org/10.5281/zenodo.23624549 on Zenodo.

A mix of human-written and AI-generated textHuman understanding: some partsKuzmin's conjectureNagata-Higman theoremnil algebrasnilpotency indexpolynomial identitiessymmetric group
Nov 16, 202614 pages
PDFView work

math.CO — Combinatorics

The Lee (2026) conjecture on the diameters of order and chain polytopes fails in both directions, and other miscellanea

Contributed by Dave Goel

For a finite poset PP, Stanley's order polytope O(P)\mathcal O(P) and chain polytope C(P)\mathcal C(P) have the same number of vertices and, by a theorem of Hibi, Li, Sahara and Shikama, the same number of edges. J. Lee recently conjectured that for a connected poset the diameters of their graphs differ by at most 11. We show that this fails in both directions. For every k≥1k\ge1 we describe a connected poset BkB_k with 3k3k elements on three consecutive antidiagonals of the grid Z2\mathbb Z^2, for which the graph of O(Bk)\mathcal O(B_k) has diameter exactly kk, while the graph of C(Bk)\mathcal C(B_k) has diameter exactly ⌊2k/3⌋+1\lfloor2k/3\rfloor+1. Their difference is therefore ⌈k/3⌉−1\lceil k/3\rceil-1, and their ratio tends to 3/23/2. Hence no constant bounds diam⁡O(P)−diam⁡C(P)\operatorname{diam}\mathcal O(P)-\operatorname{diam}\mathcal C(P) on connected posets. In the other direction, for every n≥4n\ge4 we construct a connected poset PnP_n with 2n2+5n+12n^2+5n+1 elements such that diam⁡O(Pn)=2\operatorname{diam}\mathcal O(P_n)=2 and diam⁡C(Pn)=4\operatorname{diam}\mathcal C(P_n)=4. We also show that diam⁡O(P)≤2\operatorname{diam}\mathcal O(P)\le2 implies diam⁡C(P)≤4\operatorname{diam}\mathcal C(P)\le4 for every finite poset PP, so a difference of 22 is the largest possible at order diameter 22.

Author comments: First version: October 23, 2026. This is the expanded version of the paper "Diameters of the order and chain polytopes of a connected poset", which is at https://hexagonmath.org/2611.00523 on Hexagon.

A mix of human-written and AI-generated textHuman understanding: some partsLee conjecturechain polytopediameterfinite posetgraph of a polytopeorder polytope
Nov 16, 202631 pages
PDFView work

math.CO — Combinatorics

Diameters of the order and chain polytopes of a connected poset

Contributed by Dave Goel

For a finite poset PP, Stanley's order polytope O(P)\mathcal O(P) and chain polytope C(P)\mathcal C(P) have the same number of vertices and, by a theorem of Hibi, Li, Sahara and Shikama, the same number of edges. On disconnected posets the diameters of their graphs can differ by any amount, since both diameters add over disjoint unions and already differ on small examples, but on connected posets a computer search of Lee found no difference larger than 11. We show that on connected posets, too, the two diameters can be far apart. For every k≥1k\ge1 we describe a connected poset BkB_k with 3k3k elements whose order polytope has graph diameter kk and whose chain polytope has graph diameter at most ⌊3(k+1)/4⌋\lfloor3(k+1)/4\rfloor; hence the first diameter can exceed the second by any amount. For every n≥4n\ge4 we construct a connected poset PnP_n with 2n2+5n+12n^2+5n+1 elements whose order polytope has graph diameter 22 and whose chain polytope has graph diameter 44. Finally, for every finite poset PP, if the graph of O(P)\mathcal O(P) has diameter at most 22, then the graph of C(P)\mathcal C(P) has diameter at most 44; so 22 is the largest possible difference when the order polytope has graph diameter 22.

Author comments: First version: October 28, 2026. The expanded version of this paper, "The Lee (2026) conjecture on the diameters of order and chain polytopes fails in both directions, and other miscellanea", is at https://doi.org/10.5281/zenodo.23351398 on Zenodo.

A mix of human-written and AI-generated textHuman understanding: some partschain polytopediameterfinite posetgraph of a polytopeorder polytope
Nov 16, 202619 pages
PDFView work

math.CO — Combinatorics

Flow reconfiguration with one modulus for all graphs, and Cereceda's conjecture for bipartite 2-degenerate graphs

Contributed by Dave Goel

This paper answers a question of Esperet, Hendrey, Lagoutte, Marseloo, Norin and Steiner on flow reconfiguration and makes inroads into Cereceda's recolouring conjecture for d=2d=2. Parts I and II are about flows. For a finite multigraph GG and an integer k≥2k\ge 2, let Mk(G)M_k(G) be the graph on the nowhere-zero Zk\mathbb{Z}_k-flows of GG, and Ik(G)I_k(G) the graph on the integer flows FF of GG with 1≤∣F(e)∣≤k−11\le|F(e)|\le k-1 on every edge; two flows are adjacent if the support of their difference is a cycle. We prove that Mk(G)M_k(G) and Ik(G)I_k(G) are connected for every finite bridgeless loopless multigraph GG if k=40k=40, if k=48k=48, or if kk is a multiple of 44 with k≥52k\ge 52. This answers their Problem 1.2. The same holds for k=66k=66, for every prime power pNp^N with N≥6N\ge 6, and for a set of moduli of natural density one; these results do not cover every k≥40k\ge 40. A master theorem for finite abelian groups gives the connectivity of the flow graph F(G,Γ)F(G,\Gamma) for every abelian group Γ\Gamma of order 4040, and a binary form of it for every abelian group of exponent dividing 44 and order at least 3232, in particular F25\mathbb{F}_2^5 (Esperet et al. proved F28\mathbb{F}_2^8). Part III is about colourings: two proper kk-colourings of a graph GG are adjacent if they differ at exactly one vertex. Cereceda conjectured that this graph has diameter O(n2)O(n^2) for every dd-degenerate graph on nn vertices and k=d+2k=d+2; the case d=2d=2 is open. For four colours we prove the diameter bound 2n(n+1)2n(n+1) for every bipartite graph of degeneracy at most 22, with the order n2n^2 sharp in this class, also at girth 66; the bound 5n(n+1)5n(n+1) when an independent set of vertices of degree at most 22 is added; and, with a computer-verified certificate, 4n(n+1)4n(n+1) for every graph of cone width at most 22, a class that contains all graphs of treewidth at most 22 and some graphs of treewidth 33 with triangles.

Author comments: First version: October 23, 2026. This is the expanded version, with many other results, of the paper "The Cereceda (2007) conjecture holds for bipartite 2-degenerate graphs", which is at https://hexagonmath.org/2611.00260 on Hexagon. The ancillary files of this paper (programs and data) are at https://doi.org/10.5281/zenodo.23603238 on Zenodo.

A mix of human-written and AI-generated textHuman understanding: some partsCereceda conjecturedegenerate graphsflow reconfigurationgraph recolouringnowhere-zero flow
Nov 16, 2026181 pages
PDFView work

math.CO — Combinatorics

Nowhere-zero flow reconfiguration in every finite abelian group of order at least 3024

Contributed by Dave Goel

For a finite multigraph GG and a finite abelian group Γ\Gamma, let F(G,Γ)F(G,\Gamma) be the graph on the nowhere-zero Γ\Gamma-flows of GG in which two flows are adjacent if the support of their difference is a cycle. We prove that F(G,Γ)F(G,\Gamma) is connected for every finite bridgeless multigraph GG and every finite abelian group Γ\Gamma of order at least 30243024. The previous bound for all finite abelian groups, due to Esperet, Hendrey, Lagoutte, Marseloo, Norin and Steiner, is a number with 694694 digits; for the cyclic groups of prime order pp their bound is p>2.26⋅1015p>2.26\cdot 10^{15}. A theorem of an earlier paper of the author covers every group that is not cyclic of prime-power order and whose order has a divisor dd with 4≤d≤∣Γ∣/104\le d\le|\Gamma|/10; from the order 100100 on, it leaves only the cyclic groups whose order is a prime power, twice a prime or three times a prime. For a cyclic factor Zn\mathbb{Z}_n we use units of Zn\mathbb{Z}_n as scales, and we average over a set of scales that is generated by good units. Counts of the bad units settle the orders from 39993999 on, and a finite arithmetic certificate with 230230 rows settles the orders from 30243024 to 39983998.

Author comments: First version: October 23, 2026. The ancillary files of this paper (a certificate checker) are at https://doi.org/10.5281/zenodo.23605837 on Zenodo.

A mix of human-written and AI-generated textHuman understanding: some partsfinite abelian groupflow reconfigurationgroup flownowhere-zero flow
Nov 16, 202632 pages
PDFView work

math.CO — Combinatorics

Integer and modular flow reconfiguration: the moduli up to six, chords, and large moduli

Contributed by Dave Goel

For a finite multigraph GG and an integer k≥2k\ge2, let Mk(G)\mathcal M_k(G) be the graph on the nowhere-zero Zk\mathbb Z_k-flows of GG, and Ik(G)\mathcal I_k(G) the graph on the integer flows FF of GG with 1≤∣F(e)∣≤k−11\le|F(e)|\le k-1 on every edge; a step adds a nonzero constant along one cycle. The Esperet–Hendrey–Lagoutte–Marseloo–Norin–Steiner (2025) lifting question asks for a proof that Ik(G)\mathcal I_k(G) is connected whenever Mk(G)\mathcal M_k(G) is connected; its authors write that they do not know how to prove this even for k=4k=4. We prove it for k=2,3,4,5,6k=2,3,4,5,6 and every graph, in a stronger form: reduction modulo kk induces a bijection between the components of Ik(G)\mathcal I_k(G) and of Mk(G)\mathcal M_k(G). We prove the same for every kk on the graphs in which every cycle with more than nine edges has a chord between two vertices that are not neighbors on the cycle. We also prove that Ik(G)\mathcal I_k(G) is connected for every bridgeless multigraph GG and every k≥mc⁡(G)+2k\ge\operatorname{mc}(G)+2, where mc⁡(G)\operatorname{mc}(G) is the largest number of edges of a cut of GG; and that scaling by mm carries the components of Mk(G)\mathcal M_k(G) into components of Imk(G)\mathcal I_{mk}(G). With a theorem of Esperet et al. on planar graphs, the first result settles the question for every planar graph and every kk. The bijection of the components for k≤6k\le6 holds more generally for the integer and modular kernel vectors of every totally unimodular matrix, with the circuit vectors as steps, and in this generality it fails at every prime p≥7p\ge7, for the tensions of a graph on 2p2p vertices; this does not answer the question for the flows of graphs. For the six moduli k=8,9,12,16,18,36k=8,9,12,16,18,36 we prove the bijection of the components for every graph also; this is a short deduction from a lemma on liftable steps of a companion paper. For the other k≥7k\ge7 this paper does not settle the question on arbitrary graphs.

Author comments: First version: October 23, 2026.

A mix of human-written and AI-generated textHuman understanding: some partsflow reconfigurationinteger flowmodular flownowhere-zero flowtotally unimodular matrix
Nov 16, 202623 pages
PDFView work

math.CV — Complex Variables

Sheil-Small's (1974) covering problem has a positive answer, and other miscellanea

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 both the self-inversive polynomials, whose zeros are symmetric with respect to the unit circle, and the polynomials whose zeros, with multiplicity, are symmetric under taking reciprocals (the literal reading of the problem as printed), so the theorem answers the question under either reading. 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 of the polynomial on the circle. For these polynomials the question is therefore equivalent to asking whether every coefficient has modulus at most half this maximum. O'Hara and Rodriguez and, independently, Saff and Sheil-Small proved this in 1974 for every coefficient except the middle one, and Kristiansen proved the middle case in 1979. The new case is that of polynomials with zeros off the unit circle. We treat this case with the Schur–Cohn Hermitian form of the polynomial minus a value that it does not take in the disc. This expanded version adds a description by rays of the image of a self-inversive polynomial, two examples, and the trigonometric form of the middle case. The results of Sections 2–5 are also proved in Lean 4, with the coefficient bound taken as given.

Author comments: First version: November 2026. This is the expanded version of the paper "Sheil-Small's (1974) covering problem has a positive answer", which is at https://hexagonmath.org/2611.00154 on Hexagon.

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

math.DG — Differential Geometry

The dimension-free symmetric Gaussian isoperimetric profile: finite attainment and critical rank

Contributed by Sihan Chen

We determine the infimum of Gaussian perimeter over centrally symmetric sets when the ambient dimension is allowed to vary. The answer is the lower envelope of the perimeters of centered balls and their complements. At every mass other than one half the infimum is attained in finite dimension, proving the finite-attainment conjecture stated by Heilman. Every attaining ball rank is at most 1/(2∣a−1/2∣2)1/(2|a-1/2|^2). At mass one half the value is 1/π1/\sqrt\pi and no finite-dimensional centrally symmetric set attains it. Every optimal ball rank satisfies k∣a−1/2∣2→1/(9π)k|a-1/2|^2\to1/(9\pi) as a→1/2a\to1/2. The profile has expansion π−1/2−(3π/2)∣a−1/2∣2+O(∣a−1/2∣4)\pi^{-1/2}-(3\sqrt\pi/2)|a-1/2|^2+O(|a-1/2|^4), and it yields the sharp even Gaussian Cheeger inequality. The geometric input is Viana's classification of isoperimetric regions in real projective spaces. The additional step is a stability estimate that controls the smaller of the two spherical ranks away from half volume and identifies the only regime in which both ranks can escape to infinity.

Primarily AI-generated textHuman understanding: some partsCheeger inequalityGaussian isoperimetrycentral symmetryfinite attainmentreal projective spacevolume-preserving stability
Nov 16, 202614 pages
PDFView work

math.NT — Number Theory

A narrower admissible 234 360 000-tuple and H_5 <= 4 891 341 734

Contributed by David Niedbala Giraudin

Let H_m = liminf (p_{n+m} - p_n). Kapila proved DHL[234360000,6] and deduced H_5 <= 5040082836, the diameter of the tuple formed by the 234360000 smallest primes larger than 234360000. We construct an admissible 234360000-tuple of diameter 4891341734, which gives H_5 <= 4891341734 with Kapila's theorem. The tuple consists of +-1 and of +-q for primes q in a symmetric window, with 1746831 primes removed; its admissibility is checked by two independent programs.

Primarily AI-generated textHuman understanding: no partsMaynard-Tao sieveadmissible tuplesbounded gapscomputer-assisted proofgaps between primes
Nov 16, 20263 pages
PDFView work

math.NT — Number Theory

A lower bound 0.11096505 for Romanoff's constant

Contributed by David Niedbala Giraudin

Let d be the lower density of the integers of the form p + 2^a with p prime and a >= 1. We prove d >= 0.11096505, unconditionally. The previous best unconditional bound is d >= 0.110825, due to Tomar. The proof is Tomar's method, with the same analytic inputs, applied to a different modulus of the same period 27720; the bound is certified in exact rational arithmetic by Tomar's checking program, with changes that only make the computation faster and that we verify against the original program.

Primarily AI-generated textHuman understanding: no partsPintz inequalityRomanoff's constantSelberg sievecomputer-assisted proofprimes and powers of two
Nov 16, 20263 pages
PDFView work

math.NT — Number Theory

Consecutive primes at distance 122,290

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

We exhibit two consecutive primes whose difference is exactly 122 290122\,290. Both primes have 8 2628\,262 decimal digits. Every integer strictly between them has a prime divisor at most 32 46732\,467. We give the covering argument and the elliptic-curve criterion that certify the result. The proof is computer-assisted and uses finite arithmetic checks to establish endpoint primality and the compositeness of every interior integer.

Author comments: 3 pages. The supplementary arithmetic appendix supplies the full covering table and both endpoint primality chains.

Primarily AI-generated textHuman understanding: all parts
Nov 16, 20263 pages
PDFView work

math.ST — Statistics Theory

The planar data-selection constants F(2,n)=2n/(2n−1)F(2,n)=2n/(2n-1), including F(2,3)=6/5F(2,3)=6/5 and F(2,2)=4/3F(2,2)=4/3

Contributed by Samuil Petkov

For a finite multiset D⊂R2D\subset\mathbb{R}^2 let LD∗L_D^* be the least mean squared distance from a point to DD, and let LD∗(n)L_D^*(n) be the least such loss attained at the average of nn points selected from DD with repetition. Hanneke, Moran, Shlimovich and Yehudayoff asked for F(d,n)=sup⁡DLD∗(n)/LD∗F(d,n)=\sup_D L_D^*(n)/L_D^*. We prove F(2,n)=2n/(2n−1)F(2,n)=2n/(2n-1) for every n≥2n\ge2: every finite planar multiset satisfies LD∗(n)≤2n2n−1LD∗L_D^*(n)\le\frac{2n}{2n-1}L_D^*, with equality for 2n−12n-1 copies of (0,0)(0,0) and one copy of (1,0)(1,0). In particular F(2,3)=6/5F(2,3)=6/5, and F(2,2)=4/3F(2,2)=4/3 receives a short proof. The proof reduces to three support points by a mean-preserving Carathéodory argument and then exhibits an explicit random selection of nn support points, supported on one small triangle of the selection grid, whose second moment about the population weights is dominated by 12n−1\frac{1}{2n-1} times the categorical covariance. For n∈{2,3}n\in\{2,3\} we also give random selections attaining this second moment exactly.

Author comments: 6 pages. Determines F(2,n) for all n, resolving the d=2 row of Question 1 of the COLT 2025 open problem "Data selection for regression tasks" (Hanneke, Moran, Shlimovich, Yehudayoff).

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

math.NT — Number Theory

A DETAILED FINITE-CARRY PROOF OF A CONJECTURE ON PERMUTATION BINOMIALS IN CHARACTERISTIC TWO

Contributed by yi li

Let q = 2m, where m ≥ 5 is odd and 3 | m. Tu, Zeng, Jiang and Li formulated a conjecture asserting that if a family of Hermite-type sums Sr,α(y), attached to the binomial xr(a+ x3(q−1)), vanishes for every α with 3 | (1 + α), then y3 = 1. We give a detailed proof, including all exceptional and boundary cases. In fact, seven indices suffice: α ∈ {2,8,14,20,26,32,38}. The first two indices reduce a hypothetical counterexample to a primitive seventh root of unity. Lucas’s theorem then turns the remaining equations into six-bit conditions, and an explicit finite carry elimination completes the proof. The paper records the complete residue tables, their derivation, and a short SageMath verification certificate.

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

math.NT — Number Theory

Pair correlation of LL-zeros and Hooley's conjecture

Contributed by Travor Zihao Liu

In this article, we study the form factor for zeros of Dirichlet LL-functions, pairing zeros of the same LL-function and then averaging over primitive characters modulo a prime conductor. Unconditionally, we show for ∣α∣<1|\alpha|<1 that the form factor agrees with the random matrix prediction from the Circular Unitary Ensemble (CUE). Under GRH and the Hardy--Littlewood twin primes conjecture, we extend this agreement to ∣α∣<2|\alpha|<2. For ∣α∣≥1|\alpha|\ge1, we prove that the CUE prediction is equivalent to Hooley's conjecture for the variance of primes in arithmetic progressions with prime moduli. We also explore applications of these form-factor results to the simplicity of zeros.

Primarily human-written textHuman understanding: all parts
Nov 16, 202622 pages
PDFView work

math.GM — General Mathematics

An Algebraic Proof of Hilbert Nullstellensatz over Rationals

Contributed by liang zhang, Xiaohua(Michael) Xuan

We, with the aid of AI, prove a finite approximate form of the weak Nullstellensatz over the Gaussian rationals: Let f1,…,fmf_1,\ldots,f_m be polynomials in nn variables with rational complex coefficients. If there are no polynomials g1,…,gmg_1,\ldots,g_m in the same variables with rational complex coefficients such that 1=g1f1+⋯+gmfm1=g_1f_1+\cdots+g_mf_m. (A finite Gr\"obner basis computation decides whether such polynomials exist.), then, for any positive rational number ε\varepsilon, there exists a pont zz with nn rational complex coordinates such that \[ \sum_{j=1}^{m}\N(f_j(z))<\varepsilon^2, \] where N(a+ib)=a2+b2\N(a+ib)=a^2+b^2. The proof is constructive and relis only on finite rational arithmetics without using real numbers or infinite sets concepts, and extends authors' earlier one-vaiable result on Fundemental Theorem of Algerba to several-varaibles case.

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

math.CA — Classical Analysis and ODEs

Closed-Form Adiabatic Asymptotics of the Solution of the Amsler Equation

Contributed by Anton Kalmykov

We consider the regular solution y(x;s)y(x;s) of the Amsler equation (xy′)′=sin⁡y(xy')'=\sin y, y(0)=πsy(0)=\pi s, y′(0)=sin⁡πsy'(0)=\sin\pi s, with s∈(0,1)s\in(0,1), and prove that as x→∞x\to\infty it is approximated, with accuracy O(τ−5/2)O(\tau^{-5/2}) for τ=2x\tau=2\sqrt{x}, by an explicit closed-form adiabatic ansatz yady_{\rm ad}: a libration of the pendulum w′′+sin⁡w=0w''+\sin w=0 (w=y−πw=y-\pi) whose parameter m0(τ)m_0(\tau) is determined by the adiabatic invariant τ ℓ(m0)=πν\tau\,\ell(m_0)=\pi\nu, where ℓ(m)=E(m)−(1−m)K(m)\ell(m)=E(m)-(1-m)K(m) and ν=π−1ln⁡csc⁡πs2\nu=\pi^{-1}\ln\csc\frac{\pi s}{2}, and whose phase is Φ=τf(m0)+Θ0−18τ\Phi=\tau f(m_0)+\Theta_0-\frac{1}{8\tau} with f(m)=E(1−m)−mK(1−m)f(m)=E(1-m)-mK(1-m) and Θ0=C2+ν(1+ln⁡8ν)\Theta_0=C_2+\nu(1+\ln\frac{8}{\nu}); explicitly, yadx)=π+2arcsin⁡ ⁣(m0 sn(2K(m0)πΦ ∣ m0))y_{\rm ad} x)=\pi+2\arcsin\!\bigl(\sqrt{m_0}\,\mathrm{sn}\bigl(\tfrac{2K(m_0)}{\pi}\Phi\,\big|\,m_0\bigr)\bigr). The proof combines elementary adiabatic analysis of the damped pendulum (residual estimates, absence of low-order resonances, an approximate fundamental system) with two external inputs stated explicitly: Maevsky's asymptotics for yy and the Its--Novokshenov/Kitaev connection formula for the sine-Gordon (D8D_8) reduction of the Painlev\'e III equation. The matching of the two determines the amplitude and phase constants in closed form, C1=8νC_1=\sqrt{8\nu}, C2=5π4+arg⁡Γ(1+iν)−3νln⁡2C_2=\frac{5\pi}{4}+\arg\Gamma(1+i\nu)-3\nu\ln2; in particular, the result is a closed-form description of the large-xx behaviour of every regular solution (up to the symmetries y↦−yy\mapsto-y, y↦y+2πy\mapsto y+2\pi), conditional on the two external inputs and with no fitting parameters.

Primarily human-written textHuman understanding: all partsAmsler equationPainleve III equationadiabatic invariantsconnection formulaselliptic integralssine-Gordon equation
Nov 16, 202634 pages
PDFView work

cs.FL — Formal Languages and Automata Theory

A uniform 7/48 cubic upper bound for reset thresholds

Contributed by SUNGBIN HONG

We prove that every complete synchronizing deterministic finite automaton AA with nn states satisfies rt⁡(A)≤748n3+o(n3)\operatorname{rt}(A)\le\frac{7}{48}n^3+o(n^3), uniformly over the automaton and its finite alphabet. The coefficient is the milestone proposed in Trahtman's 2011 half-rank approach. The argument fixes a short word whose kernel is stable over a dyadic length interval. Degree transport in the graphs of pairs mergeable by short words, combined with a simultaneous selection of times of small degree growth, gives a compression bound for every sufficiently large subset of states. The bound remains available after replacing the current word. We combine it with the cheap-gap construction and the Pin--Frankl rank upgrade: the cost of reaching half rank is paid by a saving in the subsequent rank reductions. The required scalar comparison has an elementary analytic proof over its entire parameter domain. An explicit two-parameter estimate proves uniformity and extends the result from strongly connected automata to arbitrary complete synchronizing automata. The full theorem, including the word constructions used as classical inputs, has also been formalized in Lean 4.

Author comments: 14 pages, including two appendices. Uniform asymptotic bound over all complete synchronizing DFAs and finite alphabets. A separate Lean 4 development and recorded verification artifact are described in the paper; code is not included in this Hexagon deposit.

Primarily AI-generated textHuman understanding: no partsCerny conjectureSynchronizing automatondegree transportformal verificationreset threshold
Nov 16, 202614 pages
PDFView work

math.PR — Probability

Stationary prediction from finite calibration: obstructions and sharp history rates under interval catastrophes

Contributed by Man Huang

Can calibration experiments confined to a fixed spatial diameter determine stationary block probabilities on larger spatial scales? We answer this question for a one-dimensional recovery process driven by independent rows of Poisson interval catastrophes with an unknown intensity law, under a common small recovery-weighted intensity budget. For every calibration diameter, two laws have exactly the same complete local damage-word distributions and deterministic-initial experimental transcripts, even under arbitrarily many adaptive repetitions, while a sufficiently large stationary block has probabilities separated by a positive constant. The pair also matches intensity moments of orders zero, one and two and the eventual power-law parameters. For the upper stationary open phase, we then prove that all-open finite-history approximations converge uniformly over a law class and all finite targets if and only if the recovery-weighted tails vanish uniformly. Under a common intensity-moment budget of order 2+ϵ2+\epsilon, 0<ϵ≤10<\epsilon\le1, the worst missing-history error has matching scale min⁡{b,B[max⁡(m0,T)]−ϵ}\min\{b,B[\max(m_0,T)]^{-\epsilon}\}, with constants depending only on a fixed small recovery budget bb. Here TT counts retained physical rows, BB is the moment budget and m0m_0 the minimum interval length. The lower bound holds at one fixed site; the upper bound covers every finite target and the full moment class, including zero intensity and laws without regular variation. Together, these results identify the obstruction to local calibration, the exact tail condition for uniform history approximation, and the sharp deterministic depth of the all-open truncation.

Author comments: 28 pages, including all references and Appendices A-C. English text of version 2026-11-16.1. Complete bilingual edition, source and finite diagnostic materials: https://doi.org/10.5281/zenodo.24268525 (https://zenodo.org/records/24268525).

Primarily AI-generated textHuman understanding: some partscorrelated catastrophesfinite calibrationhistory truncationpartial identificationstationary prediction
Nov 16, 202628 pages
PDFView work

math.QA — Quantum Algebra

Maximal torus theory for crossed product quantum groups

Contributed by Teo Banica

We give counterexamples to three proposed tests for characters, amenability and polynomial growth using the group-dual subgroups of a compact matrix quantum group. For an action on a compact connected Lie group, a single such subgroup detects all three properties exactly when the action preserves a maximal torus of the base. For a lattice bicrossed product whose compact factor has infinitely many components, failure of character detection is witnessed by a class function on that factor, and a torus of a quantum quotient detects exponential growth. These results suggest three conjectures. The character conjecture uses the quotient by the quantum center. The amenability and growth conjectures use tori of cocycle twists of quantum quotients.

Primarily AI-generated textHuman understanding: some partsCrossed productMaximal torus
Nov 16, 202630 pages
PDFView work

math.GT — Geometric Topology

Spherical space forms in K3: an instanton parity argument

Contributed by Peter Kronheimer, Tomasz Mrowka

Let RR be a connected subdiagram of the Dynkin diagram E8E_8, and let YRY_R be the spherical three-manifold which bounds the corresponding plumbing of (−2)(-2)-spheres. We show that if a negative-definite four-manifold NN with H1(N)=0H_1(N)=0 and oriented boundary YRY_R is embedded in the K3 surface, then the intersection form of NN is the negative-definite root lattice −R-R. As a consequence, the traces of −2-2 and −4-4 surgery on the left-handed trefoil do not embed in K3. Heegaard Floer correction terms and the theory of lattices reduce the theorem to the exclusion of one smaller lattice for each of R=D5R=D_5, D6D_6, D7D_7 and E7E_7. In these cases, stretching the K3 surface along YRY_R exhibits a zero-dimensional moduli space of instantons as the zero set of a section of a real two-plane bundle over a compact surface. The quaternionic nature of the linearized anti-self-duality equations on K3 shows that the Euler number of this bundle is even, while the corresponding Donaldson invariant is odd.

Primarily AI-generated textHuman understanding: some partsInstanton homologyTait colorings
Nov 16, 202623 pages
PDFView work

math.PR — Probability

Towards a conformal field theory of critical percolation. I. The bulk stress tensor and Ward identities.

Contributed by Alberto Gandolfi

We construct joint correlations of the bulk holomorphic stress tensor and the density field for critical site percolation on the triangular lattice, allowing any fixed finite numbers of insertions at separated points in the plane. Density correlations encode open-cluster connections; their two-point function is the renormalized probability that an open path joins two marked sites. Each stress insertion probes the directional response of these connections by closing and rotating a small ellipse and extracting the second angular component. To justify this construction, we extend Camia’s existence and conformal covariance results for density correlations from simply connected domains to the domains with finitely many analytic holes created by the ellipses, and prove uniform bounds for combining these correlations with the local ellipse responses. The main estimate controls the complete frontier record: the second angular coefficient has a comparable-scale defect of order (r/d)^(9/4), giving a Cauchy exponent 1/4 after quadratic normalization. The limits require no radius averaging, are distributions in the density coordinates, and are independent of the fixed ellipse shape parameters. They satisfy the conformal Ward identities with central charge zero and yield sequential stress-collision and contour identities.

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

math.NT — Number Theory

Geometric Equivalence of the Riemann Hypothesis

Contributed by FELIPE MARTINS SANTOS

We study the complex rational extensions of two sequences, called SeqImpar and SeqPar, and the way their geometric images relate to the nontrivial zeros of the Riemann zeta function. We prove that I(z) = 5 − 4/(z − 1) maps the critical line Re(z) = 1/2 to the circle |w − 9| = 4, and that, for w = I(ρ), rational inversion recovers exactly the coordinates Re(ρ) and γ = Im(ρ). We show that SeqPar induces a second rational curve and that its extension is injective in the half-plane Re(z) > 0. To distinguish points corresponding to zeta zeros from the other points on these curves, we use a Dirichlet series weighted by the convergence errors of the sequences and prove the correspondence between its poles and the nontrivial zeros. This yields a geometric criterion rigorously equivalent to the Riemann Hypothesis: all relevant poles of the transformed function must lie on the indicated circle. We present formulas for extracting ordinates using residues and contour integrals, together with numerical checks involving the first five known zeros. The results constitute an exact reformulation of the hypothesis, not a proof of its truth or an independent algorithm for computing new zeros.

Author comments: A parallel construction holds for SeqPar’s curve CP . These characterizations do not prove RH; they make the geometric equivalence explicit and locate the remaining difficulty in independently determining the poles of the transform. https://doi.org/10.5281/zenodo.24247902

A mix of human-written and AI-generated textHuman understanding: all partsRiemann Hypothesis
Nov 15, 202610 pages
PDFView work

math.NA — Numerical Analysis

Geometric Root Calculators: Radical supports of orders five and nine and real-degree enclosures in the Pandrosion rectangle

Contributed by Ivan BESEVIC

We study ruler-and-compass iterations for the positive root X1/pX^{1/p} that share one rectangle, one power stage and one readout, and differ only in a support line. Every support approximates the same target function κ∗(t)=(t−1)/(t1/p−1)\kappa_*(t)=(t-1)/(t^{1/p}-1) of the residual tt, and the contact order of the approximation fixes the order of the iteration. Besides the classical supports of orders one to four we treat three radical supports. A decentered arc gives a globally monotone fifth-order iteration. Two supports have local order exactly nine for every real p>2p>2 and converge monotonically from every positive start: a support built from two successive mean proportionals, with error constant 7/6487/648 for cube roots, and a combination of the arithmetic mean, the geometric mean and one conic mean of 11 and tt, with error constant 23/2073623/20736 for cube roots, drawn with three arcs. For integer p≥3p\ge 3 one step costs at most 10p+910p+9 elementary traces for the decentered arc, 10p+1110p+11 for the three-mean support and 10p+5910p+59 for the nested support; measured by the efficiency index, and under the stated counting conventions, the three-mean support is preferable for every p≥3p\ge3. We then separate what is a finite construction from what is only a scalar statement: the fast iterations are finite constructions for rational degrees, whereas for irrational pp a single step is not. For arbitrary real p≠0p\neq 0 a power-free subdivision with one final Padé readout encloses the root with relative width at most z5/256z^5/256 in at most 15n+6315n+63 traces after nn subdivisions (for X>1X>1, p≥1p\ge 1). Global convergence and the local orders with their constants, for the three radical supports and every real p>2p>2, are checked in Lean, as are the degree, approximation and efficiency statements; the drawing inventories are written protocols.

Author comments: Version 29, a revision of V28. New in this version: the three-mean support of Section 5, with its Lean proofs, its construction and its inventory; the comparisons of Section 6 are updated. The verifier anc/verify_v29.py recomputes the constants, identities and tables (SymPy, mpmath). LaTeX sources, verifiers and the Lean 4 / Mathlib formalization: https://github.com/ivan-fr/pandrosion

Primarily AI-generated textHuman understanding: some parts
Nov 15, 202631 pages
PDFView work

math.DG — Differential Geometry

An unconditional estimate and the structure of the Bäcklund orbit

Contributed by Anton Kalmykov, Alexander Timmermans

Let ff be an arbitrary C∞C^\infty solution of the sine-Gordon equation fxy=sin⁡ff_{xy}=\sin f in the square W=[−L,L]2W=[-L,L]^2, and let ωn\omega_n be obtained by nn successive B\"acklund transformations with arbitrary real parameters a1,…,an>0a_1,\dots,a_n>0 and arbitrary normalization constants cjc_j. For a solution ω\omega let r(ω)r(\omega) be the associated smooth map of a surface of curvature K=−1K=-1 (Chebyshev net, common initial frame at the origin). We prove the unconditional estimate ∥r(ωn)−r((−1)nf)∥L∞(W)≤Kn∑j=1n1/aj\|r(\omega_n)-r((-1)^n f)\|_{L^\infty(W)}\le K_n\sum_{j=1}^n 1/a_j, Kn=3L2+(1+L)π(2T∗+π)3n−1K_n=3L^2+(1+L)\pi(2T_*+\pi)3^{n-1}, T∗=sup⁡∣x∣≤L∫−LL∣fy∣ dyT_*=\sup_{|x|\le L}\int_{-L}^{L}|f_y|\,dy, with no restrictions on the aja_j, their ratios, the cjc_j, or LL. The proof reduces the problem to a cascade of forced pendulum equations, controlled by an integral Lyapunov estimate and by cumulative estimates for the orthogonal Gauss-Weingarten propagator. For the Amsler seed f=Y(xy)f=Y(xy) we show T∗≤2L2T_*\le 2L^2, which gives an explicit constant; the order 1/a1/a is sharp. We also study the dependence on the data: smoothness along finite-dimensional families, continuity on the Fr\'echet data space, convergence of the immersions in C0C^0 and W1,pW^{1,p} although the solutions ωn\omega_n themselves need not converge, partial limits along arbitrary index sets for aj→∞a_j\to\infty and for aj→0a_j\to0, and a two-chamber structure of the orbit under B\"acklund chains.

Author comments: The interactive demonstration is suppelmetary materials

Primarily human-written textHuman understanding: all partsAmsler surfacesBacklund transformationBianchi permutability theoremChebyshev netssine-Gordon equationsurfaces of constant negative curvature
Nov 15, 202646 pages
PDFView work

math.NT — Number Theory

Vieta invariants and Markoff–Hurwitz orbits

Contributed by Qiyue Tang

We classify rational Vieta invariants for Guéritaud's family in characteristic zero, including every nonzero fiber. For each positive integer coefficient and each dimension residue class, we construct infinitely many Markoff–Hurwitz equations with infinitely many maxima shared by at least any prescribed number of distinct positive integer orbits.

Author comments: The ideas in this article originated in the author’s own work and in discussions with ChatGPT. I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

Primarily AI-generated textHuman understanding: some parts
Nov 15, 20266 pages
PDFView work

math-ph — Mathematical Physics

From Four-Dimensional Wilson Lattice Gauge Theory to Quantum Yang--Mills Theory: Construction with Proofs from Certified Assumptions, and the Record of Its Independent Validation

Contributed by Zeng Chunping

We present a complete formal paper compiling the Lean-verified construction of quantum Yang--Mills theory submitted on October 28, 2026, and independently validated by the Yang--Mills Shepherding Committee. Starting from the Wilson definition of lattice gauge theory on a four-dimensional torus, we give full proofs of every step that can be carried out from the definitions: the field-label algebra, the finite lattice theory, and---under an explicit, individually certified package of renormalization-group and analytic assumptions (RG1)--(RG5), (UV1), (PH1)--(PH3), (AN1), (Y1)--(Y4), (B1), (C1)---the fixed-volume ultraviolet limit, the subsequential infinite-volume limit, the phase decomposition with clustering and full support, the Osterwalder--Schrader reconstruction satisfying the Wightman axioms, and the Yang--Mills identification: the stress tensor and its Ward identity, the trace anomaly with the verified constant 3dim⁡Rg/π43\dim_{\mathbb{R}}\mathfrak{g}/\pi^{4}, the exclusion of a precise class of free-field descriptions, the one-loop running coupling, and the operator product expansion. The independent validation (clean rebuild, Lean kernel replay, Comparator runs, the verification of the OS axioms against an independent axiom system, and the lattice-law, Ward-identity, common-scale, short-distance, and OPE adapters) is recorded in the second part. Two errata to the source validation document are corrected in the text. For the mass gap we prove two logical boundaries: an explicit OS model satisfies all sixteen registered inputs, with E4 clustering (equivalently, vacuum uniqueness) holding, yet its Hamiltonian has no spectral gap, and a mass gap is equivalent to a uniform exponential rate in the clustering axiom E4; the sixteen registered inputs therefore do not imply a mass gap. The gap problem is reduced to a single volume-uniform, label-uniform rate (MG); the cluster-expansion, spectral, rate and Wilson-loop routes, the random-mechanics criteria, the source-level adjudication, and the complete status are recorded in an appendix. A positive mass gap, uniqueness of the infinite-volume limit, uniqueness of the vacuum of the mixed theory, and order-by-order agreement of the OPE with perturbation theory are not proved, and the paper records precisely what is and is not proved at every step.

Author comments: Recompiled with complete proofs from the committee's validation document (2026-11-10 release) of the Lean-verified OpenAI Yang--Mills construction (2026-10-28), incorporating the readable re-proof and the review-and-supplement packages. All proofs that can be carried out from the definitions and the certified assumption package (16 external inputs) are given in full; two errata of the source document are corrected (the $I^2=1$ contraction identity and the $\log^2$ weight of the free-field exclusion). The mass-gap problem is reduced to the single uniform rate (MG); Appendix E records the complete adjudicated status including rate theorems, counterexample families, cluster-expansion and local-mixing routes, and source-level adjudications.

A mix of human-written and AI-generated textHuman understanding: some partsLeanOPEOS/Wightman axiomsRGWilson latticeYang-Millsconstructive QFTmass gaptrace anomaly
Nov 15, 202681 pages
PDFView work

math.NT — Number Theory

The reciprocal cube sums of Lucas sequences of quadratic units are irrational

Contributed by Shawn Krisman

Let η>1\eta>1 be a unit of a real quadratic order and Un=(ηn−ηˉn)/(η−ηˉ)U_n=(\eta^n-\bar\eta^n)/(\eta-\bar\eta) its Lucas sequence. We prove that ∑n≥1Un−3\sum_{n\ge1}U_n^{-3} is irrational. Equivalently, ∑n≥1Un(P,Q)−3∉Q\sum_{n\ge1}U_n(P,Q)^{-3}\notin\mathbb{Q} for the Lucas sequences with Q=−1Q=-1, P≥1P\ge1, and with Q=1Q=1, P≥3P\ge3. In particular the sums of the reciprocal cubes of the Pell numbers and of the numbers FknF_{kn}, for every k≥1k\ge1, are irrational. The case of the Fibonacci numbers was treated in earlier work of the author; the proof here is the same Hankel-determinant construction, carried out for a general unit and for both signs of its norm. The constants of the argument do not depend on η\eta once they are measured in units of log⁡η\log\eta. The whole argument is formalised in Lean 4 with Mathlib.

Primarily AI-generated textHuman understanding: no partsFibonacci numbersHankel determinantsLeanLucas sequencesPell numbersirrationalityq-series
Nov 15, 202613 pages
PDFView work

math.NT — Number Theory

Density-One Uniqueness for Markoff–Hurwitz Solutions

Contributed by Qiyue Tang

For each fixed integer n≥4n\ge4, we prove that almost every positive integer solution of ∑i=1nxi2=n∏i=1nxi\sum_{i=1}^n x_i^2=n\prod_{i=1}^n x_i is determined up to permutation by its largest coordinate. The density is taken over sorted solutions with largest coordinate at most RR, as R→∞R\to\infty.

Author comments: The author initiated this project to extend the density-one uniqueness results in William Y. Chen’s *Almost all Markoff numbers are unique* and the author’s earlier *Almost all \(k\)-Markov numbers are unique* to the standard Markoff–Hurwitz equation in \(n\ge 4\) variables. Both preprints appeared on Hexagon. [Chen, 2610.00281v2](https://hexagonmath.org/2610.00281v2) · [Tang, 2611.00216v1](https://hexagonmath.org/2611.00216v1) I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

Primarily AI-generated textHuman understanding: some parts
Nov 15, 202620 pages
PDFView work

math.AG — Algebraic Geometry

A Counterexample to the Realizability Conjecture for Surface Classes

Contributed by Qiyue Tang

We give a counterexample to Huang–Huh–Michałek–Wang–Wang’s conjecture on the real realizability of universally pseudoeffective surface classes.

Author comments: I am sharing this paper on behalf of a friend who obtained the result using AI, solely to make the mathematical result available, and neither of us claims credit for it.

Primarily AI-generated textHuman understanding: no parts
Nov 15, 20266 pages
PDFView work