Browse

All works

Browse the Hexagon catalog.

Newest works

1208 works

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

math-ph — Mathematical Physics

Can moving the mouths of a self-supporting wormhole make a shortcut? A no-shortcut theorem in a two-dimensional loop model

Contributed by MengHan Tsai

The Morris-Thorne-Yurtsever route to a time machine moves one wormhole mouth so that a twin-paradox lag becomes a time shift between the mouths. For wormholes supported by their own Casimir-like energy (Maldacena-Milekhin-Popov) the static throat is longer than the exterior path; we know of no explicit dynamical calculation for moving mouths. We study a toy model in which the question can be posed exactly: a JT-gravity throat whose two boundaries are transparent to conformal matter that also propagates through a rigid flat exterior. We prove that in this model no timelike motion of the mouths produces a shortcut through the throat in either direction, as long as both mouth clocks keep running. The proof combines (i) a lap identity, by which there is no shortcut iff a Dirichlet operator built from one mouth's Schwarzian energy is non-negative on each lap of a matter stream; (ii) a sum rule equating the averaged null energy along each complete null geodesic of the throat to −β/2-\beta/2 times the sum of the clock rates at its ends, which is the dynamical form of a relation of Maldacena and Qi and is not claimed as new; and (iii) a variational step. With the quantum inequality for the streams the same steps exclude a shortcut for any agent acting locally on the streams in the exterior. Two partial lower bounds on the size of the margin are given; no positive floor is proven. Simulations from one code base illustrate the results. The model has a non-gravitating exterior and a classical Schwarzian mode, and nothing is claimed about four dimensions. The derivations, code and text were produced with AI assistance under the author's direction; Section 6 states what was checked and by whom. No physicist has checked this work.

Primarily AI-generated textHuman understanding: no partsJT gravitySchwarzianaveraged null energy conditionchronology protectiontraversable wormholes
Nov 19, 202614 pages
PDFView work

math.QA — Quantum Algebra

Grothendieck rings of complex fusion categories: rank 4

Contributed by Sebastien Palcoux

Every complex fusion category of rank four admits a spherical structure. Together with the pivotal classification of Dong, Palcoux and Plessis, this gives exactly fifteen Grothendieck rings. We prove sphericality by comparing the ordinary ring with the signed ring of the sphericalization. Formal codegrees and moments of central twists bound the dimension of a putative counterexample. An exact search leaves two signed Casimir polynomials for one ordinary ring. Both violate the same moment inequality. For the six rings with a non-self-dual simple, we also give a direct classification by central induction and twist moments.

Author comments: 50 pages. Third volume of a uniform series on ranks 2, 3 and 4. Computer-assisted proof of sphericality, followed by the pivotal classification of Dong-Palcoux-Plessis. Exact code and data, with a one-command replay: https://github.com/sebastienpalcoux/grothendieck-ring-classification/tree/edc79bd0a828aa5564f6e7a5392bc9be9bb43d48/supplements/rank4/sphericality . Sources and revision letter: https://github.com/sebastienpalcoux/grothendieck-ring-classification/tree/edc79bd0a828aa5564f6e7a5392bc9be9bb43d48/manuscripts/hexagon

Primarily AI-generated textHuman understanding: some partsFusion categoriesGrothendieck ringsexact computationformal codegreessphericality
Nov 19, 202650 pages
PDFView work

math-ph — Mathematical Physics

Uniform Spectral Gap and Stability for the Spin-2 Square-Lattice AKLT Model with Free Boundaries

Contributed by Runze Zhong

We prove a uniform spectral gap above the full ground space of the spin-2 AKLT Hamiltonian on every square-lattice rectangle with four free sides and both lengths at least two. The ground-space dimension grows exponentially with the perimeter. Starting from the classical hard-boundary coupling of Aronow and Lopatto, we compare the boundary Gram operator of one wing with the product of its marginals on the cut side and the remaining three sides. A reference system with at most eight unsaturated sites then controls a physical cut of arbitrary length. Recursion over overlapping rectangles gives the gap. We also obtain a gap on all simple tori, including those of fixed circumference. In free squares, boundary effects on fixed local observables decay exponentially with the buffer width. By the stability theorems of Nachtergaele, Sims and Young, weak quasi-local perturbations with stretched-exponentially decaying interaction terms preserve the bulk GNS gap and the finite-torus gap at bounded aspect ratio.

Author comments: v1: Initial version. 16 pages, 3 figures. Establishes a uniform spectral gap above the full exponentially degenerate ground space of the undecorated spin-2 square-lattice AKLT Hamiltonian on all open rectangles of side lengths at least two, a uniform gap on all simple tori (including fixed short circumferences down to three), exponential local topological quantum order (LTQO) in free boxes, and perturbative stability of both the infinite-volume bulk GNS gap and the bounded-aspect-ratio finite-torus gap. The reduction is modular on the classical hard-boundary coupling of Aronow and Lopatto (Hexagon 2611.00580v1).

A mix of human-written and AI-generated textHuman understanding: some partsAKLT modelLTQOfrustration-freequantum spin systemsspectral gap
Nov 19, 202616 pages
PDFView work

math.NT — Number Theory

The sum of the reciprocal Mersenne cubes is irrational

Contributed by twinheterodox

The sum of the reciprocal cubes of the Mersenne numbers 2n−12^n-1 is irrational. More generally, for ∣b∣>1|b|>1 let Mj(b)=∑n≥1(bn−1)−jM_j(b)=\sum_{n\ge1}(b^n-1)^{-j}. For every integer b≥2b\ge2, we prove that 1,M1(b),M2(b),M3(b)1,M_1(b),M_2(b),M_3(b) are linearly independent over Q\mathbb{Q}. These four numbers are also linearly independent over Q(b)\mathbb{Q}(b) whenever bb is an algebraic integer with ∣b∣>1|b|>1 and every conjugate other than bb and bˉ\bar b lies in the closed unit disk. This includes all Pisot and Salem numbers.

Author comments: 8 pages. The source archive includes four verification programs and their reference results. Manuscript and code: https://github.com/twinheterodox/algebraic-base-lambert-values

Primarily AI-generated textHuman understanding: some partsLambert seriesMersenne numbersirrationalitylinear independence
Nov 19, 20268 pages
PDFView work

math.QA — Quantum Algebra

Grothendieck rings of complex fusion categories: rank 3

Contributed by Sebastien Palcoux

Ostrik classified the pivotal fusion categories of rank three. We show that every complex fusion category of rank three admits a spherical structure and recover the five Grothendieck rings. Both steps use the mass at twist one in the Drinfeld center. For an irreducible cubic codegree polynomial, Galois averaging in the sphericalization determines the first six moments of the squared twist. For a spherical category, the first two moments give a single inequality that excludes all the remaining rings outside the list. The rank-specific descent theorem we use from the literature is Ostrik's theorem for a quadratic factor.

Author comments: 10 pages. Computer-free. Second volume of a uniform series on ranks 2, 3 and 4. Source and revision letter: https://github.com/sebastienpalcoux/grothendieck-ring-classification/tree/edc79bd0a828aa5564f6e7a5392bc9be9bb43d48/manuscripts/hexagon

Primarily AI-generated textHuman understanding: some partsFrobenius-Schur indicatorsFusion categoriesGrothendieck ringsrank threesphericalization
Nov 19, 202610 pages
PDFView work

math.QA — Quantum Algebra

Grothendieck rings of complex fusion categories: rank 2

Contributed by Sebastien Palcoux

Ostrik classified fusion categories over C\mathbb C with two simple objects. We recover the two possible Grothendieck rings from sphericalization and central induction. For a candidate rule X2=1+nXX^2=1+nX, the dimension divisibility of Etingof, Nikshych and Ostrik forces one lift of XX to satisfy the same rule in the sphericalization. The induction matrix then expresses −ndim⁡(X)-n\dim(X) as the sum of two roots of unity. Taking a conjugate gives n≤1n\leq 1. Both rings occur.

