HEXAGONbeta

Browse

All works

Browse the Hexagon catalog.

Newest works

342 works
hexagon:2610.00441v1

math.AC — Commutative Algebra

Zero-divisor methods for absolute concentration robustness

Contributed by Michael Mislan

We study the relation between absolute concentration robustness and zero divisors in steady-state coordinate rings. Explicit positive rational, two-sided bimolecular examples disprove both necessity and sufficiency of the proposed unrestricted criterion. A separate example shows why elimination order matters without contradicting lexicographic or product-order statements. We prove completeness of a block-compatible algebraic interface under explicit basis, leading-coverage, nonvacuity and zero-divisor hypotheses. The manuscript develops complementary criteria from regular positive geometry and quantitative algebraic certificates, with examples from loaded reactors, EnvZ and product-release networks. Selected counterexamples, the conditional completeness theorem and exact certificate identities are formalized in Lean 4. Geometric and nonlinear dynamical arguments supplied conventionally are identified separately.

Primarily AI-generated textHuman understanding: some partsLean formalizationabsolute concentration robustnesselimination ordersquantitative certificatessteady-state idealszero divisors
Oct 21, 2026PDF ↗View work →
hexagon:2610.00440v1

math.PR — Probability

Chemical heredity without genetic templates

Contributed by Michael Mislan

We prove two quantitative forms of chemical heredity that do not rely on copying a genetic sequence. In the first model, a population of four compartments carries three prescribed catalyst types that compete for a shared local fuel. Two types are present from the start; a third is supplied for a fixed seeding period, after which all catalyst input stops. We prove that, with failure probability at most 0.004517975690072193, a single finite-stock process acquires the third type and keeps all three present in both daughters of every division, delivers three million catalytic conversion credits on a fixed per-site schedule, and rebuilds the population's copy reserves eleven times, interleaved with ten divisions. The proof controls acquisition, catalytic service, recovery and resource consumption on one stochastic history; it does not assume that a compartment stays replenished between recovery and division. In the second model, an imperfect parent copies its majority conformation into an independent racemic blank, after which both outputs undergo cooperative restoration while spontaneous errors continue. At 4,000 molecules per compartment, 100 successive copying cycles succeed with probability at least 0.999, uniformly over a box of rate parameters. Complete conventional proofs and explicit finite certificates are supplied. The central finite-stock theorem, though not the restoration result, also has a machine-checked Lean formalization. A converse for random division explains why unlinked information units and linked carriers face different loss mechanisms. These results establish acquisition and retained function under prescribed chemistry and operations; chemically generated successive innovations and open-ended evolution require additional mechanisms.

Primarily AI-generated textHuman understanding: some partschemical heredityfinite resourcesorigin of lifestochastic reaction networkstemplate-free heredity
Oct 21, 2026PDF ↗View work →
hexagon:2610.00439v1

math.DS — Dynamical Systems

Unistationarity of Type II_l and Type V autocatalytic cores with nonnegative degradation

Contributed by Michael Mislan

We prove that reversible Type II_l autocatalytic cores with l at least three and Type V cores admit at most one positive stationary state when every degradation rate is nonnegative. The Type II result assumes source-minimality, while the Type V statement uses its literal normal form. Strictly positive reaction rate constants are retained throughout. A reduction to the fork skeleton, source-exhaustion identities and diagonal current criteria control both positive-loss and boundary cases, including internal chains. We also derive determinant estimates and local continuation results, with small-degradation existence and stability under the stated hypotheses. The main nonnegative-degradation uniqueness theorem is registered in Lean 4; the manuscript and supporting claim map distinguish the formal interface from additional conventional results.

Primarily AI-generated textHuman understanding: some partsLean formalizationType V networksautocatalytic coresmass-action kineticsnonnegative degradationunistationarity
Oct 21, 2026PDF ↗View work →
hexagon:2610.00438v1

math.DS — Dynamical Systems

Optimal affinity of autocatalytic networks beyond gross stoichiometry

Contributed by Michael Mislan

An explicit reversible autocatalytic network has a unique global maximum of controlled production whose affinity exponential is strictly below its gross stoichiometric seed ratio. This refutes the proposed general lower bound. We identify a response-profile capacity that retains the missing kinetic information, analyze a literal recycling family approaching the source boundary and give a zero-diagonal counterexample. Under the stated rooted accessibility and response hypotheses, a local mass-action realization theorem makes the capacity sharp; an explicit power family supplies global maxima, while interacting cores delimit broader claims. The registered Lean project verifies the original refutation and checks the explicit witness against the literature conventions. Broader historical formal evidence and conventional arguments are distinguished in the manuscript and supporting claim map.

Primarily AI-generated textHuman understanding: some partsLean formalizationautocatalytic networkscounterexamplemass-action kineticsoptimal affinityresponse-profile capacity
Oct 21, 2026PDF ↗View work →
hexagon:2610.00437v1

math.DS — Dynamical Systems

Unistationarity of Type II_l autocatalytic cores

Contributed by Michael Mislan

We prove unistationarity of reversible Type II_l autocatalytic cores with l at least three under strictly positive degradation. The source-minimal wiring forces source exhaustion and unit return tails, allowing comparison of positive stationary states through current ratios, chain reduction and a cyclic determinant argument. The proof includes separated stems and the exceptional coincident three-fork branch, with all internal chain species retained. Exact six- and seven-species reversible mass-action examples show that the minimality assumptions cannot be dropped: both admit two distinct positive stationary states with strictly positive rates and losses. The principal uniqueness theorem has a complete registered Lean formalization. The manuscript distinguishes that theorem, broader historical formal evidence and conventional exact calculations; the supplied claim map records the boundaries of each.

Primarily AI-generated textHuman understanding: some partsLean formalizationautocatalytic coresmass-action kineticspositive degradationsource minimalityunistationarity
Oct 21, 2026PDF ↗View work →
hexagon:2610.00436v1

math.RT — Representation Theory

Counterexamples to the weakly Gorenstein symmetry conjecture

Contributed by Qiyue Tang

We construct a 29-dimensional algebra which is left weakly Gorenstein and is not right weakly Gorenstein. We also construct a 145-dimensional gendo-symmetric algebra with the same property. Both constructions work over every field containing an element of infinite multiplicative order. These examples disprove the weakly Gorenstein symmetry conjecture.

A mix of human-written and AI-generated textHuman understanding: some partsweakly Gorenstein symmetry conjecture
Oct 21, 2026PDF ↗View work →
hexagon:2610.00435v1

math.DG — Differential Geometry

Area Nondecreasing Drawstrings and Counterexamples to Euclidean Rigidity and Zero Mass Stability

Contributed by Jiangcheng You, Heng Zhang

Building on the drawstring construction of Kazaras--Xu, we develop a localized refinement that contracts prescribed curves while preserving positive scalar curvature and without decreasing two-dimensional area. As two applications, we disprove part~(b) of Gromov's Euclidean C0C^0 rigidity conjecture and Sormani's zero mass stability conjecture.

Primarily human-written textHuman understanding: all partsADM massAF manifoldsDrawstring constructionsGromov's Euclidean C^0 rigidity conjectureIntrinsic flat convergencePositive mass theoremScalar curvature rigidityZero mass stability
Oct 21, 2026PDF ↗View work →
hexagon:2610.00434v1

math.CO — Combinatorics

Counterexamples to the Two-Bases Conjecture for the Tutte Polynomial

Contributed by Jungang Chen

We disprove the two-bases conjecture of Chávez-Lomelí, Merino, Noble, and Ramírez-Ibañez (Conjecture 5.8 in *Some Inequalities for the Tutte Polynomial*), which asserts that max⁡{TM(2,0),TM(0,2)}≥TM(1,1)\max\{T_M(2,0),T_M(0,2)\}\ge T_M(1,1) whenever a matroid contains two disjoint bases or its ground set is the union of two bases. We construct a connected, self-dual, rationally representable matroid MM of rank 3232 on 6464 elements whose ground set is partitioned into two bases, but for which \[ T_M(2,0)=T_M(0,2)=263656235940864 <275621102802945=T_M(1,1). \] The construction extends to an explicit infinite family MmM_m of rank 2m2m on 4m4m elements such that \[ \frac{\max\{T_{M_m}(2,0),T_{M_m}(0,2)\}}{T_{M_m}(1,1)}\longrightarrow0. \] Consequently, the corresponding additive and multiplicative Merino–Welsh inequalities also fail under the two-bases hypothesis. We additionally construct a simple and cosimple matroid on 6060 elements whose ground set is partitioned into two bases and for which TM(2,0)<TM(1,1)T_M(2,0)<T_M(1,1). This disproves the simple-matroid, two-bases-covering formulation of Conjecture 4.2 of Merino, Ibañez, and Rodríguez; its dual disproves the corresponding cosimple-matroid, two-disjoint-bases formulation. The constructions and inequalities are established by explicit rank functions, exact Tutte-polynomial evaluations, and elementary coefficient estimates.

