Browse

All works

Browse the Hexagon catalog.

Newest works

1110 works

math.NT — Number Theory

An explicit elementary proof of no Landau--Siegel zeros

Contributed by Victor Z. Guo

We give an elementary proof of the absence of Landau--Siegel zeros with the explicit constant c=1/100c=1/100. For every primitive quadratic Dirichlet character χ\chi of conductor q≥3q\ge3, each real zero β∈(0,1)\beta\in(0,1) of L(s,χ)L(s,\chi) satisfies (1−β)log⁡q>c(1-\beta)\log q>c. The proof combines integer coefficient counting, polynomial congruences, a paired-tail hyperbola estimate, and a logarithmically weighted comparison of positive sums. All required constants are explicit, and one choice of parameters covers every conductor. The argument uses elementary arithmetic and real summation and integration, without separate zero computations for small conductors.

A mix of human-written and AI-generated textHuman understanding: all partsFrobenius congruencesLandau--Siegel zeroselementary methodsexplicit estimatesquadratic characters
Oct 22, 202617 pages
PDFView work

math.CO — Combinatorics

Two conjectures of Wormald on Hamilton cycles in tournaments

Contributed by Deep Bhattacharjee

A tournament is a complete graph in which every edge has been given a direction, and a Hamilton cycle in it is a directed cycle through all the vertices. Let h(n)h(n) be the largest number of Hamilton cycles that a tournament on nn vertices can have, and let g(n)=2−n(n−1)!g(n)=2^{-n}(n-1)! be the expected number of Hamilton cycles of a random tournament on nn vertices. Wormald obtained lower bounds for h(n)h(n) by replacing every vertex of a fixed regular tournament TT on dd vertices by a random tournament on nn vertices. The expected number of Hamilton cycles of the result is governed by a number HH, the determinant of the Hessian of a function defined implicitly by TT; the bound is d/H g(dn)\sqrt{d/H}\,g(dn), or e1/dd/H g(dn)e^{1/d}\sqrt{d/H}\,g(dn) when the blocks are regular. Wormald computed HH for a few small tournaments, found that d/Hd/H was the square of a rational number every time, and could not explain it. We prove that H=ddet⁡(d2I+S2)/det⁡(d2I−S2)H=d\det(d^2I+S^2)/\det(d^2I-S^2), where SS is the skew adjacency matrix of TT, so that H≠0H\neq0 and d/H=det⁡(dI−S)/det⁡(dI−iS)\sqrt{d/H}=\det(dI-S)/\det(dI-iS) is a ratio of two positive integers. This is his Conjecture~6. For the cyclic tournament on dd vertices the formula becomes d/H=((d+1)d+(d−1)d)/((d+i)d+(d−i)d)\sqrt{d/H}=\bigl((d+1)^d+(d-1)^d\bigr)/\bigl((d+i)^d+(d-i)^d\bigr), which tends to cosh⁡1/cos⁡1=2.8559578925…\cosh1/\cos1=2.8559578925\ldots as dd grows. This is his Conjecture~2, and it identifies the constant 2.8559582.855958 that he estimated by fitting polynomials; it also explains why the terms in 1/d1/d and 1/d31/d^3 of his fits were nearly zero. We add bounds for d/H\sqrt{d/H} over all regular tournaments on dd vertices, with equality in the lower bound exactly for doubly regular tournaments. Every statement is proved by hand.

A mix of human-written and AI-generated textHuman understanding: some partsHamilton cycleHessian determinantformal verificationrandom blow-upskew-symmetric matrixtournament
Oct 22, 202612 pages
PDFView work

math.CO — Combinatorics

All τk\tau_k-maximal graphs have the same size

Contributed by Deep Bhattacharjee

A graph is τk\tau_k-maximal if none of its subgraphs has k+1k+1 edge-disjoint spanning trees, but adding any missing edge creates such a subgraph. Wang and Tian conjectured that every τk\tau_k-maximal graph on n≥2k+2n\ge 2k+2 vertices has exactly (k+1)(n−1)−1(k+1)(n-1)-1 edges. We prove this conjecture.

A mix of human-written and AI-generated textHuman understanding: some partscount matroidedge-disjoint spanning treessaturated graphssparse graphs
Oct 22, 20265 pages
PDFView work