Author comments: 3 pages. Computer-free. First volume of a uniform series on ranks 2, 3 and 4. Source and revision letter: https://github.com/sebastienpalcoux/grothendieck-ring-classification/tree/edc79bd0a828aa5564f6e7a5392bc9be9bb43d48/manuscripts/hexagon

Primarily AI-generated textHuman understanding: some partsFusion categoriesGrothendieck ringscentral inductionrank twosphericalization
Nov 19, 20263 pages
PDFView work

math.QA — Quantum Algebra

Vertex operator algebras from Flohr's second family realising doubles of near-group categories Zn+n\mathbb{Z}_n+n for even nn

Contributed by Andrew Riesen, David E. Evans

We study Flohr's second family W(2,3k)\mathcal{W}(2,3k), with generating weights 22 and 3k3k and central charge 1−24k1-24k for k∈12Z>0k\in\frac{1}{2}\mathbb{Z}_{>0}. We realise these algebras and their subalgebras W(2,8k)\mathcal{W}(2,8k), generated in weights 22 and 8k8k, by deforming the conformal vector of the vertex algebra of the rank-one lattice L=ZβL=\mathbb{Z}\beta, (β,β)=2k(\beta,\beta)=2k. We prove strong rationality and compute the simple modules and modular data for W(2,8k)\mathcal{W}(2,8k) at all kk and W(2,3k)\mathcal{W}(2,3k) at integral kk. For nonintegral kk we describe the Neveu–Schwarz sector of the W(2,3k)\mathcal{W}(2,3k) superalgebra. The same conformal vector makes the lattice vertex algebra of the index-two sublattice 2L2L an extension of W(2,8k)\mathcal{W}(2,8k). Its modules in the representation category of W(2,8k)\mathcal{W}(2,8k) form a Z2\mathbb{Z}_2-graded category with neutral component of near-group type Z4k+4k\mathbb{Z}_{4k}+4k. We realise the Drinfeld centres of the graded category and its neutral component by regular vertex operator algebras, using the orthogonal complement of a primitive norm-8k8k vector in the E8E_8 lattice and conformal shifts to match the ribbon structures. For integral kk we give a Leavitt algebra realisation of the near-group category and derive finite quantum dilogarithm identities. We also realise the centres of its quotients by central lifts of the order-2s2s subgroups of Z4k\mathbb{Z}_{4k} for s2∣ks^2\mid k, including twisted Haagerup–Izumi-type centres over Z2s\mathbb{Z}_{2s} when k=s2k=s^2. We classify the Galois conjugates of the centre modular data with positive categorical dimensions, determine the Witt classes of the W(2,3k)\mathcal{W}(2,3k) representation categories for integral kk, and describe the near-group module categories and their Morita duals.

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

math.NT — Number Theory

A weighted reciprocal Lucas sum lies outside ℚ(√5)

Contributed by twinheterodox

For the even-indexed Lucas numbers L2nL_{2n}, the reciprocal sums with numerators 11 and n2n^2 are known to be transcendental. We prove that the intermediate sum ∑n≥1n/L2n\sum_{n\ge1}n/L_{2n} lies outside Q(5)\mathbb{Q}(\sqrt{5}), and that the same conclusion holds with L2anL_{2an} in the denominator for every integer a≥1a\ge1. More generally, the weight-two value β1/b(2)=∑n≥1n/(bn+b−n)\beta_{1/b}(2)=\sum_{n\ge1}n/(b^n+b^{-n}) of the qq-analogue of Dirichlet's beta function lies outside Q(b)\mathbb{Q}(b) for every real algebraic integer b>1b>1 whose other conjugates have modulus at most one.

Author comments: 8 pages. Includes the irrationality of the weighted even-indexed Lucas reciprocal sum at every positive integer stride and a field-exclusion theorem for the weight-two q-beta value. The source archive includes the exact three-pole check. Source and verification code at https://github.com/twinheterodox/weighted-even-lucas-reciprocals

Primarily AI-generated textHuman understanding: some partsLucas numbersPisot and Salem numbersirrationalityq-series
Nov 19, 20268 pages
PDFView work

math.NT — Number Theory

A height criterion for irrational weight-three Lambert sums

Contributed by twinheterodox

For an algebraic number bb with ∣b∣>1|b|>1, the weight-three Lambert sum is Z(b)=∑n≥1n2/(bn−1)Z(b)=\sum_{n\ge1}n^2/(b^n-1). We prove that Z(b)Z(b) lies outside Q(b)\mathbb{Q}(b) whenever the Mahler measure M(b)M(b) satisfies log⁡M(b)<(352π2/2889) rlog⁡∣b∣\log M(b)<(352\pi^2/2889)\,r\log|b|, where r=1r=1 for a real base and r=2r=2 otherwise. The criterion allows several conjugates outside the unit disk and applies to nonintegral bases. In particular, Z(3+3)∉Q(3)Z(3+\sqrt{3})\notin\mathbb{Q}(\sqrt{3}), although both conjugates of the base exceed one.

Author comments: 5 pages. Companion to The weight-three Lambert sum at the golden ratio is irrational (Hexagon 2611.00623v1). The source archive includes the verification code and expected results. Source and verification code at https://github.com/twinheterodox/algebraic-base-lambert-values

Primarily AI-generated textHuman understanding: some partsLambert seriesMahler measurealgebraic numbersirrationality
Nov 19, 20265 pages
PDFView work

math.CO — Combinatorics

Hadamard matrices of orders 668, 716, 892, 1132, 1244, 1388, 1436, 1676, 1772, 1916, 1948 and 1964

Contributed by Erisa Hasani, Abhinav Nellore, Rachel Ward

We construct Hadamard matrices of orders 668, 716, 892, 1132, 1244, 1388, 1436, 1676, 1772, 1916, 1948 and 1964, the twelve multiples of 4 below 2000 for which none was known, and a second, inequivalent matrix of order 668. Five come from the Goethals–Seidel array with circulant blocks invariant under a multiplier group, four from the width-4 bordered array of Wallis and Whiteman, and four from bordered Goethals–Seidel arrays of widths 12, 20 and 28 whose corner is itself a Hadamard matrix. To our knowledge borders wider than 4 with a Hadamard corner are new; the first two arrays are classical. The four matrices with a border of width 4, of orders 668, 716, 1676 and 1772, are instances of a theorem of Miyamoto on Hadamard matrices of order 8m+48m+4, which Seberry and Yamada restated with their M-structures; the matrices to which the theorem applies were found here by computer search. The searches differ greatly in size. Those for the wider borders formed at most about 2442^{44} pairs of candidate blocks. Those for orders 716 and 668 with a border of width 4, made with no multiplier group, formed about 2662^{66} and 2592^{59}, and these two matrices, that of order 716 above all, are results of large-scale computation more than of a new construction. With these matrices, a Hadamard matrix of order nn is known for every n≡0(mod4)n\equiv 0\pmod 4 with n≤2000n\le 2000.

Author comments: 28 pages. The source also builds a marked copy showing every change from the original write-up (instructions at the top of the TeX file). The timing program of Appendix D, pairsum_bench.c, is at the end of the TeX source.

Primarily AI-generated textHuman understanding: some partsGoethals–Seidel arrayHadamard matrixM-structuresMiyamoto's constructionbordered arraycompression of sequencesdivisible difference familymeet-in-the-middle searchmultiplier groupsupplementary difference sets
Nov 19, 202628 pages
PDFView work

math.NT — Number Theory

Daboussi's elementary proof of the prime number theorem, reconsidered

Contributed by Paul Pollack

In 1984, Daboussi gave an "elementary" proof of the prime number theorem whose central actors are smooth numbers (numbers with no large prime factors). We explain a variant of his argument that might be considered even more elementary.

A mix of human-written and AI-generated textHuman understanding: all partsMöbius functionprime number theoremsmooth numbers
Nov 19, 20269 pages
PDFView work