Primarily AI-generated textHuman understanding: some parts
Oct 21, 2026PDF ↗View work →
hexagon:2610.00433v1

math.CO — Combinatorics

Highly connected counterexamples to the permutation Tutte inequality

Contributed by Jungang Chen

We disprove Conjecture 7.3 of Csikvári, Around the Merino–Welsh conjecture: improving Jackson's inequality, which asserts that T~H(2,0)T~H(0,2)≥1\widetilde T_H(2,0)\widetilde T_H(0,2)\ge1 for every bipartite graph HH of minimum degree at least two. For each integer k≥2k\ge2, we construct an explicit sequence of finite simple balanced bipartite graphs whose minimum degree and vertex connectivity are both exactly kk. The graphs admit automorphisms interchanging their two vertex classes, and both T~H(2,0)\widetilde T_H(2,0) and T~H(0,2)\widetilde T_H(0,2) tend to zero along the sequence. Consequently, no fixed minimum-degree or connectivity threshold ensures the inequality, and even the corresponding maximum and additive inequalities fail in these classes. The construction consists of a complete bipartite core with additional vertices of degree kk attached to disjoint kk-element subsets on each side. A one-variable integral bound gives explicit exponential decay for each fixed kk and a sufficient size threshold. We also give a 1000-vertex, 2-connected example whose two axis values are each less than 7/107/10, certified by exact rational arithmetic. These are statements about the permutation Tutte polynomial; a failure of a local permutation inequality alone does not give a counterexample to a graph or matroid Merino–Welsh inequality.

Primarily AI-generated textHuman understanding: some parts
Oct 21, 2026PDF ↗View work →
hexagon:2610.00431v1

math.CO — Combinatorics

Counterexamples to Three Conjectures of Ok on Tutte-Polynomial Deletion Ratios

Contributed by Jungang Chen

We disprove Conjectures 7.2.1, 7.2.2, and 7.2.3 from Seongmin Ok's thesis *Aspects of the Tutte Polynomial*. Conjecture 7.2.1 asserts that deleting a non-bridge edge from a connected loopless graph cannot decrease the ratio of acyclic orientations to spanning trees; Conjecture 7.2.2 strengthens this to monotonicity of T_{G-e}(x,2-x)/T_G(x,2-x) on 0 ≤ x ≤ 2. Both fail for an explicit simple planar, 2-connected, chordal 2-tree on 16 vertices, for which deleting one edge multiplies the first ratio by 53/54. A two-parameter construction gives an exact criterion for infinitely many counterexamples. Conjecture 7.2.3, a differential inequality for Tutte-polynomial ratios of matroid minors, fails already for the cycle matroid of the five-edge diamond graph: its asserted nonnegative expression equals -4 at (0,2) and -25/16 at (1/4,7/4). We further construct counterexamples of arbitrarily high vertex connectivity and minimum degree, even when both graphs are chordal, and prove that the sharp supremum of the reverse ratio under one deletion is 2, already within simple planar series-parallel graphs. These counterexamples do not disprove the Merino–Welsh inequalities.

Primarily AI-generated textHuman understanding: some parts
Oct 21, 2026PDF ↗View work →
hexagon:2610.00430v1

math.CO — Combinatorics

Highly Connected Counterexamples to the Multiplicative Merino–Welsh Inequality

Contributed by Jungang Chen

For every integer k≥3k\ge 3, we construct kk-connected matroids representable over every infinite field, with girth kk, arbitrarily large cogirth, and Merino–Welsh quotient \[ \Phi(M)=\frac{T_M(1,1)^2}{T_M(2,0)T_M(0,2)} \] tending to infinity. In particular, this disproves **Conjecture 7.2 of Csikvári (2026)**, which asserts the multiplicative Merino–Welsh inequality for simple and cosimple matroids, and therefore also the stronger **Conjecture 7.3** therein, as observed by its author. Our examples are rank truncations of direct sums of kk-element circuits. We give a 3-connected counterexample on 1011 elements of rank 433, certified by exact integer arithmetic, and a 6048-element counterexample admitting a proof without computation. Taking the direct sum of a counterexample with its dual also gives a negative answer to **Problem 4.3 of Beke, Csáji, Csikvári, and Pituk (2024)**: the original maximum and additive Merino–Welsh inequalities can fail for simple and cosimple matroids. The same construction disproves **Conjecture 2 of Knauer, Martínez-Sandoval, and Merino (2026)**: for every fixed g≥3g\ge 3, Φ\Phi is unbounded even among matroids having both girth and cogirth exactly gg. The dual direct-sum examples need not be connected; these constructions do not disprove the graphical or binary versions.

Primarily AI-generated textHuman understanding: some parts
Oct 21, 2026PDF ↗View work →
hexagon:2610.00428v2

math.NT — Number Theory

Every algebraic number is a critical value of an integer polynomial

Contributed by RJ Acuna

We arrived at an independent proof of Petrov's theorem. For every irreducible f∈Z[x]f \in \mathbb{Z}[x] of positive degree there are g∈Z[x]g \in \mathbb{Z}[x] and an irreducible F∈Z[x]F \in \mathbb{Z}[x] of positive degree with F∣g′F \mid g' and F2∣f∘gF^{2} \mid f \circ g. Equivalently, every algebraic number is a critical value of an integer polynomial, so the set of critical values of Z[x]\mathbb{Z}[x] is exactly Q‾\overline{\mathbb{Q}}. The construction is explicit. We classify g∈Z[x]g \in \mathbb{Z}[x] with critical value α\alpha, and find a lower bound for deg⁡g\deg g. The proof was assisted by AI, and has been formalized in Lean.

A mix of human-written and AI-generated textHuman understanding: all parts
Oct 21, 2026PDF ↗View work →
hexagon:2610.00427v1

math.CO — Combinatorics

Total mutual visibility in Fibonacci and Lucas cubes

Contributed by Daniel Adam Pyle

A set of vertices is total mutual-visible if every pair of graph vertices has a shortest path whose internal vertices avoid the set. We prove that the total mutual-visibility numbers of the n-dimensional Fibonacci and Lucas cubes both have order ρⁿ/n, where ρ > 1 satisfies ρ³ = ρ² + 1. The eligible Fibonacci words are exactly those avoiding 11 for which zero padding avoids 0000. Their induced graph decomposes into fibres of recognizing subsets of maximal independent sets of a path, and each fibre is a Cartesian product of smaller Fibonacci cubes. Total visibility becomes open packing in these fibres. An elementary coloring and counting argument proves the order of growth. Typical degree and free-dimension estimates, together with a classical binary-code asymptotic, sharpen the normalized bounds to constants 4.032058… and 6.346255…. We give the cyclic analogue, an exact component inventory, and reproducible exact values through dimension 20 for Fibonacci cubes and 16 for Lucas cubes. Neither a leading asymptotic constant nor a closed formula in every dimension is established.

Primarily AI-generated textHuman understanding: no partsFibonacci cubeLucas cubeconstrained codeopen packingrecognizing subsettotal mutual visibility
Oct 21, 2026PDF ↗View work →
hexagon:2610.00426v1

math.NT — Number Theory

An explicit upper-bound certificate for the essential minimum of the Zhang–Zagier height

Contributed by Ricardo Pinho

We give an exact certificate proving C82<0.2534449C_{82}<0.2534449 for the essential minimum of h(α)+h(1−α)h(\alpha)+h(1-\alpha), where hh is the absolute logarithmic Weil height. We use Doche's limit-point method, building on Grinsztajn's factor library and, in particular, Épi's unequal-multiplicity construction. We retain Épi's denominator factors, add Doche's P7P_7, and add 25 numerator factors found by LP-dual-weighted evaluation lattices with LLL. Joint linear-program re-optimisation is followed by exact rational rounding. Two separately written ball-arithmetic checkers certify the bound; a further adversarial computational audit accepts the certificate.

Primarily AI-generated textHuman understanding: some partsDoche limit-point methodLLLWeil heightZhang-Zagier heightcomputer-assisted proofessential minimumlinear programming
Oct 21, 2026PDF ↗View work →
hexagon:2610.00425v1

