Browse

All works

Browse the Hexagon catalog.

Newest works

1253 works

math.OC — Optimization and Control

Linear-size sparsification from self-concordant barriers

Contributed by Yilin Liu

A θ\theta-self-concordant barrier gives ε\varepsilon-sparsifiers with O(θ/ε2+r)O(\theta / \varepsilon^2 + r) summands and rr exact linear weight constraints. The proof uses a cone-positivity bound with a sharp exponent. Constrained sparsification is monotone under closed lifts on both sides of duality, and jointly lower semicontinuous in the cone and error tolerance. We sharpen the deterministic support bound for hyperbolicity cones and determine the minimum closed hyperbolic lift degree of the nuclear-norm epigraph. We give matching support bounds for this epigraph, the quantum relative entropy cone, and its dual.

Primarily AI-generated textHuman understanding: no partscone sparsificationconic liftshyperbolicity conesnuclear normpartial coloringself-concordant barriers
Nov 20, 20268 pages
PDFView work

math.NT — Number Theory

tlog⁡tt^{\log t} is transcendental for almost all integers tt

Contributed by Shawn Krisman

Let L~=Q‾+Q‾L\widetilde{\mathcal{L}}=\overline{\mathbb{Q}}+\overline{\mathbb{Q}}\mathcal{L} be the Q‾\overline{\mathbb{Q}}-vector space spanned by 11 and the logarithms of nonzero algebraic numbers. We prove that #{2≤t≤X: (log⁡t)2∈L~}≤π(X)+O(X3/4)\#\{2\le t\le X:\ (\log t)^2\in\widetilde{\mathcal{L}}\}\le\pi(X)+O(X^{3/4}). Hence tlog⁡t=e(log⁡t)2t^{\log t}=e^{(\log t)^2} is transcendental for all integers t≥2t\ge2 outside a set of density zero, and no relation (log⁡t−B)(log⁡t−A)=C′+γν(\log t-B)(\log t-A)=C'+\gamma\nu with A,B,C′,γA,B,C',\gamma algebraic and ν\nu a logarithm of an algebraic number holds outside that set. The proof uses Roy's strong six exponentials theorem only through configurations of exponent vectors in dimensions 22 and 33, where it makes the primitive exceptional integers a multiplicative Sidon set, and then Erdős's bound for such sets. The prime numbers show that the bound π(X)\pi(X) is the limit of the method. We also show that the configurations of exponent vectors allowed by the strong six exponentials theorem can be much larger than in dimensions 22 and 33: there are such sets of 2r2^r points in Pn−1\mathbb{P}^{n-1} with n=1+r(r+1)/2n=1+r(r+1)/2. No individual number such as 2log⁡22^{\log 2} is decided.

Primarily AI-generated textHuman understanding: no partsalpha^{log alpha}linear forms in logarithmsmultiplicative Sidon setssix exponentials theoremtranscendence
Nov 20, 202611 pages
PDFView work

math.NT — Number Theory

Sharp finite cases of the Erdős–Surányi interval-product problem: g(4) = 5 and g(5) = 6

Contributed by John Tripodo

Let g(n)g(n) be the Erdős–Surányi function of Erdős Problem #708: the least kk such that, for every set AA of nn distinct integers at least 22 and every interval II of max⁡A\max A consecutive integers, some set of at most kk elements of II has product divisible by ∏a∈Aa\prod_{a\in A} a. We prove g(4)=5g(4)=5 and g(5)=6g(5)=6. The lower bound g(n)≥n+1g(n)\ge n+1 for n≥3n\ge 3 is due to Erdős and Surányi (1959). Our contribution is the matching universal upper bounds g(4)≤5g(4)\le 5 and g(5)≤6g(5)\le 6; to our knowledge these are the first exact values beyond g(3)=4g(3)=4. The four-modulus proof combines a Hall-matching reduction with gcd/lcm collision repair and an anchored proper-divisor lemma. The five-modulus proof classifies a maximal antichain-admissible assignment of the moduli to interval multiples by its occupancy shape; the hardest shapes are a squarefree four-prime exception and a (4,1)(4,1) configuration controlled by a propagation invariant. Both values, in the exact-cardinality reading of the original problem and in the at-most reading used by later work, are machine-checked in Lean 4. The formalization is registered in the Palomar registry as PALOMAR-2026-11-19-000019. The general question whether g(n)≤2ng(n)\le 2n remains open.

Author comments: First version. The lower bounds are due to Erdős and Surányi (1959); the contribution is the matching upper bounds. Both values are formalized in Lean 4 and registered in the Palomar registry as PALOMAR-2026-11-19-000019. The written arguments have had AI-assisted review only, not human refereeing. The general conjecture remains open.

Primarily AI-generated textHuman understanding: no partsErdős Problem 708Erdős–Surányi functionHall's theoremLean 4divisibility antichainsformal verificationinterval product-cover
Nov 20, 202619 pages
PDFView work

math.NT — Number Theory

Irrationality of odd q-zeta values at real quadratic units

Contributed by Shawn Krisman

For ∣q∣<1|q|<1 and odd l≥3l\ge3 let ζq(l)=∑m≥1ml−1qm/(1−qm)\zeta_q(l)=\sum_{m\ge1}m^{l-1}q^m/(1-q^m). Let qq be a unit of norm +1+1 in a real quadratic field Q(d)\mathbb{Q}(\sqrt d) with 0<∣q∣<10<|q|<1. We prove that the dimension of the Q\mathbb{Q}-vector space spanned by 1,d ζq(3),d ζq(5),…,d ζq(A−1)1,\sqrt d\,\zeta_q(3),\sqrt d\,\zeta_q(5),\dots,\sqrt d\,\zeta_q(A-1) is at least (π/12+π2+o(1))A(\pi/\sqrt{12+\pi^2}+o(1))\sqrt A, and that one of d ζq(5),…,d ζq(11)\sqrt d\,\zeta_q(5),\dots,\sqrt d\,\zeta_q(11) lies outside Q+Qd ζq(3)\mathbb{Q}+\mathbb{Q}\sqrt d\,\zeta_q(3); these seem to be the first results on odd qq-zeta values of weight at least five at an algebraic irrational qq. We also give an elementary proof that d ζq(3)\sqrt d\,\zeta_q(3) is irrational, formalised in Lean 4 with Mathlib using only the standard axioms. In particular, for a Lucas sequence (Um)(U_m) of a real quadratic unit η>1\eta>1, ∑m≥1m2(Um+1/Um−η)∉Q\sum_{m\ge1}m^2(U_{m+1}/U_m-\eta)\notin\mathbb{Q}, for instance ∑m≥1m2(Fm+1/Fm−φ)∉Q\sum_{m\ge1}m^2(F_{m+1}/F_m-\varphi)\notin\mathbb{Q}. The proofs use the very-well-poised basic hypergeometric series of Krattenthaler, Rivoal and Zudilin, whose coefficients turn out to be invariant or anti-invariant under q↦1/qq\mapsto1/q, up to a power of qq; at a unit with conjugate 1/q1/q this makes suitable integer linear forms in the twisted values d ζq(l)\sqrt d\,\zeta_q(l) small at both archimedean places. A stronger form of the weight-three statement has been claimed concurrently and independently in unverified preprints.

Primarily AI-generated textHuman understanding: no parts
Nov 20, 202621 pages
PDFView work

math.NT — Number Theory

Root separation for polynomials over Fq[T]\mathbb{F}_q[T]

Contributed by Tomislav Pejkovic

We study the minimum distance between distinct roots of a separable polynomial of degree d≥2d\ge2 over Fq[T]\mathbb{F}_q[T], with respect to the absolute value ∣T∣=q|T|=q. For reducible polynomials of height HH, the exponent d−1d-1 in the lower bound H−(d−1)H^{-(d-1)} is best possible in every degree. In characteristic two we construct absolutely irreducible polynomials that attain this bound at every height qNq^N, N≥1N\ge1. In odd characteristic pp, the exponent d−1d-1 is best possible for absolutely irreducible polynomials whenever d−1=pamd-1=p^a m with p∤mp\nmid m and m∣pa−1m\mid p^a-1. The separation exponents for irreducible and absolutely irreducible polynomials coincide for every qq and dd.

