Browse

All works

Browse the Hexagon catalog.

Newest works

1110 works

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

math.CO — Combinatorics

An Irredundant Test for Circular Positivity

Contributed by Qiyue Tang

We give an inclusion-minimal circular-minor positivity test on five boundary vertices that is not weakly separated. This refutes the inclusion-minimal version of Conjecture 6.3.4 of Alman, Lian and Tran.

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

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

math.RT — Representation Theory

Unramified multiplicity one spherical pairs

Contributed by Rui Chen

Let pp be an odd prime and let kk be a finite extension of Qp\mathbb{Q}_{p}. We study the distinction between multiplicity one for unramified representations and multiplicity one for irreducible unitary representations. We prove that (G2, SL3) has the former property but not the latter. The unramified multiplicity one assertion uses spherical functions and the spherical Hecke module. For the failure of multiplicity one property, we use Weil representations and theta lifting to obtain an irreducible unitarizable representation with at least two independent SL3(k)-invariant linear forms.

A mix of human-written and AI-generated textHuman understanding: some partsGelfand pairsmultiplicity one property
Nov 15, 202618 pages
PDFView work

math.CO — Combinatorics

Schur Nonnegativity of Double-Wiring Cluster Variables

Contributed by Qiyue Tang

We prove Cuenca’s conjecture that every cluster variable of the matrix cluster algebra associated with a double wiring diagram evaluates to a Schur nonnegative symmetric function on every generalized Jacobi–Trudi matrix. The result extends to cluster monomials.

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

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

math.DS — Dynamical Systems

Complex central configurations of the planar five-body problem at special masses

Contributed by Tejasvi Singh Tomar

We study the complex solution sets of the polynomial system for planar central configurations of five bodies, modulo rotations, at the masses (1,4,4,4,4)(1,4,4,4,4), (1,1,4,4,4)(1,1,4,4,4) and (9,36,36,36,4)(9,36,36,36,4), where the proof of finiteness for all positive masses in a companion paper counts the real central configurations. At (1,4,4,4,4)(1,4,4,4,4) the solution set is the union of 3636 explicit, pairwise disjoint irreducible curves and a finite set; the curves contain the modified Roberts continuum of Albouy and Kaloshin, up to relabelling the bodies, but none of their points is a positive central configuration. At (1,1,4,4,4)(1,1,4,4,4) the solution set is finite, and at (9,36,36,36,4)(9,36,36,36,4) the potential, which is positive at every central configuration, vanishes identically on every curve in the solution set, so these curves contain no positive central configuration. Finiteness at these masses, their positive multiples and their permutations therefore follows without a count. We also show that at positive masses two of the limit diagrams of Albouy and Kaloshin occur only for masses on finitely many explicit curves in the projective space of masses.

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

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

math.CA — Classical Analysis and ODEs

Bounds for the sign uncertainty constant in dimension one

Contributed by Tejasvi Singh Tomar

Bourgain, Clozel and Kahane proved that a nonzero even real function ff on R\mathbb{R} with ff and f^\widehat{f} integrable, f(0)≤0f(0)\le0 and f^(0)≤0\widehat{f}(0)\le0 cannot have ff and f^\widehat{f} both nonnegative outside an arbitrarily small neighborhood of the origin. The sharp constant in this sign uncertainty principle is A+(1)A_+(1), the infimum of A(f)A(f^)\sqrt{A(f)A(\widehat{f})} over all such ff, where A(f)A(f) is the radius beyond which ff is nonnegative; its square is the constant of Problem 6.11 in the list of Georgiev, Gómez-Serrano, Tao and Wagner. We prove 0.5502<A+(1)≤0.55090.5502<A_+(1)\le0.5509, improving the previous bounds 0.45≤A+(1)≤0.30890.45\le A_+(1)\le\sqrt{0.3089}; in particular A+(1)<0.555A_+(1)<0.555, as conjectured by Gonçalves, Oliveira e Silva and Ramos. The lower bound comes from a weight in the spirit of the summation formulas of Cohn and Gonçalves, built from Gaussians and cosines and corrected near the origin by an approximate solution of a Fredholm integral equation, and the upper bound from an explicit self-dual combination of Gaussians. The numerical inequalities in both proofs are verified in ball arithmetic, and the bounds 0.5502≤A+(1)≤0.55090.5502\le A_+(1)\le0.5509 also have formal proofs in Lean 4.

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

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

math.CV — Complex Variables

A lower bound for the Bohr radius of the bidisc

Contributed by Tejasvi Singh Tomar

We prove that the Bohr radius K2K_2 of the bidisc, whose exact value is unknown, satisfies K2>0.301665K_2>0.301665, improving Patel's bound K2>0.30158758K_2>0.30158758. As in his argument, we pass to functions with positive real part and value 11 at the origin; we bound the sum of the moduli of their coefficients of degree nn by 2Sn2S_n instead of 2n2\sqrt n, where SnS_n is the Sidon constant of {0,1,…,n}\{0,1,\dots,n\}, and we bound S5S_5, S6S_6 and S7S_7 with computer-assisted certificates. In Lean 4 we also prove K2≥0.301665K_2\ge0.301665, assuming Patel's inequality coupling the coefficients of degrees two and three.

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

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

math.NT — Number Theory

Bounds for the smallest limit point of the areal Mahler measure of totally positive algebraic integers

Contributed by Tejasvi Singh Tomar

Pritsker's areal analog ∥P∥0\|P\|_0 of the Mahler measure replaces the integral of log⁡∣P∣\log|P| over the unit circle by its integral over the unit disc with respect to normalized area. For an algebraic number α\alpha of degree nn with minimal polynomial P∈Z[x]P\in\mathbb{Z}[x], taken primitive with positive leading coefficient, let N0(α)=∥P∥01/nN_0(\alpha)=\|P\|_0^{1/n}. Flammang proved that N0(α)≥1.380047N_0(\alpha)\ge1.380047 for every totally positive algebraic integer α\alpha outside an explicit finite set. We prove that the smallest limit point of the values of N0N_0 on totally positive algebraic integers and their essential minimum lie between 1.38301341.3830134 and 1.38395791.3839579. The lower bound improves on Flammang's constant: it holds for all but finitely many totally positive algebraic numbers, not only integers, although the exceptions are not determined. Infinitely many totally positive algebraic integers satisfy N0(α)<1.3839579N_0(\alpha)<1.3839579. The lower bound comes from an auxiliary function with a logarithmic energy term, and the upper bound from an explicit measure that, by a criterion and a theorem of Smith, is a limit of distributions of conjugates of totally positive algebraic integers. The inequalities behind both bounds are verified in ball arithmetic, and both bounds are also proved in Lean, the upper one assuming Smith's theorem.

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

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

