HEXAGONbeta

Browse

All works

Browse the Hexagon catalog.

Newest works

475 works
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.00420v4

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: ∑k∈Nλ⊢kHnλλ! ak>∑d∣nd\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 Snm=∑k=1n∑λ∈℘kk+m−1Hnλ\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γ=1+∑a≥21a!∑m≥0(−1)mζA(a+m)+∑a,b≥21a! b!∑m,n≥0(−1)m+nζA(a+m,b+n)+⋯e^\gamma = 1 + \sum_{a\ge2}\frac{1}{a!}\sum_{m\ge0}(-1)^m\zeta^{\mathrm{A}}(a+m)+\sum_{a,b\ge2}\frac{1}{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.00418v2

math.DS — Dynamical Systems

Dimension of the equilibrium measure on Pn(C)\mathbb{P}^n(\mathbb{C})

Contributed by Snir Ben Ovadia, Aaron Brown

Consider the dynamics of endomorphisms f:Pn(C)→Pn(C)f: \mathbb{P}^n(\mathbb{C})\to \mathbb{P}^n(\mathbb{C}) of degree d≥2d\geq 2. This note presents an explicit and elementary counterexample to the dimension formula for the equilibrium measure μ\mu conjectured by Binder--DeMarco, coming from the same family of quadratic skew products that appeared recently by Bianchi--He. In addition, the note shows that the one-sided inequality dimHμ≥(log⁡d)∑i=1nλi−1\mathrm{dim}_{\mathrm{H}}\mu\geq (\log d)\sum_{i=1}^n \lambda_i^{-1} holds for the equilibrium measure of every degree-dd holomorphic endomorphism of Pn\mathbb P^n. The proof adapts Dupont's volume-growth method to the unstable flag: combined with Gromov's orbit-graph argument, it bounds the cumulative partial entropies. Qian--Xie's extension of Ledrappier--Young theory then yields the inequality.

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.00413v2

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)\mathrm{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(X0(kN),e)\mathrm{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.00398v2

math.NT — Number Theory

log⁡p2⋅log⁡p(3+2)\log_p 2 \cdot \log_p(3+\sqrt2) is not a pp-adic linear form in logarithms

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.00393v3

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.00387v2

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 →
hexagon:2610.00379v1

math.MP — Mathematical Physics

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

Contributed by K. MAHESH KRISHNA

Let O\mathcal{O} be an octonionic Hilbert space. Let A:D(A)⊆O→OA: \mathcal{D}(A)\subseteq \mathcal{O}\to \mathcal{O} and B:D(B)⊆O→OB:\mathcal{D}(B)\subseteq \mathcal{O}\to \mathcal{O} 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{O} \text{ satisfying } \|y\|\leq1 \text{ and } \langle h, y \rangle =0, \end{align*} where Δh(A):=∥Ah−⟨Ah,h⟩h∥ \Delta _h(A):= \|Ah-\langle Ah, h \rangle h \|. We call Inequality (1) as octonionic Heisenberg-Robertson-Schrodinger uncertainty principle and Inequality (2) as octonionic Maccone-Pati uncertainty principle.

Primarily human-written textHuman understanding: all partsOctonionic Hilbert space.Uncertainty Principle
Oct 20, 2026PDF ↗View work →
hexagon:2610.00378v2

math.DG — Differential Geometry

Smooth Local Isometric Embeddings of Riemannian Manifolds in Optimal Dimension

Contributed by Wenchang Yang, Yi Wang

We prove that every smooth Riemannian manifold of dimension n≥5n\geq5 admits, near each point, a smooth isometric embedding into Rn(n+1)/2\mathbb{R}^{n(n+1)/2}. This extends the local theorem of Janet and Cartan from real-analytic to arbitrary smooth metrics in these dimensions, and attains the optimal universal ambient dimension without any curvature or genericity assumption. The proof starts from a flat immersion whose second fundamental form has full normal rank. The linearized metric equation then reduces to a determined first-order system, whose characteristic variety is singular. We do not invert this system on its singular set. Instead, the metric is corrected by the quadratic interaction of characteristic waves: their phase-averaged quadratic terms generate the directions missing from the image of the reduced symbol, while the remaining oscillatory products and the residual linear errors are removed by parametrices on regular characteristic and elliptic patches. Exact Fourier localization of the increments yields an iteration that converges in C∞C^\infty on a fixed neighborhood.

A mix of human-written and AI-generated textHuman understanding: some partsIsometric embeddingsJanet–Cartan theoremcharacteristic wavesoptimal embedding dimensionsmooth Riemannian metrics
Oct 20, 2026PDF ↗View work →
hexagon:2610.00375v1

math.NT — Number Theory

Ramanujan's prime counting inequality holds for all x ≥ 38,358,837,683: ranges from the zeros, a spectral barrier, and trade-offs

Contributed by Sayed Barez

Ramanujan proved that π(x)2<exlog⁡xπ(x/e)\pi(x)^2 < \frac{ex}{\log x}\pi(x/e) for all sufficiently large xx. Let NRN_R be the least integer such that this holds for every real x≥NRx \ge N_R. Dudek and Platt showed that the Riemann hypothesis implies NR=38,358,837,683N_R = 38{,}358{,}837{,}683. We prove that NR=38,358,837,683N_R = 38{,}358{,}837{,}683. To our knowledge, this is the first determination of NRN_R without assuming the Riemann hypothesis. The proof uses the zero-free half-plane Res>7/8\mathrm{Re}s > 7/8 of a recent OpenAI preprint. Its main statement for ζ\zeta is formalized in Lean 4 and has been rebuilt independently; its written proof has not been peer reviewed. The deduction is our Theorem B: if ζ(s)≠0\zeta(s) \ne 0 for Res>0.945092\mathrm{Re}s > 0.945092, then NR=38,358,837,683N_R = 38{,}358{,}837{,}683. The proof of Theorem B uses only refereed inputs, together with Bhattacharjee's correction of a theorem of Büthe. Relying only on the peer-reviewed literature, and on preprints where stated, we also prove the following by rigorous computer-assisted interval arithmetic. (A) The inequality holds for 38,358,837,683≤x≤e753.9838{,}358{,}837{,}683 \le x \le e^{753.98}. The previous range ended at e103e^{103}. (C) It holds for x≥e3035.01x \ge e^{3035.01}. This replaces Axler's threshold e3158.442e^{3158.442}, whose proof applies a lemma of Dudek and Platt in a case where that lemma's proof is defective. (B′, D) Either of the following also suffices: a zero-free region β≤1−1/(1.7373log⁡∣γ∣)\beta \le 1 - 1/(1.7373\log|\gamma|) above height 3⋅10123\cdot10^{12}, or RH verified to height 4.1602⋅10144.1602\cdot10^{14}. We tabulate the trade-off between the two. (E) Arguments that use only non-negativity, analytic continuation and the poles up to height TT cannot go beyond e754.40e^{754.40} when T=3⋅1012T = 3\cdot10^{12}. So (A) is optimal among such arguments to within 0.41 in log⁡x\log x. Building on Bhattacharjee's discovery that the constant E2E_2 in Büthe's Theorem 1 lacks a factor log⁡(3c)\log(3c), we show that the affected rows of the Broadbent–Kadiri–Lumley–Ng–Wilk table inherit the error, by 1.3–2.2% after re-optimization. We also trace the consequences in the literature.

Primarily AI-generated textHuman understanding: all partsChebyshev functionRamanujan's inequalitycomputer-assisted proofexplicit estimatesinterval arithmeticprime-counting functionzero-density estimateszero-free half-planezero-free region
Oct 20, 2026PDF ↗View work →
hexagon:2610.00374v1

math.CO — Combinatorics

Antimatroid characterization of RAF interior operators

Contributed by Michael Mislan

Addressing the RAF-realizability question in Section 4 of Mike Steel's Interior Operators and Their Relationship to Autocatalytic Networks (arXiv:2305.16714v4, 2023), we characterize which interior operators on the subsets of a finite set E are maxRAF operators of catalytic reaction systems whose reaction set is exactly E. An interior operator is represented by its family of fixed sets, a union-closed family containing the empty set. A same-ground realization is a system with one reaction per element of E, finitely many molecule types, a food set and a catalysis relation; it realizes the empty set together with its RAFs, the nonempty reaction sets whose reactants arise from food by iterated closure under the selected reactions and whose reactions are each catalysed by a molecule of that closure. Such a family has a same-ground realization if and only if it is the intersection of an accessible union-closed family A and a predecessor-support family. Here A contains the empty set, is closed under unions, and every nonempty member of A has an element whose removal leaves a member of A; the members of A need not cover E. A set S is supported by a predecessor map P on E when every element e of S has some element of S in P(e), loops allowed. The family consisting of the empty set and all subsets of size at least three has a same-ground realization if and only if E has at most four elements. This gives the sharp threshold for the family considered in Proposition 5 and its subsequent remarks in Steel (2023). Both results are formalized in Lean 4 with Mathlib.

Primarily AI-generated textHuman understanding: some partsLean formalizationRAF setsantimatroidsfood generationinterior operatorsrealizability
Oct 20, 2026PDF ↗View work →
hexagon:2610.00373v1

math.CO — Combinatorics

Equivalence of the RAF abundance conjecture and Frankl's union-closed sets conjecture

Contributed by Michael Mislan

In a catalytic reaction system with finitely many reactions, a RAF is a nonempty set of reactions whose reactants are produced from the food set by iterated closure under the selected reactions and whose reactions are each catalysed by a molecule of that closure. Steel (arXiv:2305.16714v4, Section 4) asked whether some reaction always lies in at least half of the RAFs. Call a reaction food-ready if all its reactants are food, and abundant if it lies in at least half of the sets in the family formed by the RAFs and the empty set. If some RAF U consists entirely of food-ready reactions, then some reaction of U is abundant, with no condition on the other reactions. If every reaction of the system, except at most two, is food-ready and the system has a RAF, then some reaction is abundant. Finally, the statement that every catalytic reaction system with finitely many reactions and a RAF has an abundant reaction is equivalent to Frankl's union-closed sets conjecture in the form: every finite union-closed family containing the empty set and a nonempty set has an element lying in at least half of its members.

Primarily AI-generated textHuman understanding: some partsLean formalizationRAF setsabundant reactionselementary coresunion-closed sets conjecture
Oct 20, 2026PDF ↗View work →
hexagon:2610.00372v2

math.NT — Number Theory

χ₂(1/3) and χ₂(1/5) are irrational

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. We prove that χ2(1/3)\chi_2(1/3) and χ2(1/5)\chi_2(1/5) are irrational. Equivalently, Li2(1/q)−Li2(−1/q)∉Q\mathrm{Li}_2(1/q)-\mathrm{Li}_2(-1/q)\notin\mathbb{Q} for q=3,5q=3,5. The proof uses the Hankel determinants Δh(χ2(1/q))\Delta_h(\chi_2(1/q)) of the moment functional g↦∑t≥1q−2t(g(u) u/Dh(u))′∣u=tg\mapsto\sum_{t\ge1}q^{-2t}(g(u)\,u/D_h(u))'|_{u=t}, where Dh(u)=∏k<h(u+k+1/2)D_h(u)=\prod_{k<h}(u+k+1/2). These determinants are values of polynomials Δh(X)∈Q[X]\Delta_h(X)\in\mathbb{Q}[X] of degree at most hh. We bound the denominators of Δh(X)\Delta_h(X) prime by prime: a bound adapted to residue classes for the large primes, a Lagrange-basis bound for the small ones, and separate arguments for the primes 22, 33 and qq. We bound the size of Δh(χ2(1/q))\Delta_h(\chi_2(1/q)) by a discrete log-gas argument against an explicit dual certificate, and prove that Δh(a/b)≠0\Delta_h(a/b)\neq0 for every rational a/ba/b and infinitely many hh, through a reduction modulo an auxiliary prime ℓ=h/3\ell=h/3. The margins are below −0.054-0.054 (q=3q=3) and −0.256-0.256 (q=5q=5) per h2h^2. The whole proof, including the prime number theorem and both numerical certificates, has been formalised in Lean 4 with Mathlib and checked by the Lean kernel, using only Lean's three standard axioms.

Primarily AI-generated textHuman understanding: no partsHankel determinantsLeanLegendre chi functionPadé approximationdilogarithmformal verificationirrationalitylogarithmic potential theory
Oct 20, 2026PDF ↗View work →
hexagon:2610.00371v1

math.AG — Algebraic Geometry

Algebraicity of Weil classes on non-split abelian sixfolds of Weil type over Q(−3)\mathbb{Q}(\sqrt{-3}) with Hermitian determinant −2-2

Contributed by Antti Hippeläinen

Let K=Q(−3)K=\mathbb{Q}(\sqrt{-3}). We give a proof that every Weil class is algebraic on every complex abelian sixfold of Weil type for KK whose Hermitian form has signature (3,3)(3,3) and determinant −2-2 modulo norms. These forms are not split, so neither Schoen's theorem on sixfolds nor the theorem on sixfolds claimed in a preprint of Markman, both of which concern split forms, applies. We model the sixfolds by the part of the Jacobian of a cover C→P1C\to\mathbb{P}^1, branched at thirteen points, on which its group, the complex reflection group G32G_{32}, acts through its reflection representation. A degeneration argument with a ball-arithmetic certificate shows that this family dominates the nine-dimensional Shimura variety. On every member, an integral relation among characters induced from linear characters of subgroups, realized by correspondences with coefficients in the group algebra, reduces the Weil classes to the determinants of eigenspaces of eleven cyclic subcovers. A theorem of Schoen makes these determinants algebraic for the three étale subcovers; for the eight ramified ones we prove it for all cyclic covers of curves of degree at least 33 with at least 33 branch points and fully paired branching data, through a cone over a Fermat variety and Shioda's results. Specialization and isogenies then reach every sixfold. The determinant of the Hermitian form and the relation among characters are exact computations.

Primarily AI-generated textHuman understanding: no partsFermat varietiesHodge conjectureHurwitz spacesWeil classesabelian varieties of Weil typecomplex reflection groupsperiod maps
Oct 20, 2026PDF ↗View work →
hexagon:2610.00370v1

math.CO — Combinatorics

Graph Puzzles IV.1-preview: Factorisations of hypohamiltonian and permutation snarks

Contributed by Nikolay Ulyanov

Every hypohamiltonian snark and every permutation snark has a unique multiset of cyclically 5-edge-connected factors of the same class under successive decompositions along cycle-separating 4-edge-cuts. We prove that hypohamiltonicity passes from a dot product to both of its snark factors. Together with the factorisation theorem for bicritical snarks, this answers a question of Goedgebeur and Zamfirescu. For permutation snarks, we extend the atom argument of Chladný and Škoviera using colourable cut multipoles and closure under their canonical completions.

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

math.DS — Dynamical Systems

Counterexamples to the D-unstable-core conjecture for parameter-rich and elementary mass-action networks

Contributed by Michael Mislan

Two exact four-species counterexamples refute necessity of a D-unstable core for instability of a positive equilibrium. The first has five reactions, parameter-rich kinetics, an explicit generalized-mass-action equilibrium, and a rational Jacobian with eigenvalue 1/500 + (51/500)i. The second has six reactions, at most two molecules on each side of every reaction, no catalysts, and classical mass-action kinetics with fixed integer kinetic orders. At a positive rational equilibrium its Jacobian has integer entries and an unstable nonreal eigenvalue with real part between 0 and 5, certified by an exact shifted-quartic intermediate-value argument. The networks share a reactant incidence relation and 24 nonempty child selections. Exact symmetrization, triangular-block and cubic-factorization certificates show that every child matrix is D-nonunstable in both networks. A permanent zero eigenvalue in an exceptional child distinguishes D-noninstability from strict D-stability. Both counterexample theorems have Lean 4 proofs with Mathlib. A separate asymptotic calculation explains the elementary example through circulation and a fast branching coordinate. The results establish strict linear instability, without asserting a Hopf bifurcation or periodic orbit.

Primarily AI-generated textHuman understanding: some partsD-unstable coresLean formalizationchemical reaction networksclassical mass actioncounterexampleelementary bimolecular reactionsgeneralized mass actionparameter-rich kinetics
Oct 20, 2026PDF ↗View work →
hexagon:2610.00367v1

math.DS — Dynamical Systems

A critical-point criterion for D-stability in every dimension

Contributed by Michael Mislan

A real square matrix A is D-stable if DA is Hurwitz for every positive diagonal matrix D. Applying the critical-point method to Johnson’s contact variety establishes that, in every dimension and for every positive choice of barrier weights, D-stability is equivalent to Hurwitz stability and absence of positive solutions of an explicit principal-minor Fritz–John system. In dimension five the system separates into Lagrange and tangency branches; both equivalences are registered in Lean. Further results treat regular-contact persistence, the boundary of the D-stable set, stability under bounded time-scale ratios and the minimal destabilizing ratio. The finite decision procedure also uses conventional finiteness and termination arguments and was executed exactly only in dimension three. For the five-dimensional Lagrange system the multihomogeneous Bézout number is 1200; 980 generic complex solutions were observed numerically. Worked examples include a Lotka–Volterra community, a published refinery-column gain matrix and an exactly recovered benchmark window. Formal statements, conventional arguments, exact certificates and numerical illustrations are distinguished throughout.

Primarily AI-generated textHuman understanding: some partsD-stabilityFritz-John conditionsLean formalizationcritical-point methoddiagonal scalingtime-scale robustness
Oct 20, 2026PDF ↗View work →
hexagon:2610.00366v1

math.CO — Combinatorics

Finite Multiset Codes and Affine Lattice Restrictions

Contributed by Daniel Adam Pyle

We study constant-weight nonnegative integer vectors under half-L1 distance and compare arbitrary codes with full intersections of affine additive-subgroup cosets with the discrete simplex. A heavy-coordinate decomposition gives the exact reduction A_q(n,n-s) = q + B_q(n,s) to codes whose coordinates are bounded by s. It determines the unrestricted optimum throughout 2n > (q+1)s. For every q ≥ 3 and s ≥ 2, at n = qs−1 and D = (q−1)s−1 the unrestricted and full-coset optima are respectively q+1 and q; we classify all q² unrestricted extremizers. We retain a complete classification of both optima for three coordinates and n < 2D. In the next ternary band, 2D ≤ n < 3D, eight words are attainable precisely when 3n ≥ 8D; equality yields an infinite eight-versus-seven full-coset separation. Exact finite certificates also give a six-versus-five gap at (q,n,D) = (4,5,3) and the quinary single-deletion values A_5(9,2) = 143 and A_5(10,2) = 201. The proofs use intersection bounds and explicit integer affine combinations. The unrestricted decomposition extends known methods, and bibliographic novelty remains unresolved, particularly against a closely related 2024 paper not compared in full.

Primarily AI-generated textHuman understanding: no partsaffine latticescoding theorydeletion codesdiscrete simplexexact certificatesmultiset codes
Oct 20, 2026PDF ↗View work →
hexagon:2610.00364v1

math.CO — Combinatorics

Partitioning {1,…,n}\{1,\dots,n\} into parts of size at most three whose sums are powers of three

Contributed by Deep Bhattacharjee, Ushashi Bhattacharya

We prove unconditionally the conjecture of Gurvich and Naumova that for every n≥1n\ge1 the set {1,…,n}\{1,\dots,n\} can be partitioned into parts of at most three elements whose sums are powers of 33. The partition is given by an explicit recursion.

A mix of human-written and AI-generated textHuman understanding: some partsformal verificationpowers of threeset partitionzero-sum triples
Oct 20, 2026PDF ↗View work →
hexagon:2610.00363v1

math.AG — Algebraic Geometry

Durfee inequalities for quasihomogeneous complete intersections of codimension two

Contributed by Qiyue Tang

For positive-weight quasihomogeneous isolated complete intersections of minimal embedding codimension two, we prove μ≥4pg+1\mu\ge4p_g+1 in dimension two and μ>Cn,2pg\mu>C_{n,2}p_g in every dimension n≥3n\ge3.

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

cs.MS — Mathematical Software

Certified rational-anchor filtering for exact GPU scans of power-residue runs

Contributed by Brice Pouly

We study exact longest monochromatic runs of power-residue colourings, including neutral prefixes and least canonical witnesses. A certified rational cover represents every relevant interval inside a short signed character table. A reflection-compatible schedule retains an anchor; conservative filters reject only known contradictions, bilateral completion recovers the full run, and tie-preserving reduction selects its least witness. We prove this exact-success contract and describe its CUDA realization with separate arithmetic domains below 2322^{32} and 2332^{33}. On one RTX 5090, two reserved cohorts give ratios 24.0024.00 and 10.9510.95 of sums of hot per-prime medians against the identified historical dense engine. A separate batch study gives throughput factors 1.231.23-2.582.58 against an already optimized reference. The experiments have different timing boundaries and their factors are reported separately. Short-table multiplicative extraction has close algorithmic antecedents in cryptanalysis; our contribution is its certified organization for exhaustive maxima and witnesses and its measured implementation. Square-root-sized cover parameters do not give a general O(p)O(\sqrt p) running-time bound.

Primarily AI-generated textHuman understanding: no partsCUDANVIDIA RTX 5090SM120certified algorithmsexact GPU scansmultiplicative characterspower-residue runsrational-anchor filtering
Oct 20, 2026PDF ↗View work →
hexagon:2610.00359v1

math.CO — Combinatorics

Succinct Rabung certificates and recurrence-closed lower bounds for van der Waerden numbers

Contributed by Brice Pouly

Rabung's power-residue construction describes a large progression-free colouring by a prime, a colour count and a target length. We give six additional primitive certificates, checked by full ordinary CPU scans, which yield fourteen direct lower bounds. In colour-first notation, these include W(3,17)>33 166 190 897W(3,17)>33\,166\,190\,897, W(3,18)>100 289 348 022W(3,18)>100\,289\,348\,022, W(3,19)>259 446 988 783W(3,19)>259\,446\,988\,783 and W(3,20)>326 368 775 450W(3,20)>326\,368\,775\,450. The larger ternary primes lie outside the complete census below 2322^{32}. We prove the equivalence of the run and boundary tests with Rabung's criterion and separate pointwise verification from discovery. A finite closure of explicitly identified earlier constructions places the new bounds in context: direct ternary certificates win through length 2323; Berlekamp and binary recurrence inputs win thereafter. Exact-modulus cyclic witnesses also give six-colour product bounds. The previously published thirteen-claim evidence and its closed empirical analyses are retained separately. Comparisons refer to the stated source catalogue, without an exhaustive global priority or optimality claim.

Primarily AI-generated textHuman understanding: no partsRabung certificatesarithmetic progressionscomputer-assisted proofslower boundspower-residue colouringsrecurrence closurevan der Waerden numbers
Oct 20, 2026PDF ↗View work →
hexagon:2610.00358v1

math.CO — Combinatorics

Prescribed Eigenvalues in Power Bands of Finite Prime-Cover Graphs

Contributed by Idris Ali Shaik

Let G_X be the graph on the positive integers at most X, with an edge between n and np whenever p is prime and np <= X. Write lambda_1(X) >= lambda_2(X) >= ... > 0 for its positive adjacency eigenvalues, counted with multiplicity. We prove that, for every fixed 21/61 < theta < 1/2 and every integer X^theta/log X <= a <= X^theta, lambda_a(X)^2 = pi(X/a) + O_theta(a/log X), where pi is the prime-counting function. This identifies the eigenvalue at the prescribed rank a throughout a polynomially growing band of centres. For every 0 < theta < 1/2, ordered mean-square bounds give a weaker estimate outside o(X^theta) centres below X^theta. When 1/3 < theta < 1/2, the same O_theta(a/log X) error holds outside o(X^theta) centres using only global prime estimates. The results extend to deletion of any fixed finite set of prime directions. Edges labelled by primes exceeding sqrt(X) form disjoint stars. Retaining their first-exit interactions gives local comparison operators and a family of approximate eigenvectors. Bounds on their overlaps and residuals control eigenvalue counts across clusters, allowing ranks to be recovered where the global perturbation bound no longer separates neighbouring star levels. The Baker--Harman--Pintz lower bound and the Brun--Titchmarsh upper bound supply the short-interval prime counts used in the uniform every-centre theorem.

A mix of human-written and AI-generated textHuman understanding: all partsmatrix perturbationordered eigenvaluesprime number theoremprime-cover graphsshort intervalsspectral graph theory
Oct 20, 2026PDF ↗View work →
hexagon:2610.00357v1

math.NT — Number Theory

Arithmetic coding against unknown small-prime signs

Contributed by Brice Pouly

We encode binary messages in completely multiplicative sign functions and read them along the three sequences n2+1n^2+1, n2+2n^2+2 and n2−2n^2-2. Two observations with the same exact cofactor remove the unknown smaller-prime signs when multiplied. Allocating shared large primes before pairing embeds ordinary binary error-correcting codes in each trace. Under an explicit large-factor mass hypothesis, a computable schedule gives one infinite encoding with positive prefix rate and a linear errors-and-erasures allowance. A first-occurrence filter makes its raw readings depend causally on a linear message prefix, while encoding and decoding remain polynomial in the numerical observation length. Its supporting primes have arbitrarily small harmonic cost. A finite construction, independent of the analytic hypothesis, stores 273273 bits in 87368736 readings of each trace and corrects every pattern of 499499 reading errors. Complementary constructions give persistent sign prescriptions, uniform laws for the active coordinates of words, and compact multiplicative subgroups whose nontrivial quotients have positive quadratic entropy. The word-law and entropy conclusions are not asserted for the polynomially decoded encoding. A separate matrix construction gives another causal positive-rate map. Fixed-scale balancing provides an unconditional quarter-sign bound against every small-prime assignment. All coding statements concern deliberately constructed families, not recovery of an arbitrary multiplicative source. The sparse constructions at superlinear cutoffs keep their large-factor mass input explicit.

Primarily AI-generated textHuman understanding: no partsarithmetic codingcausal encodingerror-correcting codeserrors and erasuresmultiplicative functionsquadratic tracesunknown prime signs
Oct 20, 2026PDF ↗View work →