Primarily AI-generated textHuman understanding: some partsDiophantine approximationfunction fields of positive characteristicpolynomial heightroot separation
Nov 20, 202619 pages
PDFView work

math.SP — Spectral Theory

The equilateral triangle is the extremal triangle for the lowest Robin eigenvalue, for every boundary parameter

Contributed by Jason Davies

Let λ1(T,α)\lambda_1(T,\alpha) be the lowest eigenvalue of the Laplacian on a triangle TT with the Robin condition ∂νu+αu=0\partial_\nu u+\alpha u=0. Lotoreichik and Lu conjectured that, among triangles of given area, the equilateral triangle minimises λ1(T,α)\lambda_1(T,\alpha) when α>0\alpha>0 and maximises it when α<0\alpha<0. We prove both halves, with the equilateral triangle as the unique extremiser; the same holds at fixed perimeter. The proof is computer-assisted. For α>0\alpha>0 the result is new; previously the inequality was known for all triangles only when α∣T∣\alpha\sqrt{|T|} is smaller than an absolute but non-explicit constant (Ferudun). Thin triangles are handled by slicing, and α∣T∣≤1/100\alpha\sqrt{|T|}\le1/100 by an explicit vector field and a Schur-complement criterion. Near the equilateral triangle EE, the second-order perturbation constant of EE is bounded from above through certified lower bounds for two perturbed eigenvalue problems, uniformly in α\alpha. The remaining compact set of shapes is covered by 100 cells; an exact identity in the Klein model of the hyperbolic plane of shapes, together with concavity, reduces each cell to certified Crouzeix–Raviart lower bounds at its vertices, which are checked in exact integer and ball arithmetic. For α<0\alpha<0 the first proof is due to Ma (computer-assisted, 2026); ours was found independently. Write β=−α∣T∣\beta=-\alpha\sqrt{|T|}. For β≤6/5\beta\le6/5 two trial functions suffice. For β≥1.1531\beta\ge1.1531 an exact corner bound disposes of all triangles with a small angle, and on the remaining near-equilateral triangles three transplanted corner waves, with a one-step perturbation estimate, reduce the problem to a one-variable inequality, which is verified in ball arithmetic.

Primarily AI-generated textHuman understanding: no partsCrouzeix–Raviart elementsRobin LaplacianRobin eigenvaluecomputer-assisted proofinterval arithmeticisoperimetric inequalityshape optimizationtriangles
Nov 20, 202638 pages
PDFView work

math.SP — Spectral Theory

Maximizing the First Positive Neumann Eigenvalue of Pentagons and Hexagons

Contributed by Lüwei Dong, Sirui Yang

For n=5n=5 and n=6n=6, we prove that the regular nn-gon uniquely maximizes the first positive Neumann eigenvalue of the Laplacian among all simple nn-gons of prescribed area, up to congruence. Reflex and straight interior angles are allowed. We also exclude nonconvex quadrilaterals, prove a strict gap exceeding 5/n45/n^4 for every simple nonconvex nn-gon with n≥4n\ge4, establish quantitative strict optimality along the affine orbit of regular polygons, and isolate the remaining (2,1,1)(2,1,1) chamber for heptagons. The finite comparisons are backed by exact rational or interval arithmetic certificates.

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

math.CA — Classical Analysis and ODEs

Character coefficients for integrals of odd products of hyperbolic tangents

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

For odd n≥3n\geq 3, we express the integral of x−2∏k=1ntanh⁡(kx)x^{-2}\prod_{k=1}^{n}\tanh(kx) on the positive half-line in terms of derivatives of primitive even Dirichlet LL-functions at −1-1 and logarithms of integers. Finite character sums give every coefficient, including the rational coefficients of the logarithms.

Primarily AI-generated textHuman understanding: all partsDirichlet charactersMellin transformshyperbolic tangent integrals
Nov 20, 20262 pages
PDFView work

math.CO — Combinatorics

Counting triangles with interlacing rows

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

For a triangle filled with distinct integers, require each entry above the bottom row to lie strictly between its two children. We give an exact formula for the number of fillings of any size, using row transfer matrices and inclusion–exclusion. A refinement prescribes the bottom-row positions of both extrema.

Primarily AI-generated textHuman understanding: all partsinclusion–exclusioninterlacing trianglestransfer matrices
Nov 20, 20262 pages
PDFView work

math.GT — Geometric Topology

The strong AJ conjecture for hyperbolic prime knots is false

Contributed by RJ Acuna

Let KK be a knot in S3S^3. The strong AJ conjecture relates two of its invariants. The first is the minimal-order annihilator A^\widehat A of the nnth colored Jones polynomial J(n)J(n). The second is the two-variable AA-polynomial of Cooper, Culler, Gillet, Long, and Shalen. The conjecture says that after specialization ε∗(A^)≍A\varepsilon^*(\widehat A)\asymp A. Zhang gave the first family of composite-knot counterexamples. For 8118_{11} the specialization of A^\widehat A carries an extra trefoil factor L+M6L+M^6. We prove this by verifying Leˆ\text{L\^{e}}'s P^=A^\widehat P=\widehat A conjecture. Zhang's corrected formulation of the AJ conjecture agrees with Leˆ\text{L\^{e}}'s weak AJ conjecture, which we prove for 8118_{11}. Li, Li, and Sun have since reported counterexamples of the weak AJ conjecture among non-hyperbolic prime knots. This work was AI assisted, and parts of it have been formalized in Lean.

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

math.PR — Probability

Convex, time-decreasing functions need not preserve semimartingales

Contributed by Alexander Dabrowski

We construct a continuous function, strictly convex in space and strictly decreasing in time, whose composition with a bounded continuous martingale is not a semimartingale. We also construct a continuous, spatially convex, time-increasing function that is not a difference of spatially convex, time-nonincreasing functions on a rectangle. The construction combines parabolic oscillations, diffusion superposition and martingale concatenation to obtain infinite drift variation in the composition.

Primarily AI-generated textHuman understanding: all partsItô’s formulaSemimartingalescontinuous martingalesconvex functionsfinite variationparabolic oscillationstime-monotone functions
Nov 20, 20264 pages
PDFView work

math.NT — Number Theory

Root separation in one-parameter families of integer polynomials

Contributed by Tomislav Pejkovic

For every n≥2n\ge2 we construct irreducible integer polynomials of degree nn and arbitrarily large height HH with two roots at distance ≪nH−(4n−3)/6\ll_n H^{-(4n-3)/6}. All the roots can be chosen positive, or the two close roots can be chosen nonreal with all the other roots positive. We also construct monic irreducible examples. For a squarefree family F(T,X)∈Z[T,X]F(T,X)\in\mathbb{Z}[T,X] of positive degree in TT, let e(F)e(F) denote the exponent for which the least distance between two roots of F(t,X)F(t,X) is H(F(t,X))−e(F)+o(1)H(F(t,X))^{-e(F)+o(1)} as t→+∞t\to+\infty. Among families of degree nn in XX and degree three in TT, the maximum of e(F)e(F) is (2n−1)/3(2n-1)/3. It is (4n−3)/6(4n-3)/6 for families irreducible over Q(T)\mathbb{Q}(T), and (2n−2)/3(2n-2)/3 for monic families of odd degree n≥3n\ge3. For arbitrary degree in TT, we prove e(F)≤(3n−1)/4e(F)\le(3n-1)/4. Two roots in different irreducible factors over C(T)\mathbb{C}(T) have separation exponent strictly less than 2n/32n/3. If E(n)E(n) denotes the supremum of e(F)e(F) over squarefree families of degree nn in XX, then E(n)/nE(n)/n tends to sup⁡d≥2E(d)/d∈[2/3,3/4]\sup_{d\ge2}E(d)/d\in[2/3,3/4].

Primarily AI-generated textHuman understanding: some partsinteger polynomialsirreducible polynomialspolynomial familiesroot separation
Nov 20, 202618 pages
PDFView work

math.CO — Combinatorics