math.NT — Number Theory

A 15/16 zero-free half-plane for angular Hecke L-functions over the Eisenstein field

Contributed by Troy Winarski

We describe the argument recorded in a frozen Lean development for nonvanishing of the unit-compatible angular Hecke L-functions over Q(−3)\mathbb Q(\sqrt{-3}) in the strict half-plane ℜ(s)>15/16\Re(s)>15/16, apart from the genuine principal pole. The family includes imprimitive finite parts, every integer angular type allowed by the unit relation, and real unitary norm twists. The proof route passes through a mean-square estimate for the actual sextic rows, sixth-power averaging, a smoothed Möbius estimate with a totient factor, and Mellin continuation. We reconstruct the angular reflection, quadratic energy estimate, finite descent, and the calculation producing the 15/1615/16 exponent, while identifying the technical source lemmas inherited from OAI-003 that remain to be independently reconstructed. The theorem is formally verified in Lean and the frozen source/evidence package has undergone statement comparison, axiom audit, recursive kernel replay, quotient postchecking, and separate AI-assisted review. This manuscript is an expository reconstruction rather than a claim of independent human certification. We describe the formally verified proof as a xenoproof, and the theorem provisionally as a xenotheorem, to distinguish formal mathematical correctness from human mathematical understanding.

Primarily AI-generated textHuman understanding: some partsEisenstein integersHecke L-functionsLeananalytic number theoryangular Hecke charactersformal verificationxenoproofxenotheoremzero-free regions
Oct 22, 202636 pages
PDFView work

math.CO — Combinatorics

Projective-plane determinant bounds for sparse binary matrices

Contributed by John Tripodo

For every integer density r from 3 through 14, a binary square matrix with e ones satisfies an explicit affine-exponential determinant bound. Under e <= r n this gives the projective-plane determinant rate, with equality precisely for direct sums of projective-plane incidence matrices of order r-1. Individual row and column degrees are unrestricted. The written proof uses an exact finite scalar certificate with rigorous unbounded-degree tails; the companion contains a pinned 98-module Lean mathematics closure.

Primarily AI-generated textHuman understanding: no partscombinatorial matrix theorydeterminantsprojective planessparse matrices
Oct 22, 20268 pages
PDFView work

math.CO — Combinatorics

Reflexive Descent to Minimal Seeds in the Kreuzer--Skarke List

Contributed by Deep Bhattacharjee, Ushashi Bhattacharya

Kreuzer and Skarke built the list of reflexive polytopes by growing it from small seed polytopes. We ask how far a polytope can be from its seeds when it is shrunk through reflexive polytopes only, one at a time and without skipping any. Such a descent always exists and always ends at a seed. In four dimensions no descent takes more than 348 steps, which proves the conjecture of a uniform transition depth, and in two and three dimensions the exact maxima are five and eleven. In four dimensions two polytopes with thirty-seven lattice points need exactly twenty-two steps, so the maximum lies between twenty-two and 348.

A mix of human-written and AI-generated textHuman understanding: some partsCalabi–Yau threefoldsKreuzer–Skarke listlattice polytopesreflexive polytopes
Oct 22, 202618 pages
PDFView work

math.CO — Combinatorics

The book Ramsey number R(B57,B58)=231R(B_{57},B_{58})=231

Contributed by Deep Bhattacharjee

We construct a graph on 230230 vertices with no book B57B_{57} whose complement contains no B58B_{58}. With the upper bound of Rousseau and Sheehan this gives R(B57,B58)=231R(B_{57},B_{58})=231, the smallest case of Wesley's conjecture R(Bn−1,Bn)=4n−1R(B_{n-1},B_n)=4n-1 that was open. The graph is a two-block circulant graph over Z115\Z_{115}, and the proof reduces to 5757 inequalities.

A mix of human-written and AI-generated textHuman understanding: some partsRamsey numberblock-circulant graphbook graphformal verificationlocal search
Oct 22, 202610 pages
PDFView work

math.NT — Number Theory

A sixteen-prime-factor bound for Lehmer's totient problem and exact prime-completion criteria

Contributed by Deep Bhattacharjee