math.NT — Number Theory

An upper bound for the smallest limit point of the absolute Mahler measure of totally positive algebraic integers

Contributed by Tejasvi Singh Tomar

Let ℓ+\ell_+ be the smallest limit point of the values of the absolute Mahler measure Ω(α)=M(α)1/deg⁡α\Omega(\alpha)=M(\alpha)^{1/\deg\alpha} on totally positive algebraic integers α\alpha. Smyth's work gives ℓ+≤ℓ2=1.72731…\ell_+\le\ell^2=1.72731\ldots, where ℓ=1.31427…\ell=1.31427\ldots is the limit point that he found for totally real algebraic integers. We prove ℓ+≤1.7239501\ell_+\le1.7239501, and that infinitely many totally positive algebraic integers satisfy Ω(α)<1.7239501\Omega(\alpha)<1.7239501. Together with the lower bound ℓ+>1.7234615\ell_+>1.7234615 of a companion paper, this places ℓ+\ell_+ in an interval of length less than 4.9⋅10−44.9\cdot10^{-4}. The proof exhibits a measure μ\mu on [0,9][0,9] with a piecewise linear density on 3,4813{,}481 rational nodes. Its logarithmic potential is bounded below by a combination of log⁡∣Q∣\log|Q| for 2121 irreducible polynomials QQ, namely xx and polynomials taken from Flammang's work. By a criterion of Smith, μ\mu, normalized to mass 11, is a limit of distributions of conjugates of totally positive algebraic integers, and its integral of log⁡+x\log^{+} x gives the bound. Two separately written programs verify the conditions in ball arithmetic. Both results are also proved in the Lean proof assistant, assuming Smith's theorem and a lower bound for the potential of the arcsine measure, with the checks of the certificate run either as compiled code or by Lean's kernel.

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

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

math.NT — Number Theory

A lower bound for the smallest limit point of the absolute Mahler measure of totally positive algebraic integers

Contributed by Tejasvi Singh Tomar

Let ℓ+\ell_+ be the smallest limit point of the absolute Mahler measures Ω(α)=M(α)1/deg⁡α\Omega(\alpha)=M(\alpha)^{1/\deg\alpha} of totally positive algebraic integers α\alpha. By work of Smyth, ℓ+≤1.7274\ell_+\le1.7274, and the best lower bound was Flammang's ℓ+≥1.722069\ell_+\ge1.722069. We prove that all but finitely many totally positive algebraic numbers α\alpha satisfy Ω(α)>1.7234615\Omega(\alpha)>1.7234615, and that ℓ+>1.7234615\ell_+>1.7234615. We also prove that all but finitely many totally real algebraic numbers β\beta have absolute logarithmic Weil height log⁡Ω(β)>0.2721673\log\Omega(\beta)>0.2721673. The proof adds to Smyth's method of auxiliary functions the logarithmic energy term that Orloski, Talebizadeh Sardari and Smith derived from the integrality of discriminants for the Schur–Siegel–Smyth trace problem. The resulting inequality is verified rigorously by computer, and the lower bounds are also proved in the Lean proof assistant.

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

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

math.CA — Classical Analysis and ODEs

Bounds for the weak type (1,1) constant of the centred maximal operator over squares

Contributed by Tejasvi Singh Tomar

Let c2c_2 be the best constant in the weak type (1,1)(1,1) inequality for the centred Hardy–Littlewood maximal operator over axis-parallel squares in the plane. We prove 1.7027237335≤c2≤3.591231.7027237335\le c_2\le3.59123, improving the bounds 1.6855…≤c2<3.6157491.6855\ldots\le c_2<3.615749 obtained by Lin. The upper bound comes from a new kernel in Lin's comparison principle, which bounds c2c_2 by half the integral of a suitable kernel; closed forms for the fractional operator in this principle make its conditions checkable. The lower bound comes from a periodic measure obtained by modifying Lin's lattice of point masses. Both proofs are computer-assisted and formally verified in Lean.

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

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

math.NT — Number Theory

A lower bound for the essential minimum of the Zhang–Zagier height

Contributed by Tejasvi Singh Tomar

For an algebraic number α\alpha let h(α)h(\alpha) be its absolute logarithmic Weil height, and let hZ(α)=h(α)+h(1−α)h_Z(\alpha)=h(\alpha)+h(1-\alpha). The essential minimum of hZh_Z is the supremum of the numbers HH for which only finitely many algebraic numbers satisfy hZ(α)≤Hh_Z(\alpha)\le H. Zagier showed that it is at least 12log⁡1+52=0.2406059…\frac12\log\frac{1+\sqrt5}{2}=0.2406059\ldots, and the best lower bound so far is 0.248740.24874, due to Flammang. We prove that the essential minimum is at least 0.249829330.24982933. The proof combines Smyth's method of auxiliary functions, here with five integer polynomials in z(1−z)z(1-z), with a logarithmic energy term relative to a measure on the circles ∣z∣=1|z|=1 and ∣1−z∣=1|1-z|=1. Resultants and discriminants of minimal polynomials are nonzero integers. They bound the polynomial terms and the energy term, and a condition on the degrees absorbs the leading coefficients, so the argument applies to all algebraic numbers. A superharmonicity argument reduces the positivity of the auxiliary function to the unit circle, where two separately written programs verify it in ball arithmetic for a certificate with exact rational data. We also prove this lower bound in Lean.

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

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

math.MG — Metric Geometry

An upper bound of 2√2 for the three-dimensional sofa problem in a snake-shaped corridor

Contributed by Tejasvi Singh Tomar

