Browse

All works

Browse the Hexagon catalog.

Newest works

385 works

math.CV — Complex Variables

Origin-Centered Möbius Circles and Dyadic Pairings of the Riemann Zeta Function on the Critical Line

Contributed by Ryan Hackbarth

We investigate the complex geometry of the normalized Dirichlet eta terms tn(s) = 1 1−2 1−s (−1)n−1 ns (s = a + bi). By analyzing the Möbius geometry of each term, we demonstrate that the base-2 resonant partial sum S2(s) = t1(s) + t2(s) forms an exact circle. Remarkably, this base circle is centered strictly at the origin (0, 0) if and only if Re(s) = 1 2 . We further establish a dyadic pairing theorem showing that every oddeven pair Pm(s) = tm(s) + t2m(s) inherits this origin-centered circular symmetry on the critical line. Analyzing the phase distribution on these concentric circles reveals four geometric mechanisms that distinguish non-trivial Riemann zeta zeros b = bn from generic values of b, including right-half-plane slow-zone clustering of P1 and opposinghemisphere alignment of the leading inner circles P3, P5, P7. Finally, we prove that removing all odd-even dyadic pairs leaves the multiples-of-4 subseries P∞ k=1 t4k(s) = t4(s)ζ(s), whose partial sums spiral around a target center Ctarget(b) that coincides with the origin (0, 0) if and only if b is a Riemann zeta zero.

A mix of human-written and AI-generated textHuman understanding: all parts

math.PR — Probability

Explicit onsets, rates and the tail of the collision constant for heat-evolved Weyl polynomials

Contributed by Bingo Baggins