We study composite integers nn for which Euler's totient divides n−1n-1. The finite-search results give at least sixteen distinct prime factors, at least 1800118001 when (n−1)/φ(n)≥3(n-1)/\varphi(n)\ge3, and more than 10910^9 when 3∣n3\mid n. A solution with kk prime factors satisfies n<22k−7n<2^{2^{k-7}}, and every solution exceeds 103510^{35}. For the companion divisibility φ(n)∣n+1\varphi(n)\mid n+1, the nine known solutions exhaust the cases with at most eight prime factors. For a fixed prime prefix A=∏pA=\prod p, B=∏(p−1)B=\prod(p-1), the quotient is forced to be M=⌈A/B⌉M=\lceil A/B\rceil and a possible largest prime is uniquely q=1+(A−1)/(MB−A)q=1+(A-1)/(MB-A). We derive its exact divisibility, coprimality and valuation consequences, and prove that deleting the largest prime of a hypothetical counterexample cannot yield a smaller Lehmer counterexample. A two-prime factorisation identifies the additional integrality and primality conditions required by a replacement construction. A complete finite construction is proved for every prescribed factor count. Excluding its output at every factor count, or excluding the final prime for every prefix, remains unproved; the full Lehmer conjecture is not resolved.

A mix of human-written and AI-generated textHuman understanding: some partsCarmichael numbersEuler's totient functionFermat primesLehmer's totient problemlarge sieve
Oct 22, 202656 pages
PDFView work

math-ph — Mathematical Physics

Faster-than-power-law decay of order parameter correlations in the two-dimensional RP2 model: a rigorous result by vibe-proving

Contributed by Masaki Oshikawa