math.NT — Number Theory

An explicit upper-bound certificate for the Schur–Siegel–Smyth trace constant

Contributed by Ricardo Pinho

We document an explicit certificate proving C86<1.8117251C_{86}<1.8117251 for the smallest limiting trace-to-degree ratio of totally positive algebraic integers. The construction uses the primal problem of Orloski and Talebizadeh Sardari, with their four-polynomial set enlarged to eleven. A discretised solution is rounded to a rational step density, then normalised to a probability measure. Exact rational calculations and rigorous ball-arithmetic inequalities verify Smith's sufficient criterion for an arithmetic measure. An independently written agent checker accepts the certificate and rejects four corrupted controls. This note records the proof, data provenance, reproduction results and limitations of the previously released certificate; it makes no optimality claim.

Primarily AI-generated textHuman understanding: some partsSchur-Siegel-Smyth trace problemball arithmeticcomputer-assisted prooflinear programmingtotally positive algebraic integers
Oct 21, 2026PDF ↗View work →
hexagon:2610.00421v1

math.CO — Combinatorics

Disjoint union activation of difference distance magic labelings

Contributed by Daniel Adam Pyle

A graph is difference distance magic orientable (DDMO) if its vertices can be labeled bijectively by consecutive positive integers and its edges oriented so that the incoming and outgoing neighbor-label sums agree at every vertex. We give an affirmative answer to the disjoint-union question posed by Aceska et al. in January 2026: two copies of the non-DDMO graph K₃,₃ have a DDMO disjoint union. More precisely, for k ≥ 1 and r ≥ 0, the graph consisting of k disjoint copies of K₃,₃ and r isolated vertices is difference distance magic orientable if and only if k is even or r ≥ 1. The proof reduces fixed-label bipartite orientations to signed zero sums and applies classical Skolem and hooked Skolem pairings. A compatible fixed labeling of K₃,₃ has exactly two orientations, related by reversal. We prove that twelve vertices is the minimum order of a DDMO graph whose connected components are all non-DDMO in isolation. A separate exact computer-assisted classification shows that two disjoint copies of K₃,₃ form the unique graph attaining that minimum.

Primarily AI-generated textHuman understanding: no partsSkolem sequencesdifference distance magicdisjoint unionexact computationgraph labeling
Oct 21, 2026PDF ↗View work →
hexagon:2610.00420v1

math.NT — Number Theory

The Riemann Hypothesis on Young's Lattice

Contributed by José Damián Espinosa

This work establishes a novel structural connection between the Riemann Hypothesis and Young's Lattice through partition-indexed harmonic numbers and the Generalized Assembly Theorem. We establish a new family of equivalences for the conjecture, define the partition-based harmonic numbers HnλH_n^{\boldsymbol{\lambda}}, and reformulate the Riemann Hypothesis as the Young's Lattice equivalence: $$\sum_{\substack{k \in \mathbb{N} \\ \boldsymbol{\lambda} \, \vdash \, k}} \frac{H_n^{\boldsymbol{\lambda}}}{\boldsymbol{\lambda}!} \, a_k > \sum_{d \mid n} d$$ for every n∈Nn \in \mathbb{N}, where λ⊢k\boldsymbol{\lambda} \vdash k denotes a partition of kk, λ!\boldsymbol{\lambda}! is the partition factorial, and ak=1k+⋯+1k2a_k = \frac{1}{k} + \dots + \frac{1}{k^2} or ak=log⁡(k+1)a_k=\log(k+1). We then prove the Generalized Assembly Theorem, which shows that the assembly sum $\mathfrak{S}_n^m = \sum_{k=1}^{n} \sum_{\boldsymbol{\lambda} \in \wp_k^{k+m-1}} H_n^{\boldsymbol{\lambda}}$ equals nn for every excess parameter m−1m-1, providing a systematic framework to analyze divisor bounds through the branch decomposition of the partition-indexed series. The resulting structure yields an exact, non-asymptotic realization of the divisors of nn. Finally, we propose and explore a hierarchical expansion connecting the exponential of the Euler--Mascheroni constant, eγe^\gamma, to Multiple Zeta Values under Abel summability. $$e^\gamma = 1 + \sum_{a\ge2} \frac1{a!} \sum_{m\ge0} (-1)^m\zeta^{\mathrm{A}}(a+m) + \sum_{a,b\ge2} \frac1{a!\,b!} \sum_{m,n\ge0} (-1)^{m+n}\zeta^{\mathrm{A}}(a+m,b+n) + \cdots$$

Primarily human-written textHuman understanding: all parts
Oct 21, 2026PDF ↗View work →
hexagon:2610.00419v1

math.NT — Number Theory

Improved bounds on HmH_m for 2≤m≤52\le m\le 5

Contributed by Annanay Kapila

Let Hm=lim inf⁡n→∞(pn+m−pn)H_m=\liminf_{n\to\infty}(p_{n+m}-p_n), where pnp_n denotes the nnth prime. We prove \[ H_2\le 20{,}370,\qquad H_3\le 1{,}380{,}156,\qquad H_4\le 82{,}959{,}170,\qquad H_5\le 5{,}040{,}082{,}836, \] improving the bounds 33,11833{,}118, 2,718,1082{,}718{,}108, 214,099,720214{,}099{,}720 and 14,541,349,28814{,}541{,}349{,}288 of Roeling (2026). We use the multidimensional Selberg sieve of Maynard and Tao in the form developed by Polymath. The arithmetic input is Stadlmann's equidistribution estimate for primes in arithmetic progressions, in the extension to triply densely divisible moduli given in OpenAI's 2026 preprint proving H1≤186H_1\le186. Together with a criterion from the same preprint for the triple dense divisibility of least common multiples, it allows the sieve weights to be supported, instead of on Polymath's truncated simplex, on a region in which single coordinates may be as large as about 0.380.38. On this region we use product trial functions multiplied by an optimised function of the sum of the coordinates, and we certify the resulting variational quotients in ball arithmetic, computing the relevant distribution functions by Fourier inversion.

Primarily AI-generated textHuman understanding: some parts
Oct 20, 2026PDF ↗View work →
hexagon:2610.00418v1

math.DS — Dynamical Systems

The Binder-DeMarco-Dupont Inequality

Contributed by Snir Ben Ovadia, Aaron Brown, Laura DeMarco

In the setting of endomorphisms of Pk(C)\mathbb{P}^k(\mathbb{C}), a dimension formula for the measure of maximal entropy was conjectured by Binder and DeMarco in 2003, asserting that $$\mathrm{dim}_\mathrm{Hausdorff}(\mu)=\log d\sum_{i=1}^k \frac{1}{\chi_i},$$ where dd is the degree of the (non-invertible) endomorphism and χi\chi_i's are the Lyapunov exponents with multiplicity. Indeed, this is well-defined as all Lyapunov exponents are known to be positive due to Briend and Duval. The most significant progress is due to Dupont, who in complex-dimension 2, proved the dimension lower-bound holds; And recently by Genes, who proved the equality for two-dimensional polynomial skew-product maps which satisfy a Lyapunov exponent condition. Recently, He and Bianchi were able to find a family of simple counter-examples. In Appendix A we present a single ``hands on'' description of such a counter example, which is given by a quadratic polynomial skew-product. In this manuscript, we provide the proof, which was achieved by lightly prompting ChatGPT, of extending Dupont’s inequality to all complex dimensions. We wish to share this manuscript with the community as we believe that this provides a full picture of the recently settled Binder-DeMarco conjecture. We do not claim ownership of the proof.

Primarily AI-generated textHuman understanding: some partsComplex dynamics
Oct 20, 2026PDF ↗View work →
hexagon:2610.00417v1

math.CT — Category Theory

The third unit in the adjoint tower of group involutions

Contributed by Zhenyu Sun

The functor G↦Hom⁡(C2,G)G\mapsto\operatorname{Hom}(C_2,G) determines an adjoint tower through successive Eilenberg--Moore comparison functors. We prove that the unit of the third adjunction need not be an isomorphism, answering a question of Bergman. For the generalized dihedral group H=(C4×C4)⋊C2H=(C_4\times C_4)\rtimes C_2, with inversion action, we compute F3V3H≅H×C2F_3V_3H\cong H\times C_2, with counit the first projection. The unit at V3HV_3H is injective, with underlying domain and codomain of cardinalities 2020 and 4040. For an arbitrary group GG, let E(G)=F2V2GE(G)=F_2V_2G and let KGK_G be the kernel of the second counit. We prove that KGK_G is central and that F3V3G≅E(G)/KG[2]F_3V_3G\cong E(G)/K_G[2], where KG[2]K_G[2] consists of the elements of KGK_G whose square is one. The third unit at V3GV_3G is an isomorphism precisely when KGK_G has no element of order four. A central extension of HH of order 128128 supplies such an element and yields the stated description of F3V3HF_3V_3H.

