Browse

All works

Browse the Hexagon catalog.

Newest works

1152 works

math.FA — Functional Analysis

Spectral measures for subfactors and Lie groups

Contributed by Cédric ARHANCET

We compute the rooted laws of four small-index principal graphs. For a unitary fusion category we express the rooted law of the canonical Lagrangian inclusion in terms of formal codegrees. This explains why two Haagerup extensions have the same moments. We determine when the signed measures of the Deligne--de Man interpolation have positive support and nonnegative cumulative functions for all weights. For the adjoint tensor square, the second and fourth heat derivatives determine the simple Lie type. For the nn-th tensor power, we prove an expansion in 1n\frac1n, with two correction terms after the leading factor, of the Laplace transform of the Casimir law at time sn\frac sn. The second correction is an explicit function of the dimension and of the squared norm, divided by the dimension, of the symmetrized quartic trace tensor, affine in the latter.

Author comments: C\'edric Arhancet

Primarily AI-generated textHuman understanding: some partsCasimir operatorDrinfeld centerSubfactorexceptional seriesformal codegreeheat semigroupprincipal graphspectral measurespectral shift
Nov 18, 202657 pages
PDFView work

math.NT — Number Theory

The rational points of the non-split Cartan modular curve of level 25

Contributed by Manvir Jaswal

We prove that the modular curve Xns+(25)X_{\mathrm{ns}}^{+}(25) of the normalizer of a non-split Cartan subgroup of level 25, of genus 14 and Jacobian rank 14, has exactly nine rational points, all of them CM. This is the level 25 case of a conjecture of Rouse, Sutherland and Zureick-Brown, and with their theorem it determines the 5-adic images of Galois of elliptic curves over Q\mathbb{Q} without complex multiplication. A descent by the modular units of the curve, using no information on the Mordell–Weil group, places every rational point in the residue disc of a CM point at the prime 1151. Quadratic Chabauty at 1151, with two correspondences that change only the level structure, then shows that each of these discs holds one rational point. The local term at 5 of these correspondences vanishes, by a formula of Betts and Dogra, because their eigenvalues lie in 5 Q\sqrt5\,\mathbb{Q}, and the height pairing is fixed by the nine CM points alone.

Primarily AI-generated textHuman understanding: no partsGalois images of elliptic curvesKummer descentNon-split Cartan modular curvesmodular unitsp-adic heightsquadratic Chabauty
Nov 18, 202625 pages
PDFView work

math.CA — Classical Analysis and ODEs

Sup-norm stability radii for a nodal face of the B3B_3 spherical discriminant

Contributed by Oleksiy Babanskyy

How large can a real perturbation be before a nodal line ceases to be a single graph in a fixed spherical sector? We study a truncated face of the degree-nine B3B_3 discriminant, allowing all 100 real spherical polynomial modes of degree at most nine and measuring the supremum norm on the entire closed tube. The failure radius equals the minimum cost of cancelling the field and its normal derivative. We bound it on the full parameter domain and determine it exactly in two sufficient regimes, using an explicit atomic mixed-jet certificate on the sphere. In these exact regimes the unique critical field is a scaled Chebyshev polynomial, and the whole closed radius ball still preserves the graph, although the critical zero level is singular; every larger amplification of that field fails. Two continuous examples separate the limits of a support criterion from those of the radius formula. Below the radius we obtain quantitative graph bounds. In the exact regimes a smooth family approaching the critical field from inside the ball has uniformly convergent graphs and terminal slopes diverging as ε−1/3\varepsilon^{-1/3} at the minimizing terminals. Persistence and C1C^1 conditioning therefore separate.

Author comments: 33 pages, two figures. Manuscript sources and reproducible companion, edition 1.0.1: https://github.com/aconsciousfractal/B3-Nodal-Stability-Radii/tree/f9cfcb9b3162cdf3724e609fcaecbeedc3cce45e

Primarily AI-generated textHuman understanding: no partsBernstein inequalitiesChebyshev polynomialsnodal setsspherical polynomialsstability radii
Nov 18, 202633 pages
PDFView work

math.AC — Commutative Algebra

Cluster monomials and finite type

Contributed by Jason Turner

Let A be a cluster algebra of geometric type with a full-column-rank extended exchange matrix. We prove that A is of finite type if and only if its cluster monomials form a basis over the integral Laurent coefficient ring. Finite type is also equivalent to every universally nonnegative element having a unique expansion as a finite linear combination of cluster monomials with nonnegative Laurent coefficients. In infinite type, we exhibit a universally nonnegative product of positive powers of two cluster variables that lies outside the span of the cluster monomials over the coefficient ring.

Primarily AI-generated textHuman understanding: some parts
Nov 18, 20264 pages
PDFView work

math.MG — Metric Geometry

Convex-body volume counterexamples: Convex-body volume counterexamples to hyperplane equipartition

Contributed by Sihan Chen

For every d≥4d\ge4 and every ellipsoid in Rd\R^d, we construct real-analytic convex bodies of positive curvature, converging smoothly to that ellipsoid and having the same volume, whose volume admits no equipartition by dd affine hyperplanes. For d≥6d\ge6, the bodies can be chosen centrally symmetric. The four-dimensional construction uses Sober\'on's cubic--quartic tensor nonvanishing theorem. We prove a boundary-perturbation criterion that realizes this obstruction for the uniform volume of a convex body; higher-dimensional examples follow from a finite-dimensional transversality argument. We also construct counterexamples to orthogonal equipartition near every ellipsoid with distinct semiaxes in dimensions d≥3d\ge3, with central symmetry when d≥4d\ge4. The counterexample property is open in the Hausdorff topology, giving polytopal examples as well.

Primarily AI-generated textHuman understanding: some partsGr\"unbaum problemHyperplane equipartitionconvex bodyorthogonal hyperplanesradial perturbationuniform volume
Nov 18, 202610 pages
PDFView work

math.AG — Algebraic Geometry

Plane Algebraic Curve Families from Normalized Zeta Series: Prime-Base Extensions and Composite Breakdown

Contributed by Ryan Hackbarth

In a companion study of Euler's alternating series η(s)=(1−21−s)ζ(s)\eta(s) = (1 - 2^{1-s})\zeta(s), distributing the prefactor across individual summands tn(s)=(−1)n−1(1−21−s)−1n−st_n(s) = (-1)^{n-1}(1 - 2^{1-s})^{-1}n^{-s} exposed two distinct families of plane curves along vertical lines s=a+ibs = a + ib in the critical strip. On the critical line Re⁡(s)=12\operatorname{Re}(s) = \frac{1}{2}, the pure powers t2k(12+ib)t_{2^k}(\frac{1}{2} + ib) trace an infinite hierarchy of closed, irreducible plane algebraic curves of degree 2k2k in Z[x,y]\mathbb{Z}[x, y] whose enclosed signed areas sum to zero, whereas weighting non-power terms by (1−2−s)(1 - 2^{-s}) yields concentric circles centered at (0,0)(0, 0) uniquely at a=12a = \frac{1}{2} and open, precessing rosettes for a≠12a \neq \frac{1}{2}. This sequel investigates whether the emergence of these curve families is specific to base 22 or extends to general integer normalizations ηq(s)=(1−q1−s)ζ(s)\eta_q(s) = (1 - q^{1-s})\zeta(s) for q≥2q \ge 2. We show that every prime base pp generates an analogous two-family structure: the pure-power terms tp,pk(12+ib)t_{p,p^k}(\frac{1}{2} + ib) form irreducible degree-2k2k algebraic curves over Z\mathbb{Z} governed by a two-step polynomial recurrence, a Blaschke-involution elliptic perimeter integral, and a zero-sum signed-area law; their seed quartics tp,p2(12+ib)t_{p,p^2}(\frac{1}{2} + ib) evolve geometrically from figure-eights (p=2,3p = 2, 3) to teardrops and asymptotically circular ovals (p≥5p \ge 5) while retaining degree-44 integer structure; their rational equations in Q[x,y]\mathbb{Q}[x, y] uniquely single out a=12a = \frac{1}{2} among rational abscissas a∈(0,1)∩Qa \in (0, 1) \cap \mathbb{Q}; and all paired non-power curves (n≠pkn \neq p^k) transition from concentric circles of radius Rp,n=∣cp(n)∣/pn\mathcal{R}_{p,n} = |c_p(n)|/\sqrt{pn} on a=12a = \frac{1}{2} to two-dimensional rosettes off it. When qq is composite, however, this classification fractures. Proper prime powers q=pmq = p^m (m≥2m \ge 2) produce rational algebraic curves on 2m−12m - 1 vertical lines a=r2ma = \frac{r}{2m} and create a hybrid third family of resonant sub-powers pjp^j (m∤jm \nmid j) that remain closed algebraic loops off Re⁡(s)=12\operatorname{Re}(s) = \frac{1}{2}, while multi-prime composites fail to gather their prime divisors into algebraic towers and break the multiplicative structure of Euler's product.

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

math.MG — Metric Geometry

A Universal Square-Root-of-Six Bound for Kissing Numbers

Contributed by Sebastien Palcoux

The least positive number α\alpha for which the Euclidean kissing numbers satisfy τn≤αn\tau_n\leq\alpha^n in every positive dimension is 6\sqrt{6}. We show how this follows from a classical spherical-cap estimate and known low-dimensional bounds, then give two elementary proofs that require no tables of kissing numbers. A recurrence for cap areas gives strict inequality in every dimension except two. A second proof packs explicit bodies of revolution into the unit ball. The Lean 4/Mathlib certificate registered in Palomar uses this volume construction to prove the universal bound, the planar value τ2=6\tau_2=6, and the optimality of the base.