We consider the RP2RP^2 model on the two-dimensional square lattice with nearest-neighbor interactions. It is obtained by replacing the spin in the standard classical Heisenberg model with a director, which does not distinguish two opposite directions. Unlike the standard classical Heisenberg model or the O(3) nonlinear sigma model, the RP2RP^2 (and its cousin RP3RP^3) model allows point vortex defects classified by π1(RP2)=Z2\pi_1(RP^2)=Z_2 in two dimensions. It is tempting to expect the Z2Z_2 vortices to induce a phase transition analogous to the well-established Berezinskii-Kosterlitz-Thouless transition in the O(2) model (XY model) in two dimensions. Indeed, the possibilities of a critical phase or a critical point with power-law correlations of the order parameter in the RP2RP^2 and RP3RP^3 models have been discussed in the literature. However, the challenging nature of the problem has prevented a definitive conclusion on the phase diagram so far. In this paper, we report a rigorous mathematical proof by Artificial Intelligence (ChatGPT 6 Astra) that the absolute value of the two-point correlation function of order parameters at distance rr in the RP2RP^2 and RP3RP^3 models on the two-dimensional square lattice is bounded above by Cβexp⁡{−cβ[log⁡(2+r)]2}C_\beta \exp\{-c_\beta[\log(2+r)]^2\} for any finite inverse temperature β≥0\beta\ge0, with positive constants CβC_\beta and cβc_\beta depending only on β\beta. Namely, the correlation function decays faster than any power of rr. The proof is formalized and verified in Lean; the formalization is publicly available at \href{https://doi.org/10.5281/zenodo.23548847}{doi:10.5281/zenodo.23548847}. A heuristic argument based on a one-parameter effective theory ansatz at large distances combined with the rigorous correlation bound suggests (but does not prove) that the Z2Z_2 vortices are always unbound at any nonzero temperature.

A mix of human-written and AI-generated textHuman understanding: some parts
Oct 22, 202635 pages
PDFView work

math.NT — Number Theory

Cross-Energy of Dirichlet Partial Sums. Part 9: Zeros of the prime zeta function in its half-plane of absolute convergence

Contributed by Pedro Caceres

The prime zeta function P(s)=∑pp−sP(s)=\sum_pp^{-s} has zeros in its half-plane of absolute convergence. Belovas, \v{C}epaityt\.{e} and Sabaliauskas proved that P≠0P\ne0 for Re⁡s>σP=1.7795446535…\operatorname{Re}s>\sigma_P=1.7795446535\ldots, the solution of P(σ)=21−σP(\sigma)=2^{1-\sigma}. We show that this is sharp: the closure of the real parts of the zeros in Re⁡s>1\operatorname{Re}s>1 is exactly [1,σP][1,\sigma_P], there are no zeros on Re⁡s=σP\operatorname{Re}s=\sigma_P, and zeros occur arbitrarily close to every line Re⁡s=σ\operatorname{Re}s=\sigma with 1<σ<σP1<\sigma<\sigma_P (Bohr's method). By Jessen's theorem the density of real parts is J′′(σ)/2πJ''(\sigma)/2\pi, where J(σ)=−σlog⁡2+Elog⁡+(2σ∣Yσ∣)J(\sigma)=-\sigma\log2+\mathbb E\log^+(2^\sigma|Y_\sigma|) and Yσ=∑p≥3p−σeiθpY_\sigma=\sum_{p\ge3}p^{-\sigma}e^{i\theta_p} has independent uniform phases. JJ is smooth, σP=inf⁡{σ:J(σ)+σlog⁡2=0}\sigma_P=\inf\{\sigma:J(\sigma)+\sigma\log2=0\}, and the density vanishes at σP\sigma_P faster than any power. The argument principle in ball arithmetic certifies exactly 6868 zeros with 1.1≤Re⁡s≤1.851.1\le\operatorname{Re}s\le1.85 below height 20002000 (70.070.0 predicted) and 1212 with Re⁡s≥1.5\operatorname{Re}s\ge1.5 below height 50005000 (12.012.0 predicted). A heuristic large-deviation extrapolation predicts zeros with real part above 1.71.7 about once every 6⋅1066\cdot10^6 units of height. In 12<Re⁡s<1\frac12<\operatorname{Re}s<1, PP is single-valued on the half-plane minus (12,1](\frac12,1] if and only if RH holds (a reformulation of a classical equivalence), its zeros are canonical below height 3⋅10123\cdot10^{12}, and they are the solutions of ζ(s)=eA(s)\zeta(s)=e^{A(s)}, A(s)=∑m≥2P(ms)/mA(s)=\sum_{m\ge2}P(ms)/m, with ∣P(s)∣<2π|P(s)|<2\pi. Below height 600600 their counts for Re⁡s≥0.7\operatorname{Re}s\ge0.7 agree numerically with the random model. The zeros are cancellations between 2−s2^{-s} and the remaining primes, the prime-sum analogue of the Euler-product interference behind the off-line zeros of the Davenport--Heilbronn function. Version~2 adds the critical line: the partial prime zeta function weights each zero by 1/((ρ−s)log⁡x)1/((\rho-s)\log x), and a Gaussian slice of the primes weights it by e−ε2(γ−T)2e^{-\varepsilon^2(\gamma-T)^2}. In a numerical experiment at height 10001000, the partial prime zeta function aimed at an off-line pair detects it sooner than a wide slice (ε=0.02\varepsilon=0.02) and later than a narrow one (ε=1\varepsilon=1); aimed 3030 away, the wide slice is the best of the three.

Author comments: Revised 10 Nov 2026 after external examination (see CHANGES_v2.md). Version 2 (2 Nov 2026). 17 pages, 6 figures, 8 tables; ancillary Python scripts reproduce the tables and figures. Part 9 of a series of forty-seven on the cross-energy of Dirichlet partial sums (book edition of 2 November 2026, block II: Primes and Euler products; Part 0 is the guide, Part 1 the plan). We do not prove the Riemann hypothesis. 2 Nov 2026: the paper states the RH caveat once, in the Discussion (Section 7 in version 2); the abstract and introduction no longer repeat it (no other change).

A mix of human-written and AI-generated textHuman understanding: all partsC2 FunctionDirichlet SumsRiemann Zeta Function
Oct 22, 202617 pages
PDFView work

math.NT — Number Theory

Small algebraic integers and Frobenius prime sums

Contributed by Scott Kominers

The determinant argument in recent proofs of Landau–Siegel zero exclusion compares the size of a nonzero integer with its divisibility by inert primes. We observe that the same comparison applies to every Frobenius class in a finite Galois extension of Q\mathbb{Q}, bounding its weighted prime count in terms of the supply of small algebraic integers. For each fixed field, the resulting height bound implies a weighted Chebotarev theorem whose only analytic inputs are the elementary Chebyshev and Mertens estimates. In the quadratic case there are only two Frobenius classes, so the lower bound obtained by complementation remains uniform in the conductor; this recovers Landau–Siegel zero exclusion.

A mix of human-written and AI-generated textHuman understanding: all partsChebotarev density theoremFrobenius congruenceGalois extensionGeometry of numbersLandau–Siegel zeroWronskianinterpolation determinant
Oct 22, 20268 pages
PDFView work

math.MP — Mathematical Physics

Superfluid Stiffness and Nonclassical Rotational Inertia of the Dilute Hard-Sphere Bose Gas

Contributed by P. M. Aronow, Patrick Lopatto

We study the three-dimensional Bose gas of hard spheres of diameter aa at density ρ\rho and temperature TT, in the thermodynamic limit with aa, ρ\rho, and TT fixed. When the gas parameter ρa3\rho a^3 is sufficiently small and 0<T<T∗0<T<T_*, we prove two equilibrium signatures of superfluidity. First, in a periodic box, the superfluid fraction, defined through the free-energy cost of twisted boundary conditions, has thermodynamic lower limit at least c (ρa3)3/8c\,(\rho a^3)^{3/8}, uniformly in TT in this interval. Second, in dilations of an arbitrary nonempty bounded open container with hard walls, the nonclassical rotational inertia fraction 1−I/Icl1-I/I_{\mathrm{cl}} has thermodynamic lower limit at least c′(ρa3)3/8c'(\rho a^3)^{3/8} for every fixed rotation axis, where II is the moment of inertia, IclI_{\mathrm{cl}} its classical value, and c′>0c'>0 depends only on the container and the axis. In both results the derivative of the free energy is taken at finite volume, before the thermodynamic limit. The temperature T∗T_* is of order (ρa3)1/3/log⁡(1/(ρa3))(\rho a^3)^{1/3}/\log(1/(\rho a^3)) times the critical temperature of the ideal Bose gas. We also bound the moment generating function of the winding vector of the Feynman–Kac paths by that of a centered Gaussian, at every density and positive temperature. Combining this upper bound with the first result, we determine the order of the winding fluctuations in the regime above. Further, for 0<ε≤10<\varepsilon\le1, ρa3≤(ε/100)3\rho a^3\le(\varepsilon/100)^3, and T≥(1+ε)4πρ2/3T\ge(1+\varepsilon)4\pi\rho^{2/3}, about 1.9(1+ε)1.9(1+\varepsilon) times the critical temperature of the ideal Bose gas, the superfluid fraction in a periodic box tends to zero exponentially in its side length. By identities of Pollock and Ceperley and of Sindzingre, Klein, and Ceperley, we can express the two responses as multiples of the variances of the winding and of the signed projected area of the paths. We bound these variances from below with a variance inequality of Hammersley–Chapman–Robbins type, applied to random rewirings of the paths in a short imaginary-time interval along closed lattice routes. The rewirings adapt route comparisons developed in OpenAI's preprints on Bose–Einstein condensation in dilute Bose gases, and we extend the thermal estimates of the positive-temperature hard-sphere preprint in that series to higher temperatures. We average the rewirings over randomly translated closed lattice walks whose independent copies rarely approach each other. This makes the changed law close to the original law in chi-square divergence. Using conditional independence between disjoint imaginary-time intervals, we obtain bounds uniform in temperature. We also transfer the thermal estimates to arbitrary containers.

Primarily AI-generated textHuman understanding: no partsbose gassuperfluid
Oct 22, 2026233 pages
PDFView work

math.NT — Number Theory

A quantitative refinement of Lu's elementary prime number theorem

Contributed by Rajat Bhattacharjee

We refine Lu's elementary method for the prime number theorem to obtain, for every fixed K>400K>400, \[ \psi(X)-X=O_K\!\left( X\exp\!\left\{-\frac{\sqrt{\log X}}{(\log\log X)^K}\right\}\right) \qquad(X\to\infty), \] where ψ\psi is Chebyshev's function. The main ingredient is a comparison estimate that remains uniform as the degree grows and the short-interval parameter shrinks. Combining this estimate with exponential weights in Balog's identity, a single finite energy step and positivity-based interpolation yields the stated bound, retaining the full degree tail and all arithmetic correction terms. The resulting remainder strengthens Lu's fixed-parameter estimates and Goz\'e's quantitative refinement within the real-variable framework; stronger remainder estimates are known by other methods.

Primarily AI-generated textHuman understanding: no parts
Oct 22, 202629 pages
PDFView work

math.CO — Combinatorics

A polynomial algorithm for general d-position in trees

Contributed by Daniel Adam Pyle

A vertex set is in general dd-position if no three of its vertices lie on a shortest path of length at most dd. We give an exact algorithm for an nn-vertex tree in O(n(D+2)4)O(n(D+2)^4) time and O(n(D+2)2)O(n(D+2)^2) space, where D=min⁡{d,n−1}D=\min\{d,n-1\}. In particular, the problem is polynomial-time solvable when the threshold is part of the input. This answers the tree-complexity question posed by Klav\v zar, Rall, and Yero in 2021 and retained in the August 2026 version of the general position survey. The dynamic program uses two truncated distances at each rooted boundary: the nearest selected vertex and the nearest far endpoint of an ancestor-comparable selected pair. These distances characterize every forbidden triple created by joining child subtrees. The algorithm reconstructs an optimal set and extends to signed vertex weights and exact counting of optimal sets. It also computes the full cardinality generating polynomial in O(n2(D+2)4)O(n^2(D+2)^4) coefficient operations. Exhaustive comparisons with direct subset enumeration support the implementation independently of the proof.

Primarily AI-generated textHuman understanding: no parts
Oct 22, 202610 pages
PDFView work

math.AG — Algebraic Geometry

Point Separation for Adjoint Line Bundles

Contributed by Brian Nugent

Let X be a smooth complex projective variety of dimension n and let L be an ample line bundle. Using the freeness and minimization inputs specified in the introduction, we prove that KX + mL separates distinct points for every integer m ≥ n + 2, the sharp bound predicted by Fujita’s very ampleness conjecture. Exponential-moment convergence produces point-centred minimizing valuations at both points in a common degree. Strict convexity then gives a divisor with discrepancy equality at one point and strict excess at the other. A rational perturbation on a resolution, followed by Kawamata–Viehweg vanishing and descent, gives the required sections

Primarily AI-generated textHuman understanding: some parts
Oct 22, 202615 pages
PDFView work

math-ph — Mathematical Physics

Which String Vibrations Become Which Generations on the Dwork Quintic

Contributed by Deep Bhattacharjee, Ushashi Bhattacharya

We determine, for the heterotic string on the one-parameter family of quintic threefolds, which vibration modes become which families of charged particles. The hundred and one families are labelled by the characters of a symmetry group of order one hundred and twenty-five. Every Yukawa coupling that this symmetry allows is a power of the modulus, and every other coupling vanishes. The invariant deformation pairs each family with exactly one partner, so that fifty families are massless at the Fermat point and none anywhere else, and at the Fermat point the masses are given in closed form by the Gamma function. On the three other one-parameter families of the same type, in weighted projective spaces, the symmetry no longer tells the families apart and some families stay massless at every member. We also prove that the Geometric Selection Conjecture is equivalent to the existence of one viable vacuum fixed by mirror symmetry, and that a free quotient of a Calabi–Yau complete intersection of any of the thirteen one-parameter hypergeometric types never carries three families with the standard embedding; on seven of these types, among them the sextic and dectic pencils, no finite group acts freely at all.

A mix of human-written and AI-generated textHuman understanding: some partsYukawa couplingsfree quotientsgenerationsheterotic stringquintic threefold
Oct 22, 202631 pages
PDFView work

math.CT — Category Theory

Vanishing of Higher Magnitude Homology for Finite Prefix Models

Contributed by Ryoji Hirayama

Bradley and Vigneaux define a generalized distance on a finite prefix poset using next-token probabilities. They conjecture that its higher magnitude homology vanishes. Motivated by their expression of magnitude as a weighted sum of homological Euler characteristics, we verify this conjecture for their explicit complex, in which both endpoint faces are zero. For each finite length, the homology groups in degrees two and above are zero. The degree-one homology group is free abelian, with one generator for each positive-probability edge of that length. The proof constructs a contracting homotopy for each component whose endpoints have an interior prefix. This homotopy inserts the least interior prefix. Edge probabilities zero and one are both allowed.

A mix of human-written and AI-generated textHuman understanding: all partsenriched categorieslanguage modelsmagnitude homologyprefix posets
Oct 22, 20263 pages
PDFView work

math.CO — Combinatorics

Distinct partial products in prime dihedral groups

Contributed by alexandre Thiery

Let D2pD_{2p} be the dihedral group of order 2p2p, where pp is prime. For every fixed 0<α<10<\alpha<1, we prove that every subset A⊆D2p∖{e}A\subseteq D_{2p}\setminus\{e\} with Cα≤∣A∣≤pαC_\alpha\le |A|\le p^\alpha admits an ordering whose nonempty partial products are pairwise distinct. Combined with the known small- and large-set theorems, this covers every subset size for all sufficiently large primes. Pairing reflections reduces the products to partial sums with fixed parity-labelled offsets. Two passes of block rotations remove distant collisions; bounded displacement allows the local condition to exclude the remaining collisions. The existence of suitable rotations follows from Pham--Sauermann's subset-sum anticoncentration theorem, an affine-rank estimate, and a count of clustered collision witnesses.

Primarily AI-generated textHuman understanding: some parts
Oct 22, 202616 pages
PDFView work

math.GT — Geometric Topology

Inscribed Square Problem and an Embedding of M¨obius Band in a Family of Solid Toruses

Contributed by Faris ELmikdad

In this paper, we relate the space of line segments induced by a Jordan curve in the plane to the space of line segments induced by the plane by embedding the M¨obius band associated with the curve into the family of toruses associated with the plane; we further demonstrate how the geometric ”square condition” of the curve translates into a topological property through this embedding.

Primarily human-written textHuman understanding: all partsM¨obius bandRotationSquare.Torus
Oct 22, 20269 pages
PDFView work

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, 202624 pages
PDFView work

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, 202634 pages
PDFView work

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, 202620 pages
PDFView work

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, 202625 pages
PDFView work

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, 202614 pages
PDFView work

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, 202613 pages
PDFView work

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, 202625 pages
PDFView work

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, 20266 pages
PDFView work

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, 20267 pages
PDFView work

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, 20266 pages
PDFView work

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, 20267 pages
PDFView work

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, 20264 pages
PDFView work

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, 202613 pages
PDFView work

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, 20265 pages
PDFView work

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, 20266 pages
PDFView work

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, 20269 pages
PDFView work

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, 202630 pages
PDFView work

math.NT — Number Theory

Finite prime gaps from weighted Selberg sieves and pair penalties

Contributed by Annanay Kapila

Let Hm=lim inf⁡n→∞(pn+m−pn)H_m=\liminf_{n\to\infty}(p_{n+m}-p_n). We develop a pair-penalty refinement of a multidimensional Selberg sieve, together with explicit admissible tuples and interval-arithmetic evaluations. A mixed prime–divisor asymptotic is derived from distribution on triply densely divisible moduli. Combining it with the numerical certificates gives H2≤19,844H_2\le19{,}844, H3≤1,357,780H_3\le1{,}357{,}780, H4≤82,234,788H_4\le82{,}234{,}788, and H5≤4,830,355,416H_5\le4{,}830{,}355{,}416. The proof combines truncated marginal estimates, support-loss bounds for signed trial functions, a trace-preserving auxiliary sieve for prime pairs, and exact modular certificates. Exact finite data, interval enclosures, and reproducibility code accompany the manuscript.

Author comments: Updated manuscript dated 6 November 2026, with a pair-penalty refinement and improved bounds for H_2 through H_5.

Primarily AI-generated textHuman understanding: some parts
Oct 20, 202635 pages
PDFView work

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, 202616 pages
PDFView work

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, 202620 pages
PDFView work

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, 202614 pages
PDFView work

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, 202611 pages
PDFView work

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, 202656 pages
PDFView work

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, 202645 pages
PDFView work

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, 20266 pages
PDFView work

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, 202650 pages
PDFView work

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, 202641 pages
PDFView work

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, 20267 pages
PDFView work

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, 202672 pages
PDFView work