cs.FL — Formal Languages and Automata Theory

The Černý (1969) conjecture holds for quasi-Eulerian automata of degree one

Contributed by Dave Goel

An automaton with nn states is quasi-Eulerian of degree dd if there are positive letter weights summing to one, a set XX of dd exceptional states and a further state ss such that every state outside X∪{s}X\cup\{s\} receives total weight one and every edge that starts in XX ends in X∪{s}X\cup\{s\}. Berlinkov bounded the reset threshold of strongly connected synchronizing ones by 2d(n−d+1)(n−1)2^d(n-d+1)(n-1). We prove that every synchronizing quasi-Eulerian automaton of degree one has a reset word of length at most (n−1)2(n-1)^2, so the Černý (1969) conjecture holds for this family; the Černý automata belong to it and attain the bound. The same bound holds for every synchronizing automaton whose transition matrix, weighted by some positive, possibly irrational, letter weights, has a positive stationary vector that is constant on all states but one; for this family Berlinkov's bound was 2n(n−1)2n(n-1). For synchronizing quasi-Eulerian automata of degree two, the bound holds whenever the automaton is not strongly connected, whenever its two exceptional states form a block of a congruence, and, for binary strongly connected automata, in 4646 of the 4949 configurations (up to renaming) of the edges at the two exceptional states. The key step in degree one is elementary: a shortest word that takes the exceptional state out of a set KK of states that contains it has length at most ∣K∣|K|, and one that takes it into a set KK that does not contain it has length at most n−∣K∣n-|K|.

Author comments: First version: October 24, 2026.

A mix of human-written and AI-generated textHuman understanding: some partsSynchronizing automatonquasi-Eulerian automatonreset wordstationary vectorČerný conjecture
Nov 19, 202620 pages
PDFView work

cs.CC — Computational Complexity

Black-box identity testing for affine orbits of read-once oblivious algebraic branching programs

Contributed by Yilin Liu

For every fixed width, we construct a polynomial-size hitting set for read-once oblivious algebraic branching programs under an unknown invertible affine change of variables. A width bound in a single unknown order suffices. The resulting deterministic black-box identity test runs in time polynomial in the number of variables and the total degree over every field with more elements than the degree. The construction preserves the generic ranks of consecutive matrix products in descending order. At fixed dimension and width, the query count is linear in the total degree in characteristic zero or above the individual degree in the hidden coordinates. When the width bound holds in every order, cut ranks give linear dependence up to logarithmic factors even in small characteristic. We also treat multivariate layers with bounded overlap and obtain a linear query bound for bivariate programs of width two.

Primarily AI-generated textHuman understanding: no partsaffine orbitshitting setspolynomial identity testingread-once oblivious algebraic branching programs
Nov 19, 202618 pages
PDFView work

cs.CC — Computational Complexity

Parameterised complexity of graph homomorphism to odd cycles

Contributed by Jason Davies

A nonbipartite graph has an odd-cycle core precisely when it maps to its shortest odd cycle. Core recognition and homomorphism to an input odd cycle are both XNLP-complete for the width of a supplied path decomposition, XALP-complete for the width of a supplied tree decomposition, and W[SAT]-hard and in W[P] for feedback vertex number. Hardness persists on connected, 2-degenerate NN-vertex sources of girth Ω(N1−ε)\Omega(N^{1-\varepsilon}) for any fixed 0<ε<10<\varepsilon<1. Our reduction encodes lists by cycles sharing an edge. On inputs with an edge it increases treewidth and feedback vertex number by exactly two. Lean 4 checks this structural transfer. For feedback edge number rr, we compute the exact circular chromatic number in 2O(r)2^{O(r)} time up to polynomial factors, which gives the same upper bound for both decision problems.

Primarily AI-generated textHuman understanding: no partsLeanXNLPcircular chromatic numberfeedback vertex setgraph homomorphismodd cycleparameterized complexitypathwidthtreewidth
Nov 19, 202615 pages
PDFView work

math.NA — Numerical Analysis

Numerical evidence for the almost Hadamard conjecture

Contributed by Teo Banica

We report on encouraging numerical evidence for the almost Hadamard conjecture, stating that any local maximizer of the 11-norm on UNU_N must have all entries of modulus 1/N1/\sqrt{N}, or equivalently that every complex almost Hadamard matrix H=N UH=\sqrt{N}\,U must be a complex Hadamard matrix, with computations at the key values N=4,5N=4,5 arising from our attempts to both prove and disprove the conjecture, and adding to the previous abstract evidence.

Primarily AI-generated textHuman understanding: some partsAlmost HadamardHadamard matrix
Nov 19, 202630 pages
PDFView work

math.QA — Quantum Algebra

An Extremal Vertex Operator Algebra of Central Charge c=64

Contributed by Gerald Höhn

Starting with the standard self-dual (−1)(-1)-orbifold of the Barnes--Wall lattice VOA of central charge 3232, we construct a simple-current extension of a fixed-point subalgebra of its tensor square. The resulting vertex operator algebra is self-dual of central charge 6464 and has no nonzero Virasoro highest-weight vector of weight 11 or 22. We give the twisted conformal weights, an elementary proof of the group-cohomological detection statement needed to trivialize the twisted-module associator class, and a permutation-cover argument determining the relevant absolute module weights. This identifies the complete weight-two obstruction set in a 5656-dimensional binary quadratic space. An explicit 2828-dimensional totally singular graph avoids that set; its exhaustive verifier is included. The final algebra object and its multiplication are also explicit. To my knowledge, this is the first new central-charge value of an extremal self-dual vertex operator algebra since the examples discussed in my 1995 thesis.

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

math.CO — Combinatorics

The shortest word containing every permutation of ten symbols as a subsequence has length 83

Contributed by Jason Davies

A word is universal for an alphabet if it contains every permutation of the alphabet as a subsequence. We prove that no word of length 82 is universal for ten symbols. Together with the known construction of length 83, this shows that the shortest universal word on ten symbols has length 83. The proof cuts a word at the copies of one symbol: universality is equivalent to complementary prefix and suffix conditions at consecutive copies. A counting argument confines a least frequent symbol to four, five, six or seven copies and excludes four. In the remaining cases, frequency tests reduce the possibilities to finitely many block templates, and machine-checked propositional refutations exclude every ordering of each. The computation also reproduces the nine-symbol value 66.

Primarily AI-generated textHuman understanding: no partsLean 4RUP certificatesSATcomputer-assisted proofpermutationsshortest common supersequencesubsequencesuniversal words
Nov 19, 20268 pages
PDFView work

math.SP — Spectral Theory

The equilateral triangle maximises the first Steklov eigenvalue among triangles

Contributed by Jason Davies

Let σ1(T)\sigma_1(T) be the first nonzero Steklov eigenvalue of a triangle TT and L(T)L(T) its perimeter. Among triangles the equilateral triangle EE uniquely maximises σ1L\sigma_1 L. If the shortest and longest sides of TT have lengths a≤ba\le b, then σ1(E)L(E)−σ1(T)L(T)≥(b−a)/(2b)\sigma_1(E)L(E)-\sigma_1(T)L(T)\ge (b-a)/(2b). Since ∣T∣/L(T)2|T|/L(T)^2 is also maximal at EE, the equilateral triangle uniquely maximises σ1∣T∣\sigma_1\sqrt{|T|} as well. This settles the case n=3n=3 of the Steklov analogue of the Pólya–Szegő conjecture for nn-gons, for both normalisations. The extremal value satisfies 3.8724615957722≤σ1(E)L(E)≤3.87246159577343.8724615957722\le \sigma_1(E)L(E)\le 3.8724615957734. For side length one, σ1(E)=σ2(E)<σ3(E)=23<σ4(E)\sigma_1(E)=\sigma_2(E)<\sigma_3(E)=2\sqrt3<\sigma_4(E). Under displacement of the apex over a fixed unit base, the first two perimeter-normalised eigenvalues split linearly with equal and opposite slopes independent of direction. The proof is computer-assisted. Near EE we transplant the first eigenspace of EE affinely; away from EE the trial function cos⁡(πx)\cos(\pi x) suffices. We verify the finite matrix and interval inequalities in ball arithmetic.