A mix of human-written and AI-generated textHuman understanding: all partsadjoint towercentral extensiongeneralized dihedral groupinvolutory quandlemonadic decomposition
Oct 20, 2026PDF ↗View work →
hexagon:2610.00414v1

math.NT — Number Theory

Superlinear complexity of the (3/2)n(3/2)^n steering word

Contributed by Ralf Stephan

Write (3/2)n=mn+εn(3/2)^n = m_n + \varepsilon_n with mnm_n the nearest integer and εn∈[−12,12)\varepsilon_n\in[-\tfrac12,\tfrac12), and let T=(tn)T=(t_n), tn=2mn+1−3mnt_n=2m_{n+1}-3m_n, be the resulting \emph{steering word}: the step-by-step record of the map x↦32xx\mapsto\tfrac32 x on the orbit of 1, coded by nearest-integer rounding. We prove that the subword complexity pT(k)p_T(k) of TT is superlinear, pT(k)/k→∞p_T(k)/k\to\infty. A pigeonhole argument reduces this to exponential pair repulsion of the orbit modulo one, which we establish by two applications of the pp-adic Subspace Theorem: once in three variables, which handles all gaps between the two orbit points at once, and once in two variables (Ridout's theorem) for the single degenerate family of constant gap. The argument is completely formalized in Lean~4, together with the Subspace Theorem it uses.

A mix of human-written and AI-generated textHuman understanding: all partsuniform distribution
Oct 20, 2026PDF ↗View work →
hexagon:2610.00413v1

math.AG — Algebraic Geometry

Testing the non-vanishing of the Ceresa cycle of X0(N)X_0(N)

Contributed by Leonardo Finzi

For a curve CC and a fixed degree-one divisor ee of CC, we can embed CC into its Jacobian. This embedding induces an algebraic 11-cycle on the Jacobian called the Ceresa cycle, which we denote by $\Cer(C,e)$. Although homologically trivial, Ceresa cycles of very general curves with genus ≥3\geq 3 are non-trivial under algebraic equivalence. It is generally unknown whether a very general curve admits a non-trivial Ceresa cycle modulo rational equivalence. In this paper, we explore the non-triviality under rational equivalence of the Ceresa cycle corresponding to the modular curve X0(N)X_0(N). By extending a method of Lupoian--Rawson involving computing the order of the shadow of the Atkin--Lehner involution wNw_N, we show $\Cer(X_0(kN),e)$ is non-trivial when N=57,58,77,82,85,88,91,93,111,112,115,123,133,135,141,143,145,147,155,161N = 57, 58, 77, 82, 85, 88, 91, 93, 111, 112, 115, 123, 133, 135, 141, 143, 145, 147, 155, 161 for k≥1k \geq 1. Moreover, we detail an algorithm for computing the shadow of the Hecke operator TℓT_\ell for odd primes ℓ\ell not dividing NN, which can be used to determine the non-triviality of the Ceresa cycle of X0(N)X_0(N).

Primarily human-written textHuman understanding: all parts
Oct 20, 2026PDF ↗View work →
hexagon:2610.00412v1

math-ph — Mathematical Physics

Intrinsic Spectral Cosmology

Contributed by Rajesh Dachiraju

We propose an intrinsic spectral cosmology based on intrinsic geometric wave mechanics, spectral dynamics, localized resonances, HJ source flow, and Hamilton--Jacobi gravity for point masses. The intrinsic field is represented through its time-local spectrum P(k,t)P(\mathbf k,t), whose second moment defines M2M_2, an intrinsic scale RI=M2−1/2R_I=M_2^{-1/2}, and HI=R˙I/RI=−M˙2/(2M2)H_I=\dot R_I/R_I=-\dot M_2/(2M_2). A canonical spectral Hamiltonian gives a conditional continuity equation and current Jk=∂h/∂(∇kθ)\mathbf J_k=\partial h/\partial(\nabla_k\theta); the actual Hamiltonian needed to determine that current is not fixed by the intrinsic space-time weak equation. We exhibit a minimal scale-drift Hamiltonian as a clearly labeled closure ansatz, not as a derived result. Gravity acts only between finite point masses through their Hamilton--Jacobi dynamics. Redshift, distance, structure formation, and the relation of localized resonances to masses remain hypotheses or open derivations. The framework makes no claim of empirical validation.

A mix of human-written and AI-generated textHuman understanding: some parts
Oct 20, 2026PDF ↗View work →
hexagon:2610.00411v1

math-ph — Mathematical Physics

Beyond the Event Horizon: An Operator-First Theory of Persistent Geometry and Black Hole Dynamics

Contributed by Jeromie Beasley

A black hole carries one wall of each kind. Its horizon is a geometric fold: in the right coordinate it is smooth, and nothing breaks there. Its innermost stable circular orbit is a spectral wall, a Jordan block where steady circling turns into a plunge. This paper builds both kinds of wall exactly in a setting where every step can be proved and computed, and then compares them, structurally, with black holes. The setting is the shape space of four bodies. Its kinetic metric is the Bures metric of a real qutrit, and its one genuine wall, the coplanar configurations, is a fold at finite distance. Across it a tetrahedron meets its mirror image. The transport operator A(H) = TH + HT − 2Tr(TH)G is self-adjoint in the kinetic metric. Read in the Gram frame, its back-coupling vanishes like σ₃², and it forms a Jordan block whose square-root branch is exactly the orientation double cover. Lifted to the cover, it is analytic, and the wall point is a plain double point at the tip of a cone with slope 2|t₁−t₂|√(1−δ²). Both readings are exact. What a single eigenvector reports can fail at the wall; the eigenvalue pair and its trace-log ledger come through exact, and a loop through the mirror leaves a sign. New in edition 10 - Reflection and refraction on the projector metric. A wave meeting a step in the metric reflects through the metric along the step and the Clairaut constant C alone: Γ = (√(a₁−C) − √(a₂−C)) / (√(a₁−C) + √(a₂−C)). The transverse metric drops out at a sharp step. Total reflection begins exactly where a geodesic turns, so the optical threshold is a turning point. A change of spectral gap reflects with the peel coordinate tanh(½ ln Δ₂/Δ₁). - One Gram determinant does two jobs: it sets the wave admittance, and it caps the Berry curvature a path can feel (the angle safeguard of the intrinsic quantum geometric tensor). - Mirror and matched load. The polar stratum is a perfect mirror, |Γ| = 1. A Killing horizon, polar in the same sense, is a matched load, Γ = 0. - The photon ring, read by the same generator as the ISCO: each half orbit dims an image by e^−π = 0.0432, a value that belongs to the uncharged hole alone; charge lowers it. - The fermion record: its offset is a point on the same reflection chart, tanh(ħω/2k_BT_H). - The reflection tests were pre-registered before they ran, and each was pushed several ways: 400 random sharp steps, three smooth profiles, reciprocity, flux balance, the transverse metric in a thick layer, total reflection, and the gap form. Main results - The coplanar wall is a fold, and its distance is a Bures angle: arcsin√ε = arccos√F. - Quantum Fisher information on the shape space is eight times the shape kinetic energy wherever the rank is constant, and fidelity is blind to the mirror. - Two kinds of wall: spectral (a Jordan block in every frame) and geometric (a fold that a signed coordinate unfolds). The ISCO is spectral, at the point where gravity's effective power p = 2 + 6M/r reaches the inverse cube. The horizon is geometric. - Any distance potential is even across the wall, with stiffness 2∂V/∂w₃. A thin disk holds the shape at its own frequency ν. Gravity holds the square at ω = √(2(2√2−1)); its exact potential along the lifted square is given in closed form, and its stiffness turns over for a rhombus thinner than diagonal ratio k* = 0.144557. - Structural comparisons: Petrov types through Majorana stars (Kerr is type D), merging ringdown overtones, the horizon's surface resistance as a matched load (376.73 Ω), Bell violation by a Hawking pair, Ramanujan's mock theta functions, and the mirror rule for knots. The metric throughout is the intrinsic kinetic metric of the shape space, never a spacetime metric. Every statement about black holes is a structural comparison, and every claim carries its grade (derived, measured, cited, or structural) where it is made. Files - bh_paper_v10_1.pdf: the paper (56 pages). - bh_paper_v10_1.html: the web edition, with its cover; it runs no scripts. - bh_mixer_v10.html: the Event Horizon Mixer, edition 10. It runs offline in any browser and computes every curve live: the photon-ring orbits, the layered step, the reflection chart with the horizon and the fermion record, the sine guard, and the tip-and-tail matrices. Its Synchronize mode drives every eye from one wall dial, and its "Synchronize the universe" eye shows the connection energy draining as a ring of fields falls into step. - bh_v10_1_code_and_sources.zip: LaTeX source, figures, every check script with its saved output, the pre-registrations, the proof log and the ideas ledger, and a README. Each script states its kill condition before it runs (Python 3: numpy, scipy, sympy, mpmath, matplotlib). AI-assisted: the ideas and research direction are the author's; AI tools were used for literature search, computation, drafting and typesetting, and every number was checked by the scripts in the archive.

A mix of human-written and AI-generated textHuman understanding: some parts
Oct 20, 2026PDF ↗View work →
hexagon:2610.00410v1

math.LO — Logic

Relative PP-Ideals of Hypergraphs and Ultrafilter Spectra

Contributed by Zhenyu Sun

We study ideals of hypergraphs of finite uniformity under countable upper bounds modulo finite vertex covers. The canonical ideal generated by a free filter and finite weak colorings has this relative PP-property exactly when the filter is the intersection of finitely many PP-points. The classification is preserved by adjoining hypergraphs that are locally finite after a finite vertex deletion. The corresponding extension of a trace ideal induces capture ideals on increasing sequences. These are σ\sigma-ideals exactly for PP-filters, and their uniformities are max⁡{πχ(F),d}\max\{\pi\chi(\mathcal{F}),\mathfrak{d}\}. For an ultrafilter U\mathcal{U}, the arity-two capture ideal equals the Louveau ideal exactly when U\mathcal{U} is a PP-point. Successive capture ideals decrease with the arity, and equality characterizes QQ-points. Every strict inclusion is witnessed by a closed set. Thus a non-QQ PP-point yields a decreasing sequence of σ\sigma-ideals, distinguished by closed sets, with equal uniformities. We also establish invariance under locally finite witness enlargements and analyze Stone kernels and countable block products. Consistently, nested ray-positive PP-sets have the same singleton endpoint spectrum and different ray transversal numbers.

A mix of human-written and AI-generated textHuman understanding: all partsHypergraph idealLouveau idealP-pointQ-pointStone dualityreaping numberultrafilter
Oct 20, 2026PDF ↗View work →
hexagon:2610.00409v2

math.NT — Number Theory

A Frobenius determinant proof of the non-existence of Landau–Siegel zeros

Contributed by Roelof van Dijk

We give a variant of the OpenAI proof [1] of the non-existence of Landau–Siegel zeros, following the simplifications of Kerr [2], Green [3] and Barreto [4]. The Frobenius congruence proves both divisibility and nonvanishing of the determinant. Reduction modulo the largest inert prime below the cutoff reduces nonvanishing to a polynomial root count, replacing resultants and Wronskians. The argument was discovered in discussions with GPT-6 Astra and Opus 5.5 and the new arguments should be attributed to these models.

A mix of human-written and AI-generated textHuman understanding: no parts
Oct 20, 2026PDF ↗View work →
hexagon:2610.00408v1

math.NT — Number Theory

On the irrationality of the 33-adic zeta value ζ3(5)\zeta_3(5)

Contributed by Antti Hippeläinen

We give a proof that the 33-adic zeta value ζ3(5)\zeta_3(5) is irrational. The proof adapts to p=3p=3 a Hankel-determinant method that a recent preprint applies to ζ2(7)\zeta_2(7). A Volkenborn integral of an explicit rational function defines a linear functional with values in Q+Q ζ3(5)\mathbb{Q}+\mathbb{Q}\,\zeta_3(5), and its Hankel determinants are the values at ζ3(5)\zeta_3(5) of polynomials with rational coefficients. We bound the 33-adic valuation of these values and the size and the denominators of the coefficients. The new ingredients at p=3p=3 are a triangular basis of the polynomials that are integer valued on 3−1Z3×3^{-1}\mathbb{Z}_3^\times, a local estimate at primes of the order of nn in which a pole of order 33 coming from harmonic sums cancels exactly against a zero of order 33 of the rational function, and a non-vanishing theorem at an auxiliary prime, in which Wilson's theorem makes one block of a reduced Gram matrix invertible. Here nn is the parameter of the rational function. Two constants of the estimates are bounded by finite computations, and with these bounds the 33-adic valuation exceeds the size and the denominators together by more than 4.54.5 bits per n2n^2. An appendix gives a second proof, independent of the first, which adapts to ζ3(5)\zeta_3(5) and the modular curve X0(3)X_0(3) a determinant argument that a preprint of Yi gives for ζ7(3)\zeta_7(3), and which rests on published theorems on overconvergent modular forms.

Primarily AI-generated textHuman understanding: no partsHankel determinantsKubota-Leopoldt L-functionVolkenborn integralirrationalityoverconvergent modular formsp-adic zeta values
Oct 20, 2026PDF ↗View work →
hexagon:2610.00406v1

math.OC — Optimization and Control

Classical regularity and attainment in portfolio choice with nonhomothetic utility

Contributed by Yuanhong Wei, Zhenyu Sun

We study classical regularity and attainment in terminal-utility portfolio choice with unspanned factors, nonnegative wealth, and exposures that are square-integrable in expectation. A joint estimate for logarithmic marginal utility controls relative risk aversion and factor sensitivity. In several dimensions, a risk-price component uniformly separated from the factor-hedging span gives classical solvability and a unique strong optimal portfolio on every finite horizon. A scalar comparison equation treats correlated single-factor markets. For state-independent C4C^4 utility, the preference assumptions reduce to positive lower and upper bounds on relative risk aversion. In an orthogonal single-factor market, a uniform finite-order condition allows the risk price to vanish and change sign. Subelliptic gradient estimates and a parabolic equation in the factor variable yield a classical value; verification and strict concavity give strong existence for its continuous feedback. In both settings, the optimal dual coefficient has a deterministic bound uniform over initial states and multipliers. Attainment has a separate integrability boundary. For deterministic opportunities with a finite static optimum, the prescribed strategy class attains the value exactly when the optimal payoff lies in L2L^2 under the physical probability. An explicit nonhomothetic utility gives a horizon and wealth classification with smooth finite values and nonattainment. Further results identify wealth-dependent purchasing-power hedges and a strict increase in the dual value under factor-information restrictions.

Primarily human-written textHuman understanding: all partsNonhomothetic utilityclassical regularityconvex dualitydegenerate HJB equationssquare-integrable strategiesstochastic factors
Oct 20, 2026PDF ↗View work →
hexagon:2610.00405v1

math.MP — Mathematical Physics

Quaternionic Heisenberg-Robertson-Schrodinger and Maccone-Pati Uncertainty Principles

Contributed by K. MAHESH KRISHNA

Let Q\mathcal{Q} be a quaternionic Hilbert space. Let A:D(A)⊆Q→QA: \mathcal{D}(A)\subseteq \mathcal{Q}\to \mathcal{Q} and B:D(B)⊆Q→QB:\mathcal{D}(B)\subseteq \mathcal{Q}\to \mathcal{Q} be possibly unbounded self-adjoint linear operators. Then for all h∈D(AB)∩D(BA)h \in \mathcal{D}(AB)\cap \mathcal{D}(BA) with ∥h∥=1\|h\|=1, we show that \begin{align*} (1) \quad \quad \quad \Delta _h(A)\Delta _h(B)\geq \frac{\sqrt{|\langle \{A,B\}h, h \rangle -2\langle Ah, h \rangle\langle Bh, h \rangle|^2+|\langle [A,B]h, h \rangle |^2}}{2} \end{align*} and \begin{align*} (2) \quad \quad \quad \Delta _h(A)^2+ \Delta _h(B)^2 \geq \frac{|\langle (A+B)h, y \rangle|^2+|\langle (A-B)h, y \rangle|^2}{2}, \quad \forall y \in \mathcal{Q} \text{ satisfying } \|y\|\leq1 \text{ and } \langle h, y \rangle =0, \end{align*} where Δh(A)≔∥Ah−⟨Ah,h⟩h∥ \Delta _h(A)\coloneqq \|Ah-\langle Ah, h \rangle h \|. We call Inequality (1) as quaternionic Heisenberg-Robertson-Schrodinger uncertainty principle and Inequality (2) as quaternionic Maccone-Pati uncertainty principle.

Primarily human-written textHuman understanding: all partsQuaternionic Hilbert space.Uncertainty Principle
Oct 20, 2026PDF ↗View work →
hexagon:2610.00404v1

math.KT — K-Theory and Homology

Quillen's local parameter conjecture in dimension four

Contributed by Yunpeng Li

Let RR be a Noetherian regular local ring of mixed characteristic and dimension four, and let rr be a member of a regular system of parameters. We prove that every finitely generated projective module over R[1/r]R[1/r] is free. We also prove that Sp4(R[1/r])\mathrm{Sp}_4(R[1/r]) acts transitively on unimodular columns of length four and that every determinant orientation of a rank-two projective module is induced by a basis. The argument reduces freeness to two vanishing results: the degree-three Zariski cohomology of the naive degree-four Milnor--Witt sheaf and the alternating Witt group of R[1/r]R[1/r]. We establish these results using integral degree-two algebraic KK-theory, supported hermitian KK-theory, and local motivic cohomology. A finite-rank symplectic comparison relates the image of the completion obstruction to Milnor--Witt multiplication and yields the required symplectic frames.

Primarily AI-generated textHuman understanding: no parts
Oct 20, 2026PDF ↗View work →
hexagon:2610.00407v1

math.NT — Number Theory

Optimal bounds for the length and number of unit fraction representations

Contributed by Thomas Bloom, Wouter van Doorn

This paper gives a human-written exposition and simplification of proofs that were recently posted by OpenAI. We prove that every a/b∈(0,1)a/b\in (0, 1) can be written as the sum of O(log⁡log⁡b)O(\log\log b) many distinct unit fractions. We also prove that the number of representations of 11 as the sum of kk distinct unit fractions grows doubly exponentially in kk.

Primarily human-written textHuman understanding: all partsegyptian fractionsunit fractions
Oct 20, 2026PDF ↗View work →
hexagon:2610.00402v1

math.PR — Probability

Lower and Upper Bounds for Glauber Dynamics from Typical States of the Low-Temperature Sherrington–Kirkpatrick Model

Contributed by P. M. Aronow, Patrick Lopatto

We study the heat-bath (Glauber) dynamics of the Sherrington–Kirkpatrick model at zero external field and fixed inverse temperature β>1\beta>1. We sample the disorder JJ and an initial configuration X0X_0 from its Gibbs measure. Let TJ(X0)T^J(X_0) be the time at which the transition law, conditional on JJ and the realized X0X_0, first comes within total-variation distance 1/41/4 of equilibrium. In continuous time, with rate one per site, we prove that, for every fixed ω∈(0,1/4)\omega\in(0,1/4), with probability tending to one, \[ A_\beta n^{7/30}<\log T^J(X_0)\le n^{1-\omega}, \] where Aβ>0A_\beta>0 depends only on β\beta. Corresponding bounds hold for the discrete-time chain. These results strengthen OpenAI’s typical-start lower and upper bounds while following their proof architectures. The lower-bound argument introduces a three-replica comparison with a cubic pressure deficit and uses Aronow and Lopatto’s quantitative mean-bias estimate. The upper-bound argument combines a pathwise information–energy cancellation, concentration estimates on a growing mesh, and optimized exponents. We also complete Lean formalizations of two known results: OpenAI’s fluctuation-scale theorem, giving variance n1/3+o(1)n^{1/3+o(1)} for the log partition function, and its mean-bias consequence of order at least n−5/6−εn^{-5/6-\varepsilon} for every fixed ε>0\varepsilon>0. The formal development proves the positive-Laplace-window input needed for the fluctuation theorem. Five specified result groups are formalized, including the continuous-time dynamics upper bound.

Primarily AI-generated textHuman understanding: some parts
Oct 20, 2026PDF ↗View work →
hexagon:2610.00401v1

math.NT — Number Theory

Irrationality measures for G±5π2/48G\pm5\pi^2/48 and L(2,χ−3)L(2,\chi_{-3})

Contributed by Sean Litsey

Building on OpenAI's determinant method for the irrationality of Catalan's constant G=∑j≥0(−1)j/(2j+1)2G=\sum_{j\ge0}(-1)^j/(2j+1)^2, we prove \[ \begin{gathered} \mu\Bigl(G-\frac{5\pi^2}{48}\Bigr)\le 38.35,\qquad \mu\Bigl(G+\frac{5\pi^2}{48}\Bigr)\le 38.35,\\ \mu\bigl(L(2,\chi_{-3})\bigr)\le 23.82 , \end{gathered} \] where μ\mu is the irrationality exponent. We know of no earlier irrationality measure for G±5π2/48G\pm5\pi^2/48. For L(2,χ−3)L(2,\chi_{-3}), which Calegari, Dimitrov and Tang proved irrational, the previous best bound we know of is their effective bound μ≤24781\mu\le24781. The approximations come from determinants of \emph{rectangular} L\"owner matrices of digamma differences at integer nodes. We bound their denominators with pp-adic assignment problems and rank deficits modulo pp. We prove nonvanishing modulo a prime by reducing it to bordered Krylov determinants, which we evaluate through Jacobi matrices and Darboux transformations. We bound their size with Andr\'eief's identity and a certified lower bound for a discrete logarithmic energy. Every result is formalized in Lean~4, with no unproved steps and only the standard axioms.

Primarily AI-generated textHuman understanding: no parts$L(2Andr\'eief identityCatalan's constantCauchy determinantsDarboux transformationL\"owner matricesLean\chi_{-3})$formal verificationirrationality exponent
Oct 20, 2026PDF ↗View work →
hexagon:2610.00399v1

math.CV — Complex Variables

A covering-strip and moment certificate for Korenblum's constant

Contributed by Ricardo Pinho

We give an explicit certificate for c_2>=54/125=0.432, where c_2 is Korenblum's constant for the Bergman space. This is an unrefereed preprint. The construction combines an elementary two-zero Schwarz estimate on the covering strip of an annulus, the classical hyperbolic Jung inequality, and Wikström's moment-duality criterion. A rational twelve-atom measure with a Lebesgue tail satisfies the required inequalities for every moment index. Two independently implemented exact checkers, one using Arb and one using only integer interval arithmetic, verify the quantitative hypotheses. The best public certified lower bound located in the accompanying priority audit is Wikström's 0.4263. Neither optimality nor a new version of Jung's theorem is claimed.

Primarily AI-generated textHuman understanding: some partsBergman spaceKorenblum's constantcomputer-assisted proofhyperbolic Jung inequalityinterval arithmeticmoment duality
Oct 20, 2026PDF ↗View work →
hexagon:2610.00398v1

math.NT — Number Theory

Products of pp-adic logarithms of algebraic numbers that are not linear forms in logarithms, and a machine-checked pp-adic linear-subgroup theorem

Contributed by Shawn Krisman

Let pp be a prime, Cp\mathbb{C}_p the completion of an algebraic closure of Qp\mathbb{Q}_p, Q‾\overline{\mathbb{Q}} the algebraic numbers in Cp\mathbb{C}_p, LL the Q\mathbb{Q}-vector space of pp-adic logarithms of algebraic numbers, and L=Q‾+Q‾L\mathcal{L}=\overline{\mathbb{Q}}+\overline{\mathbb{Q}}L the space of pp-adic linear forms in logarithms of algebraic numbers with algebraic coefficients. We prove, in Lean 4 with Mathlib and from the three standard axioms only, that log⁡p2⋅log⁡p(3+2)∉L\log_p 2\cdot\log_p(3+\sqrt2)\notin\mathcal{L} for every prime p≡±3(mod8)p\equiv\pm3 \pmod 8, together with a family of similar statements for real quadratic fields, and the general principle behind them: if σ\sigma is a continuous automorphism of Cp\mathbb{C}_p fixing a nonzero t∈Lt\in L and moving u∈Lu\in L to a conjugate σu≠±u\sigma u\neq\pm u of finite orbit, then tu∉Ltu\notin\mathcal{L}. This is G. Diaz's use of complex conjugation with an element of Gal(Q‾p/Qp)\mathrm{Gal}(\overline{\mathbb{Q}}_p/\mathbb{Q}_p) in its place; the complex analogue log⁡2⋅log⁡(3+2)∉L\log 2\cdot\log(3+\sqrt2)\notin\mathcal{L} is open. The deep input is Roy's form of Waldschmidt's linear-subgroup theorem for Gad0×Gmd1\mathbb{G}_a^{d_0}\times\mathbb{G}_m^{d_1} over Cp\mathbb{C}_p, with a derivative subspace, which we also prove in Lean, from Philippon's multiplicity estimate; the strong six exponentials theorem and the inhomogeneous Baker--Brumer theorem in two logarithms over Cp\mathbb{C}_p follow. The pp-adic linear-subgroup theorem has been used since Laurent and Roy, but we were unable to locate a proof written for Cp\mathbb{C}_p of the version with derivatives. The Lean development is the proof of record; the paper explains the statements, the route, and how to check the certificate. The code is available at https://github.com/telaviv/p-adic-log-products.

Primarily AI-generated textHuman understanding: no partsLean 4Mathlibformal verificationinterpolation determinantslinear forms in logarithmslinear-subgroup theoremmultiplicity estimatesp-adic logarithmp-adic transcendencestrong six exponentials theorem
Oct 20, 2026PDF ↗View work →
hexagon:2610.00394v1

cs.DM — Discrete Mathematics

An explicit counterexample to the six-neighbor square tiling conjecture

Contributed by Chunlei Liu, Aijin Lin

Luo, Sun and Wu conjectured that in a locally finite square tiling of the complex plane in which each square intersects exactly six others, all squares have the same size. We construct a counterexample by surrounding a ten-square core with alternating rectangular shells, each formed by six squares. The only point-only contacts occur at the three four-square points in the core; all subsequent contacts have positive length. A two-state induction shows that every new square has four contacts when inserted and acquires two more at the next shell. The nested rectangles exhaust the plane, so the construction is locally finite and gives a counterexample on the whole plane.

Primarily human-written textHuman understanding: all partsSquare Tiling Conjecture
Oct 20, 2026PDF ↗View work →
hexagon:2610.00393v2

math.AG — Algebraic Geometry

Algebraicity of the G2\mathrm{G}_2-invariant tensors on Yun's exceptional motives

Contributed by Benjamin Severn

Zhiwei Yun constructed, from a rigid Hecke eigensheaf for G2\mathrm{G}_2 on P1\mathbb{P}^1 minus three points, a family of rank-seven motives whose motivic Galois groups are dense in G2\mathrm{G}_2. We show that on this family the invariant cubic form is the class of an algebraic cycle: at every Hodge-generic parameter, every rational Hodge class on every tensor construction of the rank-seven piece is algebraic, and at every parameter the transported G2\mathrm{G}_2-invariant tensors are algebraic. The cycles are top components of Satake convolution fibres transported by Hecke correspondences. The projector that cuts out the rank-seven piece is made algebraic by a canonical weighted resolution of Yun's boundary divisor, built on the moduli stack of bundles from the stabiliser tori of its points, together with a characteristic-zero census of those points and a cycle-class comparison on varieties with quotient singularities. Yun announced that the cubic is motivated in Andr\'e's sense; the step from motivated to algebraic is new. This version, with its computational certificates and review bundle, is archived on Zenodo: https://doi.org/10.5281/zenodo.23478625

Primarily AI-generated textHuman understanding: some partsHecke eigensheavesHodge conjectureexceptional motivesgeometric Satakemotivated cyclesweighted blow-ups
Oct 20, 2026PDF ↗View work →
hexagon:2610.00391v1

math.CO — Combinatorics

An intrinsic interval-deletion characterization of digraph support families

Contributed by Michael Mislan

For a finite directed graph with loops allowed, its supported subsets are those in which every vertex has an in-neighbour within the subset. We characterize exactly which set families arise this way on their original ground set. Starting from the power set, a legal step chooses an inclusion-maximal remaining nonmember, selects a previously unused root absent from every target-family member below it, and deletes the rooted interval. A family is a digraph support family if and only if some legal deletion sequence reaches it. The maximal residual set may follow any fixed valid policy; only roots require branching. Successful traces have at most one step per vertex and reconstruct a realizing digraph. Consequences include exact root sets and trace length, a finite recognizer, conventional NP membership for explicit lists, projection, deletion and product closure, and RAF realizability criteria using the published antimatroid characterization. The characterization and selected consequences and trace-checking interfaces are verified in Lean 4; conventional statements and computational examples are identified separately.

Primarily AI-generated textHuman understanding: some partsLean formalizationRAF realizabilitydigraph support familiesinterior operatorsrooted-interval deletionsingle-head Horn theories
Oct 20, 2026PDF ↗View work →
hexagon:2610.00387v1

math.AG — Algebraic Geometry

Weil classes on every abelian sixfold of Weil type for Q(−3)\mathbb{Q}(\sqrt{-3})

Contributed by Benjamin Severn

We prove that the Weil classes of every polarized complex abelian sixfold of Weil type for K=Q(−3)K=\mathbb{Q}(\sqrt{-3}), of every Hermitian discriminant, are algebraic. The same holds for every abelian eightfold of Weil type for KK of signature (4,4)(4,4) with split discriminant, and every power of such a sixfold whose special Mumford--Tate group is SUHSU_H satisfies the Hodge conjecture. The proof applies the transfer theorem of the companion preprint to the Shephard--Todd group G34G_{34} with twenty reflections as local monodromies, and passes from eightfolds to sixfolds by a compensation argument. Two general tools are proved on the way. If every local monodromy of a transfer datum is conjugate to its inverse, the lattice condition of the transfer theorem follows from Brauer's induction theorem. Dominance of the period map follows from exact data at a maximal degeneration, by the nilpotent orbit theorem. We also give an explicit higher-dimensional form of Schoen's compensation argument, which shows that one decided cell of 2n2n-folds, n≥4n\ge4, decides every cell of sixfolds over the same imaginary quadratic field. No outside unrefereed manuscript is used. This version, with its computational certificates, is archived on Zenodo: https://doi.org/10.5281/zenodo.23422649

Primarily AI-generated textHuman understanding: some partsBrauer inductionHodge conjectureWeil classesabelian varieties of Weil typecomplex reflection groupsnilpotent orbits
Oct 20, 2026PDF ↗View work →
hexagon:2610.00386v1

math.AG — Algebraic Geometry

A transfer theorem for Weil classes on Prym--Tyurin factors of Galois covers

Contributed by Benjamin Severn

Let KK be an imaginary quadratic field, GG a finite group, σ\sigma an irreducible representation of GG with character field KK, and SS a connected component of a Hurwitz space of GG-covers of P1\mathbb{P}^1 with fixed local monodromy. When the σ\sigma-isotypic factors of the Jacobians are abelian 2n2n-folds of Weil type for KK, we prove that the Weil classes of every polarized abelian 2n2n-fold of Weil type for KK with Hermitian discriminant d\mathfrak{d} are algebraic, provided three conditions hold: a lattice condition (L) on the characters of a group of multiplicative type attached to the cover, dominance (D) of the period map of SS, and the equality of the Hermitian discriminant of the family over SS with d\mathfrak{d}. None of the conditions refers to a particular group. The Hodge conjecture for every power of a member AA follows when the special Mumford--Tate group of AA itself is SUHSU_H; a statement about the generic member of the family does not suffice, and members with smaller Hodge group are not treated here. Positive instances of the conditions are verified by finite input certificates, so a new example needs new certificates, whose validation may need its own arguments, and no new transfer proof. The theorem recovers the case G=G32G=G_{32}, K=Q(−3)K=\mathbb{Q}(\sqrt{-3}), d=−2\mathfrak{d}=-2 of the author's earlier preprint (hexagon:2610.00246), with every step of that proof an instance of a general lemma. A second source of cycles, balanced combinations of several characters of one subgroup, is available conditionally on a theorem of an unrefereed manuscript on abelian covers. With it the datum (Q(i),[−3])(\mathbb{Q}(i),[-3]) carried by W(E8)⋅μ4W(E_8)\cdot\mu_4 satisfies every hypothesis, so, conditionally on that theorem, the Weil classes of every abelian sixfold of Weil type for Q(i)\mathbb{Q}(i) with discriminant −3-3 are algebraic. For this datum the Schoen-only condition (L) fails. A companion preprint applies the transfer theorem, with new tools, to prove that the Weil classes of every abelian sixfold of Weil type for Q(−3)\mathbb{Q}(\sqrt{-3}), of every Hermitian discriminant, are algebraic. We also state what the theorem cannot reach. This version, with its computational certificates, is archived on Zenodo: https://doi.org/10.5281/zenodo.23422651

Primarily AI-generated textHuman understanding: some partsGalois coversHodge conjecturePrym-Tyurin varietiesShimura varietiesWeil classes
Oct 20, 2026PDF ↗View work →
hexagon:2610.00385v1

math.NT — Number Theory

Convolution Smoothing in the Turán Hierarchy: The Blind Zone Extends from Order 43 to Order 61, and Empirically to Order 68

Contributed by Changxia Lin

Let Xi(t)=xi(1/2+it) be the Riemann xi-function on the critical line, Xi(t)=sum_{k>=0}(-1)^k c_k t^{2k} its even Taylor expansion, and D(n,r)=det[c_{n+i-j}]_{i,j=0}^{r-1} the associated Toeplitz minors. Writing G(z)=sum_{k>=0}c_k z^k and beta_j=-1/z_j for the zeros of G, the dual Jacobi-Trudi identity gives D(n,r)=c_0^r s_{(r^n)}(beta), the Schur function of the rectangular partition (r^n) in the alphabet beta. Positivity of D(n,r) for all n>=0 and all r>=1 is equivalent to the Riemann hypothesis (RH) by the Schoenberg-Edrei characterisation of Polya frequency sequences; for each fixed r, the inequalities D(n,r)>=0 are a necessary condition, and for r=2 they hold unconditionally. A previous paper of the author proved that every level r<=43 is blind: the minors D(n,r) stay positive even in the presence of non-real zeros. The mechanism there was the two-variable Chebyshev criterion U_k(cos theta)>0 iff (k+1)theta<pi, together with the uniform bound theta<=theta_max=2 arctan(1/(2 gamma_1)) =0.07071826... The present paper shows that the bound 43 is not the truth but an artefact of ignoring two structural features of the true alphabet. First, the evenness Xi(-t)=Xi(t) forces every zero of G to occur with multiplicity two in beta, so the relevant constituent is not U_r but the self-convolution W_r = sum_{i=0}^{r} U_i(cos theta) U_{r-i}(cos theta), with generating function sum_{r>=0} W_r z^r = 1/(1-2z cos theta + z^2)^2. We prove the identity W_r = (1/2) U'_{r+1}(cos theta) and the pole-free sign criterion of Lemma (sign), and we show that W_r>0 for all r<=61 while W_62<0: the convolution of the Chebyshev sequence against itself smooths away the sign change that occurs at U_44, pushing the threshold from 43 to 61. Secondly, the zeros on the critical line contribute a positive real sub-alphabet whose complete symmetric functions h_i(X)>0 convolve with the violating part, h_r(X union Y)=sum_{i+j=r} h_i(X) h_j(Y), pushing the threshold further. Main theorem (proved). For every r<=61 and every n=1, and regardless of whether RH is true, D(1,r)>0. Consequently the first 61 levels of the Turan hierarchy are blind on the shift-1 row. High-precision computation of the full rectangular Schur functions s_{(r^n)}(beta) on the true alphabet (truncated at N critical-line zeros) shows that the first discriminating order is r*=69 at shift n=1 and n=3, so that all orders r<=68 are blind; the value is stable under truncation (N=45,60,80 all give 69). A scaling law r* ~ 1.5 pi/theta is observed across two and a half decades of the violating offset. At shift n=2 no negative minor was found for any r<=400, suggesting a qualitatively stronger phenomenon. The number 61 is proved; the number 68 is numerical, and the Status section separates the two without ambiguity. No claim of a proof of RH is made.

Primarily human-written textHuman understanding: all partsRiemann zeta function / xi-function / Turan inequalities /
Oct 20, 2026PDF ↗View work →
hexagon:2610.00384v1

math.AC — Commutative Algebra

A counterexample to the Eisenbud–Mazur conjecture

Contributed by Chung Pang Mok, Yiqi Xu

We construct a height-five prime ideal PP in the six-variable formal power series ring RR over Q\mathbb{Q} such that P(2)⊈mPP^{(2)}\not\subseteq\mathfrak{m}P, thus providing a prime-ideal counterexample to the Eisenbud--Mazur conjecture (with Q\mathbb{Q} being the coefficient field). The ideal is the kernel of an explicit quadratic parametrization over a number field of degree 2828 over Q\mathbb{Q}. A witness has order three, with leading term the determinant of a symmetric 3×33\times3 matrix. We construct the witness by eliminating critical values to all orders and then straightening the resulting formal curve. Interpolation at the 2828 nodes of an arrangement of eight lines supplies the required lifting maps. A rational linear functional on third and fourth jets certifies nonmembership in mP\mathfrak{m}P. The construction also yields an unmixed radical ideal with 2828 smooth branches over C\mathbb{C}, and provides a counterexample to the more general form of the Eisenbud--Mazur conjecture stated by More (with C\mathbb{C} being the coefficient field). Finally, the prime ideal counterexample descends to the localized polynomial ring Q[x0,…,x5](x0,…,x5)\mathbb{Q}[x_0,\ldots,x_5]_{(x_0,\ldots,x_5)}, where a polynomial witness with the same fourth jet exists. All finite identities used in the proof admit exact verification.

A mix of human-written and AI-generated textHuman understanding: all partsEisenbud–Mazur conjectureSymbolic powersVeronese surfacecritical valuesformal curves
Oct 20, 2026PDF ↗View work →
hexagon:2610.00383v1

math.AG — Algebraic Geometry

Non-flat toroidal compactifications of the universal abelian variety in genus five and above

Contributed by David Holmes

We prove that two mixed Delaunay--Voronoi models of the universal abelian variety are not flat in genus five: the classical model over the second-Voronoi compactification and the model over the finite cover that records a symmetric theta divisor. Both counterexamples arise from the same monoid-theoretic obstruction: two inequivalent minimal elements in one fibre-degree slice acquire a common positive translate. The ordinary Delaunay cells and cones are certified by exact all-lattice-point computations; after this geometric input, the obstruction is verified by the integer calculations displayed below. Combining the genus-five example in the fixed-theta model with a theorem of Nakamura--Sugawara gives the sharp threshold: the morphism is flat exactly in genera at most four.

Primarily AI-generated textHuman understanding: some partsabelian varietiestoroidal compactifications
Oct 20, 2026PDF ↗View work →
hexagon:2610.00382v1

cs.AI — Artificial Intelligence

BLLM: Beyond the LLM with Deep Human-Mind-AI

Contributed by Deep Bhattacharjee, Ushashi Bhattacharya

A system that improves itself keeps every change that passes a check, so a check that makes errors lets mistakes pile up. We compute the least checking that keeps such a system sound. It is an entropy of the costs of the changes, and an endless chain of improvements stays sound at finite cost exactly when that entropy is finite. A stack of checked layers costs more than its layers would cost alone. We also compute how many guesses a proposer needs before a right one appears: human authors come close to this least number, and language models need 1.5 to 4.3 times as many. Anaxia, an engine built on these laws, rebuilt the published 2016 counterexample to Steinberg's conjecture from the rules of a colouring problem alone. The engine is a work in progress, and its rules and search are being revised and extended for the open problems it has not yet settled.

A mix of human-written and AI-generated textHuman understanding: some partsautomated discoveryentropyrecursive self-improvementverification
Oct 20, 2026PDF ↗View work →
hexagon:2610.00381v1

math.DG — Differential Geometry

A proof of the second pinching theorem in dimension four

Contributed by JINXI ZHANG

Let M⁴ be a closed connected manifold minimally immersed in the unit sphere S⁵(1), and let h be its second fundamental form. We prove that constant S = |h|² > 4 implies S > 8. No constancy of tr(h³) is assumed. The proof combines integral curvature identities with a joint estimate for two contractions of the symmetrized Hessian. The remaining algebraic inequality is verified in Mathematica using exact rational arithmetic. The code and data are included in the supplementary material.

A mix of human-written and AI-generated textHuman understanding: all partsChern conjectureMinimal hypersurfaceconstant scalar curvaturesecond pinching problem
Oct 20, 2026PDF ↗View work →
hexagon:2610.00380v1

math.NT — Number Theory

Note on variable role-reversals

Contributed by Runbo Li

In [1], the author uses variable role-reversals only when θ<4589−ε\theta < \frac{45}{89} - \varepsilon. In this note, we shall discuss how to use variable role-reversals when 4589−ε⩽θ<1120−ε\frac{45}{89} - \varepsilon \leqslant \theta < \frac{11}{20} - \varepsilon.

Primarily human-written textHuman understanding: all partsHarman's sieveVariable role-reversalsarithmetic progressionssieve methods
Oct 20, 2026PDF ↗View work →