Browse

All works

Browse the Hexagon catalog.

Newest works

1094 works

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 \emph{astrophysical system} and of \emph{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 \emph{inverse obstruction theorem}, showing that combining causality-constrained equations of state with empirical observable relations induces \emph{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

math.QA — Quantum Algebra

Solutions of the set-theoretic quantum Yang--Baxter equation arising from posets

Contributed by G. Militaru

We extend Victoria Lebed’s construction of idempotent solutions of the braid equation by introducing four families of solutions associated with posets. We show that every group can be realized as the automorphism group of such a solution, and establish a classification of solutions that either preserve or interchange the components of each pair. We also characterize when two solutions arising from posets are isomorphic. Finally, for finite posets, we construct two families of involutive solutions whose automorphism groups are explicitly described in terms of the automorphisms and anti-automorphisms of the underlying posets.

A mix of human-written and AI-generated textHuman understanding: all partsYang–Baxter equationposet
Nov 15, 202619 pages
PDFView work

math.LO — Logic

Self-embedding monoids and the existential Thomas conjecture

Contributed by Dr. András Pongrácz

We give a countable homogeneous finitely bounded Ramsey structure in a finite relational language with finitely many reducts up to first-order interdefinability but infinitely many self-embedding monoids of reducts. The reducts producing these monoids are first-order interdefinable, while their monoids form a strictly increasing chain. This refutes the existential strengthening of Thomas' conjecture even under the Ramsey hypothesis. The example is an ordered expansion of an equivalence-relation structure. Before the order is added, that structure has exactly five reducts up to first-order interdefinability. We also give a revised proof of the classification of self-embedding monoids for reducts of the countable existentially closed binary branching semilinear order. Exactly five monoids occur, refining its three-class first-order classification. The proof transfers the known classification for the homogeneous binary branching CC-relation from antichains to arbitrary finite configurations. The additional step is a connectivity argument on finite labelled trees, using both preservation and reflection of the reduct's basic relations.

Primarily human-written textHuman understanding: all parts
Nov 15, 202634 pages
PDFView work

math.NT — Number Theory

Automorphisms of the modular curves XΔ(N)X_\Delta(N)

Contributed by Filip Najman

We show that every automorphism of a modular curve XΔ(N)X_\Delta(N) of genus at least 22, where Γ1(N)⊆ΓΔ(N)⊆Γ0(N)\Gamma_1(N)\subseteq \Gamma_\Delta(N)\subseteq \Gamma_0(N), is induced by the normalizer of ΓΔ(N)\Gamma_\Delta(N) in PSL2(R)\mathrm{PSL}_2(\mathbb{R}), except for five curves, namely X0(37)X_0(37), X0(63)X_0(63), X0(108)X_0(108), a curve of level 3737 found by Jeon, Kim and Schweizer, and a curve of level 6363 whose non-modular automorphisms had, to our knowledge, not been noticed before. In particular every automorphism of X1(N)X_1(N) normalizes the group of diamond operators, as claimed for square-free NN in an unpublished preprint of Momose. The proof combines a twisted Hecke relation, which comes from the Galois action on the Tate module of the Jacobian, with a uniform bound for the dimension of the CM part of the Jacobian and with computations for finitely many levels.

Author comments: 30 pages. Code and logs: https://github.com/F-Najman/automorphisms_XDelta. Lean formalization: https://github.com/F-Najman/normalizer-lean

Primarily AI-generated textHuman understanding: some partsautomorphism groupsintermediate modular curvesmodular curves
Nov 15, 202630 pages
PDFView work

math.MG — Metric Geometry

The Barker--Larman problem in dimension three A counterexample to the Barker--Larman problem in dimension three

Contributed by Sihan Chen

We construct an origin-symmetric convex body of revolution in R3\R^3, with real-analytic boundary and positive principal curvatures, whose planar sections tangent to a concentric inner ball all have the same area. The body is nonspherical and has the same section data as a centered ball. The construction bifurcates from the unit ball at height 1/31/\sqrt{3}, where degree two is the only even Legendre resonance. We construct approximate solutions to arbitrary order and correct them by a Newton iteration on nested closed parameter sets. A finite-order reduction of the linearized section operator and measure estimates for its small divisors provide the inverse bounds needed for convergence.

Primarily AI-generated textHuman understanding: some partsBarker--Larman problemLegendre polynomialsgeometric tomographyparallel sectionssmall divisor
Nov 15, 202628 pages
PDFView work

math.AG — Algebraic Geometry

A proof of the HLRV conjecture

Contributed by Qiyue Tang

We prove the Hausel–Letellier–Rodriguez-Villegas conjecture on the mixed Hodge polynomials of generic semisimple GLn\mathrm{GL}_n character varieties.

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, 2026129 pages
PDFView work

math.NT — Number Theory

Growth criteria for reciprocal series with nonincreasing weights

Contributed by twinheterodox

Fix nonincreasing positive integer weights w0,…,wd−1w_0,\ldots,w_{d-1} and define c>1c>1 by (c−1)2∑j=0d−1wjcj=w0(c-1)^2\sum_{j=0}^{d-1}w_jc^j=w_0. If the total weight is at least two, we prove irrationality of ∑n≥11/(anw0⋯an+d−1wd−1)\sum_{n\ge1}1/(a_n^{w_0}\cdots a_{n+d-1}^{w_{d-1}}) whenever the positive integers ana_n are strictly increasing and lim sup⁡n→∞(log⁡an)/cn=∞\limsup_{n\to\infty}(\log a_n)/c^n=\infty. For every nonconstant nonincreasing weight profile, this lowers the sufficient base in the general criterion of Barreto, Kang, Kim, Kovač and Zhang (Bull. Lond. Math. Soc. 58 (2026), e70457, Theorem 3), with the classical base-2 criterion included in the comparison. For weights (3,2,1)(3,2,1) the base becomes 43\sqrt[3]{4}; staircase weights (d,d−1,…,1)(d,d-1,\ldots,1) give (d+1)1/d(d+1)^{1/d}. Irregular growth is allowed. A more general form permits nondecreasing sequences and positive integer numerators under polynomial size bounds.

Author comments: 9 pages. Extends the two-weight result in Hexagon 2611.00428v1 to all fixed nonincreasing positive integer weight profiles. Includes a general numerator criterion and a comparison with finite-product substitutions. Source and build instructions: https://github.com/twinheterodox/weighted-reciprocal-growth

Primarily AI-generated textHuman understanding: some partsgrowth criteriairrationalityreciprocal series
Nov 15, 20269 pages
PDFView work

cs.CC — Computational Complexity

An edge comparison with constant 3/2 and the coefficient 6/sqrt(2 pi) for the average sensitivity of polynomial threshold functions

Contributed by David Niedbala Giraudin

For every real polynomial threshold function f of degree at most d on the uniform cube {-1,1}^n we prove AS(f) <= min{n, 6 d b_n (n+d)/(n+2d)} <= (6/sqrt(2 pi)) d sqrt(n) < 2.394 d sqrt(n), where b_n = E|B_n - n/2| for B_n ~ Bin(n,1/2). The previous coefficient was 8/sqrt(2 pi) = 3.1915... The new ingredient is an edge comparison with constant 3/2 in place of 2 in OpenAI's weighted-grading argument: for every positive weight and every sign function h, the number of ordered equal-sign edges of h is at most (3/2)||MH+HM||_HS^2. The proof rests on the exact identity (Z_i M Z_i - M)^2 = I - A_i^2, where A_i is the grade-diagonal part of the multiplication by x_i. Combined with OpenAI's original coupling estimate alone, the lemma already gives AS(f) <= 6 d sqrt(n).

Primarily AI-generated textHuman understanding: no partsBoolean functionsaverage sensitivitycoupling inequalitypolynomial threshold functionstotal influenceweighted grading
Nov 15, 20264 pages
PDFView work

math.MP — Mathematical Physics

Electric-field hotspot packing and power channels in dielectric media

Contributed by Daniel Wang

We study quantified versions of two questions on field concentration and power channels posed by Miller and Monticone in OQ14. At a fixed driving frequency and under a common positive permittivity bound, we construct arbitrarily many simultaneous localized electric-field peaks in a single driven field, both in a two-dimensional invariant setting and in finite three-dimensional dielectrics. We also construct arbitrarily many localized peaks in a single normalized outgoing mode of a finite smooth dielectric, with prescribed real part of the complex resonance frequency and an arbitrarily high quality-factor target. The modal normalization is a reciprocal-residue normalization. Its relation to other possible interpretations of the original modal-volume question requires separate justification. For a specified channel definition, we construct, for every finite NN, an NN-dimensional counted input space through the same square section at fixed frequency, material bounds, and thresholds. The construction applies when the permitted absolute-bypass threshold exceeds the required passage threshold and when the selected output is the complete outgoing scattering map, including reflection. Thus the corresponding unrestricted uniform finiteness assertion fails. The result does not decide stricter bypass conditions or receiving-only output formulations. These quantified results do not resolve every interpretation of the original OQ14. The formal verification and its scope are described in the manuscript.

Author comments: Initial manuscript. The channel counterexample concerns the specified quantified formulation with the complete outgoing scattering map, including reflection; it does not settle stronger bypass or receiving-only formulations.

Primarily AI-generated textHuman understanding: no partsMaxwell equationsdielectric resonatorsfield localizationoptical channelsscattering theory
Nov 15, 2026112 pages
PDFView work

math.NT — Number Theory

Subrings and cotypes of truncated polynomial rings

Contributed by Ramin Takloo-Bighash, Sarthak Chimni

We study unital finite-index subrings of Rn=Z[t]/(tn)R_n=\Z[t]/(t^n). We compute the cubic cotype function and the quartic total and cocyclic functions at every prime, including the exceptional factors at 22, and prove the corresponding global counting theorems in degrees three, four, and five. Explicit Hermite sums with determinantal weights give full cotype formulas for n=4,5n=4,5, without an asserted closed rational evaluation. We extend these calculations by a linear lifting recursion for every degree and by a two-parameter description of every cocyclic subring for n≥4n\ge4. The latter gives $2-2/(n-1)\le\alpha_n^{\cc}\le2$ for the global cocyclic convergence abscissa, and hence $\alpha_n^{\cc}\to2$. An exact quadratic family of quintic diagonal counts gives absolute convergence of the residual Dirichlet series for $\Rea s>19/13$. All asymptotics are obtained by elementary summation and absolutely convergent convolution.

A mix of human-written and AI-generated textHuman understanding: all partsIntegral ringsp-adic integration
Nov 15, 202636 pages
PDFView work

math.NT — Number Theory

Aigner's Three Monotonicities from Fibonacci Matrices and Six Snake Pieces

Contributed by Elleard Felix Webster Heffern

Starting from the established fact that Markov numbers count perfect matchings of their Markov snake graphs, we give a self-contained proof of the fixed-sum, fixed-numerator, and fixed-denominator orderings proposed by Aigner. The author's Fibonacci-matrix normalization begins with (AC)11−(B2)11=2(AC)_{11}-(B^2)_{11}=2 for consecutive odd-indexed Fibonacci blocks. Fibonacci matrices prove normalization and fixed-numerator monotonicity. The author's six-piece decomposition proves the remaining fixed-sum comparison and fixed-denominator monotonicity. We credit the matching correspondence to its original 2002–2003 REACH development and distinguish that history from the later ordering theorems.

Author comments: Standalone v4, 6 pages, 2 figures. The normalization and three ordering proofs also appear in Section 5 of Meridians; this standalone presentation makes them easier to find and cite. Earlier proofs of the orderings and the 2002–2003 matching correspondence retain their citations. The general Markov uniqueness conjecture remains open. Linked chronology: 8 November 2026: standalone v3: https://zenodo.org/records/24053747 11 November 2026: standalone v4, source, figures and finite-check reports: https://zenodo.org/records/24146546 12 November 2026: v4 PDF mirrored on ResearchGate: https://www.researchgate.net/publication/417809122_Aigner's_Three_Monotonicities_from_Fibonacci_Matrices_and_Six_Snake_Pieces 12 November 2026: corrected Meridians v22: https://zenodo.org/records/24167894 ; its Aigner arguments and figures are unchanged. The v4 source's version note records its original synchronization with v21. 13 November 2026: Meridians published on Hexagon: https://hexagonmath.org/2611.00410 Related computational supplements (2 November 2026): https://zenodo.org/records/23874075 ; current trillion-verification evidence accompanies the corrected Meridians archive above. Earlier project announcements, not announcements of this standalone proof: 21 October 2026, 15:18:25 UTC: X, earlier billion-scale verification: https://x.com/webystar/status/2112926487091282350 23 October 2026, 14:54:57.771 UTC: LinkedIn, earlier 9.3-billion verification: https://www.linkedin.com/posts/elleard-felix-webster-heffern-joseph-by-confirmation-2953a3104_markovnumbers-activity-7519411048115003392-4NaJ No separate social announcement for this paper has been independently verified.

A mix of human-written and AI-generated textHuman understanding: all partsAigner's conjecturesFibonacci matricesMarkoff numbersMarkov numberscombinatorial number theoryfixed-denominator monotonicityfixed-numerator monotonicityfixed-sum monotonicityperfect matchingssnake graphs
Nov 15, 20266 pages
PDFView work

math.AG — Algebraic Geometry

An explicit determinantal formula for Sinkhorn limits of matrices and tensors

Contributed by Shankar Sivarajan

We give an explicit formula, as a single determinant, for the polynomial satisfied by any entry of the limit obtained by scaling a positive tensor of format n1×⋯×nrn_1\times\dots\times n_r to arbitrary prescribed one-dimensional margins (Sinkhorn--Knopp scaling, Kruithof's method, iterative proportional fitting). The polynomial is the multilinear resultant, on the Segre variety $\PP^{n_1-1}\times\dots\times\PP^{n_r-1}$, of the linear forms expressing the margin conditions. Its degree is the multinomial coefficient N=(dn1−1,…,nr−1)N=\binom{d}{n_1-1,\dots,n_r-1} with d=∑k(nk−1)d=\sum_k(n_k-1), and for generic tensors its roots are the corresponding entries of all complex solutions of the scaling equations. A Sylvester matrix turns it into an explicit N×NN\times N generalized eigenvalue problem, whose null vector recovers the whole limit. The leading coefficient is the principal AA-determinant of the product of simplices, that is, the product of the hyperdeterminants of all faces of the tensor. The constant term is likewise a product of face hyperdeterminants, and the faces avoiding the chosen entry split off as a factor independent of that entry. For matrices we also give a short proof, in Pl\"ucker coordinates, of a diagonal form of the eliminant. For every positive tensor, the limit is the unique root for which the Sylvester matrix has a positive null vector of monomials. Generically, the other roots are the corner entries of the solutions of the same scaling equations with complex scaling factors.

Primarily AI-generated textHuman understanding: all partsSinkhorn scaling
Nov 15, 202612 pages
PDFView work

math.NT — Number Theory

Irrationality of χ2(1/q)\chi_2(1/q), Ti2(1/q)\mathrm{Ti}_2(1/q) and χ2(2/q)\chi_2(2/q)

Contributed by Shawn Krisman

Let χ2(z)=∑n≥0z2n+1/(2n+1)2\chi_2(z)=\sum_{n\ge0}z^{2n+1}/(2n+1)^2 be Legendre's chi function and Ti2(z)=∑n≥0(−1)nz2n+1/(2n+1)2\mathrm{Ti}_2(z)=\sum_{n\ge0}(-1)^nz^{2n+1}/(2n+1)^2 the inverse tangent integral. We prove three theorems: χ2(1/q)\chi_2(1/q) is irrational for every integer q≥3q\ge3 with q≠4q\ne4; Ti2(1/q)\mathrm{Ti}_2(1/q) is irrational for every integer q≥5q\ge5; and χ2(2/q)\chi_2(2/q) is irrational for every odd integer q≥175q\ge175. All three come from one construction: the Hankel determinants of a moment functional with half-integer poles and geometric weight ww, read at w=q−2w=q^{-2}, w=−q−2w=-q^{-2} and w=4q−2w=4q^{-2}. Their denominators are bounded prime by prime, their size by a discrete log-gas argument against explicit dual certificates, and their nonvanishing by a reduction modulo an auxiliary prime. The three cases differ at the prime 22, where each needs its own lemma, in the certificates, and in how the nonvanishing lemma is transferred. For large qq the three statements follow from the linear independence criteria of David, Hirata-Kohno and Kawashima; for the first two, a 1990 criterion of Hata, which we could not consult, also applies from a threshold unknown to us. Below these ranges the results are new as far as we know. All three theorems are formalised in Lean 4 with Mathlib and checked by the Lean kernel, using only Lean's three standard axioms.

Primarily AI-generated textHuman understanding: no partsHankel determinantsLeanLegendre chi functionPadé approximationdilogarithmformal verificationinverse tangent integralirrationalitylogarithmic potential theory
Nov 13, 202646 pages
PDFView work

math.NT — Number Theory

Regularity criteria and an effective bound for irregular extensions of Euler triples

Contributed by Sinisa Slijepcevic, Andrej Dujella

An Euler triple is a Diophantine triple {a,b,c}\{a,b,c\} with a<b<c=a+b+2ab+1a<b<c=a+b+2\sqrt{ab+1}. It extends to the regular Diophantine quadruple {a,b,c,d+}\{a,b,c,d_+\}, and it is conjectured that it has no other extension d>cd>c. We prove that an irregular extension forces c<4⋅1048c<4\cdot10^{48}, against c<1098c<10^{98} in recent work of He and Togb\'e. The proof squeezes the index mm of the extension, which locates a common term of two Pell sequences, between a floor from congruences, c<8m4c<8m^4, valid for every irregular extension, and ceilings from linear forms in logarithms. The same squeeze, with other bounds, gives three regularity criteria: by the size of b/ab/a, which confines irregular extensions to 1+11538<b/a<335521+\frac1{1538}<b/a<3355^2; by pair coordinates, through the hypergeometric method; and by coprime divisors of the index combinations, which settles every Euler triple with two elements in a ratio j:kj:k with jk≤300jk\le300. As applications, the three-parameter family of Cipu, Fujita and Mignotte extends only regularly when νA≥2\nu A\ge2 and K≥643K\ge643, and when K=1K=1, A∈{2,3}A\in\{2,3\} and ν≥2\nu\ge2; the latter contains the Hoggatt--Bergum triples, for which this recovers Dujella's theorem for extensions d>cd>c.

A mix of human-written and AI-generated textHuman understanding: some partsDiophantine quadruplesEuler triples
Nov 13, 202672 pages
PDFView work

math.RT — Representation Theory

A proof of Lusztig's connectedness conjecture in finite type

Contributed by Qiyue Tang

We prove that every equal-parameter Kazhdan–Lusztig left cell in a finite Weyl group is connected by simple left multiplications.

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

Primarily AI-generated textHuman understanding: no parts
Nov 13, 202630 pages
PDFView work

math.RT — Representation Theory

A proof of Lusztig’s conjectures for extended affine Weyl groups

Contributed by Qiyue Tang

We prove Lusztig’s conjectures P1–P15 for extended affine Weyl groups with positive integer-valued weight functions.

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

Primarily AI-generated textHuman understanding: no parts
Nov 13, 202657 pages
PDFView work

math.CO — Combinatorics

An Upper Bound Exponent of 0.9999873 for Square-Difference-Free Sets

Contributed by Eric Naslund

Let A⊆{1,…,N}A\subseteq\{1,\ldots,N\} contain no two distinct elements whose difference is a nonzero square, and let s(N)s(N) be the largest possible size of such a set. We prove \[ s(N)\le CN^{0.9999873} \] with an absolute constant CC. A recent preprint of OpenAI proves $s(N)\le CN^{1-\eps}$ for some absolute $\eps>0$. Their proof utilizes a certain average of the Fourier transform over (24!)161(24!)^{161} points, and for the parameter choices displayed there we calculate that they obtained $\eps\approx \exp_{10}(-\exp_{10}(\exp_{10}(5782.77)))$, in the sense that $\log_{10}\log_{10}\log_{10}(1/\eps)\approx5782.77$. We follow the same overall strategy, with new work at almost every quantitative step. The largest gain is the use of 7272 slots (positions at which the Fourier transform is evaluated) in place of (24!)161(24!)^{161}: the exponent is roughly a fixed constant divided by the number of slots, so this alone gains many orders of magnitude, but leaves far less room for loss elsewhere. Other savings come from the local construction at each prime. Small primes are handled jointly rather than one by one; and errors are measured in the actual half-distributions of the laws being compared, not bounded term by term against a product model. Where sums over the primes of a block of Weil-type error terms of size O(p−1/2)O(p^{-1/2}) would be too weak, we prove bounds of order O(p−1)O(p^{-1}) for the same error terms using \'etale cohomology over finite fields (Deligne's theorems and Katz--Sarnak monodromy for families of curves), the representation theory of GL2(Fp)\mathrm{GL}_2(\mathbf F_p), exact counts at p≡3(mod4)p\equiv3\pmod4, and a modular evaluation of Ahlgren and Ono. Dependence in our distributions is controlled by the correlation inequalities of Peyre and Kassabov. The remaining finitely many numerical inequalities are verified by exact computer arithmetic, listed in the appendices; all analytic steps are proved in the text. The companion repository \cite{NaslundUpperRepository2026} contains a partial Lean 4 formalization, totaling over 600,000 lines of lean. It establishes s(N)≤CN0.99999s(N)\le C N^{0.99999}, conditional on five named analytic inputs and explicit numerical hypotheses. This formalizes the most critical parts of the proof.

Primarily AI-generated textHuman understanding: some parts
Nov 13, 2026603 pages
PDFView work