Primarily AI-generated textHuman understanding: no partsPólya–Szegő conjectureSteklov eigenvaluescomputer-assisted proofinterval arithmeticshape optimizationtriangles
Nov 19, 202614 pages
PDFView work

math.AG — Algebraic Geometry

Christol’s Conjecture for Non-Resonant Globally Bounded ₃F₂(a₁, a₂, a₃; b, 1; x) Series

Contributed by David Jordan

Christol conjectured that every globally bounded, D-finite power series with rational coefficients is the diagonal of a rational function. We prove this for the hypergeometric series 3F2(a1,a2,a3;b,1;x){}_3F_2(a_1,a_2,a_3;b,1;x) with rational parameters such that aia_i, bb and ai−ba_i-b are not integers: if such a series is globally bounded, then it is the diagonal of an algebraic power series in two variables, and hence of a rational function in three variables; three is the least possible number of variables. This includes Christol's example 3F2(19,49,59;13,1;x){}_3F_2(\frac19,\frac49,\frac59;\frac13,1;x) from 1987, and the series 3F2(17,27,47;12,1;x){}_3F_2(\frac17,\frac27,\frac47;\frac12,1;x), which Christol suggested as a possible counterexample to his conjecture. By a result of Rivoal and Roques, under the Rohrlich-Lang conjecture the latter is a diagonal that is not a Hadamard product of algebraic power series. The proof is Hodge-theoretic and not constructive: it shows that such diagonal representations exist, but does not produce them. Using Fedorov's formula for the Hodge numbers of hypergeometric local systems, we show that the series is globally bounded exactly when every Galois conjugate of its local system carries a complex variation of Hodge structure with two adjacent Hodge levels. The restriction of scalars of the local system then underlies a polarized integral variation of Hodge structure of weight one. By a theorem of Deligne the series is therefore a period of an abelian scheme, and hence of a family of curves, where it is an integral over vanishing cycles of a semistable degeneration. Expanding this integral at the nodes of a regular model gives the diagonal representation.

Author comments: Supplementary material (independent checks, computations, verification logs and searches): https://github.com/bbrhuft/christol-3f2-diagonals; archived version on Zenodo: https://doi.org/10.5281/zenodo.24355840

Primarily AI-generated textHuman understanding: no partsChristol’s conjectureabelian schemesdiagonals of rational functionsglobally bounded power serieshypergeometric functionsvanishing cyclesvariations of Hodge structure
Nov 19, 202640 pages
PDFView work

cs.CC — Computational Complexity

Thermodynamic saturation and prescribed window barriers for Kleinian-code graded spaces

Contributed by Mohamed Fradj

We investigate prescribed graded-window dimensions for Kleinian-code characters, motivated by the four-leg construction of a subexponential 3-SAT algorithm, but without claiming new admissible algebraic operators. For every compact J⋐(0,∞)J\Subset(0,\infty), we prove, uniformly for isotropic additive codes S⊂KmS\subset K^m, $$ \rho_{\mathrm{win}}(V_S;h,\lambda)\geq \frac{1}{\sqrt{2}}+\eta_J-C_Jm^{-1/2}, $$ whenever h/m∈Jh/m\in J and 2λ≤dim⁡(VS)h2^\lambda\leq\dim(V_S)_h, where ηJ>0\eta_J>0 is specified by the proof but has not yet been evaluated as a certified numerical constant for any given compact interval. The fixed-density proof combines the central-window inequality, sectorwise thermodynamic estimates based on the isotropic local weight bound, finite-length concentration, and certified interval arithmetic (Arb, cross-checked with mpmath.iv) for specified sign inequalities. These numerical certificates do not formalize the complete proof. No concavity or convergence assumption on the code-weight spectrum is needed. For additive codes of 2-rank at most mm, we also prove that the maximally encoded prescribed-window cost converges uniformly to 1/21/\sqrt{2} as h/m→∞h/m\to\infty, with two-sided explicit errors of order O(m/h+(mh)−1/4)O(\sqrt{m/h}+(mh)^{-1/4}) for admissible h≥15mh\geq 15m and mh≥4000mh\geq 4000. These are statements about window dimensions, not intrinsic matrix ranks or implementations within a SAT algorithm.

Author comments: First public submission of this 26-page manuscript, dated 17 November 2026. The mathematical exploration, candidate proofs, manuscript preparation, and computational verification were developed with substantial assistance from ChatGPT (OpenAI) and Claude (Anthropic). The author understands the motivation and intended scope of the research but has not independently verified or fully mastered all technical proofs. Independent qualified human mathematical review and complete formal proof verification remain outstanding. Companion reproducibility software and recorded computational checks are available at: https://github.com/MFRADJ/graded-window-barrier-certificates/releases/tag/v1.1.0 The software release is distinct from this manuscript.

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

math.MG — Metric Geometry

An explicit formal dual for every configuration Γ(C,C⊥)\Gamma(C,C^\perp) of Bierbrauer–Edel's definition, and formal isoduality of the packings in dimensions 18, 28 and 30

Contributed by Antoine Olivier

Let CC be a binary linear [2k,k][2k,k] code with C≠C⊥C\neq C^\perp, and Γ=Γ(C,C⊥)\Gamma=\Gamma(C,C^\perp) the configuration of formula (1), the definition on p. 97 of Bierbrauer–Edel. Theorem A gives an explicit formal dual of Γ\Gamma in the sense of Cohn–Kumar–Reiher–Schürmann, in terms of CC, C⊥C^\perp and two auxiliary words. No hypothesis on minimum distance or parity is needed. The finite pair behind it has ∣S∣=∣T∣=2r+1|S|=|T|=2^{r+1} in a group of order 22r+22^{2r+2}, where r=k−dim⁡Rr=k-\dim R and R=C∩C⊥R=C\cap C^\perp is the hull of CC. Proposition I shows that this dual is an isometric copy of Γ/8\Gamma/8. So Γ\Gamma rescaled to unit density is formally isodual in the sense of Cohn–Kumar–Schürmann. A remark shows that it is formally self-dual exactly when 4∣n4\mid n and the hull is doubly even. Hence the packings 18.1, 28.1 and 30.1 are formally isodual and not formally self-dual. A further remark concerns codes with 1∈R\mathbf 1\in R and r=4,6,8r=4,6,8: an F2\mathbb F_2-linear identification turns SS into a graph {(x,F(x)):x∈F2r+1}\{(x,F(x)) : x\in\mathbb F_{2^{r+1}}\} with FF a permutation, formally self-dual under the trace pairing of Kölsch–Schüler. The same construction was also run for r=10,12r=10,12: computed, not reviewed.

Primarily AI-generated textHuman understanding: some partsBierbrauer–Edelbinary codesformal dualityisodualitylattice packings
Nov 19, 202625 pages
PDFView work

math.KT — K-Theory and Homology

Gersten exactness with invertible coefficients for excellent regular local surfaces

Contributed by Niels Feld

Let RR be an excellent regular local ring of dimension two, and let N≥2N\geq2 be a natural number invertible in RR. We prove exactness of the augmented Gersten complex for K(R;Z/N)K(R;\mathbb{Z}/N) in every degree. More generally, it suffices that the normalization of every reduced closed curve in Spec⁡R\operatorname{Spec} R be finite. The proof applies to ramified mixed-characteristic rings without a henselianity assumption. With coefficients of invertible order, we first prove that pushforward from a Cartier divisor on the spectrum of a noetherian semilocal ring annihilates every class coming from connective KK-theory. For a curve in Spec⁡R\operatorname{Spec} R, we then place its normalization and auxiliary regular curves as transverse Cartier divisors on a finite RR-scheme. A third curve carries a prescribed residue class, and a quotient of the two divisor equations moves that residue to an auxiliary curve. The residues on the auxiliary curves cancel after transfer to the residue field of RR. These constructions prove generic injectivity; vanishing of the closed-point pushforward then gives the full complex.