The moving sofa problem in a snake-shaped corridor, posed by O'Rourke and by Georgiev, Gómez-Serrano, Tao and Wagner, asks for the largest volume of a connected body that can be moved through a corridor of unit-square cross-section with two turns that are far apart, one in the xx–yy plane and one in the yy–zz plane. The largest reported body has volume at least 1.85584041.8558404, and Tang obtained upper bounds for this problem, the best of which is 3.40833.4083. We prove by hand that the largest volume is at most 222\sqrt2 whenever the straight section between the turns is longer than 2+22+\sqrt2. The main new tool is a sharp bound: two infinite tubes of unit-square cross-section whose axes make an angle θ\theta meet in volume at most 1/sin⁡θ1/\sin\theta. With it, Hammersley's argument for the planar moving sofa problem carries over to three dimensions. The same argument gives explicit bounds for shorter straight sections; these and the main bound have also been proved in Lean 4 with Mathlib.

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

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

math.PR — Probability

A certified upper bound for the beat the average game

Contributed by Tejasvi Singh Tomar

Let CC be the supremum of P[X1+X2+X3<2X4]\mathbb{P}[X_1+X_2+X_3<2X_4] over all probability measures on [0,∞)[0,\infty), where X1,…,X4X_1,\dots,X_4 are independent with the given law. Determining CC is Problem 6.39, the beat the average game, in the list of Georgiev, Gómez-Serrano, Tao and Wagner. Bellec and Fritz proved 0.4006953≤C≤673/16150.4006953\le C\le 673/1615 and conjectured that the lower bound, 0.4006953723…0.4006953723\ldots, is the exact value. We prove C≤0.40069634C\le0.40069634, less than 10−610^{-6} above the conjectured value. The proof applies Razborov's flag algebra method to samples of nine points. Since the points are independent, the positivity constraints of flag algebras hold for every single measure, so that no limit objects are needed. An exact certificate is checked in rational arithmetic, and the bound is also proved in the Lean 4 proof assistant, with Lean's kernel checking the certificate.

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

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

math.MG — Metric Geometry

A lower bound for Moser's worm problem with rotations and translations

Contributed by Tejasvi Singh Tomar

In its convex form, Moser's worm problem asks for the least area of a convex set in the plane that contains a copy of every arc of length 11. For the version in which the copies may be rotated and translated but not reflected, we prove that this least area M+M^{+} satisfies M+≥0.2414M^{+}\ge0.2414; the best bound before, 0.2390.239, follows from Keller's bound for the version with reflections. The proof bounds the area of the convex hull of copies of five polygonal arcs, among them two zigzags that turn in opposite directions, so that without reflections the hull must contain a zigzag turning each way. A branch and bound over the placements of the arcs, with second-order Taylor bounds for signed areas of polygons, produces a certificate, which is checked in ball arithmetic and in the Lean proof assistant.

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

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

math.CO — Combinatorics

An upper bound for the connective constant of the square lattice

Contributed by Tejasvi Singh Tomar

We prove that the connective constant μ\mu of the square lattice Z2\mathbb{Z}^2, the exponential growth rate of the number of nn-step self-avoiding walks, satisfies μ≤2.6586513\mu\le2.6586513. The previous best upper bound, μ≤2.662342426\mu\le2.662342426, is due to Couronné. Like the bounds of Pönitz and Tittmann and of Couronné, ours comes from a finite automaton that remembers a bounded part of the past of the walk. The new idea is to count bridges. Since they can all be preceded by the same infinite history, the automaton may treat as visited the unvisited cells that no infinite self-avoiding continuation can reach, and three tests on the current state and the next step recognize such cells. The bound is checked in exact integer arithmetic and proved in the Lean proof assistant.

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

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

math.NT — Number Theory

The sum of the reciprocal cubes of the Fibonacci numbers is irrational

Contributed by Shawn Krisman

We prove that ζF(3)=∑n≥1Fn−3\zeta_F(3)=\sum_{n\ge1}F_n^{-3} is irrational, where FnF_n are the Fibonacci numbers. To our knowledge the only odd value of the Fibonacci zeta function previously known to be irrational was ζF(1)\zeta_F(1). The proof is a Hankel-determinant construction over Z[φ]\mathbb{Z}[\varphi], φ=(1+5)/2\varphi=(1+\sqrt5)/2, adapted from a recent unrefereed construction for the qq-zeta value ∑n2/(pn−1)\sum n^2/(p^n-1) at integers p≥2p\ge2. Four estimates are combined: a real decay of size exp⁡(−29K3log⁡φ)\exp(-\tfrac29K^3\log\varphi), a smallness exp⁡(−K3log⁡φ)\exp(-K^3\log\varphi) at the Galois conjugate, which replaces the base-prime content gain of the integer case, local cyclotomic denominator bounds at the twisted roots of unity that occur, and nonvanishing by rational interpolation. The whole argument is formalised in Lean 4 with Mathlib.

Primarily AI-generated textHuman understanding: no partsCyclotomic PolynomialsFibonacci zeta functionHankel determinantsLambert seriesLean 4Padé approximationformal verificationirrationalityq-zeta valuesreciprocal Fibonacci sums
Nov 15, 202613 pages
PDFView work

math.NT — Number Theory

New lower bounds for Romanoff's constant

Contributed by Tejasvi Singh Tomar

Romanoff proved in 1934 that the integers of the form p+2ap+2^a, with pp prime and a≥1a\ge1, have positive lower density dd. We prove that d≥0.110825d\ge0.110825 and, conditionally on an upper bound for prime pairs that Johnston and Trudgian derive from Lichtman's work on primes in arithmetic progressions, that d≥0.119178d\ge0.119178; the best lower bound so far was 0.107880.10788. The proof refines the method of Elsholtz and Schlage-Puchta, which bounds the second moment of the number of representations in each residue class modulo a fixed integer. Both bounds are certified by computer and also proved in the Lean proof assistant, with the analytic inputs as hypotheses.

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

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

math.NT — Number Theory

Upper and lower bounds for the Schur–Siegel–Smyth trace problem

Contributed by Tejasvi Singh Tomar

