Browse

All works

Browse the Hexagon catalog.

Newest works

1229 works

math.PR — Probability

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

Contributed by Tejasvi Singh Tomar

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

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

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

quant-ph — Quantum Physics

Undistillability of Werner states from three, four and five copies

Contributed by Tejasvi Singh Tomar

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

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

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

math.NT — Number Theory

Integer-power separation does not force rational-dilation separation

Contributed by Sunay Venkat

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

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

math.NT — Number Theory

Algebraically independent counterexamples with rational-power separation

Contributed by Sunay Venkat

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

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

math.NT — Number Theory

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

Contributed by Changxia Lin

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

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

math.NT — Number Theory

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

Contributed by Elias De Jesús

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

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

math-ph — Mathematical Physics

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

Contributed by Yuri Ximenes Lecca

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

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

math.NT — Number Theory

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

Contributed by FELIPE MARTINS SANTOS

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

Author comments: DOI 10.5281/zenodo.24145199

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

math.GR — Group Theory

Flat linearity of uniform groups

Contributed by Teo Banica

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

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

math.NT — Number Theory

Colossally Abundant Numbers and Nicolas' Second Criterion

Contributed by Frank Vega

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

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

math.SG — Symplectic Geometry

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

Contributed by Zhen Gao

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

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

math.FA — Functional Analysis

A midpoint locally uniformly rotund Banach space with the Daugavet property

Contributed by Samir Hamad

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

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

math.CO — Combinatorics

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

Contributed by Yuda Chen, Yifei Wang

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

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

math.GR — Group Theory

Further cases of the inductive Alperin–McKay condition

Contributed by Qiyue Tang

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

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

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

math.RT — Representation Theory

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

Contributed by Qiyue Tang

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

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

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

math.CO — Combinatorics

Vector Packing and Sharp Bounds for Matrices of Bounded Rank

Contributed by Yair Lavi

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

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

math.LO — Logic

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

Contributed by John Hessler

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

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

math.PR — Probability

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

Contributed by Brice Pouly

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

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

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

math.OA — Operator Algebras

Karlsson matrices and the kagome lattice

Contributed by Teo Banica

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

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

math.QA — Quantum Algebra

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

Contributed by G. Militaru

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

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

math.LO — Logic

Self-embedding monoids and the existential Thomas conjecture

Contributed by Dr. András Pongrácz

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

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

math.NT — Number Theory

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

Contributed by Filip Najman

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

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

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

math.MG — Metric Geometry

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

Contributed by Sihan Chen

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

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

math.AG — Algebraic Geometry

A proof of the HLRV conjecture

Contributed by Qiyue Tang

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

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

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

math.NT — Number Theory

Growth criteria for reciprocal series with nonincreasing weights

Contributed by twinheterodox

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

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

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

cs.CC — Computational Complexity

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

Contributed by David Niedbala Giraudin

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

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

math.MP — Mathematical Physics

Electric-field hotspot packing and power channels in dielectric media

Contributed by Daniel Wang

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

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

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

math.NT — Number Theory

Subrings and cotypes of truncated polynomial rings

Contributed by Ramin Takloo-Bighash, Sarthak Chimni

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

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

math.NT — Number Theory

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

Contributed by Elleard Felix Webster Heffern

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

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

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

math.AG — Algebraic Geometry

An explicit determinantal formula for Sinkhorn limits of matrices and tensors

Contributed by Shankar Sivarajan

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

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

math.NT — Number Theory

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

Contributed by Shawn Krisman

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

Author comments: We were able to obtain a copy of Hata 1990 and updated the novelty of this result.

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

math.NT — Number Theory

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

Contributed by Andrej Dujella, Sinisa Slijepcevic

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

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

math.RT — Representation Theory

A proof of Lusztig's connectedness conjecture in finite type

Contributed by Qiyue Tang

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