Author comments: 32 pages.

Primarily AI-generated textHuman understanding: all partsGersten conjecturealgebraic $K$-theoryfinite coefficientshenselian rigiditymixed characteristicregular local rings
Nov 19, 202632 pages
PDFView work

math.NT — Number Theory

Irrational values of Dirichlet series with growing period

Contributed by twinheterodox

Let ff be a nonzero rational-valued function of period DD. We count the exponents 2≤j≤s2\le j\le s of prescribed parity for which Lf(j)=∑n≥1f(n)n−jL_f(j)=\sum_{n\ge1}f(n)n^{-j} is irrational. For fixed 0<η<10<\eta<1 our lower bound of order slog⁡log⁡s/(Dlog⁡(sD))\sqrt{s\log\log s/(D\log(sD))} has explicit constants and holds simultaneously for all D≤s1−ηD\le s^{1-\eta} and all such ff. For the real and imaginary parts of the quartic character modulo five we improve the previous lower-bound coefficient at even exponents by a factor of 2/32/\sqrt3.

Author comments: 10 pages. Extends the fixed-period theorem to periods growing with the exponent cutoff and sharpens the even-exponent bound for the quartic character modulo five. The fixed-period paper is at https://hexagonmath.org/2611.00615v1. The source and verification programs are at https://github.com/twinheterodox/growing-period-dirichlet-values

Primarily AI-generated textHuman understanding: some partsHankel determinantsirrationalityperiodic Dirichlet seriesspecial values
Nov 19, 202610 pages
PDFView work

math.NT — Number Theory

The weight-three Lambert sum at the golden ratio is irrational

Contributed by twinheterodox

For ∣b∣>1|b|>1, define the weight-three Lambert sum by Z(b)=∑n≥1n2/(bn−1)Z(b)=\sum_{n\ge1}n^2/(b^n-1). For an algebraic integer bb in this range, we prove that Z(b)∉Q(b)Z(b)\notin\mathbb{Q}(b) if every conjugate outside the closed unit disk belongs to {b,bˉ}\{b,\bar b\}. This includes all Pisot and Salem bases. For a Salem base we bound the polynomial approximations even at conjugates on the unit circle, where the series diverges. At the golden ratio φ=(1+5)/2\varphi=(1+\sqrt{5})/2, the sum Z(φ)Z(\varphi) lies outside Q(5)\mathbb{Q}(\sqrt{5}) and is therefore irrational. A nonreal example is Z(1+i)∉Q(i)Z(1+i)\notin\mathbb{Q}(i).

Author comments: 7 pages. Covers Pisot and Salem bases, the golden ratio, and the Gaussian integer 1+i. The source archive includes the independent audit program and an exact check at a complex point. Code and results: https://github.com/twinheterodox/algebraic-base-lambert-values

Primarily AI-generated textHuman understanding: some partsLambert seriesPisot numbersSalem numbersirrationality
Nov 19, 20267 pages
PDFView work

math.NT — Number Theory

Modularity of the factors of an automorphic tensor product

Contributed by Luis Dieulefait

Let FF be a totally real field and let ρ1,ρ2\rho_1,\rho_2 be two-dimensional pp-adic representations of GFG_F which are Lie-irreducible and potentially modular, each over its own extension. We prove the following: if ρ1⊗ρ2\rho_1\otimes\rho_2 is attached to a regular L-algebraic cuspidal automorphic representation Π\Pi of $\GL_4(\A_F)$, then ρ1\rho_1 and ρ2\rho_2 are modular and Π≃π1⊠π2\Pi\simeq\pi_1\boxtimes\pi_2. This is a converse to Ramakrishnan's automorphy of the Rankin--Selberg product. The proof combines the descent of Hundley--Sayag from $\GL_4$ to $\GSpin_4$ with LL-function arguments based on potential modularity. To pin down the weights of the factors we use the Galois representations attached to the adjoint lifts $\ad\pi_i'$ on $\GL_3$; this rules out factors of mixed parity.

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

math.NT — Number Theory

Complete modulus locking in the exceptional set of the abc conjecture

Contributed by Zeng Chunping

Let Nλ(X)N_\lambda(X) count primitive positive triples a+b=c≤Xa+b=c\le X with rad(abc)<cλ\mathrm{rad}(abc)<c^\lambda. We prove, using inherited anatomic estimates and a new finite exact-rational implication, that Nλ(X)≪λ,εXU+εN_\lambda(X)\ll_{\lambda,\varepsilon}X^{U+\varepsilon} for 0<λ≤10<\lambda\le1, where U=1168000720000012<73125=0.584U=\frac{11680007}{20000012}<\frac{73}{125}=0.584. The new arithmetic-computational step exhausts all third-letter whole-value modulus sets: index 11 is eliminated by a one-Lipschitz argument, leaving 3232 subsets of {2,3,4,5,6}\{2,3,4,5,6\}, and grouped power-difference bounds are used in every fixed degree 2≤e≤62\le e\le6. A branch-and-bound tree with 65,57665{,}576 leaves is verified by an independent standard-library checker which reconstructs every inequality and checks every rational multiplier; floating-point linear programming is used only to discover the tree. We also prove that the enlargement is mathematically essential: an explicit rational point feasible for the old modulus family has D=403/690D=403/690, whereas FullOC gives the collision bound 53/9253/92 at the same point, and a second explicit point gives 7/12≤DFullOC∗7/12\le D^*_{\mathrm{FullOC}}. These are statements about exponent programs, not lower bounds for abc triples. No assertion of abc, Szpiro, finiteness of the exceptional set, or an Arakelov degeneration functor is made.

Author comments: First version. Computer-assisted theorem with exact rational certificates (65,576 leaves); the certificate tree and verification scripts are archived on Zenodo (DOI: 10.5281/zenodo.24354214). The abstract-level statement is verified by an independent standard-library checker; floating-point LP is used only to discover the tree.

A mix of human-written and AI-generated textHuman understanding: all partsabc conjecture; exceptional set; radical; collision inequality
Nov 19, 202617 pages
PDFView work

math-ph — Mathematical Physics

On sequential ideal measurements in the exceptional Jordan algebra

Contributed by Robert R. MacGregor

Real, complex and quaternionic quantum theory have one exceptional relative, the Albert algebra H3(O)H_3(\mathbb O), which single-system reconstructions leave standing. Sequences of measurements on a single system can still tell it apart, provided the measurements are ideal. A yes–no test is ideal if it disturbs the state no more than its answer requires, as under the projection postulate. Ideal tests of finitely many pure states of H3(O)H_3(\mathbb O) are then matched by ideal measurements on a real, complex or quaternionic Hilbert space of any dimension exactly when those states fail to generate the algebra. When they generate it, an ideal Hilbert-space model matching every sequence from even one starting state would yield a faithful representation of the algebra and its Jordan product by operators, which Albert ruled out in 1934. Three states never generate it; whether four do is decided by one number, proportional to a squared octonion associator. Even when four do, the difference is slow to show: from the maximally mixed state, a random choice between two quaternionic qutrits matches every sequence of up to six outcomes, and only at seven is every Hilbert-space model excluded. If the tests need not be ideal, then for any finite set of tests a finite-dimensional quantum device with sharp answers matches every sequence, of any length.

Author comments: 132 pages. The LaTeX source of the companion paper, Finite certificates for sequential measurements in the exceptional Jordan algebra (56 pages), is in the source archive at companion/macgregor-finite-certificates.tex.

Primarily AI-generated textHuman understanding: no partsAlbert algebraLeanexceptional Jordan algebraoctonionsprojection postulatequantum foundationssequential measurements
Nov 19, 2026132 pages
PDFView work