The Schur–Siegel–Smyth trace constant C86C_{86} is the lower limit of tr⁡(α)/deg⁡(α)\operatorname{tr}(\alpha)/\deg(\alpha) over totally positive algebraic integers α\alpha. We prove 1.8022225<C86<1.80708091.8022225<C_{86}<1.8070809. For the upper bound we exhibit a measure on [0,6][0,6] that satisfies the hypotheses of Smith's theorem on limits of distributions of conjugates, which we check with the help of 2121 integer polynomials. This improves the upper bounds 1.82161.8216 of Orloski and Talebizadeh Sardari and 1.81172511.8117251 of Pinho. The lower bound comes from the method of Orloski, Talebizadeh Sardari and Smith with fifteen polynomials, three of them of degree 1010 found by McKee and Smyth. It is larger than the bound 1.802201.80220 reported by Giraudin, whose verification evaluates its bounds in floating-point arithmetic with fixed safety margins; ours encloses every rounding error. For each bound, two separately written programs check the certificate in ball arithmetic. Both bounds are also proved in Lean 4, the upper bound under the assumption of Smith's theorem, also in a version in which all checks on the certificates are carried out by Lean's kernel. We also give evidence that certificates of this kind cannot lower the upper bound much further without integer polynomials of high degree.

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

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

math.CV — Complex Variables

An explicit bound below 2/π for the maximum term of an entire function

Contributed by Tejasvi Singh Tomar

For a transcendental entire function ff let μ(r)\mu(r) be its maximum term and M(r)M(r) its maximum modulus on ∣z∣=r|z|=r. Erdős asked for the largest possible value BB of lim inf⁡r→∞μ(r)/M(r)\liminf_{r\to\infty}\mu(r)/M(r). An argument of Clunie gives B≤2/π=0.636619…B\le 2/\pi=0.636619\ldots, and Clunie and Hayman proved B≤2/π−cB\le 2/\pi-c for an absolute constant c>0c>0 that they did not compute. We prove B≤0.63005B\le0.63005. We make the stability argument of Clunie and Hayman quantitative by testing ff against trigonometric polynomials at one or both of two consecutive radii where the central index jumps. The proof is computer-assisted, and the theorem is also proved in the Lean proof assistant.

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

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

math.CO — Combinatorics

Certified upper bounds for two sum-difference exponents

Contributed by Tejasvi Singh Tomar

For finite sets A,BA,B of real numbers and G⊆A×BG\subseteq A\times B, Katz and Tao proved in 1999 that {a−b:(a,b)∈G}\{a-b:(a,b)\in G\} has at most N11/6N^{11/6} elements whenever AA, BB and {a+b:(a,b)∈G}\{a+b:(a,b)\in G\} have at most NN elements; by an argument of Bourgain, bounds of this kind give lower bounds for the dimension of Kakeya sets. We lower the exponent 11/611/6 to 1.82731.8273, and to 1.82951.8295 in every abelian group. We also prove ∣X−Y∣≤∣X+Y∣1.4209|X-Y|\le|X+Y|^{1.4209} for all finite sets X,YX,Y of integers, improving the exponent 1.45431.4543 of Kleinwaks; through his transfer theorem, this lowers the upper bound for the sum-difference constant of Gyarmati, Hennecart and Ruzsa from 1.31241.3124 to 1.29621.2962. Both proofs add up entropy inequalities among integer combinations of coordinates of several copies of a random pair, with rational weights found by linear programming; all four bounds are also proved in Lean 4.

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

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

math.PR — Probability

Homological percolation in characteristic two: the Ising gauge case

Contributed by Tejasvi Singh Tomar