Author comments: 6 pages. Includes the deduction from classical spherical-cap bounds, the original subfactor motivation, and an elementary proof that equality occurs only in dimension two. The volume proof uses the same four-dimensional body as the registered Lean certificate, with a shorter estimate for its volume.

Primarily AI-generated textHuman understanding: some partsDiscrete geometryKissing numbersLean 4Sphere packingformal verificationspherical capsspherical codes
Nov 18, 20266 pages
PDFView work

math.LO — Logic

Relative independence of the simultaneous chromatic number at ℵ₁

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Let QQ assert that every graph of chromatic number ℵ1\aleph_1 admits an edge coloring with palette ω1\omega_1 such that every countable partition of its vertices has a part whose induced edges realize the whole palette. Hajnal and Komjáth proved the relative consistency of QQ by adding a Cohen real. We prove the relative consistency of ¬Q\neg Q from one Woodin cardinal. In the negative model a single graph of chromatic number ℵ1\aleph_1 has the stronger property that every binary edge coloring admits a countable partition into parts with monochromatic induced edges.

Primarily AI-generated textHuman understanding: no partsErdős problemsaturated idealssimultaneous chromatic numberstationary sets
Nov 18, 20265 pages
PDFView work

math.LO — Logic

A finite-color partition relation for ω₁²

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We prove in ZFC that ω12⟶(ω1⋅ω,3,…,3⏟k)k+12\omega_1^2 \longrightarrow (\omega_1\cdot\omega,\underbrace{3,\ldots,3}_{k})^2_{k+1} for k<ωk<\omega, answering Erdős problem 1171. Under a Baire category hypothesis, a branch through a countable tree of reservoirs enables an induction on the positive colors. We then show that Cohen forcing supplies the category hypothesis and that a homogeneous set of order type ω1⋅ω\omega_1\cdot\omega in a ground-model coloring reflects to the ground model.

Primarily AI-generated textHuman understanding: no partsBaire categoryCohen forcingOrdinal partition relationsRamsey theory
Nov 18, 20266 pages
PDFView work

math.CV — Complex Variables

The sharp constant in the Erdős maximum-term problem

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

For a transcendental entire function ff, let μ(r,f)\mu(r,f) be its maximum term and M(r,f)M(r,f) its maximum modulus. We determine the supremum of lim inf⁡r→∞μ(r,f)/M(r,f)\liminf_{r\to\infty}\mu(r,f)/M(r,f) as the reciprocal of the minimum circle norm in the He–Tang theta family. The minimum is characterized by a unique solution of three real equations, and the supremum is attained. The proof combines coefficient transport at radii where two terms tie, a classification of the resulting gap sequences, and a uniform quadratic comparison for arithmetic gaps. The local comparisons use exact finite arithmetic.

Primarily AI-generated textHuman understanding: no partsMaximum termentire functionexposed indicestheta series
Nov 18, 202627 pages
PDFView work

math.CO — Combinatorics

Anti-concentration of the chromatic number of a dense random graph

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

For Gn∼G(n,1/2)G_n\sim G(n,1/2) and each fixed 0<d<1/40<d<1/4, we obtain that the supremum over intervals of radius ndn^d of the probability that χ(Gn)\chi(G_n) lies in the interval tends to zero. This implies the failure of concentration on any fixed number of possible values and gives the eventual strict half-mass bound asked for in Erdős Problem 1156. The proof treats different supplies of large independent sets by matching sums and by one- and two-count Gaussian comparisons.

Primarily AI-generated textHuman understanding: no partsChromatic numberRandom graphsanti-concentrationindependent sets
Nov 18, 202616 pages
PDFView work

math.NT — Number Theory

Sharp growth and gap exponents for admissible sequences

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

An increasing sequence of positive integers is admissible if any two finite subsets with the same sum have the same cardinality. We solve the growth and consecutive-gap questions of Deshouillers and Erdős. The least possible exponent in an eventual polynomial bound on the nn-th term is 2+222+2\sqrt 2. The least possible consecutive-gap exponent is (5+17)/2(5+\sqrt{17})/2. Both endpoints are attained with little-oo bounds, and the endpoint gap bound holds with coefficient one at every index. We also determine the tradeoff when both bounds are imposed on the same sequence. The lower bounds use subset-sum counts, a restricted-sum progression theorem, and an elementary large-gap lemma. The upper bounds use an induction on congruences of signed subset sums.

Primarily AI-generated textHuman understanding: no partsErdős problemadmissible setsgeneralized arithmetic progressionssubset sums
Nov 18, 20268 pages
PDFView work

math.MP — Mathematical Physics

Uniform Spectral Gap for the AKLT Model on the Square Lattice

Contributed by P. M. Aronow, Patrick Lopatto

We prove that the spin-22 AKLT Hamiltonian on the square-lattice torus has a unique ground state and a spectral gap bounded below uniformly when both side lengths are sufficiently large, as expected since the work of Affleck, Kennedy, Lieb, and Tasaki. We also prove uniqueness of the infinite-volume frustration-free state on the square lattice. We first bound the quantum gap from below by the spectral gap of a classical block dynamics for the measure that the valence-bond-solid state defines in spin coherent states. We bound the latter through the coupling argument of Martinelli, Olivieri, and Schonmann, whose input we derive from the exponential decay of responses of pair correlations to boundary conditions. We prove this decay by an expansion into bond-self-avoiding walks, comparing the expansions with and without boundary conditions walk by walk, and closing the resulting inequality as a contraction. The proof is computer-assisted. Its local and combinatorial inputs are verified in exact integer arithmetic and in floating-point arithmetic with directed rounding.

Primarily AI-generated textHuman understanding: no parts
Nov 18, 2026147 pages
PDFView work

math.NT — Number Theory

GPF-Tribonacci sequences admit no uniform linear bound

Contributed by Ryuya Hora

A GPF-Tribonacci sequence is a sequence of primes in which every term is the greatest prime factor of the sum of the three preceding terms. Back and Caragiu asked whether there is a constant LL such that every term of every such sequence is at most LL times the largest of its three initial terms. We show that the answer is no. For every C>0C>0 we show that there are GPF-Tribonacci sequences, starting from three distinct and arbitrarily large primes, in which three consecutive terms are all larger than CC times the largest initial term. This happens after O(log⁡C)O(\log C) steps. In the proof we prescribe the quotient of the sum of three consecutive terms by the next term. These quotients follow the periodic pattern 1,3,51,3,5. Then we apply the theorem of Green, Tao and Ziegler on linear equations in primes. The conjecture of Back and Caragiu that every GPF-Tribonacci sequence is ultimately periodic remains open.

Primarily AI-generated textHuman understanding: some partsGPF sequenceTribonacci recurrencegreatest prime factorlinear equations in primes
Nov 18, 20269 pages
PDFView work

math.AP — Analysis of PDEs

An infinite cascade for the defocusing cubic nonlinear Schrödinger equation on the square torus

Contributed by Xi Chen

We prove that the defocusing cubic nonlinear Schrödinger equation on the square torus has a global solution whose H6/5H^{6/5} norm tends to infinity. This result resolves a conjecture posed by Bourgain. In a weaker Sobolev topology the same solution approaches a horizontal almost periodic motion. We choose a one-dimensional invariant torus whose spatial mean has a nonzero stationary component in the mass gauge. This component couples pairs of high-frequency waves with orthogonal wave vectors. We arrange finitely many such interactions so that energy passes to horizontal modes, then realize the transfer along an exact trajectory in the stable manifold of a larger horizontal torus. A comparison in two Sobolev norms allows successive transfers to preserve the growth already attained at earlier times.

A mix of human-written and AI-generated textHuman understanding: some parts
Nov 18, 202640 pages
PDFView work

math.NT — Number Theory

An Averaged Iwasawa Approach to Mordell over Q

Contributed by Jit Wu Yap

We give a new proof of the Mordell conjecture over the rational numbers via the Chabuty-Kim method.

Author comments: The paper here was obtained by prompting GPT Astra 6 back in September. It was then sent to experts in the community for them to digest.

Primarily AI-generated textHuman understanding: some parts
Nov 18, 202626 pages
PDFView work

quant-ph — Quantum Physics

Hybrid Quantum Algorithms for Summary Statistics of Nonlinear PDEs with Random Initial Data

Contributed by Soo-Jong Rey

I develop a hybrid classical--quantum algorithm for summary statistics of nonlinear PDEs with Gaussian random initial data. Perturbative expansion and Wick's theorem reduce ensemble averages to deterministic momentum and time integrals. Classical interpolation and quantum amplitude estimation then evaluate these integrals with improved accuracy dependence for sufficiently smooth integrands, without quantum random-access memory. I apply the method to the Einstein--de Sitter Euler--Poisson perturbation theory developed by Goroff, Grinstein, Rey, and Wise. For the one-loop matter power spectrum, I establish the integrand regularity required by the algorithm under specified assumptions on the initial spectrum. Cubic nonlinear Schrodinger evolution provides a comparison involving resonances and diagram cancellations. I account separately for preprocessing and circuit costs.

Author comments: 69 pages+1 illustration

Primarily human-written textHuman understanding: all partsquantum algorithms
Nov 18, 202669 pages
PDFView work

math-ph — Mathematical Physics

Schwinger–Strebel measures for planar four-point correlators