cs.CC — Computational Complexity

Circle configurations and the hardness of promise graph and hypergraph coloring

Contributed by Yuwen Zhou

In 2017 Brakensiek and Guruswami conjectured that promise graph homomorphism is NP-hard for every non-bipartite source and loopless target admitting a homomorphism from the source. At CCC 2016 they conjectured hardness of properly coloring a uniform hypergraph promised a strong coloring with one more color than its uniformity. We prove both conjectures by a configuration theorem on the circle. For any fixed finite configuration of distinct rational phases, the theorem gives a reduction whose satisfiable instances place every edge near a translate of the configuration and whose unsatisfiable instances have arbitrarily small independence ratio. An antipodal pair gives hardness for every odd cycle against every fixed clique of size at least three. A regular hh-gon gives a strong (h+1)(h+1)-coloring and a rainbow (h−1)(h-1)-coloring of the same instance. A circle coloring built from single-coordinate changes gives hardness of PCSP(R,NAEh(d))\mathrm{PCSP}(R,\mathrm{NAE}_h^{(d)}) for every nonempty symmetric reconfigurable relation RR with R→NAEh(d)R\to\mathrm{NAE}_h^{(d)}, and the monochromatic-clique dichotomy of Banakh, Barsukov, and Nakajima without the Rich 22-to-11 Conjecture. For triples we obtain hardness of linearly ordered coloring for all fixed palettes 3≤c≤d3\le c\le d. The proof subtracts an average of translated distance functions to detect an independent set, then uses conditional mean zero and a finite Ramsey alignment argument to decode a Label Cover assignment.

Primarily AI-generated textHuman understanding: some partsBrakensiek–Guruswami conjectureGraph coloringLabel Coverhardness of approximationhypergraph coloringpromise constraint satisfaction
Nov 19, 202625 pages
PDFView work

math.NT — Number Theory

A Chebyshev bound for the constant in the Prouhet-Tarry-Escott problem

Contributed by David Niedbala Giraudin

Let (A,B) be an ideal solution of size n of the Prouhet-Tarry-Escott problem, with constant C defined by prod_i (x - a_i) - prod_i (x - b_i) = C, and let L be the diameter of A u B. We prove |C| <= 4 (L/4)^n, with equality exactly for the configuration given by the roots of T_n -/+ 1, where T_n is the Chebyshev polynomial of the first kind. Equality is attained by integer solutions for n <= 3 and, by Niven's theorem, is impossible for n >= 4; for n = 4, n = 5 and n = 6, however, we exhibit infinite families of integer solutions, governed by a Pell equation, along which the ratio 4^(n-1)|C|/L^n tends to 1, so that the constant 4^(n-1) cannot be improved. The bounds on C in the standard references are p-adic throughout: they determine which prime powers divide C, and the present inequality appears to be the first of archimedean type. Two further consequences are recorded: an unconditional lower bound for the height of any ideal solution, in terms of the known divisors of the universal constant C_n, which yields the first such statements for sizes 17 <= n <= 20, where no search has been published; and the observation that the extremal configuration is exactly the trigonometric configuration of Chen Shuwen, for which the analogous extremality statement for the individual variables is an open conjecture. The present result is its proven counterpart for the constant.

Primarily AI-generated textHuman understanding: no partsChebyshev polynomialsDiophantine equationsPell equationProuhet-Tarry-Escott problemideal solutions
Nov 19, 202610 pages
PDFView work

math.NT — Number Theory

Sums of three composite triangular numbers

Contributed by David Niedbala Giraudin

A triangular number T_k = k(k+1)/2 is composite for every k >= 3, the only non-composite ones being 0, 1 and 3. We ask which integers are sums of three composite triangular numbers, a restricted form of Gauss's Eureka theorem; equivalently, when 8n+3 is a sum of three squares none of which is 1, 9 or 25. We prove that every integer n > 194 is a sum of three composite triangular numbers, with at most three possible exceptions, all larger than 8.4*10^9. Such exceptions can occur only if Tatuzawa's form of Siegel's theorem, with eps = 1/20, has an exceptional discriminant -N*, and then only for 8n+3 in {N*, 9N*, 25N*}. Up to 8.4*10^9 the integers that are not such sums are exactly 41 explicit values, the largest being 194. Under the Generalized Riemann Hypothesis these 41 values are the complete list. The proof combines an elementary lemma, a union bound for the representations that use a forbidden square, the class number formula for sums of three squares, Tatuzawa's theorem, and explicit bounds for a divisor-type function. The analytic range begins at 8n+3 = 3.4561*10^10 and overlaps the computed range by a factor 1.944. The computed range is certified by two independent algorithms, supplied as ancillary files together with a verifier for every constant.

Primarily AI-generated textHuman understanding: no partsGauss Eureka theoremSiegel-Tatuzawa theoremclass numberscomputer-assisted proofsums of three squarestriangular numbers
Nov 19, 20267 pages
PDFView work

math.OA — Operator Algebras

Spectral measure blowup for Hadamard subfactors

Contributed by Teo Banica

We study the spectral measures of the Hadamard subfactors coming from the deformed Fourier matrices FX⊗QFYF_X\otimes_QF_Y. After preliminaries on small-index graphs and exceptional root measures, we express the law through a Gram matrix over a compact abelian group, interpret this as an abelian covering, and compute the moment growth. At index 6 the generic law comes from the honeycomb and kagome lattices, and finite cases correspond to Eisenstein ideals. Circulant families at square index give planar random walk laws. We locate the first Jacobi defect and construct finite-depth laws with arbitrarily long generic moment sequences.

Primarily AI-generated textHuman understanding: some partsHadamard subfactorspectral measure
Nov 19, 202644 pages
PDFView work

math.NT — Number Theory

Irrational values of Dirichlet series with periodic coefficients

Contributed by twinheterodox

Let ff be a nonzero rational-valued function of period DD, and write Lf(j)=∑n≥1f(n)n−jL_f(j)=\sum_{n\ge1} f(n)n^{-j}. For either prescribed parity we give an explicit lower bound of order slog⁡log⁡s/log⁡s\sqrt{s\log\log s/\log s} for the number of exponents 2≤j≤s2\le j\le s of that parity for which Lf(j)L_f(j) is irrational. The bound is uniform in ff for fixed DD. It applies, for example, to every nonzero rational projection of a quartic Dirichlet character modulo five. If ff is even or odd, at most D−1D-1 exponents j≥2j\ge2 of the matching parity give zero. The nonzero values at distinct exponents of that parity are linearly independent over the algebraic numbers.

Author comments: 11 pages. This paper extends irrationality counts for odd zeta values and even Dirichlet beta values to rational periodic coefficients. Related papers: https://arxiv.org/abs/2611.16156 and https://hexagonmath.org/2611.00600v1

Primarily AI-generated textHuman understanding: some partsHankel determinantsirrationalityperiodic Dirichlet seriesspecial values
Nov 19, 202611 pages
PDFView work

math.NT — Number Theory

The alternating sum of reciprocal Fibonacci cubes is irrational

Contributed by twinheterodox

We prove that the alternating sum of the reciprocal cubes of the Fibonacci numbers is irrational. The result extends to the Lucas sequences of the first kind associated with real quadratic units greater than one, including the Pell numbers. For every such sequence and every fixed positive integer kk, the reciprocal cubes with indices k,2k,3k,…k,2k,3k,\ldots, taken with signs +,−,+,…+,-,+,\ldots, also have an irrational sum.

Author comments: 8 pages. Extends the ordinary Lucas reciprocal-cube theorem of Hexagon:2611.00491v1 to alternating signs and fixed strides. The source archive includes the independent exact and numerical check programs.

Primarily AI-generated textHuman understanding: some partsFibonacci numbersHankel determinantsLucas sequencesirrationality
Nov 19, 20268 pages
PDFView work

math.CO — Combinatorics

Counterexamples to coefficient conjectures for plane Penrose polynomials