Regular induced subgraphs in bounded independent-edge arrays

Contributed by Arthur Freitas Ramos, David Barros Hulak, Ruy J. G. B. de Queiroz

Let GG be a random graph whose edges are independent and whose edge probabilities lie in [ξ,1−ξ][\xi,1-\xi] for a fixed 0<ξ<1/20<\xi<1/2. With probability at least 1−n−11-n^{-1}, GG contains a regular induced subgraph on at least cξ(log⁡n)2c_\xi(\log n)^2 vertices. If all expected degrees are equal, each prescribed order kk up to a small multiple of n2/3n^{2/3} occurs with failure probability at most exp⁡(−cn/k3/2)\exp(-cn/k^{3/2}), for kk sufficiently large. The same probability estimate holds up to order n2/(d+3)n^{2/(d+3)} for a Lipschitz kernel in dimension dd, and up to order n4/(r+7)n^{4/(r+7)} for an array admitting a bounded symmetric completion of rank at most rr. A linear product array has largest regular induced order Θ(n)\Theta(\sqrt n) with high probability, attaining the scale for dimension one and rank one. The proof weights each candidate set by the reciprocal of its success probability and controls the dependence due to shared edges.

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

math.AG — Algebraic Geometry

A residue obstruction for the whole family F_2 in the plane Jacobian problem

Contributed by David Niedbala Giraudin

In the classification of Guccione, Guccione, Horruitiner and Valqui of the possible shapes of a counterexample to the plane Jacobian conjecture, the family F_2 consists of the standard (m,n)-pairs with n=2m-1, m>=2, starting corner (5,20) and final corner (7/5,2); its degrees are (25m,25(2m-1)), that is (50,75), (75,125), (100,175), ... We show that no such pair exists, for every m>=2. (Other shapes with the same degrees, which occur for (50,75) and (125,225), are not covered.) This extends to the whole family the argument given for (m,n)=(3,5) in hexagon:2611.00675: on a generic fibre of P the form y^2 Q dQ has no residue along the left side of the Newton polygon, while its residues along the right side add up to -(2m/(2m-1)) times a sum of squares G^2, which cannot vanish. All statements are proved relative to the cited results of Guccione-Guccione-Valqui; the exact computations are reproduced by an ancillary script. The argument has not yet been examined by specialists.

Primarily AI-generated textHuman understanding: no partsJacobian conjectureKeller mapsNewton polygonfamily F_2plane Jacobian problemresidue theorem
Nov 20, 20265 pages
PDFView work

math.CO — Combinatorics

Hanoi tilings with a prescribed number of bottom squares

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

For each fixed integer k≥2k\geq 2, every sufficiently large integer square admits a Hanoi tiling with exactly kk squares on its bottom edge. We construct nearly equal columns from two coprime widths and prove a rectangle lemma to fill their remaining height.

Primarily AI-generated textHuman understanding: all partsChinese remainder theoremHanoi tilingssquare dissections
Nov 20, 20262 pages
PDFView work

math.NT — Number Theory

Two primitive Gaussian Fermat–Catalan identities

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

We give pairwise coprime Gaussian integer solutions with exponent triples (2,3,13)(2,3,13) and (3,9,2)(3,9,2). The second follows from an integer identity recorded by P.-J. Cazorla García. The lists of base norms distinguish both Gaussian triples from the examples on Ed Pegg Jr.’s published list.

Primarily AI-generated textHuman understanding: all partsFermat–CatalanGaussian integersperfect powers
Nov 20, 20262 pages
PDFView work

math.CO — Combinatorics

The edge sums of seven double-six domino frames

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

Partition the 28 double-six dominoes into seven square frames. When the four edge sums of each frame agree, exactly 10,821 sorted lists of the seven sums are attainable. An exact-cover recurrence proves completeness, and a physical arrangement certifies each list.

Primarily AI-generated textHuman understanding: all partsdominoesenumerationexact cover
Nov 20, 20262 pages
PDFView work

math.MG — Metric Geometry

All 97 Chaos Tiles duos in a single 66-tile arrangement

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

Ed Pegg Jr. asks whether 50 Veks and 40 Kays suffice to realize all 97 legal two-tile contacts in one connected arrangement. We exhibit such an arrangement using 35 Veks and 31 Kays. A numbered diagram, assembly instructions, and certificates for all 97 contact types specify the construction.

Primarily AI-generated textHuman understanding: all partsedge contactspentagonal tilingsrecreational mathematics
Nov 20, 20264 pages
PDFView work

math.MG — Metric Geometry

Solutions to Bianchi's covariogram problem and Kobayashi's Fourier zero-set problem for C+2C^2_+ convex bodies

Contributed by Sihan Chen

In each dimension n≥2n\ge2, the covariogram of a C+2C^2_+ convex body determines it among all convex bodies, up to translation and point reflection. For a general convex body, it suffices that the densities of the absolutely continuous part of its surface area measure at uu and −u-u be positive and unequal on a set of positive spherical measure. When the two densities are positive on a set of positive spherical measure, the complex zero set of the Fourier--Laplace transform, given without multiplicities, determines the body up to translation within that class. An averaged stationary phase formula locates simple zeros that account for the leading term in Jensen's bound, and a growth theorem controls the factors supported on the remaining zeros. In dimension three, width and the ordered antipodal curvature ratio also determine a body up to translation in the class with C1,1C^{1,1} support functions and uniformly positive curvature-radius matrices.

Primarily AI-generated textHuman understanding: some partsBianchi's covariogram problemFourier--Laplace transformKobayashi's Fourier zero-set problemPhase retrievalantipodal curvature ratioconvex bodiesstationary phasesurface area measure
Nov 20, 202625 pages
PDFView work

math.NT — Number Theory

Algorithms for computing iso-Delaunay domains

Contributed by Mathieu Dutour Sikiric

For a linear space TT of quadratic forms, we describe an algorithm enumerating the iso-Delaunay domains of TT, and a randomized search for an iso-Delaunay domain all of whose extreme rays are positive definite. For the quadratic forms in six variables, the search finds 14721472 pairwise inequivalent LL-type domains all of whose extreme rays are positive definite, the smallest having 2424 facets and 4747 extreme rays. No such domain exists in dimension 2≤n≤52\leq n\leq 5.

Author comments: 17 pages. The algorithms are implemented in polyhedral_common, https://github.com/MathieuDutSik/polyhedral_common. The data of the 1472 domains are at https://doi.org/10.5281/zenodo.24377749

A mix of human-written and AI-generated textHuman understanding: all partsDelaunay tessellationsL-typesVoronoi reduction theoryiso-Delaunay domainsquadratic forms
Nov 20, 202617 pages
PDFView work

math.CO — Combinatorics

Reconstructing three-point supports from their ordered convolution squares

Contributed by Alexandre Couret

Given two three-element subsets of an abelian group, we classify when their labelled ordered sum counts agree, with diagonal pairs included. Equality comes either from a translation by an element killed by doubling or from an explicit exceptional configuration involving both doubling and tripling. We give a proof using parity and the doubling fibres, and identify the corresponding Lean theorem registered in Palomar.

Author comments: Expository note accompanying Palomar record PALOMAR-2026-11-08-000010 v1. It connects the exceptional case with the cyclic example covered by Chen and Yan, Theorem 1.2(ii). Bibliographic priority and independent human mathematical review remain open.

Primarily AI-generated textHuman understanding: some parts
Nov 20, 20262 pages
PDFView work

math.AG — Algebraic Geometry

A residue obstruction for the family F_2 with (m,n)=(3,5): the degree pair (75,125) in the plane Jacobian problem

Contributed by David Niedbala Giraudin

Guccione, Guccione and Valqui list the possible shapes of a counterexample to the plane Jacobian conjecture of small degree; the first shape of maximal degree 125 is the family F_2 with (m,n)=(3,5), of degrees (75,125). We show that no standard (3,5)-pair of this shape exists. The proof combines three results of Guccione-Guccione-Valqui with the residue theorem on a generic fibre of P: on such a fibre the form y^2 Q dQ has no residue along the left side of the Newton polygon, while its residues along the right side add up to a quantity that cannot vanish. All statements are proved relative to the cited results; the exact computations are reproduced by an ancillary script. The argument has not yet been examined by specialists.