Contributed by Zhenyu Sun

The inverse-Schwinger construction associates finite positive measures on decorated moduli space to connected planar correlators of a free Hermitian matrix scalar. We determine their Lebesgue decomposition after integrating the perimeter variables in the four-point case. The reduced normal-ordered skeletons comprise ten multigraph types and 115115 oriented cells with fixed vertex labels. The path and four-cycle types have projection rank one; all other types have rank two almost everywhere. For a nonzero correlator, a singular component exists precisely when the operator degrees admit a two-against-two balance. The only purely singular degree multisets are {1,1,2,2}\{1,1,2,2\} and {2,2,2,2}\{2,2,2,2\}. At equal degree k≥2k\geq2, exact mass formulas give the sharp lower bound 3/(k+1)3/(k+1) for the singular fraction, a quantitative stability estimate, and fixed-ratio and near-symmetric large-degree limits. We derive square and path marginal densities, including a uniform inverse-cross-ratio law at unit square shapes and a common rate, and the exact path endpoint exponents. The square density is finite and jointly smooth for all positive shapes and rates. For maximal nn-point cells, a nondegenerate period system on the canonical cover of genus n−3n-3 proves that the projections are submersions everywhere and yields a perimeter-simplex density formula. Admissible gamma-shape contractions converge weakly and admit a compensated first variation under a local Hölder condition on test-function pullbacks.

Author comments: 48 pages. Computational scripts and data are included in the ancillary files.

A mix of human-written and AI-generated textHuman understanding: some partsLebesgue decompositionSchwinger parametrizationStrebel differentialsmoduli spacesplanar correlatorsribbon graphs
Nov 18, 202648 pages
PDFView work

math.CA — Classical Analysis and ODEs

Representation of Degrees of Convergence by Nonadditive Measures

Contributed by Paolo Leonetti

We characterize the functions that arise as degrees of convergence of sequences in metric spaces with respect to normalized capacities on N\mathbb{N}. More precisely, answering a question of Mi\v{s}\'{\i}k and T{\'o}th in [Fuzzy Sets and Systems \textbf{375} (2019), 179--190], we show that these functions are precisely the [0,1][0,1]-valued upper semicontinuous functions whose positive supports are separable. We obtain further characterizations when the representing capacities are required to be maxitive, subadditive, submodular, superadditive, supermodular, or countably subadditive, as well as for finitely and countably additive probability measures. Remarkably, representation by a normalized submeasure is equivalent to representation by the upper asymptotic density d⋆\mathsf{d}^\star. As a byproduct, if (X,d)(X,d) is an uncountable compact metric space, then a map f:X→[0,1]f:X\to [0,1] is upper semicontinuous if and only if there exists a sequence (xn)(x_n) in XX such that $$ f(x)=\inf_{\varepsilon> 0} \mathsf{d}^\star (\{n \in \mathbb{N}: d(x_n,x)<\varepsilon\}) \quad \text{ for all }x \in X. $$ We also characterize the pairs of upper and lower degrees that can be represented simultaneously by a single sequence, with a sharp distinction between countable compact metric spaces and the remaining metric spaces. Lastly, we characterize the existence of universal representing sequences, and investigate the comeagerness of the family of maldistributed sequences.

Primarily human-written textHuman understanding: all parts
Nov 18, 202638 pages
PDFView work

math.NT — Number Theory

The Tower Side of the DIC Audit: Semistable Towers, the Barrier κ≤13\kappa\le\frac13, and the Conductor--Discriminant Constant

Contributed by Zeng Chunping