Contributed by Yair Lavi

We give counterexamples to coefficient-sign alternation and coefficient nonvanishing for the plane Penrose polynomial PH(q)=∑A⊆E(H)(−1)∣A∣qcH(A)P_H(q)=\sum_{A\subseteq E(H)}(-1)^{|A|}q^{c_H(A)}. Here HH is a graph embedded in the sphere, and cH(A)c_H(A) counts boundary components after replacing vertices by disks and edges by bands and half-twisting the bands in AA. Weak alternation means that coefficients, read in descending powers from a positive leading coefficient, are alternately nonnegative and nonpositive. We construct a simple bridgeless plane graph on ten vertices whose Penrose polynomial is monic of degree eight and has linear coefficient 160160, contrary to weak alternation. A bridgeless plane multigraph on eleven vertices has zero linear coefficient. We also give a simple bridgeless cubic example on twelve vertices, where cubic means that every vertex has degree three; its linear and quadratic coefficients both have the wrong signs. These examples answer Aigner's questions on coefficient nonvanishing and sign alternation negatively. Replacing each degree-kk vertex of the first two examples by a kk-cycle, with the incident edges attached in their embedding order, gives counterexamples to both coefficient conjectures of Kauffman, Silver and Williams. A known triangle-replacement identity gives infinite families, and connected sums give arbitrarily many vanishing initial coefficients for the Penrose–Kauffman polynomial. The cycle matroid of the ten-vertex example is an explicit planar minor-minimal obstruction to coefficient alternation, answering Aigner's question about minor-minimal binary-matroid obstructions negatively.

Author comments: The supplement cited in the text (supplement-v7.tar.gz: an exact verifier in Python 3.10+, its saved output and a README) is archived with the paper in the Zenodo record https://doi.org/10.5281/zenodo.24351582.

A mix of human-written and AI-generated textHuman understanding: all partsBinary matroidCoefficient signsPenrose polynomialPenrose–Kauffman polynomialPlane graphcounterexample
Nov 19, 202616 pages
PDFView work

math.NT — Number Theory

Power-saving bounds for balanced radical triples via small Pell discriminants

Contributed by Zeng Chunping

For 0<λ≤10<\lambda\leq 1, let Bλ(N)\mathcal{B}_{\lambda}(N) be the set of integers n≤Nn\leq N for which rad(n(n+1)(2n+1))<(2n+1)λ\mathrm{rad}(n(n+1)(2n+1))<(2n+1)^{\lambda}. The elementary radical-box estimate gives ∣Bλ(N)∣≪Nλ/3+ε|\mathcal{B}_{\lambda}(N)|\ll N^{\lambda/3+\varepsilon}. We prove a strict power-saving refinement of this exponent: there is an absolute constant C>0C>0 such that ∣Bλ(N)∣≪λ,εNλ/3−Cλ3+ε|\mathcal{B}_{\lambda}(N)|\ll_{\lambda,\varepsilon}N^{\lambda/3-C\lambda^{3}+\varepsilon}. The argument uses Diao's uniform bound for the number of small fundamental solutions to Pell equations, together with a squarefree-kernel transfer for the three unit-difference equations, a fixed-support radical-box lemma, and a three-branch dyadic optimization. We also formulate the resulting estimate for high-quality values and for Chinese-remainder orbits, and quantify the variable-right-hand-side obstruction to a direct extension to arbitrary abc triples. No assertion of the abc or Szpiro conjecture is used, and no pointwise abc inequality is claimed. The only non-elementary external input is Diao's Theorem 1.3 in arXiv:2610.28001v1, whose statement and preprint status are recorded explicitly.

Primarily human-written textHuman understanding: all partsradical,abc conjecture, Pell equation
Nov 19, 202616 pages
PDFView work

math.MP — Mathematical Physics

The Assumption Package of the Yang–Mills Construction: Formal Definitions and Derivations

Contributed by Zeng Chunping

This is a companion document for the conditional mass‑gap theorem for four‑dimensional pure Yang‑Mills theory. We collect formal definitions and derivations for the full set of external hypotheses (RG1–RG5, UV1, PH1–PH3, AN1, Y1–Y4, B1, C1) employed in the lattice‑based construction. A volume‑consistent revised condition RG4' is established, repairing a potential volume‑divergence issue in the original formulation. Several algebraic identities are cross‑validated against the Lean 4 formal‑verification repository. We emphasize that this package of assumptions is not sufficient to prove the mass gap: counterexamples satisfy all these hypotheses while having zero mass gap. Three further open mathematical components remain required for the mass‑gap result: a volume‑uniform log‑Sobolev inequality, an Euclidean‑to‑Hamiltonian correspondence theorem, and a non‑perturbative Callan–Symanzik Ward identity implementing dynamical mass generation.

A mix of human-written and AI-generated textHuman understanding: all partsOsterwalder-Schrader axiomsYang-Mills theoryformal prooflattice gauge theorymass gapquantum field theoryrenormalization group
Nov 19, 20268 pages
PDFView work

math.NT — Number Theory

Old and new Drinfeld cusp forms of level t in characteristic 2: the weights k = 2^m + 1

Contributed by David Niedbala Giraudin

Let q = 2, A = F_2[t], and let U_t be the Atkin operator on the space S_k(Gamma_0(t)) of Drinfeld cusp forms of level t. For every weight k = 2^m + 1 we prove that S_k(Gamma_0(t)) is the direct sum of its oldforms and its newforms, that k/2 is the largest slope of U_t, and that no oldform has slope k/2. This is Conjecture 1.2(3) of Bandini and Valentino, and their conjectured old/new decomposition, for this infinite family of weights in characteristic 2, where the known methods do not apply. We also obtain the characteristic polynomial of U_t in closed form in terms of that of the Hecke operator T_t in level one, and the bound: every slope of T_t on S_k(GL_2(A)) is at most J_m = (2^m - (-1)^m)/3. The proof rests on a combinatorial theorem: the leading principal minors of the Bandini-Valentino matrix are nonzero exactly at the Jacobsthal numbers; equivalently, the number of perfect matchings of the graph of nonempty subsets of {1, ..., m} joined when disjoint or nested is odd exactly when the number of vertices plus one is a Jacobsthal number.

Primarily AI-generated textHuman understanding: no partsAtkin operatorDrinfeld cusp formsJacobsthal numberscharacteristic 2oldforms and newformsperfect matchingsslopes
Nov 19, 20268 pages
PDFView work

math.NT — Number Theory

Uniform intervals for irrational even beta values

Contributed by twinheterodox

For every positive integer qq, at least one of the Dirichlet beta values β(2q+2),β(2q+4),…,β(2⌊33q/2⌋)\beta(2q+2),\beta(2q+4),\ldots,\beta(2\lfloor33q/2\rfloor) is irrational. This gives an explicit interval from every even starting index at least four. For every positive odd mm, some even ss with m+1≤s≤(299/20)m+Cm+1\le s\le(299/20)m+C has β(s)\beta(s) irrational, where CC is absolute. This reduces the previous upper-endpoint multiplier 18.5818.58 to 14.9514.95 up to a bounded additive term. For every odd m≥4,000,000,001m\ge4{,}000{,}000{,}001, the explicit endpoint s<15ms<15m suffices.

Author comments: 10 pages. Improves the uniform upper endpoint of Hexagon 2611.00160v2 and recovers the fixed intervals of Hexagon 2611.00346v1 and 2611.00601v1. The ancillary files include all five finite certificates and their verification programs. https://github.com/twinheterodox/beta4/tree/main/uniform-even-beta-intervals

Primarily AI-generated textHuman understanding: some partsDirichlet beta functionirrationalitylinear forms
Nov 19, 202610 pages
PDFView work

math.CO — Combinatorics

Three Roles and One Bit: All Optimal Tables and Equality Graphs

Contributed by Viktor Diakin