Author comments: v4(2026/11/19):No mathematical changes have been made in this update. All available research materials from 17 research sessions, with a combined scheduled duration of approximately 167 hours, have been uploaded to the public (https://github.com/tqyqiqi1509/Lusztig-Weyl), organized by session. This duration includes recorded interruptions. Interested researchers are welcome to explore these materials and pursue further progress on Lusztig’s connectedness conjecture. Version 3 already incorporates revisions made following the Rethlas-OSV review of Version 2. No further mathematical content will be added to this paper, but any errors found will be corrected. I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

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

math.RT — Representation Theory

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

Contributed by Qiyue Tang

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

Author comments: v4(2026/11/17): The manuscript was reviewed using Rethlas-OSV with GPT-6-Astra at high reasoning effort and four concurrent workers. The review reported only two minor presentation issues: an incorrect citation locator and a missing working-directory specification in the reproduction instructions. Both were corrected in this revision. I have made no changes to the mathematical content of the paper. I do not plan to add new mathematical results to it, but I will correct any errors that come to light. I have made the research materials from all 18 rounds of work on Lusztig’s P1–P15 conjectures publicly available on GitHub:https://github.com/tqyqiqi1509/Lusztig-P1-P15/releases/tag/rounds-1-18 The rounds had a combined research window of about 171 hours. The archives include partial results that go beyond the two papers I posted here (https://hexagonmath.org/2611.00205v3 and https://hexagonmath.org/2611.00411v2). I think some of these results are worth pursuing, and I welcome anyone working on the problem to build on them. I would be glad if this work helped bring the problem closer to a solution.

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

math.CO — Combinatorics

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

Contributed by Eric Naslund

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

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

math.NT — Number Theory

The central charge of an arithmetic system: a seven-world framework

Contributed by Zeng Chunping

To an arithmetic system (prime elements, norms, weights, LL-functions) we attach the central charge Cν=∑p(log⁡Np)ν/(Np(Npν−1))⋅(weight of Frobp)−1C_\nu=\sum_{\mathfrak p}(\log N\mathfrak p)^\nu/(N\mathfrak p(N\mathfrak p^\nu-1))\cdot(\text{weight of }\mathrm{Frob}_{\mathfrak p})^{-1}. Seven worlds share it: number fields, function fields, graphs, finite-type dynamics, knots, tropical geometry, and arithmetic dynamics. We record four universal laws with their exact status. (I) Index-set identity in all seven worlds (number fields to 101310^{13}, tropical skeletons to 103110^{31}). (II) Critical law Cν∼Φ⋅(ν−1)!/ΔνC_\nu\sim\Phi\cdot(\nu-1)!/\Delta^\nu, with Δ\Delta the distance to the controlling singularity: a pole (Tate) or the natural boundary (cuspidal); Φ\Phi measures reachability (≈0.7\approx 0.7 Tate, ≈0.07\approx 0.07 cusp). (III) Diagonal main-term theorem: LL entire iff cuspidal iff no diagonal main term iff vanishing connected/remainder ratio; item (v) (never-saturating spectral form factor) is at conjecture level, the bridge closed by a companion paper's recurrence-peak criterion. (IV) Law of forgetting in six formulations, unified: forgetting = increasing Δ\Delta = rising diagonal fraction = approaching the semicircle (free) = setting η24=1\eta^{24}=1. The core dichotomy (horizontal coordinate σ=1+κ\sigma=1+\kappa universal, amplitude fingerprinted) is checked on moments. The 24 network (Δ=qη24\Delta=q\eta^{24}, Yau--Zaslow, L(11a1,1)/Ω=1/5L(11a1,1)/\Omega=1/5) and the Neron wild tables are included; everything carries a status label and a corrections register. We prove neither abc, Szpiro, RH, nor BSD.

Primarily human-written textHuman understanding: all partsCatalan numbersSato-TateTemperley-Liebarithmetic quantum chaoscentral chargeeta productmirror symmetrynatural boundary
Nov 13, 202613 pages
PDFView work

math.CO — Combinatorics

The Sharp Exponential Constant for 6-Regular Circulant Matrices

Contributed by Yair Lavi

We prove that, for every integer n≥6n\ge6 and six-element set S⊆ZnS\subseteq\mathbb Z_n, the binary circulant Cn(S)=(1{j−i∈S})i,j∈ZnC_n(S)=(1_{\{j-i\in S\}})_{i,j\in\mathbb Z_n} satisfies per⁡Cn(S)≥((3125/1296)e7/250000)n\operatorname{per}C_n(S)\ge((3125/1296)e^{7/250000})^n. For every integer d≥2d\ge2, we identify the optimal uniform base as inf⁡n≥dinf⁡∣S∣=dper⁡Cn(S)1/n=lim⁡q→∞per⁡Cqd−1({0,1,q,…,qd−2})1/qd−1\inf_{n\ge d}\inf_{|S|=d}\operatorname{per}C_n(S)^{1/n}=\lim_{q\to\infty}\operatorname{per}C_{q^{d-1}}(\{0,1,q,\ldots,q^{d-2}\})^{1/q^{d-1}}, where S⊆ZnS\subseteq\mathbb Z_n and qq runs through integers at least 22. In degree six this base is at most 1638128736631981/35163812873663198^{1/35}, while the lower bound strictly exceeds the sharp unrestricted base 3125/12963125/1296. This resolves the surviving circulant lower-bound question in Minc's Problem 10; its proposed full upper bound fails even for circulants.

Author comments: The supplement cited in the text (supplement-v7.tar.gz) is in the Zenodo record https://doi.org/10.5281/zenodo.23044484.

A mix of human-written and AI-generated textHuman understanding: all partsBinary circulantMatching entropyMatching measureMinc's Problem 10Regular bipartite graphpermanent
Nov 13, 202615 pages
PDFView work

math.CO — Combinatorics

A Conjecture on the Permanent of Positive Semidefinite Matrices

Contributed by Yair Lavi

We state the following conjecture of the author and prove it for n≤5n\leq5. Let A=(aij)A=(a_{ij}) be a complex positive semidefinite n×nn\times n matrix with n≥1n\geq1, and let χλ\chi_\lambda be an irreducible character of SnS_n of degree dλd_\lambda. For σ∈Sn\sigma\in S_n, put aσ=∏i=1nai,σ(i)a_\sigma=\prod_{i=1}^n a_{i,\sigma(i)}. The conjecture asserts that ∑σ,τ∈Snχλ(στ)aσaτ≤dλ(per⁡A)2.\sum_{\sigma,\tau\in S_n}\chi_\lambda(\sigma\tau)a_\sigma a_\tau \leq d_\lambda(\operatorname{per}A)^2. We show that Soules' permanent-on-top conjecture implies this inequality, and that it in turn implies both Lieb's immanant dominance and Chollet's permanent inequality. We also settle the previously unresolved order-four case of Soules' conjecture.

Author comments: The supplement cited in the text (exact certificates, order-four proof inputs and checking programs; ZIP, 176.5 MB) is in the Zenodo record https://doi.org/10.5281/zenodo.22976216.

A mix of human-written and AI-generated textHuman understanding: all partsChollet conjecturePositive semidefinite matrixSchur power matriximmanantpermanent
Nov 13, 20268 pages
PDFView work

math.NT — Number Theory

A √3 growth criterion for weighted reciprocal series

Contributed by twinheterodox

We prove that ∑n≥11/(an2an+1)\sum_{n\ge1}1/(a_n^2a_{n+1}) is irrational for every strictly increasing sequence of positive integers satisfying lim sup⁡n→∞log⁡an/(3)n=∞\limsup_{n\to\infty}\log a_n/(\sqrt{3})^n=\infty. This lowers the sufficient growth base from 22 to 3\sqrt{3} in the criterion of Barreto, Kang, Kim, Kovač and Zhang (Bull. Lond. Math. Soc. 58 (2026), e70457, Theorem 3) for weights (2,1)(2,1). Irregular growth is allowed. The result also extends to nondecreasing sequences and positive integer numerators subject to polynomial size bounds.

Author comments: 6 pages. Includes a general criterion with positive integer numerators. Source and build instructions: https://github.com/twinheterodox/weighted-reciprocal-growth

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

math.AG — Algebraic Geometry

A proof of the Hausel–Rodriguez-Villegas conjecture

Contributed by Qiyue Tang

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

Author comments: v2(2026/11/17):Version 1 underwent a full-manuscript review and two rounds of targeted follow-up review by Rethlas-OSV, using GPT-6-Astra at high reasoning effort with a concurrency limit of four. No confirmed mathematical issues were reported. I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

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

math.GR — Group Theory

A proof of Brauer's k(B)k(B)-conjecture at the prime two

Contributed by Qiyue Tang

We prove that every 22-block of a finite group has at most as many ordinary irreducible characters as the order of its defect groups.

Author comments: v2(2026/11/17):Version 1 underwent approximately 45 hours of review and revision using GPT-6 Pro. The next version will document the exact prompts and review procedure. I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

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

math-ph — Mathematical Physics

Global twistor sources for analytic Einstein spacetimes

Contributed by Lior Isthmus

We globalize the local analytic projective twistor correspondence for the gravitational googly problem, retaining its convergent nonlinear treatment of both gravitational chiralities. For each fixed Einstein coefficient, the correspondence identifies independently defined atlases of two analytic Čech classes of weights 22 and −6-6, structured operator sources on null monodromy presentations, and holomorphic oriented spin Einstein four-manifolds. Its inverse comparisons preserve the original source operations, Einstein scale, spin structure and complete point family, together with calibrated modules on parametrized incidence. For analytic Lorentz developments with a compact marked Cauchy surface, germs along the entire real development give the corresponding equivalence, and the maximal analytic Cauchy development determines a terminal source germ. A Nariai example admits no Hausdorff contact carrier containing the full complex skies over all points of the real development. In its product complexification and every allowed point restriction containing the entire real development, every real point sky has nonclosed saturation, so no ordinary locally finitely generated module has exactly that saturated support. These obstructions explain the use of null monodromy and parametrized incidence in the global correspondence, with compact point objects recovered by central specialization.

Author comments: v1.0.1. Bibliography metadata formatting updated; mathematical content and reference entries are unchanged. The same manuscript and computational supplement are available at https://doi.org/10.5281/zenodo.24239028 and https://github.com/lioristhmus/global-twistor-sources/releases/tag/v1.0.1.

Primarily AI-generated textHuman understanding: some partsCauchy developmentanalytic Einstein metricsgravitational googly problemmicrodifferential algebroidsnull monodromytwistor correspondence
Nov 13, 202672 pages
PDFView work

math.CO — Combinatorics

An order-eleven counterexample to triangular realization of sign matrix permanents

Contributed by Weiming Zhang

We construct an 11×1111\times11 sign matrix with permanent P=2 029 568P=2\,029\,568. An exhaustive enumeration shows that \(\lvert\per B\rvert\ne P\) for every sign matrix BB of order eleven whose entries below the diagonal are all +1+1. This gives a negative answer to a question of Ingram and Razborov.

Primarily AI-generated textHuman understanding: all parts
Nov 13, 202612 pages
PDFView work

math.NT — Number Theory

Landau's problems through ratios of LL-functions

Contributed by Haozhe Gou, Victor Wang, Max Wenqiang Xu

Very recently, Lee announced a proof of the Twin Prime Conjecture assuming the Ratios Conjecture for the Riemann zeta function. We obtain conditional asymptotic formulas with power-saving errors for each of Landau's four prime problems. Similar results may be possible for other problems in analytic number theory.

Author comments: 36 pages

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

math.RT — Representation Theory

A law of large numbers for infinitesimal characters of real reductive Lie algebras

Contributed by Andrew Salmon

We prove a law of large numbers for the infinitesimal characters of real reductive Lie algebras. Let π\pi be a unitary representation of a connected Lie group with reductive Lie algebra. For product states on the tensor powers of π\pi whose sites have uniformly bounded moments, for instance identical sites, the infinitesimal character divided by the number of sites concentrates at the spectrum of the limiting mean moment, with probabilities of deviation O(n−m)O(n^{-m}) for every mm. The generators may be unbounded and the group non-compact. For compact groups this recovers the laws of large numbers of Keyl and Werner and of Botero, Christandl and Vrana, which enter the asymptotic analysis of linear programming bounds for binary codes; spherical designs require the non-compact case. We give concrete examples arising from Howe dual pairs on bosonic Fock space.

Author comments: Comments welcome

Primarily AI-generated textHuman understanding: all parts
Nov 13, 202616 pages
PDFView work

math.NT — Number Theory

Joint marked moments and optimized zero-free half-planes for unitary Hecke L-functions

Contributed by Baiying Liu

In this paper, we improve the uniform zero-free bound for the Quasi-Riemann Hypothesis and obtain the half-plane LK (s,ω) ̸= 0 (Re s>B∗ = 0.8733458561067185768...) for every continuous unitary Hecke character ω over every number field K, with the possible norm-character pole permitted. We prove joint moment estimates for inverse and ordinary character sums and apply them to zero detection and the averaged Mellin numerator. The proof uses the earlier number-field theta and moment theorems and the unitary estimates of Hu and Gao. The same half-plane holds for finite-dimensional continuous unitary Weil representations, with pole orders equal to the multiplicities of their norm-character constituents. We determine B∗ asanalgebraicnumberofdegreenineandastheinfimumofthespecifiedpositivecomparison, allowing unequal ordinary moments and variable comparison lengths.

A mix of human-written and AI-generated textHuman understanding: some partsRiemann Zeta Functionquasi Riemann Hypothesiszero-free half-planes
Nov 13, 202654 pages
PDFView work

math.LO — Logic

Bounded Presentations and Normalization in Arithmetic Reconstruction

Contributed by Zhenyu Sun

We study bounded presentations of selected constructions in absolute anabelian geometry and Frobenioid theory. In bounded Zermelo set theory with Choice, we prove uniform recursion for a common state space and a uniformly supplied transition rule. Under explicit index bounds, membership-table codes place the states and their histories at the same finite type level. We construct coherent comparisons for representative quotients, fiberwise full skeletons, isofibrational base changes, and countable towers, and verify the lifting properties for model Frobenioids and angular presentations. For nonzero numerical observables transforming by positive scalars, compatible normalization exists exactly when the associated character is trivial on every isotropy group. A self-equivalence of the realified arithmetic Frobenioid over Q\mathbb{Q} preserves degree and every object isomorphism class but does not lift to the unit-trivialized perfection. The structural results give a relative uniform interpretation theorem: the weak theory constructs the bounded presentations and comparison maps, and specified arithmetic recognition theorems identify the resulting structures.

Author comments: 25 pages.

A mix of human-written and AI-generated textHuman understanding: some partsFrobenioidsarithmetic reconstructionbounded recursioncategorical equivalencenormalizationweak set theory
Nov 13, 202625 pages
PDFView work

math.OA — Operator Algebras

Higher invariants of complex Hadamard matrices

Contributed by Teo Banica

Associated to any complex Hadamard matrix H∈MN(T)H\in M_N(\mathbb T) is a quantum permutation group G⊂uSN+G\subset_uS_N^+, the Hopf image of the representation associated to the magic matrix formed by the rank 1 projections Pij=Proj(Hi/Hj)P_{ij}=Proj(H_i/H_j), and its invariants ck=dim⁡(Fix(u⊗k))c_k=\dim(Fix(u^{\otimes k})) are the dimensions of the relative commutants of the subfactor associated to HH. We compute these invariants well beyond the levels k=2,3k=2,3 previously known, up to k=9k=9 in the best cases, by using Jones--Wenzl and annular decompositions. For the Di\c t\u a deformations of the Fourier matrices we compute GG for all values of the parameters, and we study the order 8 families F8,5F_{8,5}, in connection with free wreath products. For the matrices of small order with c2=2c_2=2, such as the Karlsson ones at generic parameters, we find ck=Catkc_k=Cat_k at all the levels computed. Finally, via an integrality principle and character sums, we prove that the Paley II matrices, and more generally those coming from symmetric conference matrices, have infinite depth, as well as the Paley I matrices with 11≤q<10511\leq q<10^5.

Primarily AI-generated textHuman understanding: some partsHadamard matrixQuantum permutation
Nov 13, 202658 pages
PDFView work

math.DS — Dynamical Systems

Convergence Criteria for Measure-Valued Population Dynamics with Mutation and Horizontal Transfer

Contributed by Zhenyu Sun

We study a measure-valued population equation on a compact trait space with positive baseline growth and competition, an additional mutation birth gain, and frequency-dependent horizontal transfer with an antisymmetric net kernel. We give sufficient conditions for convergence to a unique nonzero equilibrium. Separating total mass from trait frequencies yields positive mass bounds. Without mutation, maximal time-averaged fitness on the initial support tends to zero, and the endpoint measure in each joint subsequential limit is supported on the zero set of the limiting averaged fitness. Potential transfer and recipient-independent competition reduce the frequency dynamics to a normalized positive semigroup. For general transfer, a common-reference balance gives an entropy criterion allowing arbitrarily strong circulation. An adjoint-weighted entropy identity includes singular population components and the normalization correction in transfer. Mutation dissipates deviations in weighted composition, while a quadratic-form condition controls the remaining mass deviation; in finite dimensions, mutation can also compensate for negative directions of that form. A separate contraction criterion compares arbitrary trajectories using only coefficient bounds. Invariant resident laws yield invasion indices for recurrent environments. Examples exhibit bistability under complete reset mutation and periodic populations whose time averages are not equilibria. For rank-one mutation, we classify stationary frequencies, prove a critical lower bound ruling out exponential convergence from an initial point mass at a maximizer, and determine the condensate when the initial population assigns positive mass to the maximizing set.

Author comments: 46 pages, 1 table.

A mix of human-written and AI-generated textHuman understanding: all partsMeasure-valued population dynamicscondensationhorizontal gene transferinvasionmutationpositive semigroupsrelative entropy
Nov 13, 202646 pages
PDFView work

math.NT — Number Theory

Every even integer greater than 2 is a prime plus a product of at most 18 primes

Contributed by Wren Aquila

We prove that every even integer N≥4N \ge 4 can be written as N=p+ηN = p + \eta with pp prime and η≥2\eta \ge 2 a product of at most 1818 primes, counted with multiplicity. The best previously stated unconditional value we have located is due to Johnston and Starichkova: 395395 in the latest version of their paper, which revised the 369369 of its first two arXiv versions. Assuming that no Dirichlet LL-function vanishes in the half-plane Re⁡s>7/8\operatorname{Re} s > 7/8, the same holds with at most 1414 primes, and under the generalised Riemann hypothesis for Dirichlet LL-functions with at most 99. The improvement comes from counting rather than bounding: an explicit lower bound for the number of primes pp with N−pN - p free of small primes is played against explicit Hardy--Ramanujan-type upper bounds for the integers with many prime factors, both in the range below the sieve threshold and inside the sieved sets. These upper bounds weight by Chebyshev's identity log⁡n=∑d∣nΛ(d)\log n = \sum_{d \mid n} \Lambda(d), use the exact power-series coefficients of a majorant of a finite Euler product and the Mertens density of rough primes, and pre-sieve modulo 11551155, so that the integers to be excluded inherit the residue classes of the primes that produce them. All numerical steps are certified in interval or ball arithmetic, except some discrete convolutions with nonnegative terms, which are evaluated in binary64 under an explicit rounding-error bound and were also recomputed independently in ball arithmetic.

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