Duncan and Schweinhart proved that the ii-dimensional plaquette random-cluster model with cluster weight qq on the 2i2i-dimensional torus has a sharp homological percolation transition at the self-dual point, for coefficients in a field of characteristic other than 22. Their proof needs the point group of the lattice to act irreducibly on the ii-th homology of the torus. In characteristic 22 it does not, and the most important case is excluded: q=2q = 2 with F2\mathrm{F}_2 coefficients, which represents the (i−1)(i-1)-form Ising lattice gauge theory. We prove the theorem for q=2rq = 2^r with r≥1r \ge 1 and F2\mathrm{F}_2 coefficients. The representation-theoretic step is replaced by a transfer-matrix inequality, the classical positivity of the partition functions of 't Hooft's electric-flux sectors; read in the random-cluster representation, this inequality compares the probabilities of homological events. As a corollary, for the ferromagnetic (i−1)(i-1)-form Ising gauge theory on the 2i2i-dimensional torus (Wegner's model when i=2i = 2), the free energy of every nontrivial 't Hooft twist tends to 00 below the self-dual coupling and to infinity above it as the torus grows. For Bernoulli plaquette percolation (q=1q = 1) the characteristic-22 case remains open for i≥2i \ge 2; we describe obstructions to proving it, and on the 44-torus we prove a computer-assisted divisibility theorem for the classes of integral giant cycles just above p=1/2p = 1/2.

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

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

math.PR — Probability

Certified upper bounds for the Chvátal–Sankoff constant

Contributed by Tejasvi Singh Tomar

Let γ2\gamma_2 be the Chvátal–Sankoff constant, so that the expected length of a longest common subsequence of two independent uniformly random binary strings of length nn is γ2n+o(n)\gamma_2n+o(n). Lueker proved γ2≤0.826280\gamma_2\le0.826280 with a finite automaton that reads a pair of strings as a sequence of minimal match pairs and remembers the last hh symbols of each string, for h=8h=8. We carry out his method up to h=13h=13 and prove γ2≤0.821963\gamma_2\le0.821963. For h=13h=13 the certificate lists 165,695,219,469165{,}695{,}219{,}469 states of the automaton, reduced by a symmetry. The bound rests on an explicit positive vector for the weighted transition matrix of the automaton; a checker rebuilds every transition with its own code and verifies the required inequalities in exact integer arithmetic. We also give a complete proof that the automaton accepts the truncated canonical decomposition of every pair of strings, the property on which the method depends. The bound γ2≤0.821963\gamma_2\le0.821963 is also proved in the Lean 4 proof assistant, with a computation evaluated by compiled code, and the bounds γ2≤0.825101\gamma_2\le0.825101, γ2≤0.824120\gamma_2\le0.824120, γ2≤0.823290\gamma_2\le0.823290 and γ2≤0.822579\gamma_2\le0.822579 for h=9h=9, 1010, 1111 and 1212 by formal proofs that are checked entirely by the Lean kernel.

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

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

quant-ph — Quantum Physics

Equality cases and every-copy results for the Werner endpoint inequality

Contributed by Tejasvi Singh Tomar

Whether every entangled state with a non-positive partial transpose (NPT) can be distilled is open. For the Werner states ρ(d,α)\rho(d,\alpha), a criterion of Costa Rico reduces kk-copy undistillability to an inequality for matrices of rank at most two: an alternating sum of the squared norms of their partial traces must be nonnegative. At α=−1/2\alpha=-1/2 we call it the endpoint inequality. It is known for two and three copies, and if it held for every kk in some dimension d≥3d\ge3, NPT bound entanglement would exist. For two copies we show that every equality case has rank two, with its range and that of its adjoint in products of two-dimensional subspaces. We also show that a first failure would produce, at some α>−1/2\alpha>-1/2, an equality case whose range has reduced states of rank at least three on every copy, unlike all known equality cases at α=−1/2\alpha=-1/2. For every kk we prove the endpoint inequality on an explicit class of matrices whose ranges generically have such reduced states. For four copies we give a computer-assisted proof of it in every dimension for all matrices CC such that the ranges of CC and of its adjoint lie in one two-dimensional subspace, as they do for all normal matrices of rank two.

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

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

math.PR — Probability

Essential enhancements of site percolation in every dimension and on periodic lattices

Contributed by Tejasvi Singh Tomar

We prove Conjecture 1 of Balister, Bollobás and Riordan for site percolation on Zd\mathbb Z^d in every dimension d≥2d\ge2: for every essential enhancement, activated at any positive density, the enhanced configuration percolates for all p<pcp<p_c close enough to the critical probability pcp_c. Aizenman and Grimmett gave an argument for this in 1991, but Balister, Bollobás and Riordan found that its combinatorial step can fail. They proved the cases d=2,3d=2,3, outlined proofs for bond percolation on Zd\mathbb Z^d and for site percolation on the triangular lattice, and left the cases d≥4d\ge4 open. Near a site that is pivotal for a long connection, our proof reroutes the open path through a finite configuration in which the enhancement creates a connection, inside a ball that need not be centred at the pivotal site. A theorem valid in every dimension makes this possible unless the first and last sites of the path in the ball lie at a corner of the ball, and a mass-transport argument finds a ball where they do not. The method extends to site percolation on fourteen further periodic lattices, among them all Archimedean lattices other than the square lattice, and to bond percolation on the honeycomb lattice. The proof for Zd\mathbb Z^d uses no computer, parts of most lattice proofs are finite computer checks of local configurations, and the main theorems for Zd\mathbb Z^d and for nine of the lattices have been checked in the Lean proof assistant.

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

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

quant-ph — Quantum Physics

Undistillability of Werner states from three, four and five copies

Contributed by Tejasvi Singh Tomar

Whether every entangled state with a non-positive partial transpose (NPT) can be distilled is a long-standing open problem of entanglement theory. It reduces to the Werner states ρ(d,α)\rho(d,\alpha), which for d≥3d\ge3 and −1/2≤α<−1/d-1/2\le\alpha<-1/d are NPT but cannot be distilled from one copy; if one of them stays undistillable from every number of copies, NPT bound entanglement exists. We prove that for every d≥3d\ge3 the state ρ(d,α)\rho(d,\alpha) is three-copy distillable if and only if α<−1/2\alpha<-1/2, the threshold known for one and two copies, so a third copy does not help. In every dimension we also prove four-copy undistillability for α≥−79/160\alpha\ge-79/160 and five-copy undistillability for α≥−9/20\alpha\ge-9/20, and improved bounds of order 1/k1/k for k≥6k\ge6 copies. The proofs use a criterion of Costa Rico and computer-verified certificates for quartic moment relaxations that hold for all large dimensions at once; for many copies they combine the resulting inequalities with known partial-trace inequalities. Whether −1/2-1/2 remains the threshold from four copies on is open.

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

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

math.NT — Number Theory

Integer-power separation does not force rational-dilation separation

Contributed by Sunay Venkat

We construct an algebraically independent set with divergent reciprocal-logarithmic weight, arbitrary prescribed proximity to selected integers and growing integer-power separation on tails. Nevertheless, every tail contains arbitrarily close rational-dilation pairs for each member of a dense family. The necessary integer-power finite-state lemmas and their proofs are included. This supplies a contrasting construction to the bounded-denominator rational-power example in the companion paper.

Primarily AI-generated textHuman understanding: some partsDiophantine approximationalgebraic independenceinteger-power separationrational dilations
Nov 15, 20267 pages
PDFView work

math.NT — Number Theory

Algebraically independent counterexamples with rational-power separation

Contributed by Sunay Venkat

Starting from Apicella’s private-prime construction, we give a proof draft of divergent reciprocal-logarithmic-weight examples that are algebraically independent, admit any prescribed positive integer-anchor error and have growing mixed-power gaps for rational dilations with bounded denominators. The integer numerator remains unrestricted. We record transcendence and field consequences and retain an elementary reconstruction of Apicella’s rational example in an appendix, with its prior-work attribution explicit.

Primarily AI-generated textHuman understanding: some partsDiophantine approximationalgebraic independencemultiplicative combinatorics
Nov 15, 202610 pages
PDFView work

math.NT — Number Theory

A Central-Commutator Regge Seed: BCC Sublattices, Face-Matched Hinges, and Quaternionic Spectral Gaps

Contributed by Changxia Lin

(i) At the arithmetic parameter \delta = 1/3, the three short face diagonals of the negative-cycle ternary Gram form become mutually orthogonal and generate a simple-cubic sublattice of index two; the full lattice is body-centered cubic. (ii) The positive- and negative-cycle Gram tetrahedra admit matching hinge faces. A four-tetrahedron Regge star consisting of one negative-cycle tetrahedron and three positive-cycle tetrahedra has an exactly computable positive deficit angle. (iii) A figure-eight graph with quaternionic cycle holonomies i and j has a nonzero spectral gap; its characteristic polynomial is computed exactly and its smallest eigenvalue is isolated by rational bounds. (iv) The commutator [i, j] = -1 identifies the graph's central Z_2 obstruction with the negative signed-cycle class of the Gram construction. The statements are finite-dimensional results about lattices, piecewise-Euclidean complexes, and unitary graph connections. They do not construct a closed shell, a Lorentzian spacetime, or a solution of the Einstein-matter equations; they do not prove the dominant energy condition or dynamical stability. The term "negative-cycle" refers only to a sign invariant and has no implication of negative physical energy.

Primarily human-written textHuman understanding: all partsSigned Gram matrices
Nov 15, 20268 pages
PDFView work

math.NT — Number Theory

Realizer Bounds and Repetition Constraints at the First Coefficient Crossing in the 3x + 1 Problem

Contributed by Elias De Jesús

Terras’s coefficient stopping time conjecture asks whether the shortcut Collatz orbit of every integer n ≥ 2 lies below n when its coefficient ρk = 3d/2k first falls below one. Here k counts shortcut steps and d counts their odd inputs. We prove that every eligible realizer descends when the first-crossing word has at most 75 maximal runs of odd inputs. Any counterexample requires at least 76 such runs, 10 439 860 591 steps and 6 586 818 670 odd inputs. The proof uses a lower bound on the seed from the length of its odd runs, rational approximations to log2 3, the verified range of Rozier and Terracol, and Rhin’s estimate for a linear form in logarithms. We also prove descent for a family with arbitrarily many odd runs. Two further restrictions narrow the remaining words. An initial square U U in a failing word satisfies |U | < 35 log2 k. For a counterexample of shortest crossing length, the reciprocal-sum estimate of Nikzad, Frinkle and Bagherzadeh gives a lower bound on ρk whose value begins 0.9441733669 . . .. The open inequality compares the least eligible starting value in each remaining parity class with an explicit threshold.

A mix of human-written and AI-generated textHuman understanding: some parts2-adic congruencesCollatz conjectureDiophantine approximationTerras conjecturecoefficient stopping timefirst coefficient crossingleast positive realizersodd-run decompositionparity vectorsreciprocal sums
Nov 15, 202612 pages
PDFView work

math-ph — Mathematical Physics

Axiomatic Foundations of Astrophysical Systems: Model-Independent Obstructions Between Equations of State, Observables, and Field Equations

Contributed by Yuri Ximenes Lecca

Continuing the axiomatic program for astrophysics initiated in previous works, we introduce a gravity-model-independent and scale-independent definition of an astrophysical system and of clusters of astrophysical systems over arbitrary piecewise smooth spatial manifolds. A cluster is modeled as a subspace of piecewise differentiable sections of matter and gravitational bundles (modulo coincidence on dense open sets), endowed with macroscopic observable functionals and coupled through a parametric field operator Dgrav\mathcal{D}_{\mathrm{grav}} encompassing Newtonian gravity, General Relativity, and modified gravity theories (f(R)f(R), Rastall, scalar-tensor, and MOND-type models). Restricting local equations of state to bounded extended-norm balls (which form affine Banach spaces on fixed partitions) and applying Implicit Function Theorems in locally convex spaces, we prove four universal obstruction theorems: (i) a direct multi-observable obstruction theorem; (ii) a gravity-coupled structural obstruction theorem via locally density-solvable field equations and reference evaluation operators; (iii) a causal lifting theorem for general acoustic cones; and (iv) an inverse obstruction theorem, showing that combining causality-constrained equations of state with empirical observable relations induces a priori bounds on the parameter space of the gravitational theory. We also prove that finite-dimensional gravity-coupled clusters are closed and nowhere dense in any Hausdorff locally convex topology, and apply our results to compact stars in Rastall and perturbative f(R)f(R) gravity, Bowers--Liang anisotropic stars, and galaxies obeying the Baryonic Tully--Fisher Relation.

Primarily human-written textHuman understanding: all partsAstrophysical systemsequations of stateimplicit function theoremlocally convex spacesmass-radius-tidal relationsmodified gravity
Nov 15, 202624 pages
PDFView work

math.NT — Number Theory

SeqImpar and SeqPar: Analytic Characterizations of the Zeros of the Riemann Zeta and Dirichlet Beta Functions and a Criterion Equivalent to the Riemann Hypothesis

Contributed by FELIPE MARTINS SANTOS

We study two rational sequences, called SeqImpar and SeqPar, originally defined by recurrences and converging to the common limit 5. The ratio of their convergence errors tends to 1/2. Using this ratio, we construct two Dirichlet series weighted by the von Mangoldt function and associated with the Riemann zeta function and the Dirichlet beta function. We prove that these series admit meromorphic continuations whose poles in the critical strip correspond exactly to the zeros of the respective functions, with residues equal to minus one-half of their multiplicities. We then prove that an estimate for the partial sum weighted by SeqImpar and SeqPar is equivalent to the Riemann Hypothesis, and state a parallel criterion for the Dirichlet beta function. The paper rigorously distinguishes proved identities, equivalences, and open problems: the coincidence of the number 1/2 with the critical line does not, by itself, constitute a proof of the Riemann Hypothesis.

Author comments: DOI 10.5281/zenodo.24145199

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

math.GR — Group Theory

Flat linearity of uniform groups

Contributed by Teo Banica

A uniform group is a quotient ZK∗M→Γ→ZKM\mathbb Z_K^{*M}\to\Gamma\to\mathbb Z_K^M on which SMS_M acts by permuting the generators, and a flat representation is a representation π:Γ→UK\pi:\Gamma\to U_K such that each π(gi)\pi(g_i) has the KK-th roots of unity as eigenvalues. These are the quasi-flat matrix models of the group duals Γ^⊂SKM+\widehat{\Gamma}\subset S_{KM}^+. We show that ZK∗M\mathbb Z_K^{*M} is flat linear, in the sense that its flat representations separate points, and that for finite groups, flat linearity and stationarity reduce to exact covering problems. We use this to compute a census, and to prove results on the Heisenberg and metabelian groups.

Primarily AI-generated textHuman understanding: some partsFlat modelUniform group
Nov 15, 202628 pages
PDFView work

math.NT — Number Theory

Colossally Abundant Numbers and Nicolas' Second Criterion

Contributed by Frank Vega

Robin's criterion states that the Riemann Hypothesis holds if and only if σ(n)<eγnlog⁡log⁡n\sigma(n) < e^{\gamma} n \log\log n for every n>5040n > 5040. Nicolas' second criterion, in the form given by Broughan, states that it holds if and only if n/φ(n)<eγlog⁡log⁡n+eγ(2+τ)/log⁡nn/\varphi(n) < e^{\gamma} \log\log n + e^{\gamma}(2 + \tau)/\sqrt{\log n} for every n≥N120569n \geq N_{120569}, where NkN_{k} is the kk-th primorial and τ=2+γ−log⁡(4π)\tau = 2 + \gamma - \log(4\pi); for NkN_{k} this inequality reads c(pk)<E(pk)c(p_{k}) < E(p_{k}). Let NN be a colossally abundant number, let q=pkq = p_{k} be the largest prime not exceeding the number ξ(N)\xi(N) associated with NN by Nicolas, and write Δ(N)=log⁡(σ(N)/N)−γ−log⁡log⁡log⁡N\Delta(N) = \log(\sigma(N)/N) - \gamma - \log\log\log N. For log⁡q≥31\log q \geq 31 we prove unconditionally that 1.317/(qlog⁡2q)≤Δ(N)−c(q)+E(q)+(22−2−τ)/(qlog⁡q)≤3.973/(qlog⁡2q)1.317/(\sqrt{q}\log^{2} q) \leq \Delta(N) - c(q) + E(q) + (2\sqrt{2} - 2 - \tau)/(\sqrt{q}\log q) \leq 3.973/(\sqrt{q}\log^{2} q). Consequently, the second inequality for NkN_{k} implies Δ(N)<−0.654/(qlog⁡q)\Delta(N) < -0.654/(\sqrt{q}\log q). We also prove that the primorials are the extremal cases of the second inequality, and that if it holds for every NkN_{k} with e31≤pk≤Xe^{31} \leq p_{k} \leq X, then Robin's inequality holds for every n>5040n > 5040 with log⁡n≤X(1−log⁡−3X)−log⁡X\log n \leq X(1 - \log^{-3} X) - \log X. A computation over the primes up to X=100,000,008,765,439X = 100{,}000{,}008{,}765{,}439 verifies this hypothesis, so Robin's inequality holds unconditionally for 5040<n≤101013.63775040 < n \leq 10^{10^{13.6377}}. To the author's knowledge, this is the largest range for which Robin's inequality has been verified: it extends the range 5040<n≤101013.114855040 < n \leq 10^{10^{13.11485}} of Morrill and Platt.

Primarily AI-generated textHuman understanding: all partsChebyshev functionColossally abundant numbersNicolas' inequalityNicolas' second criterionRiemann HypothesisRobin's inequalitySuperabundant numbersprimorial
Nov 15, 202623 pages
PDFView work

math.SG — Symplectic Geometry

Ekeland–Hofer capacities and convex duality: ordinary and real spectral invariants

Contributed by Zhen Gao

We identify the rational Ekeland–Hofer capacities of convex bodies with Clarke’s homogeneous dual-action selectors by a direct minimax argument. Convex reduction and a common nonresonant quadratic tail give the cohomological real analogue for bodies invariant under a linear anti-symplectic involution. In the real case, the mod-two index of half-period translation requires linking in the presence of fixed Fourier modes. The real selectors are full actions of generalized brake characteristics and converge to twice the least brake action. Convex approximation includes nonsmooth bodies, and Fourier decomposition computes both sequences on diagonal ellipsoids.

Primarily AI-generated textHuman understanding: some partsClarke dualityEkeland–Hofer capacitiesbrake characteristicsconvex bodiesequivariant cohomology
Nov 15, 202632 pages
PDFView work

math.FA — Functional Analysis

A midpoint locally uniformly rotund Banach space with the Daugavet property

Contributed by Samir Hamad

We construct a separable Banach space with the Daugavet and Schur properties whose norm is midpoint locally uniformly rotund and G\^ateaux smooth. The construction combines the ergodic orbit norm of Dantas, Kaasik and Perreau with a Bourgain--Rosenthal enlargement in the form developed by Kadets and Werner.

A mix of human-written and AI-generated textHuman understanding: all partsDaugavet propertymidpoint local uniform rotundity
Nov 15, 20269 pages
PDFView work

math.CO — Combinatorics

Constructions and explicit power savings for point--unit-circle incidences

Contributed by Yuda Chen, Yifei Wang

Let U(n,m)\mathcal U(n,m) be the maximum number of incidences between nn distinct points and mm distinct unit circles in the plane. We give two constructions and an explicit upper bound for this function. Writing s=min⁡(n,m)s=\min(n,m) and M=max⁡(n,m)M=\max(n,m), the first construction gives a four-piece monomial lower bound for all cardinalities, with balanced exponent 1.0411699201.041169920. The second gives balanced configurations along an unbounded sequence with exponent 1.04317223055397011.0431722305539701, and further unbalanced configurations. The upper bound is U(n,m)≪M+s2/3−2δM2/3+δ\mathcal U(n,m)\ll M+s^{2/3-2\delta}M^{2/3+\delta}, where δ=2−2664/514560000000>2−2665\delta=2^{-2^{664}}/514560000000>2^{-2^{665}}. The constructions use two windows in a relative-norm-one number-field lattice, strengthened arithmetic estimates, and interpolation between local profiles. The upper bound uses finite incidence regularization, prediction, arithmetic heights, and a six-by-five rigidity obstruction. The resulting bounds for the unit-distance problem follow as corollaries.

Primarily AI-generated textHuman understanding: some partsPoint--unit-circle incidencesarithmetic heightsclass field towersincidence boundsnumber-field latticespolynomial partitioningunit distances
Nov 15, 2026178 pages
PDFView work

math.GR — Group Theory

Further cases of the inductive Alperin–McKay condition

Contributed by Qiyue Tang

We prove the inductive Alperin–McKay condition at every prime for finite simple groups of types AA, 2A{}^2A, BB, CC, and F4F_4, and for those of type DD in characteristic two. We also prove the corresponding block condition for all unipotent blocks of natural groups of type DD on their prescribed central quotients.

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

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

math.RT — Representation Theory

The inductive Alperin–McKay condition for G2(q)G_2(q) and 3D4(q){}^3D_4(q)

Contributed by Qiyue Tang

We verify the inductive Alperin–McKay condition for G2(q)G_2(q) (q≥3q\geq3) and 3D4(q){}^3D_4(q) (q≥2q\geq2) at every odd prime.

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

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

math.CO — Combinatorics

Vector Packing and Sharp Bounds for Matrices of Bounded Rank

Contributed by Yair Lavi

We prove a packing theorem in real and complex normed spaces. Given a possibly infinite family of vectors (vj)(v_j) whose span has finite dimension r≥1r\ge1, let MM be the supremum of the norms of its finite linear combinations with coefficients of modulus at most one. If MM is finite, the family splits into rr nonempty sets, each with sum of norms at most MM. The same partition works for every norm on the span, using that norm's value of MM. We also determine exactly which finite lists of nonnegative numbers can be realized as the norms of a family of capacity one in some normed space of dimension at most kk. We also obtain sharp rank-dependent bounds for products of the moduli of the entries on generalized diagonals and the permanent of the entrywise modulus, extending the known nonnegative-matrix bounds to real and complex matrices. The packing theorem also gives sharp support and entropy bounds for doubly stochastic matrices of bounded rank.

A mix of human-written and AI-generated textHuman understanding: all partsStochastic matrixVector packingentropymajorizationmatrix rankpermanent
Nov 15, 202624 pages
PDFView work

math.LO — Logic

Points from Processes: Vakarelov’s Dynamic Mereotopology and Whitehead’s Point-Free Program

Contributed by John Hessler

Whitehead held that neither points of space nor instants of time should be primitive: both ought to be definable from relations between material things. Region-based theories of space have largely carried out the spatial half of this program, but the temporal half has remained informal. This paper offers an expository and philosophical account of Dimiter Vakarelov’s dynamic mereotopology, developed in five papers between 2010 and 2016, which aims at a theory of space and time that is point-free in this double sense. We argue that the program is best read as a staged realization of Whitehead’s demand. Each stage enriches the primitive spatio-temporal relations between changing regions just enough to recover a further layer of temporal structure: first moments without order, then an ordered time, and finally nameable, spatially non-trivial epochs. The staging culminates in a structural result Whitehead anticipated but never formalized: points of space and points of time turn out to be different aggregations of one and the same stock of abstract atoms. We also argue that the representation theorems on which the program rests deliver a reconstruction, rather than a reduction, of points, and that reconstruction is what Whitehead’s program requires.

A mix of human-written and AI-generated textHuman understanding: all partsmereotopology; point-free geometry; contact algebra;; representation theorems
Nov 15, 202635 pages
PDFView work

math.PR — Probability

Sharp Poisson approximation and second-order correction for long multiplicative runs

Contributed by Brice Pouly

Let ff be completely multiplicative with independent fair signs at primes. We count starts of constant runs of length at least LL in [N,2N)[N,2N), with L=log⁡2N+O(1)L=\log_2N+O(1) and both signs included. The total variation distance to the Poisson law with nominal or exact mean has an explicit equivalent of order LN−2/3LN^{-2/3}, with a coefficient depending on N2−LN2^{-L} and L mod 3L\bmod3. After retaining the exact mean and second factorial cumulant, the quadratic Poisson–Charlier approximation has optimal error power 4/34/3: for every fixed ε>0\varepsilon>0, its ℓ1\ell^1 error lies between constant multiples of N−4/3−εN^{-4/3-\varepsilon} and N−4/3+εN^{-4/3+\varepsilon}, uniformly in each fixed critical band. The leading correction comes from rational pairs. Keeping all channels up to a fixed height hh gives an explicit distance equivalent with power h/(h+1)h/(h+1), determined by the first omitted height. The third factorial cumulant has optimal power 41/3041/30. The proof expands around the exact Bernoulli marginals and stops at the first excluded dependent configuration. Arithmetic bounds for fixed configurations and a separate uniform tail estimate control the resulting positive boundary mass. Short square relations and a common algebraic curve bound the triple interactions; a fourth Charlier test detects the two-pair contribution that makes the quadratic exponent optimal.

Author comments: Initial Hexagon deposit of the published Zenodo edition (https://doi.org/10.5281/zenodo.24220727), including its technical companion in the same PDF. Lean formalization and reproducibility archive: https://doi.org/10.5281/zenodo.24220800. Mathematical source text is preserved; source packaging and navigation are adapted.

Primarily AI-generated textHuman understanding: no partsLean formalizationPoisson approximationPoisson–Charlier approximationarithmetic dependenciesfactorial cumulantslong runsrandom multiplicative functionstotal variation
Nov 15, 2026118 pages
PDFView work

math.OA — Operator Algebras

Karlsson matrices and the kagome lattice

Contributed by Teo Banica

For the subfactor associated to a generic Karlsson matrix of order 6, the first 18 fixed-space dimensions are the Catalan numbers. We obtain this from the quantum group of a Di\c t\u a limit. A first additional invariant tensor for a quantum 22-transitive overgroup of this group would give a probability measure on closed walks on the kagome lattice with prescribed local distributions. At every even level a straight walk forces its return path and rules out such a measure. At odd levels a family of staircase tests and a 7-letter certificate at level 15 exclude further first occurrences. The least remaining level is 19. We also give an application to free wreath products and examine the second-order variation of the fixed spaces at special parameters.

Primarily AI-generated textHuman understanding: some partsKagome latticeKarlsson matrix
Nov 15, 202626 pages
PDFView work