We study a randomized one-bit fingerprint for distinguishing graphs on a common labeled vertex set. Each vertex independently receives one of three roles according to a common probability distribution. A symmetric Boolean table assigns bits to pairs of roles, and the fingerprint is the parity of these bits over the graph's edges. We prove that, for every n≥4n \geq 4, the optimal worst-case detection probability over all symmetric Boolean tables and role distributions is exactly 8/278/27. Every optimal distribution is uniform. For n≥5n \geq 5, we classify exactly 21 optimal tables with fixed role labels; one additional table is optimal when n=4n=4. We characterize all graphs attaining the minimum, up to isomorphism and isolated vertices: the four-cycle C4C_4 occurs for every optimal table, while the three-vertex path P3P_3 occurs additionally for 15 tables. For the canonical optimal table, we establish that the second distinct minimum is 80/24380/243 when n≥6n \geq 6, attained precisely by K2,4K_{2,4} with possible isolated vertices. For n=4,5n=4,5, the second minimum is 1/31/3. Our analytic proofs use homogeneous quadratic forms over the finite field F4\mathbb{F}_4, supported by reproducible exhaustive computations. The results also apply to differences of interlacement graphs associated with double-occurrence words.

Primarily AI-generated textHuman understanding: some partsCombinatoricsMinimax optimizationRandomized fingerprintingcoding theoryfinite fieldsgraph theory
Nov 19, 202611 pages
PDFView work

math.RT — Representation Theory

Invariant tensor dimensions as Hamburger moments

Contributed by Teo Banica, Sebastien Palcoux

For a self-dual object in a complex tensor category, we characterize the Hamburger moment property of its invariant tensor dimensions by a Cauchy--Schwarz inequality on sums of its tensor powers. Imposing the inequality on all pairs of objects determines the indecomposables in each block and the tensor rules of the unit block. For the additive group, the even invariant dimensions recover the Jordan type. In a finite tensor category of fusion type, Hamburger positivity for the projective cover of the unit forces unimodularity. If the identity and double dual are naturally isomorphic as additive functors, this positivity is equivalent to semisimplicity. A zero Cartan eigenvalue yields an explicit negative Hankel square in the unimodular case. We also prove semisimplicity of every finite categorification of the even sl2\mathfrak{sl}_2 Verlinde ring at every odd level. Finally, we give a Stieltjes criterion for X⊗X∗X\otimes X^* and a six-dimensional representation whose doubled sequence has a 42-atom representing measure through degree 83 and fails at degree 84.

Primarily AI-generated textHuman understanding: some partsTensor categoryspectral measure
Nov 19, 202650 pages
PDFView work

math.NT — Number Theory

Counting powerful products of consecutive integers

Contributed by Danny Plymesser

We show that the number of n≤xn\le x for which nn and n+1n+1 are both powerful is Oε(x1/4+ε)O_\varepsilon(x^{1/4+\varepsilon}), improving the exponent 29/10029/100 of Reuss. For each fixed k≥3k\ge 3 we show that the number of n≤xn\le x for which (n+1)(n+2)⋯(n+k)(n+1)(n+2)\cdots(n+k) is powerful is Ok,ε(x77/320+ε)O_{k,\varepsilon}(x^{77/320+\varepsilon}), and we prove the same exponent uniformly over all widths k≥3k\ge3. The new ingredient is a per-interval count in Reuss's form of Heath-Brown's approximate determinant method: in lattice-reduced coordinates, the solutions on an auxiliary curve of bidegree (α,β)(\alpha,\beta) become integral points of height at most L13T12L_1^3T_1^2 on an affine curve of degree 2α+3β2\alpha+3\beta, to which the uniform bound of Castryck, Cluckers, Dittmann and Nguyen applies. The proofs are formalized in Lean 4 with Mathlib and checked by Lean's kernel and an independent kernel; the formal statements take six theorems from the literature as explicit hypotheses. The results and exposition were produced and reviewed using AI systems; no human mathematical review has been performed. Section 10 describes the verification and its scope.

Author comments: The manuscript is also available on Zenodo (version 1.0.1): https://doi.org/10.5281/zenodo.23615335. The accompanying Lean 4 formalization, theorem statements, and replay receipt are available in the matching v1.0.1 release: https://github.com/dannyply/math-frontier/tree/v1.0.1

Primarily AI-generated textHuman understanding: no partsLean 4consecutive integersdeterminant methodformal verificationintegral points on curvespowerful numberssquarefull numbers
Nov 19, 202618 pages
PDFView work

math.NT — Number Theory

Two shorter intervals of even Dirichlet beta values

Contributed by twinheterodox

We prove that each of the sets {β(6),β(8),…,β(66)}\{\beta(6),\beta(8),\ldots,\beta(66)\} and {β(8),β(10),…,β(98)}\{\beta(8),\beta(10),\ldots,\beta(98)\} contains an irrational number. These sets contain 3131 and 4646 values, respectively, improving the previous intervals with the same lower endpoints, which contained 3535 and 5252 values.

Author comments: 10 pages. Shortens the known intervals beginning at 6 and 8 to 31 and 46 even beta values, respectively. Includes exact seed computations and version-specific audit records. https://github.com/twinheterodox/beta4/tree/main/beta-intervals

Primarily AI-generated textHuman understanding: some partsDirichlet beta functionirrationalitylinear forms
Nov 19, 202610 pages
PDFView work

math.NT — Number Theory

An asymptotic lower bound for the number of irrational even beta values

Contributed by twinheterodox

For even ss, let I(s)I(s) count the irrational values among β(2),β(4),…,β(s)\beta(2),\beta(4),\ldots,\beta(s). We prove lim inf⁡s→∞2∣sI(s)slog⁡log⁡s/log⁡s≥2ζ(2)ζ(3)3ζ(6)≈1.6098018250\liminf_{\substack{s\to\infty\\2\mid s}} \frac{I(s)}{\sqrt{s\log\log s/\log s}} \geq 2\sqrt{\frac{\zeta(2)\zeta(3)}{3\zeta(6)}} \approx 1.6098018250. Here β\beta denotes the Dirichlet beta function and ζ\zeta the Riemann zeta function. The bound improves the growth rate in our earlier counting result by a factor log⁡log⁡s\sqrt{\log\log s}. It has the same growth rate as the recent theorem of Fischler, Lai, Sprang and Zudilin for irrational odd zeta values, with 1/31/\sqrt3 of their leading constant. The conclusion remains valid after any fixed initial set of even beta values is omitted.

Author comments: 13 pages. The earlier paper (Hexagon 2611.00139v1) gives an explicit lower bound for every even s ≥ 160. The present paper improves the growth rate by a factor of √(log log s). The ancillary files contain the exact checker, its reference output, and the reviews of the original and strengthened proofs. https://github.com/twinheterodox/beta4/tree/main/asymptotic-even-beta-counts

Primarily AI-generated textHuman understanding: some partsDirichlet beta functionHankel determinantsirrationality
Nov 19, 202613 pages
PDFView work

math.NT — Number Theory

Equal prime divisors in disjoint blocks of consecutive integers

Contributed by Sunay Venkat

We construct infinitely many disjoint pairs of consecutive blocks, of lengths three and four in that order, whose products have identical prime divisors. Their starting positions disprove the finiteness and separation predictions in Erdős’s 1976 formulation. The modern Erdős problem 931 requires the earlier block to be at least as long as the later one and remains open. For any fixed lengths k,ℓ≥2k,\ell\ge2, the number of equal-support pairs with increasing first terms at most XX, even allowing overlap, is Ok,ℓ,ε(X2/3+ε)O_{k,\ell,\varepsilon}(X^{2/3+\varepsilon}). In the modern length order, we prove finiteness on fixed conics, on fixed equations in separated rational functions, and for pairs admitting two independent multiplicative relations. We also give exact counts in three strips of bounded separation, without a bound on either starting term.

Author comments: 37 pages. Counterexamples to the 1976 formulation, with quantitative and special-case results. The modern ordered Erdős problem 931 remains open.

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