For towers of curves XnX_n over a number field with a fixed bad-reduction set and gn→∞g_n\to\infty, we study the height--conductor ratio κn:=hF(Jac Xn)/log⁡cond(Jac Xn)\kappa_n:=h_F(\mathrm{Jac}\,X_n)/\log\mathrm{cond}(\mathrm{Jac}\,X_n) and the normalised quantity R=12κ−1−εar+O(f^−1)R=12\kappa-1-\varepsilon_{\mathrm{ar}}+O(\hat f^{-1}) of the companion preprint "The Height-Conductor Ratio on Curve Towers" (2610.00544v2). Three structural results are established. First, σn→1\sigma_n\to1 holds for every semistable tower satisfying the tower axioms, by the combinatorial bound rank L≤2g−3\mathrm{rank}\,L\le 2g-3 together with the Saito--Liu conductor--discriminant identity. Second, the barrier κ≤13\kappa\le\frac13 reduces to irreducible isogeny factors; the archimedean branch is closed by the unconditional Theorem 8.7 of 2610.00544v2, and the remaining input Rρ≤3R_\rho\le3 for general GL2\mathrm{GL}_2 and non-GL2\mathrm{GL}_2 towers is shown to be not derivable from the currently proved inputs, the obstruction being isolated in an explicit saturating model with R≡4R\equiv4, κ→512\kappa\to\frac{5}{12}. Third, the conductor--discriminant constant is not universal: inside the CM class it forms the continuum (q2+2q+3)/(q2−1)(q^2+2q+3)/(q^2-1), and the mixed-prime model upn+vqm=1u^{p^n}+v^{q^m}=1 contributes the new continuum [−2p−1,−2q−1][-\frac{2}{p-1},-\frac{2}{q-1}] with Λ(a)=0\Lambda^{(a)}=0 exactly. On the Fermat tower the normalisation f^n=(2n+1)log⁡p\hat f_n=(2n+1)\log p, the exact layer remainder unu_n, εar=−2w/(2n+1)+O(p−n/n)\varepsilon_{\mathrm{ar}}=-2w/(2n+1)+O(p^{-n}/n) and the closed form for RnR_n are derived by finite computation with a two-channel cross-check. The upper half of Problem 10.12 is closed inside the whole Kummer family; the single-curve interior realisation (I'b) and the general bound R≤3R\le3 (route II) remain open. The remaining Mumford-type danger class is then evaluated explicitly (rounds 78--88): the rank-three criterion and the alignment with arXiv:2406.19785 record five exact structures with three retractions; equality-case constructions are rigid; the finite-layer band is continuous with γ=4−32μ\gamma=4-\frac32\mu; the End0\mathrm{End}^0 MT-group classification leaves genus 4 as the sole survivor, realised by the explicit curve C7,tC_{7,t}; and all 58 degree-eight CM anchor fields of arXiv:2510.00093v2 are certified to have Galois group identifier 8T13, with 8T24 occurring zero times, closing the 8T24 path (Λ≡0\Lambda\equiv0) and the long-term search items. In the final rounds 89--100 the last-mile chain is run to its end: C7,tC_{7,t} is realised with explicit MT structure, CM companion and conductor formula, and the characteristic-two analysis strips the remaining finite layers 3,6,12,243,6,12,24, forcing tower exhaustion; a full literature-cut proof attempt of the characteristic is recorded and fails at an explicit sign barrier, leaving a conditional theorem with three propositions; the sign of γA\gamma_A is settled by a three-valued judgement (1274/12741274/1274 sample points positive), with δγ=48c/L=12δκ\delta_\gamma=48c/L=12\delta_\kappa; and the CM anchor double-point calibration reduces the surviving input of route (II) to the single sign ΔΦeff>0\Delta\Phi_{\mathrm{eff}}>0, with all 58 endpoints satisfying dΦ=n2d_\Phi=n^2. Route (II) remains open, conditioned on this single input. Nothing in this paper proves abcabc; Theorem A of the source texts is an external input and is not independently verified here.

A mix of human-written and AI-generated textHuman understanding: all partsBogomolov-Miyaoka-YauFaltings heightFermat towerabc conjecturearithmetic conductorcomplex multiplicationcurve towersheight-conductor ratioisogeny factorssemistable reduction
Nov 18, 2026183 pages
PDFView work

math.NT — Number Theory

The 2-adic valuation of the symmetric Prouhet-Tarry-Escott constant at sizes 13 and 15

Contributed by David Niedbala Giraudin

For symmetric ideal solutions of the Prouhet-Tarry-Escott problem of odd size n over the 2-adic integers, the associated constant C was known to satisfy v_2(C) >= 12 at n = 13, with a best known solution at v_2(C) = 17, and v_2(C) >= 14 at n = 15, with no solution recorded. We show that the minimum is exactly 13 at n = 13 and exactly 14 at n = 15. The lower bounds are computer-assisted: an exhaustive 2-adic lifting, driven by the row law taken as an exact equality (units included) together with the vanishing of the odd power sums, eliminates every valuation profile below these values. The upper bounds are explicit 2-adic solutions, certified by the multivariate Hensel lemma. The same procedure reproduces exactly the known values 4, 6, 9, 11 at n = 5, 7, 9, 11. A self-contained verifier accompanies the note.

Primarily AI-generated textHuman understanding: no parts$2$-adic valuationHensel lemmaProuhet-Tarry-Escott problemcomputer-assisted proofideal solutions
Nov 18, 20265 pages
PDFView work

math.NT — Number Theory

An upper bound 0.4893562 for the upper density of the integers p+2^k

Contributed by David Niedbala Giraudin

Let A be the set of odd integers of the form p + 2^k with p prime and k >= 0. We prove that the upper density of A is less than 0.489356157186869, improving the bound 0.489440909905826 announced by Patankar in November 2026. The proof uses the finite obstruction inequality of Erdos, as in the work of Habsieger-Roblot, Chen-Dai-Li, Griego, Yoo, Salavatov and Patankar, together with a simple averaging lemma: any prime may be added to the obstruction set, whatever the multiplicative order of 2 modulo it, at the cost of averaging over its residue classes. Adding all odd primes below 200 000 to Patankar's 59-prime certificate gives the bound. Starting instead from Salavatov's 51-prime certificate, whose base histogram we rebuilt, gives the bound 0.489419333025262, which also improves the previous record. The certificates are exact rational computations and are provided with the verification programs.

Primarily AI-generated textHuman understanding: no partsRomanoff's constantcomputer-assisted proofcovering congruencessums of a prime and a power of twoupper density
Nov 18, 20264 pages
PDFView work

math-ph — Mathematical Physics

Unique continuation for the Pauli-Fierz Hamiltonian

Contributed by Mihaly A. Csirik

We prove a unique continuation property for eigenstates of the Pauli-Fierz Hamiltonian, viewed as functions of the electron configuration with values in the spin-photon space. The vector potential may lie in Lloc6L^6_\mathrm{loc}, with its divergence, curl, and the scalar potential in LlocpL^p_\mathrm{loc} for some p>2p>2. As an application, we prove a Hohenberg-Kohn theorem at positive coupling strength: the spin-summed ground-state density and combined current density determine the external potentials up to a gauge transformation and an additive constant.

Author comments: github repo: https://github.com/xyzw/pf_ucp

Primarily AI-generated textHuman understanding: all parts
Nov 18, 202643 pages
PDFView work

math.CV — Complex Variables

On meromorphic functions sharing three values IM and one value CM

Contributed by Pengcheng Fang, Tao Hu, Yanyang Li, Quanyu Tang

We prove that if two nonconstant meromorphic functions on the complex plane share three distinct values ignoring multiplicities and a fourth value counting multiplicities, then they share all four values counting multiplicities. This gives an affirmative answer to Gundersen's three-IM-one-CM problem in full generality.

A mix of human-written and AI-generated textHuman understanding: some parts
Nov 18, 202626 pages
PDFView work

math.DS — Dynamical Systems

Inclusions and invariant forms of Svinin's recurrences

Contributed by Jason Turner

We prove Svinin's Conjectures 5.2 and 5.3 for sequences with all entries nonzero and give explicit coefficient maps for both inclusions. If arbitrary solutions of the polynomial equations are allowed, both inclusions fail at every order. We also prove Conjecture 3.1 on the nonzero-coordinate domain for every g≥1g \ge 1, giving an invertible parameter correspondence between the associated recurrence and its invariant form.

A mix of human-written and AI-generated textHuman understanding: some parts
Nov 18, 20269 pages
PDFView work

math.PR — Probability

A sharp lower bound for entropy first-passage skewness in a three-state Markov ring

Contributed by Samuil Petkov

We study the time at which the accumulated medium entropy of a continuous-time three-state Markov ring first reaches or exceeds a positive threshold. For six positive finite transition rates and positive cycle affinity, the skewness scaled by the square root of the threshold has a finite large-threshold limit. We prove that its infimum at fixed affinity AA is min⁡{s(A),s(A/2),s(A/3)}\min\{s(A),s(A/2),s(A/3)\}, where ss is the one-stage biased-walk expression. This establishes the three-state case of the lower envelope conjectured by Wampler and Barato. An exact passage decomposition on the lifted integer chain controls the cumulants, including the initial-phase mixture. Two Hermitian entropy tilts constrain the characteristic coefficients to an outer region on which derivative-sign arguments reduce the bound to three endpoint values. Homogeneous rates attain the third value; positive finite-rate families approach the first two. An appendix records which steps extend to rings with any number of states.

A mix of human-written and AI-generated textHuman understanding: all partsMarkov jump processentropy productionfirst-passage timeskewnessstochastic thermodynamicsunicyclic network
Nov 18, 202610 pages
PDFView work

math.RA — Rings and Algebras

The repeated-pair symmetric nonnegative inverse eigenvalue problem in dimension five

Contributed by Samuil Petkov

We prove a necessary condition for a real symmetric entrywise nonnegative matrix of order five to have spectrum (1,a,a,b,b)(1,a,a,b,b), where 1≥a≥b≥−11\ge a\ge b\ge-1. Besides the trace condition 1+2a+2b≥01+2a+2b\ge0, such a realization requires 1+4ab≥01+4ab\ge0 or 1+a+2b≥01+a+2b\ge0. Together with the known sufficiency of these conditions, this gives the repeated-pair characterization recorded as Conjecture 5.1.2 in Clark's dissertation. The proof treats arbitrary realizations. Perron-root minimization and a two-dimensional projector frame reduce a putative counterexample to a weighted five-cycle or an HH support. A cycle-cone inequality excludes the first case; an exact identity for the HH support excludes the second at every positive trace. No constant row sum, uniform Perron vector or restriction to irreducible matrices is imposed in the statement. On the open curved part of the boundary, where 1+4ab=01+4ab=0, 1+2a+2b>01+2a+2b>0 and 1+a+2b<01+a+2b<0, the same argument determines all realizations: up to permutation similarity they form an explicit one-parameter family of weighted five-cycles containing the Loewy–McDonald matrix.

A mix of human-written and AI-generated textHuman understanding: all partsPerron rootSNIEPinverse eigenvalue problemnonnegative matricesrealizable spectraweighted cycles
Nov 18, 202615 pages
PDFView work

math.CO — Combinatorics

Counterexamples, Spectral Obstructions, and Deletion Stability for WOW-284

Contributed by Samuil Petkov

WOW-284 is a Graffiti conjecture asserting that every connected graph of order at least three and girth at least five has minimum dual degree at most −λmin⁡(D)-\lambda_{\min}(D), where DD is the distance matrix and the dual degree of a vertex is the average degree of its neighbors. We refute it with exact counterexamples on 3838, 3939, 4040, 4242 and 5050 vertices and study the structure of regular counterexamples. For a connected kk-regular graph GG of girth at least five and diameter three, we prove that δ∗(G)+λmin⁡(D)=2k−2−max⁡θ(θ+1)2\delta^*(G)+\lambda_{\min}(D)=2k-2-\max_\theta(\theta+1)^2, the maximum being over the nonprincipal adjacency eigenvalues, so strict failure is a spectral window condition. The closed window ∣θ+1∣≤2k−2|\theta+1|\le\sqrt{2k-2} alone, without any diameter assumption, forces ∣V(G)∣<(k+2)(k2+3)/6|V(G)|<(k+2)(k^2+3)/6 when k≥4k\ge4, and an integral excess matrix derived from the optimal polynomial sharpens this bound for diameter-three counterexamples. Every regular strict counterexample has degree at least six and diameter at most four, and in degree six it has at most 5050 vertices. Under vertex deletion, the Hoffman-Singleton graph remains a strict counterexample after the removal of any five vertices, while an explicit six-vertex deletion destroys strictness. A degree-5757 Moore graph, if one exists, remains a connected strict counterexample after the removal of any 5656 vertices. Every strict counterexample has at least 1515 vertices, and an exhaustive search excludes orders up to 1919. The strict induced subgraphs of the Hoffman-Singleton graph of orders 3636 to 5050 are classified up to automorphism; among them are three further irregular counterexamples of order 4040.

Author comments: This is version 2 of arXiv:2607.27452 (https://arxiv.org/abs/2607.27452). The source code, exact certificates and build instructions are at https://github.com/SamPetkov/wow284 ; the verification scripts and data used in the paper are included in anc/.

A mix of human-written and AI-generated textHuman understanding: all partsGraffiti conjectureMoore graphcounterexampledistance spectrumdual degree
Nov 18, 202644 pages
PDFView work

math.CO — Combinatorics

Obligatory triple systems: atoms, spectra and decompositions

Contributed by Samuil Petkov

Erdős Problem 593 asks which finite triple systems embed in every triple system of uncountable chromatic number. Such finite systems are called obligatory. We describe their structure and the ways of decomposing them while keeping their original hyperedges. Every obligatory system without isolated points has canonical pieces, called atoms: single triples and expansions of finite 22-connected bipartite graphs, obtained by adding one new private point to each graph edge. A forest records how the atoms meet and reconstructs the system. We determine exactly which numbers of vertices, hyperedges and components can occur, and which atom counts occur in a connected system, including the parity restriction when the vertex–hyperedge incidence graph has just one independent cycle. For a fixed system, we consider decompositions into connected pieces that meet in at most one point and whose shared-point incidences form a forest. Each such decomposition is specified by independently partitioning the atoms through each shared point. These choices, ordered by merging blocks, form a product of partition lattices. An exact piece-count formula identifies the single local mergers. Li gave the first public classification. The appendix includes our self-contained proof, developed independently in parallel with Li's work.

Author comments: The first public classification of obligatory triple systems is due to E. Li, arXiv:2606.24882 (https://arxiv.org/abs/2606.24882); the classification proof in the appendix was developed independently in parallel. The principal statements are matched to a Lean 4 development (Lean 4.32.0, pinned Mathlib) in the public repository https://github.com/SamPetkov/Erdos593 , including the self-contained file Erdos593SelfContained.lean.

A mix of human-written and AI-generated textHuman understanding: all partsErdős problemscanonical decompositionhypergraph blocksobligatory triple systemspartition lattices
Nov 18, 202634 pages
PDFView work

math.CO — Combinatorics

A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph

Contributed by Samuil Petkov

The cochromatic number ζ(G)\zeta(G) of a graph GG is the least number of parts in a partition of V(G)V(G) into cliques and independent sets, so ζ(G)≤χ(G)\zeta(G)\le\chi(G). Erdős and Gimbel asked whether χ(Gn)−ζ(Gn)→∞\chi(G_n)-\zeta(G_n)\to\infty with high probability for Gn∼G(n,1/2)G_n\sim G(n,1/2). Heckel answered this affirmatively for about 95%95\% of all integers nn and conjectured that the natural order of the difference along the full sequence is n/(ln⁡n)3n/(\ln n)^3. We prove that, as n→∞n\to\infty through all integers, χ(Gn)−ζ(Gn)≥0.063 n/(ln⁡n)3\chi(G_n)-\zeta(G_n)\ge0.063\,n/(\ln n)^3 with high probability. The failure probabilities are summable, so under any coupling of the graphs GnG_n the bound holds almost surely for all sufficiently large nn. The proof counts partitions of the vertex set into classes of five consecutive sizes, each class declared independent or complete. The two choices per class outweigh the entropy lost by restricting the class sizes, so the expected number of such partitions is large already at a number of classes that lies order n/(ln⁡n)3n/(\ln n)^3 below the first-moment lower bound for the chromatic number, uniformly in the rounding phase. A second-moment argument, which controls all overlaps between two such partitions, including whole shared classes and large intersections of unequal classes, bounds the probability that such a partition exists from below. Vertex-exposure concentration, together with a coloring of the leftover vertices, then raises this to high probability at a cost of o(n/(ln⁡n)3)o(n/(\ln n)^3) extra classes.

Author comments: This is version 2 of arXiv:2608.30604 (https://arxiv.org/abs/2608.30604). A Lean 4 formalization of an earlier version of the main theorem, with the weaker constant ((ln 2)^2/4) ln(200/153) ≈ 0.032 in place of 0.063, is registered on Palomar as PALOMAR-2026-09-02-000006: https://palomar-registry.org/entry?id=PALOMAR-2026-09-02-000006&version=1 . The improved constant 0.063 of this version is not formalized.

A mix of human-written and AI-generated textHuman understanding: all partsChromatic numberErdős problemscochromatic numberrandom graphsecond moment method
Nov 18, 202653 pages
PDFView work

math.FA — Functional Analysis

Daugavet renormings via poor subspaces

Contributed by Samir Hamad

Let YY be a separable Banach space with the Daugavet property containing a complemented copy of ℓ1\ell_1. We prove that Y⊕1EY\oplus_1 E admits an equivalent norm with the Daugavet property for every separable Banach space EE. We also construct a subspace of C[0,1]C[0,1] isomorphic to the James space such that the corresponding quotient fails the Daugavet property.

A mix of human-written and AI-generated textHuman understanding: all partsDaugavetJames spacepoor subspacesrenormings
Nov 18, 20267 pages
PDFView work

math.NA — Numerical Analysis

The Simultaneous Rectangle for Systems, without Homotopy: All the Solutions of a Polynomial System, Each in a Certified Ball, with a Proof That None Is Missing

Contributed by Ivan BESEVIC

This note carries the simultaneous rectangle of one polynomial (version G8) to a system of nn polynomial equations in nn unknowns, and removes the homotopy on which the previous version S1 relied. The points start on the solutions of a start system and are swept on FF itself with a rectangle step of order three, each point deflated of its nearest neighbours; nothing is tracked. What the sweeps do not find is obtained in three ways: the images of the solutions found by the symmetries read on the system; runs of the step of one point from random points; and the law of the residues: by the formula of Euler and Jacobi the solutions found determine the moments of the missing ones, which are then the generalised eigenvalues of small matrices. Every point passes one certificate (a contraction of a ball in interval arithmetic, and a box by Rouché's theorem for a double solution), and the output is complete when as many disjoint balls are certified as a bound of the number of solutions. For sparse systems that bound is the mixed volume, computed by mixed cells; we show that one lifting, whatever it is, gives the mixed volume as soon as an exact check meets no tie, so that the count is a proof and not a probability. With the Rust crate pandsysroots 0.21.0, on 40,000 systems of twenty-seven families the output is as expected on all of them and proved complete on 39,998; on eighteen classical or large systems, up to 6561 solutions and 64 unknowns, completeness is proved on every one, and the program is faster than a reference homotopy solver with certification on fourteen of them, level on two and slower on two (one machine, default settings). The algebra of the step, the certificate, the laws used by the residues and the argument of the lifting are checked in Lean 4 (64 theorems). The note states which results are formal proofs, written proofs, quoted theorems and numerical observations, and its limits: no theorem of convergence, no certificate for a multiplicity above two, no proof of completeness for a system with a curve of solutions.

Author comments: Version S2, 17 November 2026. Also deposited on Zenodo with the Lean files, the programs of the figures and the measurements: https://doi.org/10.5281/zenodo.24314654. Software: https://crates.io/crates/pandsysroots (version 0.21.0). Companion for systems of The Simultaneous Rectangle (G8), https://doi.org/10.5281/zenodo.24257672.

Primarily AI-generated textHuman understanding: some partsEuler-Jacobi formulaLean 4certified solutionsmixed volumepolynomial systems
Nov 18, 202614 pages
PDFView work

math.LO — Logic

Algorithmic and Provable Precision of Monotone Approximations

Contributed by Zhenyu Sun

We study how much information is needed to approximate a monotone limit and when arithmetic can prove that a finite approximation is accurate. For an eventually constant computable descending approximation in an effective partial order, we identify the minimum description length of an adequate stage bound with the one-sided algorithmic rate-distortion complexity of its limit, up to a uniform additive constant. For integer limits, this is also the complexity of a coarse quotient. Finite proof maxima give normal forms for bounded reflection and refutation completeness, and determine every provably sufficient budget. Under soundness for the positive and negative threshold families and refutation completeness at the chosen rank, the least provable error is the difference between the true threshold and its greatest provable lower bound. This difference retains the joint information in two opposing monotone limits. Chaitin counts give matching precision and Busy Beaver bounds, including a maximum law for finitely many fixed reference machines. We also obtain sharp advice bounds for variable certificate presentations, fixed-rank refutations over a finite arithmetic base, an elementary verified selector for bounded positive reflection under explicit proof-presentation assumptions, and resource bounds for proof translation.

A mix of human-written and AI-generated textHuman understanding: all partsKolmogorov complexityalgorithmic rate distortionarithmetical interpretabilitybounded reflectionmonotone approximationproof selectors
Nov 18, 202642 pages
PDFView work

cs.DS — Data Structures and Algorithms

A self-contained proof of the exponent threshold 0.4875754036 for worst-case Subset Sum

Contributed by Jennifer Voitle

We give a complete written proof that Subset Sum on n positive integers of polynomial bit length is decided by a randomized word-RAM algorithm in time O(2^(T'n)) for every fixed T' > T = 0.4875754036, in particular in time O(2^(0.4875755n)). The threshold T was reported earlier by the author, conditionally on the non-numerical lemmas of two preprints; the contribution of this paper is the derivation that removes that condition. The algorithm is the one introduced by OpenAI (isolation, a capped preliminary search, a filtered modular checksum, subtraction of aliases) with the alias step of A. Kapila (one large shared block, sparse masks, alias phase sums) and a single asymmetric checksum filter. Those ideas are theirs. What is done here is different in kind: every non-numerical lemma that the result uses is stated with its hypotheses and proved in this text, so that the argument can be checked without accepting unproved statements from other preprints. The numerical inequalities that the proof uses are listed explicitly and matched one by one to a ball-arithmetic certificate, whose analytic error bounds are also proved here. The theorem has no mathematical hypothesis beyond two cited classical theorems and those certified inequalities. The manuscript also records, statement by statement, how each proof was obtained and which independent checks are still open. It has been reviewed and audited, with the sources open, by a second AI system; it has not been refereed.

Author comments: 49 pages. This paper removes the condition in the author's earlier preprint hexagon:2611.00178 ("A certified exponent of 0.48758 for worst-case Subset Sum, and limits of the alias-checksum analysis"), which stated the same threshold assuming lemmas of two other manuscripts. Certificate code and stored output: https://github.com/jv1000/subset-sum, folder selfcontained-2026 (MIT License).

A mix of human-written and AI-generated textHuman understanding: some partsAI-assisted mathematicsFourier filteringSubset Sumball arithmeticcomputer-assisted proofexact algorithmsinterval arithmeticmeet-in-the-middlerandomized algorithmsworst-case complexity
Nov 18, 202649 pages
PDFView work

math.OC — Optimization and Control

A Fifth-Order Hurwitz Interval Polynomial Family Without a Degree-Four Weak Strictly Positive Real Numerator

Contributed by Zhengtai Xiong, Tiancheng Xu

We construct an explicit fifth-order Hurwitz-stable interval polynomial family with five independent coefficient intervals of positive width that admits no common weak strictly positive real (WSPR) numerator of degree four. For every real numerator of degree at most four, one of six fixed denominator--frequency pairs has a nonpositive real part. Robust Hurwitz stability follows from three common separator points for the even and odd denominator polynomials. Nonexistence follows from an exact linear identity: a strictly positive integer combination of the six frequency pairing functionals is identically zero. Thus robust Hurwitz stability does not guarantee a degree-four common WSPR numerator for fifth-order interval polynomial families.

Primarily AI-generated textHuman understanding: some parts
Nov 18, 20266 pages
PDFView work

math.GR — Group Theory

Counterexamples to the Mathieu Property: From Explicit Quotient Constructions to a General Classification

Contributed by Roy van Rijn

In 1997, Olivier Mathieu conjectured that if every positive power of a function on a compact connected Lie group has average zero, then multiplying those powers by any fixed function should eventually preserve this property. Christopher D. Long disproved this conjecture in 2026 and classified the compact connected groups for which the property holds. This paper extends that classification to a much broader family of algebraic spaces, including nonspherical homogeneous spaces and disconnected groups. We prove a necessary and sufficient condition determining exactly when the Mathieu–Zhao property holds. The proof constructs new explicit counterexamples using the binary octahedral and icosahedral groups, covering cases not addressed by earlier classifications. These counterexamples remain valid under polynomial transformations and give rise to transcendental generating functions. The main result completes the classification of the Mathieu–Zhao property for complex homogeneous spaces whose acting groups and stabilizers have reductive identity components, extending the known results from compact groups and spherical spaces to this general setting.

Primarily AI-generated textHuman understanding: some partsHaar integrationInvarient theoryMathieu ConjectureMathieu-Zhao subspacesReductive algebraic groupsVanishing moments
Nov 18, 202618 pages
PDFView work

math.NT — Number Theory

Cyclotomic Digit-Reversal Thresholds: Explicit Slopes, Effective Periods, and Uniform Families

Contributed by Oleksiy Babanskyy

For a base-BB digit polynomial PP, let Kt(B)K_t(B) be the first length at which the represented integer and its reversal are divisible by the full integer Φt(B)\Phi_t(B), although Φt(X)\Phi_t(X) does not divide P(X)P(X). We study this threshold through a lattice of evaluations and the capacities imposed by digit positions. For every fixed t≥3t\geq3, we determine explicit linear slopes and construct an eventual affine description on residue classes, with computable periods, cutoffs and compressed minimum witnesses. No total-unimodularity assumption is needed. For every prime p≥5p\geq5, exact formulas in stated base ranges give K3p(10)=17p−1K_{3p}(10)=17p-1 and K6p(10)=18p+1K_{6p}(10)=18p+1. Ordered capacities explain their different correction periods, two and four. A deductive scalar classification also describes the minimum algebraic values for 6p6p and the action of reversal on them. Period transfers show that excluding palindromes leaves the first thresholds unchanged for both families. The same framework treats independent coefficient bounds and collisions. Exact results for orders 105,210105,210 require finite certificates beyond total unimodularity. The general construction is effective; minimal periods and practical efficiency are not claimed.

Author comments: 51 pages. Exact-arithmetic companion 1.1.0, including certificates and reproducibility instructions: https://github.com/aconsciousfractal/FCIG-Cyclotomic-Digit-Reversal-Thresholds/tree/28b00ab1a5d4ba64956ab82dafb02fc35ac40797. No independent specialist review or formal verification is claimed. Previously deposited as aiXiv 2609.03287 v1; the mathematical content and sources are unchanged.

Primarily AI-generated textHuman understanding: no partsCyclotomic Polynomialsaffine monoidscongruence latticesdigit reversalquasi-polynomialszonotopes
Nov 18, 202651 pages
PDFView work

math.CO — Combinatorics

Cyclotomic Weight Chambers for Reverse-Complement-Invariant Minimum Decycling Sets

Contributed by Oleksiy Babanskyy

For DNA order eight, the fixed labelled weights (s(A),s(C),s(G),s(T))=(−ρ,−1,1,ρ)(s(A),s(C),s(G),s(T))=(-\rho,-1,1,\rho) in W\mathcal W, ρ>1\rho>1, with fixed A<C<G<TA<C<G<T ties meet 21 ordinary complete-move components. Their entire union has optimum residual path length 141, including non-RC endpoints. A certified reverse-complement-invariant minimum decycling set of 8230 words instead attains 107 and is optimal in a different component. The atlas classifies W\mathcal W, not all labelled antisymmetric weight maps. Certified 8232-word RC feedback sets attain length 105; the global cardinality problem remains 8230≤τRC(106)≤82328230\le\tau_{\mathrm{RC}}(106)\le8232. A two-family selector determines equality strata, and an exact atlas has 86 walls, 173 strata and 114 terminals. Boolean classical retiming optimizes entire components; prescribed RC mate sums give two paired-move sectors, each costing at most one additional path unit. Beyond a component, conditional stable completion is exactly 2-SAT; bounded coordinates and antisymmetric heights describe endpoint and cardinality problems. Balanced closed-walk loads have an exact signed-real finite-pool closure. A certified exterior passes one such relaxation but requires at least 8235 selections in its stated real-gradient class at bound 106, without a global lower-bound claim. Classical cyclotomic tensor relations and bounded signed-one-hot realization also give an all-order Farey spectrum of rational DNA embedding resonances. A real algebraic ratio is positionally realizable at some even order exactly when it belongs to a cyclotomic field. Complete arithmetic proofs and finite local exclusions are retained in the technical supplement.

Author comments: 56 pages (57 in the original aiXiv 2610.00003 v1 compilation). Mathematical content unchanged; explicit LaTeX counter aliases preserve lemma/proposition reference types across toolchain versions; companion version 3.2.0. The 141 optimum concerns the union of components met by the specified labelled weight family. The 8230-word RC witness attains length 107 and is optimal in its own component; global optimality remains open. Companion and reproduction instructions: https://github.com/aconsciousfractal/FCIG-Cyclotomic-Weight-Chambers-for-RC-Invariant-MDS/tree/752199436a9605798af9dc9117577724002a750a

Primarily AI-generated textHuman understanding: no partscyclotomic fieldsde Bruijn graphsexact certificatesminimum decycling setsretimingreverse complement
Nov 18, 202656 pages
PDFView work

math.OC — Optimization and Control

Robust Strictly Positive Real Synthesis for Polynomial Polytopes

Contributed by Tiancheng Xu

We determine when Hurwitz stability of a polynomial polytope guarantees a common numerator of prescribed degree. The denominators are real and monic of degree nn, and their convex hull has at most mm vertices. For numerator degrees n−1n-1 and nn, the guarantee holds exactly when n≤2n\le2 or m≤2m\le2. For degree n+1n+1 there is one additional case: every Hurwitz-stable cubic triangle admits a common quartic numerator. We prove this existence result by classifying the possible contacts of a nonnegative frequency pairing. In every order n≥4n\ge4 we construct a Hurwitz-stable triangle excluding all numerators of degree at most n+1n+1.

Primarily AI-generated textHuman understanding: some partsHurwitz stabilitycommon numeratordegree constraintpolynomial polytoperobust positive realness
Nov 18, 20267 pages
PDFView work

math.CO — Combinatorics

An upper bound for three-sunflower-free families of four-element sets

Contributed by Oleksiy Babanskyy

Let M(4,3)M(4,3) be the maximum size of a finite simple family of four-element sets containing no three distinct members whose pairwise intersections are equal. The empty intersection is included in the forbidden configurations. We give a computer-assisted exclusion of families of size 6969, giving the bound 54≤M(4,3)≤6854\le M(4,3)\le 68. The argument combines an imported bound of 2727 for intersecting families, structural analysis of point-links, exact trace constraints and finite exhaustions. The proof is organized at the cardinality 6969. A cap on families containing a complete R16R16 point-link provides a shorter final contradiction. We make the imported results, computational lemma contracts and remaining verification limits explicit. The lower construction is classical. Neither exclusion of size 6868 nor optimality of the lower construction is claimed.

Author comments: 17 pages. Manuscript unchanged from aiXiv 2610.01292 v1. The claimed bound is 54 <= M(4,3) <= 68, with empty kernels included; the forcing threshold is at most 69. This is partial progress on the finite four-uniform case, not a solution of the general sunflower conjecture (Erdos Problem #20). Pinned companion: https://github.com/aconsciousfractal/Four-Uniform-Three-Sunflower-Bound/tree/90c03c79bcf44eb8f61dff1b86091b822cc4cd3c

Primarily AI-generated textHuman understanding: no partscomputer-assisted proofexact certificatesextremal set theoryfour-uniform hypergraphssunflowers
Nov 18, 202617 pages
PDFView work

math.NT — Number Theory

Sun's supercongruence for two Apéry-like binomial sums at discriminant -20

Contributed by Oleksiy Babanskyy

Let an=∑j=0n(nj)2(2jj)a_n=\sum_{j=0}^n\binom{n}{j}^2\binom{2j}{j} and let Qn=∑j=0n(nj)(−8)n−j∑k=0j(jk)3Q_n=\sum_{j=0}^n\binom{n}{j}(-8)^{n-j}\sum_{k=0}^j\binom{j}{k}^3. We prove Sun's Conjecture 3.7: for every prime p≠2,5p\ne2,5, the two sums (−1)(p−1)/2∑n<p(2nn)an20−n(-1)^{(p-1)/2}\sum_{n<p}\binom{2n}{n} a_n20^{-n} and (−1)(p−1)/2∑n<p(2nn)Qn(−16)−n(-1)^{(p-1)/2}\sum_{n<p}\binom{2n}{n} Q_n(-16)^{-n} are congruent modulo p2p^2 to 4x2−2p4x^2-2p if p=x2+5y2p=x^2+5y^2, to 2x2−2p2x^2-2p if 2p=x2+5y22p=x^2+5y^2, and to zero if (−5/p)=−1(-5/p)=-1. For split primes, two modular periods at one complex multiplication point yield separate finite specializations of an integral Hecke polynomial. Its degree-pp endpoint and the sign in the nonprincipal class are treated explicitly. For inert primes, a degree-five endomorphism with square [−5][-5] forces a Hasse polynomial to vanish; a finite quadratic differential invariant then lifts each original sum from modulo pp to modulo p2p^2. Fixed algebraic certificates and their uniform specialization are included.

Author comments: 18 pages. Revised manuscript, package 0.1.1, unchanged from aiXiv 2610.00158 v2. Simplified notation and updated attribution to Mao following comments on the companion manuscripts. Companion code and reproduction instructions: https://github.com/aconsciousfractal/Sun-3-7-Supercongruence/tree/4c2e584d1f04d2aa3921e4398743eecc7431004c

Primarily AI-generated textHuman understanding: some partsApéry-like sequencesElliptic CurvesFranel numberscomplex multiplicationmodular formssupercongruences
Nov 18, 202618 pages
PDFView work

math.NT — Number Theory

Sun's supercongruence for two Apéry-like binomial sums

Contributed by Oleksiy Babanskyy

Let fn=∑j=0n(nj)3f_n=\sum_{j=0}^n\binom{n}{j}^3 and Qn=∑k=0n(nk)(−8)n−kfkQ_n=\sum_{k=0}^n\binom{n}{k}(-8)^{n-k}f_k. We prove that, for every odd prime pp, the two sums ∑n=0p−1(2nn)Qn/(−32)n\sum_{n=0}^{p-1}\binom{2n}{n} Q_n/(-32)^n and ∑n=0p−1(2nn)Qn/64n\sum_{n=0}^{p-1}\binom{2n}{n} Q_n/64^n are congruent modulo p2p^2 to 4x2−2p4x^2-2p when p=x2+2y2≡1,3(mod8)p=x^2+2y^2\equiv1,3\pmod{8}, and to zero when p≡5,7(mod8)p\equiv5,7\pmod{8}. For inert primes a finite quadratic differential invariant gives ordinary and singular lifting results, including a formula for the defect at a simple singularity. For split primes we certify the modular period by identities of weight eight, construct an integral Hecke polynomial with an explicit degree bound, and specialize a finite polynomial identity at two complex multiplication points. The coefficient at degree pp, both classes of complex multiplication matrices, and the primes 33 and 55 are treated explicitly.

Author comments: 18 pages. Revised manuscript, package 0.1.1, unchanged from aiXiv 2610.00157 v2. Incorporates Zhi-Hong Sun's comments on notation and credits Mao's stronger coefficient congruence. Companion code and reproduction instructions: https://github.com/aconsciousfractal/Sun-3-6-Supercongruence/tree/db95a4dc988e548bc9fa6cb10745e1b9c2cd5bdd

Primarily AI-generated textHuman understanding: some partsApéry-like sequencesFranel numberscomplex multiplicationmodular formssupercongruences
Nov 18, 202618 pages
PDFView work

math.FA — Functional Analysis

The Matsaev (1971) conjecture is false for every p ≠ 2, and other miscellanea

Contributed by Dave Goel

The Matsaev (1971) conjecture asserts that for 1 < p < ∞, every contraction T on an Lᵖ space and every polynomial P satisfy ‖P(T)‖ ≤ ‖P(S)‖, where S is the shift on ℓᵖ(ℕ). We prove that it fails for every p ∈ (1, ∞) ∖ {2}, already for a real 2×2 matrix and a real quadratic, without numerical computation, and that it holds for every quadratic whose constant and leading coefficients have equal modulus; these results and their proofs also form the short paper "The Matsaev (1971) conjecture is false for every p ≠ 2". This expanded version adds an explicit quadratic and an explicit family of scaled rotations that violate the conjecture on a whole punctured neighbourhood of p = 2, with a proof by hand; an exact rational re-proof of Drury's counterexample at p = 4; upper bounds, certified in exact rational arithmetic, for the shift norms of Drury's polynomial at p = 3, 4, 6, …, 20; explicit counterexamples, certified by computer, for every p ∈ [40/39, 40], p ≠ 2; and conditions that every 2×2 counterexample must satisfy.

Author comments: First version: October 28, 2026. This is the expanded version of the paper "The Matsaev (1971) conjecture is false for every p ≠ 2", which is at https://hexagonmath.org/2611.00547 on Hexagon. The ancillary files are at https://doi.org/10.5281/zenodo.24290033 on Zenodo.

A mix of human-written and AI-generated textHuman understanding: some partsBellman functionL^p spacesMatsaev's conjecturecontractionsshift operatorvon Neumann's inequality
Nov 17, 202637 pages
PDFView work

math.FA — Functional Analysis

The Matsaev (1971) conjecture is false for every p ≠ 2

Contributed by Dave Goel

The Matsaev (1971) conjecture asserts that for 1 < p < ∞, every contraction T on an Lᵖ space and every polynomial P satisfy ‖P(T)‖ ≤ ‖P(S)‖, where S is the right shift on ℓᵖ(ℕ); for p = 2 this is von Neumann's inequality. Drury (2011) disproved it for p = 4, and hence, by duality, for p = 4/3, with a computer-assisted example. We prove that it fails for every p ∈ (1, ∞) ∖ {2}, even with T a real 2×2 matrix and P a real quadratic polynomial. Let Pₐ(z) = 1 + az − Bz² with B > 0. For p ≠ 2 and small a > 0 we show that ‖Pₐ(S)‖ = ‖Pₐ(J)‖, where J is the rotation of ℓᵖ₂ (ℂ² with the ℓᵖ norm) by a right angle. For p > 2 the bound ‖Pₐ(S)‖ ≤ ‖Pₐ(J)‖ comes from a Bellman function: a function G of two real variables such that, for every real sequence x ∈ ℓᵖ(ℕ) (with x₋₁ = x₋₂ = 0) and every n ≥ 0, |(Pₐ(S)x)ₙ|ᵖ ≤ ‖Pₐ(J)‖ᵖ|xₙ|ᵖ + G(xₙ₋₁, xₙ₋₂) − G(xₙ, xₙ₋₁); the G terms cancel in the sum over n. For 1 < p < 2 the bound follows by duality. If B > 1, a rotation by an angle slightly larger than π/2, scaled down to a contraction, gives a real 2×2 matrix T with ‖Pₐ(T)‖ > ‖Pₐ(J)‖ = ‖Pₐ(S)‖. In the other direction, the conjecture holds for every quadratic whose constant and leading coefficients have equal modulus. An expanded version of this paper, with many other results, is posted on Zenodo: https://doi.org/10.5281/zenodo.23691816.

Author comments: First version: October 28, 2026. The expanded version of this paper is at https://doi.org/10.5281/zenodo.23691816 on Zenodo.

A mix of human-written and AI-generated textHuman understanding: some partsBellman functionL^p spacesMatsaev's conjecturecontractionsshift operatorvon Neumann's inequality
Nov 17, 202613 pages
PDFView work

math.DG — Differential Geometry

The Osserman (1990) conjecture is fully resolved, and other miscellanea

Contributed by Dave Goel

The Osserman conjecture says that a Riemannian manifold whose Jacobi operators have the same eigenvalues in every unit direction is flat or locally rank-one symmetric. Chi and Nikolayevsky proved it in every dimension except one remaining case: dimension sixteen, when a Jacobi eigenvalue has multiplicity seven or eight. Nikolayevsky reduced this remaining case to a purely algebraic statement, the Nikolayevsky (2009) conjecture, his Conjecture A. We prove the Nikolayevsky (2009) conjecture. Hence the Osserman conjecture is true in every dimension, including its pointwise form in dimension sixteen. The same result completes the conformal Osserman conjecture, which is stated for dimensions greater than four. Conjecture A says that an Osserman algebraic curvature tensor on ℝ¹⁶ whose reduced Jacobi operator has an eigenvalue of multiplicity seven or eight has a Clifford structure or is a linear combination of the constant-curvature tensor and an orthogonal pullback of the Cayley-plane curvature tensor. For the two-eigenvalue case, we construct a Cartan–Münzner quartic and recover the original Jacobi eigenspaces from its isoparametric classification. For the remaining multiplicity patterns, we study a rational coherent factor of the Jacobi family. Its transpose pencil, polar divisors and residue images reduce the possible poles to cases excluded by degree bounds, real positivity and homogeneous factorization. A frame-independent closed-kernel identity completes the passage from local pole reductions to the algebraic classification.

Author comments: First version: October 28, 2026. This is the expanded version of the paper "The Osserman (1990) conjecture is fully resolved", which is at https://hexagonmath.org/2611.00544 on Hexagon.

A mix of human-written and AI-generated textHuman understanding: some partsCayley planeClifford structureJacobi operatorOsserman conjecturealgebraic curvature tensorisoparametric hypersurfacerank-one symmetric space
Nov 17, 202681 pages
PDFView work

math.DG — Differential Geometry

The Osserman (1990) conjecture is fully resolved

Contributed by Dave Goel

The Osserman conjecture says that a Riemannian manifold whose Jacobi operators have the same eigenvalues for all unit tangent vectors at all points is flat or locally rank-one symmetric. Chi and Nikolayevsky proved it in every dimension except one case in dimension sixteen: a Jacobi eigenvalue of multiplicity seven or eight. Nikolayevsky reduced this case to an algebraic statement, the Nikolayevsky (2009) conjecture: an Osserman algebraic curvature tensor on ℝ¹⁶ with a Jacobi eigenvalue of multiplicity seven or eight has a Clifford structure or is a linear combination of the constant-curvature tensor and an orthogonal conjugate of the curvature tensor of the Cayley projective plane. We prove this conjecture. Hence the Osserman conjecture is true in every dimension, and so is the conformal Osserman conjecture, which is stated for dimensions greater than four. For two eigenvalues, a Cartan–Münzner quartic built from the Jacobi operators, together with the classification of isoparametric hypersurfaces with four principal curvatures, shows that the tensor is Clifford or comes from the Cayley projective plane. For three or more eigenvalues, polynomial eigenfields settle nineteen multiplicity patterns. In the remaining sixteen patterns, a sums-of-squares argument treats the case where the eigenvalue of multiplicity seven or eight is the smallest or the largest; otherwise we study the poles of a rational factorization of the Jacobi operators: a topological rigidity lemma for quadratic Gram matrices settles the case without poles, and degree bounds, real positivity and homogeneous factorization exclude each pole type or force a Clifford structure.

Author comments: First version: October 2026. The expanded version of this paper is at https://doi.org/10.5281/zenodo.23603278 on Zenodo.

A mix of human-written and AI-generated textHuman understanding: some partsCayley planeClifford structureJacobi operatorOsserman conjecturealgebraic curvature tensorisoparametric hypersurfacerank-one symmetric space
Nov 17, 202663 pages
PDFView work

math.OA — Operator Algebras

Modular Kittaneh Numerical Radius Inequalities

Contributed by K. MAHESH KRISHNA

We show that for adjointable morphisms on Hilbert C*-module over a commutative unital C*-algebra, a version of breakthrough numerical radius inequalities obtained by Kittaneh [\textit{{Stud. Math.}, 2005}] hold.

Primarily human-written textHuman understanding: all partsHilbert C*-module.Numerical radius
Nov 17, 202612 pages
PDFView work

quant-ph — Quantum Physics

Double-Pulsar Drag Bounds Dissipative Sources of Diósi–Penrose Decoherence

Contributed by Marc Sperzel

In the proposal of Diósi and Penrose a mass in a superposition of two positions loses coherence at the rate Γ=CEG/ℏ\Gamma = C E_G/\hbar, first order in Newton's constant. We ask what could produce this rate for a static superposition of equal masses. A bath in its ground state cannot: its noise equals its absorption, which vanishes at zero frequency when the response is continuous there. For the free linearized gravitational field and a 1 μ1~\mug body the loss of coherence stays at a few times 10−310^{-3} at all times and is reversible. These results are standard, at second cumulant. A bath that is not in a ground state can supply the rate, but if it couples to the mass density through a Hamiltonian, the noise that decoheres a body also takes momentum from it. We show that stationary, white, passive noise of Diósi–Penrose form drags a moving body at a rate of at least (2π/3)(CℏG/kBTeff)(2\pi/3)(C\hbar G/k_B T_{\mathrm{eff}}) times its density, with TeffT_{\mathrm{eff}} the fluctuation–dissipation temperature. If the noise keeps this form and one temperature out to the kilometre wavelengths that a neutron star resolves, as it does by construction in the linear-friction dissipative Diósi–Penrose model, the orbital decay of the double pulsar PSR J0737−3039A/B requires Teff/C>3.3×1016T_{\mathrm{eff}}/C > 3.3\times10^{16} K, up to strong-field corrections of order one. This is more than 5×10275\times10^{27} above the laboratory bound on that model and excludes the proposed Tβ≈3T_\beta \approx 3 K by 101610^{16}. Baths that differ between kilometre and laboratory scales escape. Otherwise what survives is noise without back-action: Diósi's original model with Gaussian mass-density smearing R0R_0. Published data allow R0>4.5R_0 > 4.5 Å C1/3C^{1/3} with no upper bound and do not fix CC. For a uniform sphere of radius a≫R0a \gg R_0 the rate is independent of R0R_0 to 1.7 R0/a1.7\,R_0/a at every separation dd, so one visibility measurement, with other decoherence channels subtracted, determines CC; for 1 μ1~\mug of silica τ=65\tau = 65 ps/C/C at d=1d = 1 mm and 0.35 μ0.35~\mus/C/C at d=1 μd = 1~\mum.

Primarily AI-generated textHuman understanding: some parts
Nov 17, 202624 pages
PDFView work

math.NT — Number Theory

A computer-assisted bound Λ ≤ 0.107964910079 for the de Bruijn–Newman constant

Contributed by Dale James Raymond

In the Polymath normalisation, a computer-assisted comparison gives Λ≤4276930720779424736615780984913961408125713216879677197516800<0.107964910079.\Lambda\le\frac{427693072077942473661578098491}{3961408125713216879677197516800}<0.107964910079. The initial squared zero height is bounded by 9/169/16, using OpenAI's ordinary-zeta 7/87/8 nonvanishing theorem formalised in Lean at the identified source revision. Finite signed translated-probe functionals, matched physical source estimates, and continuous-domain kernel inequalities supply a piecewise comparison for that height. A newly implemented exact rational consumer checks every one of the 221 010221\,010 arcs, their outward rounding and joins, and the complete final de Bruijn contraction. The fifteen-stage finite replay includes a direct reconstruction of all 6767 source chords from their primitive payments, with explicit binding of the main terms and the complete derivative functionals. Separate consumers verify their continuous kernel certificates and the actual physical and arithmetic charges. The analytic argument includes the corrected 11/1211/12 Gaussian remainder, finite-head localisation, attainment of a positive-time highest contact, and repeated complex contacts. The accompanying packet contains the mathematical sources, certificate data, checker programs, exact source identities, and replay instructions. The initial theorem is used at cited-theorem trust with authenticated external Lean-build evidence; a fresh local Lean build and an end-to-end formalisation of the present comparison are not claimed.

Author comments: This submission corresponds to version 1.0, dated 29 October 2026, of the manuscript deposited at https://doi.org/10.5281/zenodo.23752103. Complete computational evidence, verification instructions and component-specific rights notices remain available in that deposit and its companion repository: https://github.com/Dale-Dug/de-bruijn-newman-0107965. Related separate works: Michel Planat and Dale James Raymond, Certified Collision Exclusion and an Unconditional Upper Bound Λ < 0.156821 for the de Bruijn–Newman Constant, https://arxiv.org/abs/2611.06245 (subsequent joint paper); the earlier 0.149396 bound, https://doi.org/10.5281/zenodo.23781981; and the conditional 0.116398 bound, https://doi.org/10.5281/zenodo.23272725. These are separate works, not additional results claimed by this manuscript.

Primarily AI-generated textHuman understanding: all parts
Nov 17, 202663 pages
PDFView work

math.NT — Number Theory

Hyperbolic Collision Invariants and Certified Odd-Even Tiers toward Markoff Unicity

Contributed by Elleard Felix Webster Heffern

A collision would consist of two different ordered Markoff triples with the same largest entry MM. We derive arithmetic conditions that every such collision must satisfy. A parametrization by hyperbolic functions factors a classical determinant identity and leads to two coupled quadratic equations. If MM is odd, these equations require a factorization M=FEM=FE with F,E>1F,E>1 and gcd⁡(F,E)=1\gcd(F,E)=1. Hand proofs and exact finite computations give increasingly strong bounds, ending with F4,E4≥300000M+200000F^4,E^4\ge300000M+200000. If MM is even, division of the collision quantities by four gives the same inequalities for a coprime factorization of M/2M/2. These bounds yield explicit sufficient conditions for a Markoff number to be unique. The finite computations cover a proved search domain and apply necessary congruence and continued-fraction conditions. Two different arguments reject the final odd candidate: one uses continued fractions, and the other bounds the integer solutions of two quadratic equations of Pell type. Separately written programs reproduce the computations. The constants measure the strength of collision inequalities; they are not ranges through which Markoff numbers were checked. We identify the classical ingredients and the quantitative additions. Factorizations with increasingly comparable factors remain unresolved, so the general unicity conjecture is not proved.

Author comments: 35 pages; one figure. Source matches the 30 September 2026 manuscript deposited as Zenodo v6 on 9 November 2026: https://zenodo.org/records/24091908 (matching TeX and exact finite certificates). The constants are collision-inequality coefficients, not verified ranges; general Markoff unicity remains open. Internal “refereed” filenames do not denote external peer review. Publication chronology: earlier manuscript dated 19 August 2026, first ResearchGate posting 20 August 2026: https://doi.org/10.13140/RG.2.2.25111.33442 ; current v6 mirror recorded 12 November 2026: https://www.researchgate.net/publication/412818702_Hyperbolic_Collision_Invariants_and_Certified_Odd-Even_Tiers_toward_Markoff_Unicity . Related project chronology (earlier computational announcements, not first postings of this paper): X, 21 October 2026: https://x.com/webystar/status/2112926487091282350 ; LinkedIn, 23 October 2026: https://www.linkedin.com/posts/elleard-felix-webster-heffern-joseph-by-confirmation-2953a3104_markovnumbers-activity-7519411048115003392-4NaJ . Computational supplements, 2 November 2026: https://zenodo.org/records/23874075 . Corrected trillion-value verification/Meridians v22, 12 November 2026: https://zenodo.org/records/24167894 ; published on Hexagon 13 November 2026: https://hexagonmath.org/2611.00410 . These related computations are distinct from this paper's certified collision tiers.

A mix of human-written and AI-generated textHuman understanding: all partsDiophantine equationsFrobenius conjectureMarkoff numbersMarkov uniqueness conjecturePell equationscollision inequalitiescontinued fractionsexact finite certificateshyperbolic parametrizationunitary divisors
Nov 17, 202635 pages
PDFView work