Primarily AI-generated textHuman understanding: no parts125)Jacobian conjectureKeller mapsNewton polygondegree pair (75plane Jacobian problemresidue theorem
Nov 20, 20265 pages
PDFView work

math.DS — Dynamical Systems

Obtuse rational lattice triangles

Contributed by Manvir Jaswal

A rational triangle is a lattice triangle if the Veech group of its unfolding is a lattice. Answering a question of Hooper, we prove that an obtuse rational triangle is a lattice triangle if and only if its angles are (π/n,π/n,(n−2)π/n)(\pi/n,\pi/n,(n-2)\pi/n) with n≥5n\ge5, (π/2k,π/k,(2k−3)π/2k)(\pi/2k,\pi/k,(2k-3)\pi/2k) with k≥4k\ge4, or (π/12,π/3,7π/12)(\pi/12,\pi/3,7\pi/12). The idea is a first-order test on relative periods. By Möller's theorem, on a Veech surface the difference of two zeros of the holomorphic form is torsion in the factor of the Jacobian with real multiplication, and stays torsion along the Teichmüller curve. So certain relative periods vanish along the Teichmüller disc, and on a triangle unfolding their first derivative is an integral over the plane that can be computed in closed form. For obtuse angle at most 2π/32\pi/3 we determine for every denominator where the criterion of Mirzakhani and Wright is blind, and exclude all but four of the triangles there by relative periods and by cylinders whose moduli or areas cannot occur on a Veech surface. For obtuse angle above 2π/32\pi/3 the proof uses a theorem of Larsen, Norton and Zykoski. Parts of the proof are computer-assisted.

Primarily AI-generated textHuman understanding: no partsTeichmüller curvesVeech surfaceslattice trianglesrational billiardstranslation surfaces
Nov 20, 202658 pages
PDFView work

math.CO — Combinatorics

The Unfair 0–1 Polynomial Conjecture for Trinomial Factors

Contributed by Alessandro Baravelli

Let two monic polynomials with nonnegative real coefficients have a product whose coefficients are all zero or one. If one factor has exactly three nonzero terms, we prove that every nonzero coefficient in both factors equals one. The exponents of the three terms and the degree of the other factor are arbitrary. Equivalently, if two independent, finitely supported integer-valued random variables have a sum uniform on its support, and one takes exactly three values, each is uniform on its own support. A fractional middle coefficient would have an algebraic conjugate of modulus greater than one. At this conjugate the recurrence forces certain differences between coefficients of the other factor to grow. We bound explicit linear combinations of these differences by counting walks on the integers and applying polynomial approximation on a real interval.

Primarily AI-generated textHuman understanding: no parts
Nov 20, 20268 pages
PDFView work

math.CO — Combinatorics

A strengthening of some results of the paper "Structured sunflowers and canonical Ramsey properties"

Contributed by Rob Sullivan

In this short note, we give an exposition of an argument (potentially LLM-generated by Budiyanto) which strengthens two theorems of the author and Winkel from the recent paper “Structured sunflowers and canonical Ramsey properties”, also proving the main conjecture of that paper.

Primarily human-written textHuman understanding: all parts
Nov 19, 20263 pages
PDFView work

math.NT — Number Theory

Exact Sumsets of Primitive Quadratic Norms

Contributed by Roy van Rijn

We determine the exact binary sumsets of primitive quadratic norm values at discriminants −3,−7,−8,−11-3,-7,-8,-11. The local congruence conditions are sufficient in three cases; at discriminant −7-7 the complete additional exception set is {7,77,203}\{7,77,203\}. Stronger split-prime core identities separate the ramified dilations. The proofs combine quaternionic norm shells, precisely normalized classical Hecke bounds, and dyadic and ramified local filters. Explicit infinite estimates, rational interval certificates, complete finite sumset scans and multiplicative descent cover every positive target. We supply standalone verification code and explain the finite reductions that make the certificates complete. All sumsets concern numerical values, without coordinate multiplicities.

Primarily AI-generated textHuman understanding: no partsEisenstein integersHecke operatorsbinary quadratic formsexact sumsetsfinite certificatesprimitive quadratic norms
Nov 19, 202634 pages
PDFView work

math.NT — Number Theory

Pointwise Correlations of Quadratic Form Values and Splitting Semigroups

Contributed by Roy van Rijn

Under the stated analytic inputs, we establish the fixed-shift pair asymptotics predicted by Smilansky for the ordinary values of x2+dy2x^2+dy^2, d=1,2,3,4,7d=1,2,3,4,7. In particular, the number of n≤Xn\le X for which both nn and n+1n+1 are sums of two squares is asymptotic to X/(2log⁡X)X/(2\log X). For primitive positive definite binary forms of fixed discriminants Δi=fi2D\Delta_i=f_i^2D sharing one negative fundamental discriminant DD, we count values admitting coprime coordinates. Replacing either form within its respective genus preserves the leading binary count, with a relative logarithmic saving through an independent classical route. Under the recent analytic inputs we give an explicit mixed leading term with relative o(1)o(1), including different fixed conductors in that one field, and no class-number divisor. The central mechanism is a shared comparison between sparse indicators and arithmetic models retaining every surviving congruence character. Following Walsh's proposed indicator extension, we supply the models, local factors and a uniform reflected-target argument, using the recent zero-free and weighted-dilation theorems of OpenAI. Applications to fixed subgroup restrictions and prime-coset self-sums give target-uniform asymptotics with logarithmic savings and exact eventual congruence criteria. They include prime support 1(mod12)1\pmod{12} on targets 2(mod12)2\pmod{12} and prime support 3(mod4)3\pmod4 on even targets. All counts concern numerical values without coordinate or ideal multiplicities.

Primarily AI-generated textHuman understanding: no partsarithmetic modelsbinary quadratic formsgenus invariancepointwise correlationssplitting semigroupssums of two squares
Nov 19, 202669 pages
PDFView work

math.SP — Spectral Theory

Maximizing the First Positive Neumann Eigenvalue of Simple Pentagons

Contributed by Lüwei Dong, Hongyi Wang

We prove that among all simple pentagons of prescribed area—including non-convex pentagons and pentagons with straight interior angles—the regular pentagon uniquely maximizes the first positive Neumann eigenvalue of the Laplacian up to congruence. The proof separates naturally into two regimes. For pentagons having at least one reflex or straight interior angle, the number of strictly convex vertices is at most four; conformal mapping from the unit disk together with a Schwarz–Christoffel and Blaschke-product estimate yields the uniform bound ∣P∣μ1(P)<10.34|P|\mu_1(P) < 10.34, strictly below the regular-pentagon value ∣R∣μ1(R)>10.35335|R|\mu_1(R) > 10.35335. For strictly convex pentagons, normalizing a maximum-area vertex triangle reduces the problem to a four-dimensional shape chart coupled with a unimodular metric matrix. Combining covariance bounds, explicit polynomial trial functions, conic duality for pairs of trial functions, and Bernstein-basis branch-and-bound, we confine every potential maximizer to an explicit neighborhood of the regular pentagon in vertex Fourier coordinates. Because the first positive eigenspace of the regular pentagon is two-dimensional, we analyze both eigenfunctions simultaneously together with their first-order corrections to show that every nontrivial local deformation of the similarity class strictly decreases ∣P∣μ1(P)|P|\mu_1(P). All finite-dimensional inequalities invoked in the proof are accompanied by independently verifiable rational and interval arithmetic certificates.

Author comments: 24 pages. The ancillary files include the numerical certificates and verification programs. Reproduction instructions for this submission are in anc/verification.json.

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

math.CO — Combinatorics

Sharp packing bounds for Poly-5 and Handy-Octs

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

On the 89-square Poly-5 board, distinct pentominoes can cover at most 26 of the 28 boundary squares and 56 of the 60 exterior unit edges. Both maxima occur in a full tiling. For the five Handy-Octs octiamonds, the least area of a convex triangular-grid enclosure is 43 unit triangles. There is one optimal enclosure and it has precisely five packings, up to lattice symmetries. We prove the bounds by finite enumeration.

Primarily AI-generated textHuman understanding: some partsexact coveroctiamondspentominoestilings
Nov 19, 20264 pages
PDFView work

math.MG — Metric Geometry

Gradient structures on metric measure spaces

Contributed by Fabrice Baudoin

This work develops a theory of finite-rank gradients on metric measure spaces where the reference measure and the measure used to integrate gradients may be mutually singular. Examples include local trees, RCD spaces, sub-Riemannian manifolds, the harmonic Sierpiński gasket, and the Liouville Brownian motion.

Primarily AI-generated textHuman understanding: all parts
Nov 19, 2026200 pages
PDFView work

math.AG — Algebraic Geometry

Schubert Cox Rings and Root Operators

Contributed by Jiarui Fei

We identify the Cox ring of every Schubert variety in a symmetrizable Kac--Moody partial flag variety with an upper cluster algebra whose frozen variables are not inverted. The construction also applies to Bott--Samelson varieties for arbitrary words and to their normal projective birational contractions that preserve the standard affine chart. A line-bundle recursion determines the boundary coefficients of the exchange relations. In this mutation class, each nonzero positive simple-root operator and each nonzero stabilizing negative simple-root operator acts in a suitable seed as a monomial times a partial derivative in one frozen variable. Consequently, a single theta basis describes the root filtrations on all divisorial section spaces. We compute the facets of its regular cone from the word and the surviving divisors. The leading terms of the root operators yield tropical formulas for finite-type Levi crystals and polyhedral formulas for branching multiplicities. We obtain formulas for adjoint sections and extend the adapted root charts to projective horospherical varieties with free class group under a simply connected semisimple group.

Author comments: 39 pages, comments are welcome

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

math.NT — Number Theory

Non-existence of non-Eulerian irregular Diophantine quadruples

Contributed by Andrej Dujella, Sinisa Slijepcevic

A Diophantine quadruple {a,b,c,d}\{a,b,c,d\} with a<b<c<da<b<c<d is irregular if d≠a+b+c+2abc+2(ab+1)(ac+1)(bc+1)d\ne a+b+c+2abc+2\sqrt{(ab+1)(ac+1)(bc+1)}. It is conjectured that there are none, and He and Togb\'e have recently given a proof that there are only finitely many, with c<10338c<10^{338}. We study the non-Eulerian irregular quadruples, those whose triple {a,b,c}\{a,b,c\} is not an Euler triple, that is, c≠a+b+2ab+1c\ne a+b+2\sqrt{ab+1}, and reduce them to nine explicit families. The families are defined by the degree of {a,b,c}\{a,b,c\} under canonical descent, by the position of the descent partner d−(a,b,c)d_-(a,b,c) relative to aa and bb, by the shape of the iterated descent, and by explicit windows for the index of z=cd+1z=\sqrt{cd+1} in two Pell sequences. In particular c<1099c<10^{99}, and c<1079.71c<10^{79.71} when zz has an odd-index representation; for triples of degree one, c<1.81⋅1047c<1.81\cdot10^{47}. He and Togb\'e obtained c<10162c<10^{162} for degree one and c<10338c<10^{338} for higher degree. With the bound c<4⋅1048c<4\cdot10^{48} for Euler triples of a companion paper, every irregular Diophantine quadruple has c<1099c<10^{99}. For each family we give exact finite tests, in integer arithmetic or with certified rational enclosures, whose success shows that a given triple of the family has no irregular extension. Running these tests over the families is a finite computation. The numerical verification of these remaining cases is in progress, and its results will be appended to the final version of the paper.

Primarily AI-generated textHuman understanding: some parts
Nov 19, 2026203 pages
PDFView work

cs.DS — Data Structures and Algorithms

Exact minimum-cost arborescences under a single arc failure

Contributed by Yilin Liu

Every rooted weighted digraph on n vertices has a subgraph with O(n3/2)O(n^{3/2}) arcs that contains a minimum-cost spanning arborescence after any feasible single arc deletion, answering a question of Dey and Kavitha. An oracle of the same size reports an optimal arborescence or a shortest list of arc replacements in time linear in the output. The construction uses shortest cycles in a weighted matroid exchange graph and admits deterministic subcubic preprocessing on simple digraphs. A reduction from directed distance preservation gives an Ω(n4/3log⁡n)\Omega(n^{4/3} \log n)-bit lower bound for reporting on simple digraphs with input arc identifiers, even with constant per-query error.

Primarily AI-generated textHuman understanding: no partsdistance preserversfault-tolerant sparsificationminimum-cost arborescencessingle-arc failuresweighted matroid intersection
Nov 19, 20268 pages
PDFView work

math.ST — Statistics Theory

Finite-resolution information about a common clock: alias depth, holding-time loss, and the sampled Ehrenfest chain

Contributed by Samuil Petkov

We study how much Fisher information about a common rate multiplier survives when a reaction system is observed only at discrete times. For a finite known mark law, the first loss at short sampling times is governed by an alias depth hh, the smallest length mismatch among reaction-count fibres: the unrecovered fraction of reaction-count information is 1−Fp(λ)=Cpλh−1+O(λh)1-F_p(\lambda)=C_p\lambda^{h-1}+O(\lambda^h) with an explicit alias coefficient CpC_p. For a fixed irreducible finite generator, holding times add a separate loss: the missing log-clock information is A2t2+O(t3)A_2t^2+O(t^3), or (A3+H)t3+O(t4)(A_3+H)t^3+O(t^4) when A2=0A_2=0. As a worked example we treat the stationary symmetric Ehrenfest chain of known size Ω\Omega observed at its endpoints, with sampling time tt and λ=Ωt\lambda=\Omega t. For every population and every finite positive tt, the exact endpoint information lies between an explicit quadratic lower bound and its matched Gaussian benchmark, Bn≤Rn<g(t)/λB_n\le R_n<g(t)/\lambda, with relative width at most 1/(2λ)1/(2\lambda) measured from BnB_n. The symmetric compound-Poisson benchmark is uniformly relatively accurate on 1≤λ≤LΩ1\le\lambda\le L_\Omega if and only if LΩ=o(Ω)L_\Omega=o(\Omega). A formula-level comparison with the binomial AR(1) literature (Cui–Lund; Weiß–Kim) has not been completed.

A mix of human-written and AI-generated textHuman understanding: all partsEhrenfest chainFisher informationalias depthcompound-Poisson approximationdiscrete-time samplingholding timesmissing information
Nov 19, 202623 pages
PDFView work

math.PR — Probability

Spectral outliers of self-coupled covariance matrices with exact zero weights

Contributed by Samuil Petkov

We study the right spectral outliers of Md=n−1AdDAdTM_d=n^{-1}A_dDA_d^{\mathsf T}, where the columns of AdA_d are drawn from a Gaussian mixture with a fixed-dimensional signal subspace and each diagonal weight Dℓℓ=hbℓ(gℓ)D_{\ell\ell}=h_{b_\ell}(g_\ell) is a function of the class label and of the low-dimensional Gaussian coordinates of the same sample. The effective outlier theory of Ben Arous, Gheissari, Huang and Jagannath for such self-coupled matrices assumes that the weights do not accumulate at zero, which excludes hard gates such as the derivative of a rectified linear unit. Assuming hb(g)∈{0}∪[τ,M]h_b(g)\in\{0\}\cup[\tau,M], we prove that exact zero weights do not change the positive right-outlier equation. The proof deletes inactive columns before any linearization, keeps their random normalization, and applies the invertible-weight theory to the exact conditional mark law of the active samples; we show, by conditioning on the marks, that this theory extends to non-Gaussian fixed-dimensional marks. The limiting spectrum acquires the atom (1−ϕπ)+(1-\phi\pi)_+ at zero, while positive outliers are the roots of a q×qq\times q determinant. We obtain multiplicity-preserving eigenvalue counts, absence of spurious right outliers, a projected-eigenvector normalization, an invariant-subspace formula at repeated roots, and the exact finite-dimensional kernel.

A mix of human-written and AI-generated textHuman understanding: all partsGaussian mixturesexact zero weightsrandom matricesrectified linear unitspectral outliersweighted sample covariance matrices
Nov 19, 202617 pages
PDFView work

math.PR — Probability

Observation cost of nonequilibrium in nonnormal networks: a matched exponent for an explicit four-state generator

Contributed by Samuil Petkov

We consider detection of nonequilibrium from passive, causally scheduled snapshots of a stationary continuous-time Markov chain, with gaps between snapshots of at least τ\tau. False alarms must be controlled uniformly over every finite stationary detailed-balance chain observed through a deterministic labelling, with no restriction on hidden dimension, rates, stationary label law or mixing time. Aznagulov showed that for normal generators the optimal snapshot cost grows like e2γirrτe^{2\gamma_{\rm irr}\tau}, and that for nonnormal generators its exponent lies in a spectral window. For an explicit nonnormal four-state generator Q4Q_4, with a real slow mode and residual damping β\beta, we prove that τ−1log⁡N∗→2γ\tau^{-1}\log N^*\to2\gamma, where γ=(701−158761)/126∈(2,β)\gamma=(701-\sqrt{158761})/126\in(2,\beta) is a relaxation rate of an explicit reversible birth–death comparator; for Q4Q_4 this exponent lies strictly inside the window [2,2β][2,2\beta]. The comparator comes from an ordered-eigenfunction completion lemma: among π\pi-reversible generators with a prescribed strictly monotone eigenfunction and eigenvalue, a birth–death generator maximizes the entire Dirichlet form. The upper bound uses symmetric two-lag scores whose stationary mean is nonpositive under every hidden reversible model, together with a positive-operator tilt lemma that gives the moment-generating bound e32nθ2e^{32n\theta^2} for a deterministic number nn of dependent transitions, uniformly over the null class. We also show that the two-lag pair-law approximation exponent of Q4Q_4 by hidden reversible models is γ\gamma, that the cost exponent 2γ2\gamma holds uniformly over a four-parameter box of nonnormal deformations, and that it extends to interacting path families on {1,2,3,4}d\{1,2,3,4\}^d built from tensor lifts. More generally, if uu has distinct entries and is an eigenvector of QQ and of its L2(π)L^2(\pi)-adjoint with eigenvalue −λ-\lambda, the exponent is 2γ∗2\gamma^* whenever γ∗<β\gamma^*<\beta, where γ∗\gamma^* is the restricted gap of the completion.

A mix of human-written and AI-generated textHuman understanding: all partsbirth-death processescontinuous-time Markov chainsdetailed balancehypothesis testingnonequilibrium detectionnonnormal generators
Nov 19, 202617 pages
PDFView work

math-ph — Mathematical Physics

A four-state Markovian Mpemba effect in which every triplet test fails

Contributed by Samuil Petkov

Avitan, Factor and Gelbwaser-Klimovsky derived necessary conditions on the transition rates of a three-level system for the Markovian Mpemba effect, and proposed applying them to every triplet of levels of an NN-level system. For a zero-temperature bath and non-degenerate spectrum they proved that a strong violation of the conditions in all triplets excludes the effect; for non-zero temperature they conjectured, on the basis of numerical sampling, that violation in all triplets excludes it. We give an explicit reversible four-state chain, with energies U(0,1,2,64)U(0,1,2,64) and a bath at inverse temperature ln⁡2/U\ln 2/U, in which all four triplet conditions fail strictly and yet a hotter thermal initial state has a strictly smaller slow-mode amplitude than a colder one. This is a direct Mpemba effect, so the finite-temperature conjecture fails for N=4N=4. The example is marginal: it uses Boltzmann weights of order 2−642^{-64}, initial temperatures of order 102 U10^2\,U, a relative amplitude gap of about 0.07%0.07\%, and three of the four triplets fail by margins of order 10−610^{-6}. We then give a second, less marginal example with energies (0,130,0.434,5)(0,\frac{1}{30},0.434,5), bath inverse temperature 33 and initial inverse temperatures 0.060.06 and 16\frac{1}{6}: every triplet fails by at least 1.08×10−31.08\times10^{-3} relative to its largest rate, and the relative amplitude gap is 1.22%1.22\%. A variant of the second example with rational Boltzmann factors has the same properties and is certified in exact rational arithmetic without exponential enclosures. All claims are reduced to finite exact rational or rational-interval computations, which we describe. In both examples the ground level escapes more slowly than the slowest mode relaxes; an exact elimination identity shows that the slow mode then sees effective couplings between the excited levels that depend on the slowest eigenvalue, and these are not visible to tests built from the original rates.

Author comments: The exact verification scripts and witness data are included in anc/.

A mix of human-written and AI-generated textHuman understanding: all partsMpemba effectcontinuous-time Markov chainscounterexampledetailed balanceinterval arithmeticrelaxation to equilibriumslowest relaxation mode
Nov 19, 20269 pages
PDFView work

math.ST — Statistics Theory

The exact FDR–FNR frontier and a separable gap under one-factor Gaussian dependence

Contributed by Samuil Petkov

We determine the exact asymptotic trade-off between the false discovery rate and the false non-discovery rate in a two-group Gaussian model generated by one unobserved common factor of fixed strength. For fixed mixture weight, signal strength, equicorrelation, and false discovery target, the optimum over all randomized full-vector procedures converges to the lower convex envelope of the independent Gaussian threshold curve with effective signal μ/1−ρ\mu/\sqrt{1-\rho}. Thus not observing the factor causes no additional asymptotic loss relative to the factor-revealed experiment. The converse reveals the factor and reduces exactly to an independent experiment. For achievability, factor estimation, a pathwise threshold-crossing bound, and random-denominator control yield an observable optimal rule with finite-sample FDR calibration. If the three model parameters are replaced by consistent estimates, a plug-in rule attains the same frontier with asymptotic FDR control. We also analyze the broad coordinate-local class δn,i=fn,i(Xi,An)\delta_{n,i}=f_{n,i}(X_i,A_n), where the functions may be nonidentical and dimension-dependent and the shared external seed is independent of the model. Every oracle supporting line lying strictly below the two trivial endpoint values has a positive asymptotic gap from this separable class; an analytic parameter choice certifies that such a line exists. For the constrained problem, the gap vanishes at every level exactly when the oracle frontier is the chord joining the reject-none and reject-all rules; otherwise it is strict at every level strictly between the two trivial endpoint levels. For this fixed rank-one Gaussian family, the first result exactly evaluates the compound frontier and the second proves existence of a strict gap from the stated coordinate-local class. Broad dependent model classes and the complete constrained separable frontier remain open.

A mix of human-written and AI-generated textHuman understanding: all partsGaussian factor modelcompound decision ruleequicorrelationfalse discovery ratefalse non-discovery ratemultiple testingseparable decision rule
Nov 19, 202627 pages
PDFView work

math.PR — Probability

Complete positivity and equilibrium realizations of reversible observations

Contributed by Samuil Petkov

Complete positivity of mirrored observation matrices is necessary for equilibrium realization, but does not ensure compatible equilibrium dynamics. We study stationary finite-state continuous-time Markov chains with instantaneous deterministic labels on a fixed physical clock. For reflection-positive laws with dd active labels and reflected rank r≤d+1r\le d+1, we construct a detailed-balance realization on the minimal number rr of states. Binary rank-four laws with two prediction dimensions per label compress to four states when a finite detailed-balance realization already exists. At r=d+2r=d+2, a rational ten-state chain with six labels passes every mirrored matrix-CP test through one common nonnegative Gram factorization, yet admits no equilibrium realization. A rational seven-time statistic separates its law from all finite equilibrium observation laws, uniformly over hidden dimensions, rates and topology. It gives a positive entropy-production floor for every exact finite reciprocal realization, with conservative constants too small for practical statistical use. The law also has no ordinary symmetric Markov extension on any standard Borel state space at the original clock, despite factorability of its reflected half-path operator. For laws that fail a matrix-CP test, a separate deletion-deficit theorem gives a computable nonlinear dissipation bound.

Author comments: The exact-arithmetic certificate check is included as anc/check_certificate.py.

A mix of human-written and AI-generated textHuman understanding: all partscomplete positivitydetailed balanceentropy productionequilibrium realizationhidden Markov modelsreflected rankreflection positivity
Nov 19, 202642 pages
PDFView work

math.PR — Probability

Entropy Production under Hidden-State Reduction: Exact Safety and Non-Testability

Contributed by Samuil Petkov

Restricting hidden-state complexity can raise the least entropy production compatible with partial observations. We determine exactly when a two-hidden-state fit preserves this lower bound for finite irreducible stationary reciprocal continuous-time Markov chains with two individually observed states and one hidden label. We begin with an explicit chain with three hidden states whose observed data admit exact two-hidden-state fits, every one of which has entropy production more than sixty times that of the true chain. For strictly positive consistent stationary masses, flows, excursion counts and first duration moments, the unrestricted infimum is an explicit count functional, and four hidden states approach it while preserving every datum exactly. We classify finite attainment and safety of feasible two-hidden-state fits in every determinant regime; in the positive-determinant regime, safety is equivalent to equality of the conditional cross-excursion means, and explicit bounds quantify the reduction bias. Exact classification does not imply finite-data detectability: rare long excursions can conceal a fixed positive bias on any prescribed finite interval of stationary label observation, even under a common upper rate bound.

Author comments: The computer-assisted step in the proof of the family overestimate theorem is performed in exact rational arithmetic by the script anc/certify_I2.py included with the source.

A mix of human-written and AI-generated textHuman understanding: all partscoarse grainingentropy productionhidden Markov chainsphase-type distributionsreduction biasthermodynamic inference
Nov 19, 202619 pages
PDFView work

cs.IT — Information Theory

State complexity of rare-switching tracking: universal bounds and sharp counter tradeoffs

Contributed by Samuil Petkov

We study the number of internal states required to track a symmetric binary Markov signal observed through a fixed binary symmetric channel. For homogeneous recursive controllers with independent private randomization, a posterior-covering converse gives the sharp leading state coefficient in the iterated nearly-Bayes-optimal limit, uniformly over controller kernels and stationary recurrent mixtures. At a fixed relative excess error, we also determine the exact leading coefficient within symmetric observation-driven birth–death counters with a prescribed sign decoder. Their acceptance probabilities may vary across states and tend to zero with the switching probability. A stationary flow argument links a confidence barrier to actual switch-time mass, and a discounted passage estimate controls repeated switching. For general MAP-decoded controllers, a point certificate for the same posterior covers shows that this counter coefficient is optimal at every fixed relative excess above an explicit threshold depending only on the channel; below that threshold the general frontier remains open, and the gap is narrowed. State cardinality is the resource; no thermodynamic work claim is made.

A mix of human-written and AI-generated textHuman understanding: all partsbirth-death chainscausal filteringfinite-memory inferencehidden Markov modelsrare transitionsstate complexity
Nov 19, 202618 pages
PDFView work

math.RA — Rings and Algebras

Flip-connectivity of octonion bracketing classes

Contributed by Jesus Vilela Jato

Substitute octonions for the letters of a word ww. Each bracketing of ww is a polynomial map, and bracketings giving the same map form a kernel class inside the associahedron KnK_n (edges: flips (AB)C↔A(BC)(AB)C \leftrightarrow A(BC)). Theorem. Every kernel class is flip-connected iff ww has at most two distinct letters or every letter occupies one contiguous run. Hence for n≥1n \ge 1, exactly Bell(n)−2n+n\mathrm{Bell}(n) - 2^n + n words of length nn, up to renaming, have a disconnected class (0,0,0,3,25,145,756,…0,0,0,3,25,145,756,\dots). Ideas. In-class flips must have letter-count matrix of rank ≤2\le 2: for any nonzero 3×33\times 3 minor dd and M=2∣d∣+1M = 2|d|+1, an integer witness gives [A,B,C]≡2dM3e7(modM4)[A,B,C] \equiv 2dM^3 e_7 \pmod{M^4}. For interval words, the rank-≤2\le 2 components are separated by octonion moments that recover an explicit component invariant. For other words, “caterpillar” certificates give two Moufang-equivalent bracketings that no rank-≤2\le 2 path joins. Formalization. The main theorem, the canonical-word correspondence and the count are proved in core Lean 4 (no Mathlib): MainThm.main, Canon.canonical, Count.count_disconnected. That is 9,252 lines in lean/Caterpillar/, no sorry, standard axioms only. The one informal step is that polynomial identities over Z8\mathbb{Z}^8 and over R8\mathbb{R}^8 agree. Disclosure. The formal proofs and much of the exposition were developed with Claude (Anthropic) under my direction. An AI referee round was done before posting (paper/REVIEW.md). I’m posting for independent human judgement, especially on Proposition T, which the paper proves via the formalization. I’d also like to know whether the associative-spectrum corollary sn(G)=Cn−1s_n(G) = C_{n-1} (Catalan numbers) is already in the literature. The paper’s two-line proof gives it for every non-associative magma with a two-sided identity, in particular for O\mathbb{O}. Repository: https://github.com/Dojo-1/Lemma-W-count-determinant-witness-

Author comments: The formal proofs and much of the exposition were developed with Claude (Anthropic) under my direction. An AI referee round was done before posting (paper/REVIEW.md). I’m posting for independent human judgement, especially on Proposition T, which the paper proves via the formalization. I’d also like to know whether the associative-spectrum corollary $s_n(G) = C_{n-1}$ (Catalan numbers) is already in the literature. The paper’s two-line proof gives it for every non-associative magma with a two-sided identity, in particular for $\mathbb{O}$.

Primarily AI-generated textHuman understanding: all partsmath.RA math.CO lean-formalized octonions associahedron
Nov 19, 202613 pages
PDFView work

math.PR — Probability

BKT asymptotics for the quenched free energy of hierarchical pinning

Contributed by Igor Kortchemski

We study the disordered pinning model of Derrida, Hakim and Vannimenus on the diamond hierarchical lattice. Its partition functions satisfy Rn+1=d(Rn(1)Rn(2)+B−1)/BR_{n+1}\overset{d}{=}(R_n^{(1)}R_n^{(2)}+B-1)/B, where B>2B>2, the two variables on the right are independent copies of RnR_n, and R0=ehWR_0=e^hW with W>0W>0 and EW=1\mathbb{E}W=1. Let FF be the quenched free energy and hch_c its critical point. If hc>log⁡(B−1)h_c>\log(B-1), we prove F(hc+u)=exp⁡[−(K+o(1))/u]F(h_c+u)=\exp[-(K+o(1))/\sqrt{u}] as u↓0u\downarrow0, for a finite positive constant KK characterized by the response at criticality to a change of field. We identify a limiting profile of the rescaled tilted measures and extend their convergence in exponential weights to every time before its first pole. This yields the free-energy upper bound; a comparison with a max-type recursion and a second-moment estimate for pairs of leaves give the matching lower bound. A Lean 4 formalization of the main results accompanies the paper.

Author comments: Mathematics and text produced with AI systems (ChatGPT) under the direction of the contributor; see the section on AI use. A Lean 4 formalization of all numbered results of the paper is available at https://github.com/igor-kortchemski/BKT-hierarchical-pinning.

Primarily AI-generated textHuman understanding: no partsBerezinskii–Kosterlitz–Thouless asymptoticsdisordered pinninghierarchical latticequenched free energy
Nov 19, 202628 pages
PDFView work

math.CO — Combinatorics

Ehrhart positivity for polypositroids

Contributed by Luis Ferroni

We prove that all coefficients of the Ehrhart polynomial of an integral polypositroid are strictly positive. In particular, this proves the positroid conjecture of Ferroni, Jochemko and Schröter. More generally, inclusion of integral polypositroids in a common cyclic order implies coefficientwise comparison of their Ehrhart polynomials. Hence the hypersimplex dominates every positroid of the same rank and size. We express each coefficient as a sum of relative face volumes multiplied by explicit nonnegative rational weights. The weights count linear extensions and specialize, for hypersimplices, to Ferroni's formula involving weighted Lah and Eulerian numbers. In the appendix we exhibit two representable matroids whose quartic Ehrhart coefficients exceed those of the hypersimplices of the same rank and size.

Primarily AI-generated textHuman understanding: some partsEhrhart polynomialsEhrhart positivityalcoved polytopesmatroidspolypositroidspositroids
Nov 19, 202620 pages
PDFView work

cs.DS — Data Structures and Algorithms

Deterministic almost-linear time for general matching and network flow

Contributed by Yilin Liu

We give deterministic almost-linear-time algorithms for maximum-cardinality matching in general graphs and integral minimum-cost flow. With H=n+m+2H = n + m + 2, both run in Hexp⁡O((log⁡H)4/5(log⁡log⁡H)1/5)H \exp O((\log H)^{4/5}(\log \log H)^{1/5}) time for polynomially bounded integer flow data. Their circulation oracle charges every traversal of a returned walk. A clipped logarithmic potential handles flow thresholds under improving updates and maintains strong components under arc insertions. For subgraphs with degree bounds, two matching computations encode a factor of every feasible size. The underlying exchange argument also gives integral cardinality slices for capacitated factors and is compatible with sharp local rounding.

Primarily AI-generated textHuman understanding: no partsalmost-linear timedeterministic graph algorithmsgraph factorsmaximum-cardinality matchingminimum-cost flowminimum-ratio cycles
Nov 19, 202616 pages
PDFView work

math.MP — Mathematical Physics

Towards a conformal field theory of critical percolation. II. Scalar responses and null identities

Contributed by Alberto Gandolfi

We construct the scalar response to closing a small disk in critical site percolation on the triangular lattice. The response records how the obstacle changes every connection at a surrounding boundary. Its normalized cutoff error is of order r^(11/15), and an open-cutset argument gives its leading fusion with the density field in the complete-record norm. We identify the signed response in a domain with six alternating boundary tips and prove the level-two null identities against finite separated density, scalar, and stress insertions. These identities determine the mixed scalar–density four-point function. Assuming Camia and Feng’s asymptotic formula for one energy and two density insertions, we give their energy field a geometric interpretation as the normalized response to closing a small disk. The resulting correlation of two energies and two densities is the difference of a successive-bottleneck and an alternative-route contribution, and it changes sign. The second coefficient in the angularly averaged scalar–density collision defines a nonzero insertion Ψ of weights (77/96,77/96). Fixed stress contours and radial integrals give joint correlations of every fixed finite collection of separated Ψ insertions, with error O( \sum_i (r_i)^(1/2) ) at arbitrary relative extraction radii. We compute its two-point coefficient and signed two-obstacle connection asymptotics, including the leading stress term when the scalar sources collide in a two-density correlation. These results realize the known analytic conformal blocks through specified lattice observables. The construction uses the complete-record stress estimates and finite-hole density correlations of Paper I.

A mix of human-written and AI-generated textHuman understanding: some partsPercolationconformal field theory
Nov 19, 202699 pages
PDFView work

math.AG — Algebraic Geometry

A note on tropical convexity

Contributed by Hernandez Juan

We prove that the tropicalization of the regular function h=(x12+x22+x32)/(x1x2x3)h=(x_1^2+x_2^2+x_3^2)/(x_1x_2x_3) on the coefficient-free Markov cluster threefold is not min-convex. This disproves Conjecture 8.11 of Gross, Hacking, Keel, and Kontsevich.

Primarily AI-generated textHuman understanding: some parts
Nov 19, 202613 pages
PDFView work

math.CT — Category Theory

Finite model spaces and coherent sheaf models

Contributed by Zhenyu Sun

Let TT be a finitary coherent theory with finitely many sorts. We describe coherent sheaf-valued models over a Stone space as continuous families in a topological category of finite TT-models and all their homomorphisms. We prove that every such family over every Stone base is constant up to isomorphism on a finite clopen partition if and only if each fixed finite carrier admits only finitely many TT-structures. It suffices to test the partition property over βN\beta\mathbb N. Equivalently, at each bound on the sort cardinalities, a finite subsignature detects all homomorphisms between the bounded models. This condition holds for finite signatures and is invariant under coherent Morita equivalence. It characterizes when the canonical functor from the discrete condensed category of finite models to the coherent condensed category of points is an equivalence. For finite locally constant abelian-group sheaves, we compute first Yoneda extensions as sections of a finite locally constant sheaf and prove that all higher Yoneda extensions in their category vanish.

Primarily human-written textHuman understanding: all partsStone spaceYoneda extensioncoherent theorycondensed categoryfinite modelpretopos
Nov 19, 202621 pages
PDFView work

math.CV — Complex Variables

Fourier Epicycles and Antisymmetric Signed-Area Conservation in Normalized Riemann Zeta Terms

Contributed by Ryan Hackbarth

In companion studies of Euler's alternating series η(s)=(1−21−s)ζ(s)\eta(s) = (1 - 2^{1-s})\zeta(s) and its prime-base normalizations ηp(s)=(1−p1−s)ζ(s)\eta_p(s) = (1 - p^{1-s})\zeta(s), distributing the prefactor (1−p1−s)−1(1 - p^{1-s})^{-1} across individual summands tp,n(s)=cp(n)(1−p1−s)−1n−st_{p,n}(s) = c_p(n)(1 - p^{1-s})^{-1}n^{-s} exposed an infinite hierarchy of closed, irreducible degree-2k2k plane algebraic curves tp,pk(12+ib)t_{p,p^k}(\frac{1}{2}+ib) over Z[x,y]\mathbb{Z}[x, y] on the critical line Re⁡(s)=12\operatorname{Re}(s) = \frac{1}{2}, whose enclosed signed areas satisfy Asigned(t4)=0\mathcal{A}_{\mathrm{signed}}(t_4) = 0 at the base-22 Bernoulli lemniscate and ∑k=1∞Asigned(tp,pk)=0\sum_{k=1}^{\infty}\mathcal{A}_{\mathrm{signed}}(t_{p,p^k}) = 0 across every prime tower. Rather than keeping (1−p1−s)−1(1 - p^{1-s})^{-1} unexpanded to preserve Cartesian curve equations, this paper expands (1−p1−s)−1=−∑m=1∞pm(s−1)(1 - p^{1-s})^{-1} = -\sum_{m=1}^{\infty} p^{m(s-1)} across the critical strip 0<Re⁡(s)<10 < \operatorname{Re}(s) < 1 and distributes it termwise as a Fourier epicycle series. For every pure power n=pkn = p^k (k≥1k \ge 1) along s=a+ibs = a + ib, the distributed expansion separates into k−1k - 1 clockwise circles (1≤m≤k−11 \le m \le k - 1), a motionless center-of-mass anchor +(p−1)p−k+(p - 1)p^{-k} (m=km = k) independent of ss, and an infinite counterclockwise tail (m≥k+1m \ge k + 1), revealing index-by-index how counter-rotating harmonics fold and area-balance the Lemniscate of Bernoulli t4(12+ib)t_4(\frac{1}{2}+ib). Evaluating Green's theorem via Parseval's identity yields an exact closed-form signed-area formula for tp,pk(a+ib)t_{p,p^k}(a+ib) across 0<a<10 < a < 1, proving that t4(a+ib)t_4(a+ib) encloses zero net signed area if and only if a=12a = \frac{1}{2}---tipping toward its clockwise left lobe for 0<a<120 < a < \frac{1}{2} and its counterclockwise right lobe for 12<a<1\frac{1}{2} < a < 1. Summing over k≥1k \ge 1 further proves that the total pure-power signed area Sp(a)\mathcal{S}_p(a) is strictly antisymmetric across the critical line (Sp(1−a)=−Sp(a)\mathcal{S}_p(1 - a) = -\mathcal{S}_p(a)), negative on 0<a<120 < a < \frac{1}{2}, positive on 12<a<1\frac{1}{2} < a < 1, and zero if and only if Re⁡(s)=12\operatorname{Re}(s) = \frac{1}{2}.

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