Let hkh_k be the orthonormal Hermite polynomials for the standard Gaussian weight, and let a(w)=∑j≥0ajwja(w)=\sum_{j\ge0}a_jw^j be a real power series with radius of convergence greater than 11, a(0)≠0a(0)\ne0, no zeros on the unit circle and only simple zeros in the unit disk. For all large nn the polynomial ∑j=0najhn−j\sum_{j=0}^{n}a_jh_{n-j} has exactly as many nonreal zeros as aa has in the disk, but the known proof gives the onset by compactness. We make it explicit: if aa has no zeros in {1−d≤∣w∣≤1}\{1-d\le|w|\le1\}, with dd below an explicit threshold, the count is exact as soon as nn exceeds a polynomial in 1/d1/d and in the inverses of ∣a(0)∣|a(0)|, min⁡∣w∣=1∣a∣\min_{|w|=1}|a|, min⁡∣w∣=1−d∣a∣\min_{|w|=1-d}|a| and min⁡[−1+d,1−d]max⁡(∣a∣,∣a′∣)\min_{[-1+d,1-d]}\max(|a|,|a'|); no separation of the nonreal zeros of aa is needed. By an exact identity this applies to the random Weyl polynomials GnG_n with independent standard Gaussian coefficients under the backward heat flow Gn,t=exp⁡(−t2n∂z2)GnG_{n,t}=\exp(-\frac t{2n}\partial_z^2)G_n, whose real-rooting time converges in distribution to T∗=R∗−2T_*=R_*^{-2}, where R∗R_* is the smallest modulus of a nonreal zero of the Gaussian power series q(w)=∑jηjwjq(w)=\sum_j\eta_jw^j. We show that the convergence holds with the rate n−αn^{-\alpha} on [1+ε,∞)[1+\varepsilon,\infty) for every α<350\alpha<\frac3{50}, an exponent that does not depend on ε\varepsilon; the dependence on ε\varepsilon is removed by a super-exponential tail for the number of zeros of qq in a disk. Under a coupling of the degrees that shares the top coefficients, the real-rooting time Λn\Lambda_n satisfies ∣Λn−T∗∣≤K/n|\Lambda_n-T_*|\le K/n for n≥n0n\ge n_0, with KK and n0n_0 depending on qq. We bound KK and n0n_0 by polynomials in condition parameters of qq, with absolute degrees and, when T∗≥1+εT_*\ge1+\varepsilon, coefficients polynomial in 1/ε1/\varepsilon. For the Gaussian power series this gives, on the event {T∗≥1+ε}\{T_*\ge1+\varepsilon\}, a power tail with exponent 1/9001/900 for the largest scaled displacement DD of the final collision of zeros, and without restriction the tail bound exp⁡(−c(log⁡x/log⁡log⁡x)1/2)\exp(-c(\log x/\log\log x)^{1/2}); the inputs include closed forms of the two-point correlation functions of the zeros of qq.

Primarily AI-generated textHuman understanding: no partsHermite polynomialsWeyl polynomialscollision of zeroscorrelation functions of zerosexplicit onsetheat flowlinear combinations of orthogonal polynomialsnonreal zerosrandom power seriesrate of convergence

math.NT — Number Theory

A 256-step certificate for Turán's pure power-sum constant

Contributed by Ricardo Pinho

We give an exact-input certificate for the upper bound C_42 <= 0.6888863712 in the pure power-sum problem. The construction refines the step profiles of Griego, Röhrig and Plata to 256 middle blocks, without changing their coefficient-cancellation mechanism. It improves the strongest public proposal located in our 22 October 2026 audit, 0.688970, by 0.0000836288. An unmodified public interval checker and a separately written Arb checker verify the strict finite inequalities. The asymptotic implication is proved in the note; no explicit finite threshold, optimality, human peer review or formal verification is claimed.

Primarily AI-generated textHuman understanding: some partsTurán power sumscoefficient cancellationcomputer-assisted proofinterval arithmeticrigorous numerics

math.MG — Metric Geometry

A counterexample to the table conjecture on the sphere

Contributed by Pablo Soberón

We disprove Matschke's table conjecture, which asserts that every continuous real-valued function on S2S^2 takes a common value on the vertices of some rotated copy of every prescribed inscribed square. The counterexample is the cubic polynomial H(x,y,z)=14z3−6z+y+xzH(x,y,z)=14z^3-6z+y+xz and a square contained in a plane at distance 1/71/\sqrt{7} from the origin. We give an elementary proof.

Primarily human-written textHuman understanding: all partscounterexamplefixed pointsquare-peg

math.PR — Probability

The Real-Rooting Time Of Heat-Evolved Random Polynomials

Contributed by Bingo Baggins

Let Gn,t=exp⁡(−t2n∂z2)GnG_{n,t}=\exp(-\frac{t}{2n}\partial_z^2)G_n be a random Weyl polynomial of degree nn under the backward heat flow, with independent coefficients of a law that is not a point mass and has finite variance. Hall, Ho, Jalowy and Kabluchko showed that the empirical zero distribution collapses onto the real line at t=1t=1. We show that the first time at which all zeros of Gn,tG_{n,t} are real, a finite-degree analogue of the de Bruijn--Newman constant, converges in distribution to T∗=R∗−2T_*=R_*^{-2}, where R∗R_* is the smallest modulus of a nonreal zero of the random power series ∑jηjwj\sum_j\eta_jw^j with coefficients of the same law; the convergence is almost sure under a coupling of the degrees that shares the top coefficients, whereas under the standard coupling the set of limit points of the real-rooting time is almost surely [1,∞][1,\infty]. The proof rests on an exact count of the nonreal zeros of analytic combinations ∑j≤najhn−j\sum_{j\le n}a_jh_{n-j} of orthonormal Hermite polynomials: if the real power series aa has radius of convergence greater than 11, no zeros on the unit circle and simple zeros in the unit disk, then for all large nn the combination has exactly as many nonreal zeros as aa has in the disk. Its method expresses the polynomial and its derivative in the bulk through a 2×22\times2 matrix applied to (hn,hn−1)(h_n,h_{n-1}), built from only O(log⁡n)O(\log n) steps of the backward three-term recurrence, with the remaining terms controlled by a Christoffel--Darboux bound. For Gaussian coefficients the law of T∗T_* is a Fredholm determinant, P(T∗>t)∼43πt−3/2\mathbb{P}(T_*>t)\sim\frac4{3\pi}t^{-3/2} as t→∞t\to\infty, and (t−1)log⁡P(T∗≤t)→−π2/12(t-1)\log\mathbb{P}(T_*\le t)\to-\pi^2/12 as t↓1t\downarrow1, half of the constant for complex coefficients. At the scale 1/n1/n the last pair of nonreal zeros collides inside the real bulk, at relative position cos⁡θ∗\cos\theta_*, where R∗e±iθ∗R_*e^{\pm i\theta_*} are the nonreal zeros of minimal modulus, and the real-rooting time is within O(1/n)O(1/n) of T∗T_*. In a window of size 1/n1/n the polynomial is, up to a positive factor and O(1/n)O(1/n), the model ζcos⁡(ζ+c)+λsin⁡(ζ+c)\zeta\cos(\zeta+c)+\lambda\sin(\zeta+c), whose threshold for real-rootedness is given by Kepler's equation; the phase cc rotates with nn, so n(Λn−T∗)n(\Lambda_n-T_*) oscillates over an explicit interval and has an explicit limit law jointly with T∗T_*.

Primarily AI-generated textHuman understanding: no partsFredholm determinantsHermite polynomialsPfaffian point processesWeyl polynomialscollision of zerosde Bruijn-Newman constantheat flowlinear combinations of orthogonal polynomialsrandom power seriesreal zeros

math.AG — Algebraic Geometry

A counterexample to Liu's conjecture on Fano indices in dimension four

Contributed by Deep Bhattacharjee, Ushashi Bhattacharya

We prove that Liu's conjecture on Fano indices fails in dimension four: 13891389 is the index of a terminal Calabi--Yau fourfold and of a four-dimensional log canonical singularity, but it is not the Fano index of any canonical weighted projective space of dimension four.

A mix of human-written and AI-generated textHuman understanding: some partsCalabi–Yau varietyFano indexindexlog canonical singularityweighted projective space

math.RA — Rings and Algebras

Nilpotent-free spaces of 3 x 3 matrices over the field with three elements

Contributed by Deep Bhattacharjee

Wigderson conjectured that for every finite field FF and every n≥1n\ge1 there is a space of n×nn\times n matrices over FF of dimension n2−(n2)n^2-\binom n2 whose only nilpotent element is zero. We show that every six-dimensional space of 3×33\times3 matrices over $\F_3$ contains a nonzero nilpotent matrix, so the conjecture fails for $F=\F_3$ and n=3n=3; the largest possible dimension is five.

A mix of human-written and AI-generated textHuman understanding: some partsGerstenhaber's theoremfinite fieldsformal verificationnilpotent matricesspaces of matrices

math.MG — Metric Geometry

Densest packings of two translates of a lattice in five dimensions

Contributed by Deep Bhattacharjee, Ushashi Bhattacharya

We prove that no packing of unit balls in R5\R^5 whose centres form two translates of a lattice is denser than the D5D_5 lattice packing. Up to congruence exactly three such packings attain this density: 2 D5\sqrt2\,D_5, a layered packing of Leech, and the packing with Szöllősi's kissing configuration.

A mix of human-written and AI-generated textHuman understanding: some parts$D_5$ latticeRyshkov polyhedronSphere packingVoronoi celldeep holeperiodic packing

math.NT — Number Theory

The Number of Terms in Greedy Fibonacci--Lucas Representations

Contributed by Deep Bhattacharjee, Ushashi Bhattacharya

We prove Kimberling's conjecture on greedy representations by Fibonacci and Lucas numbers: the ratio of the number of Zeckendorf summands of 1,…,n1,\dots,n to the number of terms of their greedy representations tends to a limit in (1.2,1.4)(1.2,1.4), and the limit is (5−5)/2(5-\sqrt5)/2. We also prove the conjectures of Greathouse and Kurkov on the number of terms of the greedy representation.

A mix of human-written and AI-generated textHuman understanding: some partsFibonacci numbersLucas numbersZeckendorf representationformal verificationgreedy algorithmsummatory function

math.AG — Algebraic Geometry

Weil classes on abelian sixfolds of Weil type for Q(i)\mathbb{Q}(i) with discriminant −3-3

Contributed by Benjamin Severn

Let K=Q(i)K=\mathbb{Q}(i). We prove that the Weil classes of every polarized complex abelian sixfold of Weil type for KK whose Hermitian discriminant is the non-split class [−3][-3] are algebraic, and that every Hodge class on every power of such a sixfold is algebraic when its Hodge group is the full special unitary group. The proof starts from Galois covers of the projective line with monodromy group W(E8)⋅μ4W(E_8)\cdot\mu_4, branched over twelve points: the multiplicity space of the natural representation in the cohomology of such a cover is the first cohomology of an abelian sixfold of Weil type, and a certified rank computation at one explicit cover shows that these sixfolds fill an open set of the nine-dimensional moduli space. Algebraic cycles reach these sixfolds through Milne's theorem on Lefschetz classes, from two sources: Schoen's cycles on cyclic covers, which a computer search shows do not suffice here, and products of determinant lines of characters on abelian covers of curves. For the second source we prove a general theorem (Theorem C): if such a product is of Hodge type at every Galois conjugate, and each of the cyclic covers involved has at least two branch points and order dividing 1212 after removing the common factor of its branch exponents, then the product spans a space of algebraic classes. Its proof runs Schoen's symmetric-product construction on each factor, localises at a special fibre, transfers to a product of Fermat hypersurfaces, and applies Shioda's theorem on products of Fermat varieties. This version is archived on Zenodo: https://doi.org/10.5281/zenodo.23566607; its computational certificates: https://doi.org/10.5281/zenodo.23549514

Primarily AI-generated textHuman understanding: some partsFermat varietiesHodge conjecturePrym-Tyurin varietiesWeil classesabelian coversabelian varieties of Weil type

math.GT — Geometric Topology

The bridge index and the nonorientable four-genus of knots with at most thirteen crossings

Contributed by Deep Bhattacharjee

We determine two invariants for knots that the KnotInfo database leaves open. KnotInfo lists the bridge index of \btotal{} prime knots with thirteen crossings as either 33 or 44; we prove that \bclosed{} of them have bridge index and meridional rank 44, so the meridional rank conjecture holds for them. The lower bound comes from representations of the knot group in $\GL_4(\F_q)$ that send a meridian to a transvection or a reflection and fix no nonzero vector. KnotInfo leaves the smooth nonorientable four-genus open for \ntotal{} prime knots with eleven to thirteen crossings; we determine it for \nsettled{} of them and narrow the interval for \nnarrowed{} more. Upper bounds come from pinch moves, lower bounds from the Goeritz-lattice obstructions of Jabuka and Kelly evaluated by an exhaustive search for lattice embeddings. Every bound is a certificate checked by a program independent of the search that found it.

A mix of human-written and AI-generated textHuman understanding: some partsDonaldson diagonalisationGoeritz latticesKnotInfobridge indexmeridional ranknonorientable four-genuspinch movestransvections

math.CO — Combinatorics

Even-intersecting families of lattice paths and the Catalan numbers

Contributed by Deep Bhattacharjee

Shankar proved that a family of North--East lattice paths from (0,0)(0,0) to (n,n)(n,n) in which any two paths share an even number of edges has at most 2n2^n members, and conjectured that exactly CnC_n families attain this bound, where CnC_n is the nnth Catalan number. We prove the conjecture. The proof determines all equality cases of the inequality behind Shankar's bound: they correspond to noncrossing partial matchings of {1,…,m}\{1,\dots,m\} whose unmatched points lie under no arc, and there are (m⌊m/2⌋)\binom{m}{\lfloor m/2\rfloor} of them.

A mix of human-written and AI-generated textHuman understanding: some partsCatalan numbersEventown theoremeven intersectionslattice pathsnoncrossing matchings

math.CO — Combinatorics

The minimum number of distinct abelian squares in a binary circular word

Contributed by Deep Bhattacharjee

We prove that every binary circular word of length nn contains at least $\fl{(n-1)/2}$ distinct abelian squares, and we determine all words attaining this bound. This settles a conjecture of Simpson: its odd case holds, and in its even case the list of extremal words misses (ab)n/2(ab)^{n/2} for n≡2(mod4)n\equiv 2\pmod 4, n≥6n\ge 6.

A mix of human-written and AI-generated textHuman understanding: some partsParikh vectorabelian squarecircular wordcombinatorics on words

math.NT — Number Theory

The Welch function is not third-order sum-free

Contributed by Deep Bhattacharjee

Let n=2m+1n=2m+1. Hou and Zhao conjectured that for n≥7n\ge7 the Welch function X2m+3X^{2^m+3} on $\F_{2^n}$ sums to zero over some three-dimensional affine subspace, that is, it is not third-order sum-free. We prove this. The proof counts exactly the elements xx for which some subspace spanned by 11, xx and a third element gives a zero sum: there are (2n+1−3Kn)/4(2^n+1-3K_n)/4 of them, where KnK_n is a binary Kloosterman sum.

A mix of human-written and AI-generated textHuman understanding: some partsKloosterman sumsWelch functionalmost perfect nonlinear functionslinearized polynomialssum-free functions

math-ph — Mathematical Physics

Supersymmetric Yang--Mills theories with several times reduce to ten dimensions

Contributed by Deep Bhattacharjee

Supersymmetric Yang--Mills theories in signatures with several times are built by restricting the gaugino to the kernel of kk mutually orthogonal null vectors and letting the supersymmetry close on translations contracted with their product. We prove that every theory of this kind, defined by five axioms that Nishino's construction satisfies, has residual dimension s+t−2ks+t-2k equal to ten (or to two, a degenerate case), and that its null vectors can be real only if k≤min⁡(s,t)k\le\min(s,t). The cubic fermion terms reduce to a Fierz identity on the residual spinors, and that identity forces the dimension of the spinors to be 2(d−2)2(d-2) on a dd-dimensional vector space, which happens only for d=3,4,6,10d=3,4,6,10. With Majorana--Weyl spinors the signature must therefore satisfy s−t∈{8,0,−8}s-t\in\{8,0,-8\}. There is no such theory in (9+8n)+1(9+8n)+1, (10+8n)+2(10+8n)+2, (11+8n)+3(11+8n)+3 or (12+8n)+4(12+8n)+4 for n≥1n\ge1, although it has been claimed that the existence proofs for the signatures (9+m)+(1+m)(9+m)+(1+m) carry over to these; the signatures 27+327+3 and 19+319+3 are among those excluded. For a single time the result does not depend on the construction: in (9+8n)+1(9+8n)+1 with n≥1n\ge1 every massless multiplet without tensor charges has at least 222+4n2^{2^{2+4n}} states, so a unitary theory with no tensor charges on its massless states has no massless vector multiplet.

A mix of human-written and AI-generated textHuman understanding: some partsFierz identityMajorana-Weyl spinorsdivision algebrasnull projectionsignatures with several timessupersymmetric Yang-Mills theory

math.MP — Mathematical Physics

Gluing defects for projected coarse graining in finite spin-foam models

Contributed by Zhenyu Sun

Orthogonal truncation can discard states that contribute to a later boundary amplitude. For a self-adjoint contraction TT on a finite-dimensional Hilbert space and an isometric inclusion ss of retained states, we prove that the two-step residual Δ=s∗T2s−(s∗Ts)2\Delta=s^*T^2s-(s^*Ts)^2 controls every finite placement of intermediate projections in every Schatten norm. For blocks of lengths n1,…,nkn_1,\ldots,n_k, the error is at most ∑i<jninj∥Δ∥\sum_{i<j}n_in_j\|\Delta\|, and the constant is optimal even for positive contractions. The residual vanishes exactly when the retained subspace is invariant. Two-dimensional finite-group gauge sums realize an idempotent projected transfer operator with nonzero residual, as well as positive-semidefinite transfer operators with identical one-step retained data and different residuals. We derive their gluing and subdivision identities with explicit boundary measures and BF normalization. We also bound the accumulation of local errors under tensor contraction and the distance to compatible linear amplitude data. Colimits extend compatible amplitude families, and quotients by invariant subspaces preserve the comparison maps. A measurement map that is injective on the retained ansatz gives a unique normalized least-squares fit. Exact rational calculations reproduce the finite-group examples and the blocking comparisons.

Primarily human-written textHuman understanding: all partscoarse grainingcylindrical consistencyfinite gauge theoryspin foamstensor gluingtruncation error

math.NT — Number Theory

A truncated theta-type series with triangular weights

Contributed by Manjil Saikia

Merca (2026) recently introduced the two-block odd partition function a(n)a(n), proved that its generating function factors as A(q)=P(q)S(q)A(q)=P(q)S(q), where P(q)P(q) is the generating function of partitions whose odd parts are distinct and whose even parts are unrestricted and S(q)S(q) is a theta-type series with triangular-number weights, and conjectured that for N≡1,2(mod4)N\equiv1,2\pmod 4 the truncation P(q)SN(q)P(q)S_N(q) of this product has nonnegative coefficients, positive from q3q^{3} onward. We prove the conjecture in the stronger form $P(q)S_N(q)-A(q)\in\NN[[q]]$.

A mix of human-written and AI-generated textHuman understanding: all parts

math.GM — General Mathematics

Arithmetic of Jacobi polynomials

Contributed by Khai Hoan Nguyen Dang

We study the arithmetic of Jacobi polynomials. As applications, we prove the Mahlburg--Ono conjecture on the irreducibility and Galois groups of the four Kaneko--Zagier families, and the Cullinan--Hajir conjecture on the Galois groups of Legendre polynomials. Other applications concern common zeros of Jacobi polynomials, harmonic functions on cones, and hyperelliptic Jacobians.

A mix of human-written and AI-generated textHuman understanding: some partsJacobi polynomialKaneko--Zagier polynomialLegendre polynomial

math.DS — Dynamical Systems

Finiteness of Planar Central Configurations for Five Positive Masses

Contributed by Chih-Yao Wu

We prove that, for any five positive masses, there are finitely many planar Newtonian central configurations up to translations, rotations, and positive scaling. Building on the singular-diagram framework of Albouy and Kaloshin, we treat the exceptional masses left open by their finiteness theorem. The proof retains a lower bound for the physical potential after passing to the complex algebraic equations. On each fixed potential level, energy estimates, torque identities, and local response calculations control the possible degenerations. A polynomial selection argument then yields finiteness. The exceptional local calculations and their algebraic certificates are given explicitly. A separate Lean development accompanies the proof.

Primarily AI-generated textHuman understanding: some partsLeanSmale sixth problemcelestial mechanicscentral configurationsfive-body problemformal verification

math.NT — Number Theory

Exceptional zeros of Hecke LL-functions

Contributed by Christopher Frei, Wataru Kai

We prove that Hecke LL-functions have no exceptional zeros. We do so by generalising a variant due to Kerr of the proof by OpenAI in the case of Dirichlet LL-functions.

Primarily human-written textHuman understanding: all partsLandau--Siegel zerosexceptional zeros

math.AC — Commutative Algebra

Nonexistence of lim Cohen–Macaulay modules following [Che26] and [Ang26]

Contributed by Andy Jiang

Using the inequality stated in [ Che26, Main Claim 1.1], we prove nonexistence of lim Cohen–Macaulay sequences for the completed section rings of smooth projective surfaces over C with an ample globally generated divisor H satisfying KY ≡ 4H and 15H2/8 > χ(OY ). Such a pair is exhibited in [Ang26, Corollary 4.3], with H2 = 1080 and χ(OY ) = 1926. For a complete local domain (R, m) with ℓRHj m(R) < ∞ for 0 ≤ j < dim R, we prove that a lim Cohen–Macaulay sequence in the sense of Bhatt, Hochster, and Ma [ BHM26 ] exists if and only if a lim Γm-Cohen–Macaulay sequence exists (Definition 1.1). These may be different sequences. Chen’s geometric inequality [Che26, Main Claim 1.1] obstructs lim Γm-Cohen–Macaulay sequences over the completed section rings above. The comparison therefore rules out lim Cohen–Macaulay sequences over those rings.

Primarily AI-generated textHuman understanding: some parts

math.LO — Logic

Ramsey’s Theorem for Pairs in Pincus’s Model XI

Contributed by Frank Gilson

Howard and Rubin record Pincus’s ordered colored permutation model as N48, but do not determine whether Ramsey’s theorem for pairs holds there. We prove that N48 |= RT for pairs. The proof uses least finite supports and the homogeneity of Pincus’s ordered colored structure: after fixing all but one point of a support, the remaining point generates an infinite orbit whose unordered pairs form a single stabilizer orbit. Combining this with Pincus’s results on the dense linear ordering principle (DO), the Boolean Prime Ideal Theorem (BPI), and the failure of Part∞, together with Pincus’s transfer theorems, yields Con(ZF) ⇒ Con(ZF + RT_pairs + DO + BPI + ¬Part∞), where Part∞ states that every infinite set is the disjoint union of infinitely many infinite sets.

A mix of human-written and AI-generated textHuman understanding: some partsaxiom of choice; Ramsey's theorem

math.NT — Number Theory

Non-Archimedean Smale Mean Value and Dubinin–Sugawa Dual Mean Value Problems

Contributed by K. MAHESH KRISHNA

Motivated by the Smale mean value and the Dubinin–Sugawa dual mean value theorems, we formulate non-Archimedean Smale mean value and Dubinin–Sugawa dual mean value problems. We show that if a universal constant satisfying the non-Archimedean Smale mean value problem exists, it must be greater than or equal to one and if a universal constant satisfying the non-Archimedean Dubinin–Sugawa dual mean value problem exists, it must be less than or equal to one. We also derive other bounds whenever roots of unity exist in a non-Archimedean field.

Primarily human-written textHuman understanding: all partsDubinin-Sugawa dual mean value theoremNon-Archimedean field.Smale mean value theorem

math.CO — Combinatorics

Asymptotically optimal degree for the double Hall property

Contributed by John Tripodo

The minimum maximum degree for the double Hall property is asymptotic to sqrt(2 n). Deterministic balanced regular bipartite constructions attain this leading constant with the property on both shores and degree at most sqrt(2 n)+O(n^(21/80)) for every sufficiently large n. The construction repairs homology semibiplanes, pads by matched duplication, and completes to regularity. The all-order error term invokes the published Baker-Harman-Pintz prime-interval theorem; the formal transfer keeps that input as an explicit hypothesis.

Primarily AI-generated textHuman understanding: no parts

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

math.CO — Combinatorics

Two conjectures of Wormald on Hamilton cycles in tournaments

Contributed by Deep Bhattacharjee

For a regular tournament on dd vertices with skew adjacency matrix SS, the Hessian determinant HH that Wormald attached to its random blow-ups equals ddet⁡(d2I+S2)/det⁡(d2I−S2)d\det(d^2I+S^2)/\det(d^2I-S^2). Hence H≠0H\neq0 and d/Hd/H is the square of a rational number, as Wormald conjectured. For the cyclic tournament it gives 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), so the associated constants tend to cosh⁡1/cos⁡1=2.8559578925…\cosh 1/\cos 1=2.8559578925\ldots; this proves a second conjecture of Wormald and identifies his numerical constant.

A mix of human-written and AI-generated textHuman understanding: some partsHamilton cycleHessian determinantformal verificationrandom blow-upskew-symmetric matrixtournament

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

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

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

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

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

math.NT — Number Theory

Lehmer's totient problem with fewer than sixteen prime factors

Contributed by Deep Bhattacharjee

A composite number nn whose totient divides n−1n-1 was known to have at least fourteen prime factors. We prove that it has at least sixteen, at least 1600116001 if (n−1)/φ(n)≥3(n-1)/\varphi(n)\ge3, and more than 10810^8 if 3∣n3\mid n, and that n<22k−7n<2^{2^{k-7}} if nn has kk prime factors. For the companion equation φ(n)∣n+1\varphi(n)\mid n+1 we show that the nine known solutions are the only ones with at most eight prime factors, and that a further solution prime to 33 has at least sixteen. Each statement is reduced by hand to a finite computation, which independent programs carry out. Lehmer's conjecture remains open, and we state the assertion that would settle it.

A mix of human-written and AI-generated textHuman understanding: some partsCarmichael numbersEuler's totient functionFermat primesLehmer's totient problemlarge sieve

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

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) = ∑ₚ p⁻ˢ has zeros in its half-plane of absolute convergence. Belovas, Čepaitytė and Sabaliauskas proved that P(s) ≠ 0 for Re(s) > σₚ = 1.7795446535…, where σₚ solves P(σ) = 2¹⁻σ. We show that this bound is sharp: the closure of the real parts of the zeros in Re(s) > 1 is exactly [1, σₚ]. There are no zeros on Re(s) = σₚ, while zeros occur arbitrarily close to every line Re(s) = σ with 1 < σ < σₚ (Bohr’s method). By Jessen’s theorem, the density of real parts is J″(σ)/(2π), where J(σ) = −σ log 2 + 𝔼[log⁺(2^σ |Yσ|)], Yσ = ∑ₚ≥₃ p⁻σ eⁱθₚ, and the phases θₚ are independent and uniformly distributed. The function J is smooth, σₚ = inf{σ : J(σ) + σ log 2 = 0}, and the density vanishes at σₚ faster than any power. The argument principle, implemented with ball arithmetic, certifies exactly 68 zeros with 1.1 ≤ Re(s) ≤ 1.85 below height 2000 (70.0 predicted), and 12 zeros with Re(s) ≥ 1.5 below height 5000 (12.0 predicted). A heuristic large-deviation extrapolation predicts zeros with real part above 1.7 approximately once every 6 × 10⁶ units of height. In ½ < Re(s) < 1, P is single-valued on the half-plane with (½, 1] removed if and only if the Riemann hypothesis holds (a reformulation of a classical equivalence). Its zeros are canonical below height 3 × 10¹² and solve ζ(s) = exp(A(s)), A(s) = ∑ₘ≥₂ P(ms)/m, with |P(s)| < 2π. Below height 600, their counts for Re(s) ≥ 0.7 agree numerically with the random model. The zeros arise from cancellations between 2⁻ˢ and the contributions of the remaining primes, the prime-sum analogue of Euler-product interference behind the off-line zeros of the Davenport–Heilbronn function. We do not prove the Riemann hypothesis.

A mix of human-written and AI-generated textHuman understanding: all partsC2 FunctionDirichlet SumsRiemann Zeta Function

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

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

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

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

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

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

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.

Primarily AI-generated textHuman understanding: all partsenriched categorieslanguage modelsmagnitude homologyprefix posets

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

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

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

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

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

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

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

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

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