HEXAGONbeta

Browse

All works

Browse the Hexagon catalog.

Newest works

342 works
hexagon:2610.00339v1

math.GT — Geometric Topology

Marked Heegaard Boundary Modules: Filling, Joint Completion, and Integral Lattices

Contributed by Hao-Yu Sun

A marked handlebody state must retain its filling relations and coefficient control before complementary capping or root specialization. We construct boundary modules and regulated integral lattices that keep the disk and cyclotomic residues of one finite-stage representative together. Standard handle-attachment and recoupling results supply the geometric inputs; the comparison constructs endpoint lattices, separating transport, raw and saturated quotient towers, and exact cap domains. These objects supply the companion rootwise theory, while the two completed topologies remain distinct and root specialization remains restricted to its declared domain.

Primarily AI-generated textHuman understanding: some partsHeegaard splittingcapintegral latticejoint completionskein module
Oct 18, 2026PDF ↗View work →
hexagon:2610.00333v1

math.PR — Probability

Records, scale flows, and Gaussian limits from lattice Poisson fields

Contributed by Brice Pouly

How does a rare-event field determine the history of its extremes? Starting from the complete signed run-field comparison in Long runs and rare patterns, we develop records, censoring, occupation and Gaussian limits for the resulting lattice Poisson target. The arithmetic input retains every site, full exact length and actual sign, at growing intensity under a one-factor information-intensity budget. Strict integer records, their signed imbalance and logarithmic leadership time have a joint phase-uniform Brownian limit with explicit covariance, independent of the terminal critical field and its extremal paths. Right censoring gives scalar M1M_1 convergence for the visible maximum and J1J_1 convergence for the first-holder sign. Physical occupation instead has a nondegenerate phase-indexed limit. Canonical interpolation connects threshold thinning and a stationary scale flow without identifying their record rules or their Gaussian constants. The signed spatial theory includes weighted exact levels, fixed-window Ornstein-Uhlenbeck paths, two correlated threshold-compression noises, and rectangle fields with explicit grid centering. Direct partition and quadratic-reconstruction proofs provide alternative routes. For each specified observation, the target calculations identify its limit and the dependencies within the joint constructions.

Primarily AI-generated textHuman understanding: no partsGaussian limitsextremal processesfunctional limit theoremslattice Poisson fieldsoccupation timesrandom multiplicative functionsrecords
Oct 18, 2026PDF ↗View work →
hexagon:2610.00334v1

math.PR — Probability

Poisson laws and arithmetic clusters for rare multiplicative patterns

Contributed by Brice Pouly

We determine when rare observations of completely multiplicative functions have a Poisson law and when arithmetic relations force clusters. For independent prime values on the circle with uniformly bounded L2L^2 densities, we approximate the field of hits of site-dependent targets of Haar mass O(N−1)O(N^{-1}) on deterministic masks in [2,CN][2,CN]. The target retains the true prime-site intensities and uses Haar at composite sites, even when the total prime contribution diverges. The exponent 22 is sharp in the uniform LqL^q scale for this target and class of masks. Below this threshold, even correct prime intensities can fail at site resolution while the total count remains asymptotically Poisson. A fixed finite exceptional prime environment, possibly atomic and internally dependent, instead produces a conditional cluster law together with an exact environment-determined configuration. With Haar outside that environment, its integer relation lattice determines the compound-Poisson limit of the corrected prefix count and characterizes simple Poisson convergence. Further applications treat rational observations on sparse moving supports, permanent bounded prime biases, and - using a binary arithmetic relation profile - long Borel patterns in a finite abelian group times a torus. Classical marked Chen-Stein comparison provides a common interface. A separate deterministic-sequence interface gives correlation identities, transfer criteria and a resolution obstruction, without proving cancellation for Liouville.

Primarily AI-generated textHuman understanding: no partsPoisson approximationarithmetic clusterscompound Poisson lawsprime-value densitiesrandom multiplicative functionsrelation latticesshrinking targets
Oct 18, 2026PDF ↗View work →
hexagon:2610.00335v1

math.PR — Probability

Moving prime environments and arithmetic cluster limits

Contributed by Brice Pouly

We study shrinking-target occurrences of completely multiplicative functions with arbitrarily moving phases on a fixed finite set of exceptional primes and independent Haar values at the remaining primes. After exact removal of the environment-only points, effective integer-subgroup profiles classify all subsequential marked cluster limits, while target-scale pair overlaps characterize Poisson convergence. The quantitative input is a direct Haar comparison with the moving germ kernel, uniform in the exceptional phases and with stretched-exponential error. For deterministic profiles and interval targets, the complete spatial covariance measure reconstructs the unmarked law through primitive multiplicative rays and finite interval geometry. A positive forest formula makes this reconstruction valid even with unbounded cluster sizes. For a fixed known bounded Borel target, retaining positions and angular marks yields the corresponding identification from the complete marked covariance, using signed overlap channels. Restricting the observation to an interior spatial window imposes both angular and logarithmic-spatial constraints. The maximal number of descendants of one germ becomes a rectangle-occupancy number for a subgroup of R2\mathbb{R}^2, finite exactly when that subgroup is discrete. Explicit rank-one laws illustrate what counts forget, while environmental mixtures show why deterministic identification does not extend by averaging covariances.

Primarily AI-generated textHuman understanding: no partsPoisson approximationarithmetic clusterscovariance reconstructionmoving environmentsrandom multiplicative functionsrelation latticesshrinking targets
Oct 18, 2026PDF ↗View work →
hexagon:2610.00345v1

math.MP — Mathematical Physics

A lower bound for two-interval quantum backflow

Contributed by Daniel Adam Pyle

An explicit compactly supported positive-momentum state yields a summed backflow greater than 0.06190 over two unit-duration intervals separated by a gap of 3/2, in units where the reduced Planck constant is 1 and the mass is 1/2. An executable numerical certificate encloses its value approximately between 0.0619551065 and 0.0619551266, conditional on stated arithmetic and library assumptions. The state is defined by stored binary-rational coefficients and is re-integrated with enclosed quadrature and rounding errors. This is a trial-state lower bound, not an optimality result. It exceeds a published conjectural numerical range for equal spacing, but does not establish superiority to the true equal-spacing supremum or publication priority.

Primarily AI-generated textHuman understanding: no partscomputer-assisted proofinterval arithmeticmathematical physicsquantum backflowvalidated numerics
Oct 18, 2026PDF ↗View work →
hexagon:2610.00340v1

math.GT — Geometric Topology

Integral root fibers and closed factorizations: Pairing maps, Rees covariance, caps, and sewing

Contributed by Hao-Yu Sun

We construct rootwise and formal Rees boundary data from the marked modules and lattices of the companion boundary-module construction, keeping their distinct coefficient and completion domains. Using a Newton interpolation basis, we determine the Smith invariants and the integral image of the map induced by the Hopf pairing. Factorial/Rees covariance and compatible finite-stage representatives produce a strict rootwise/Rees module with its theta endpoint. At an admissible odd prime, no continuous homomorphism extends algebraic root specialization to the entire completed Rees source; further obstructions exclude unrestricted Newton padding and a state-natural lift of a contracted scalar identity. Established perturbative, Habiro, and stated-skein/Morita constructions give closed comparisons after the declared cap or sewing map, with their boundary state objects kept separate.

Primarily AI-generated textHuman understanding: some partsHabiro capHopf pairingMorita sewingRees completionroot of unity
Oct 18, 2026PDF ↗View work →
hexagon:2610.00341v1

math-ph — Mathematical Physics

Mass Gap of Lattice Yang--Mills Theory up to the Dobrushin Ceiling

Contributed by Deep Bhattacharjee, Ushashi Bhattacharya

We prove that the Hessian of the Wilson action on dd-dimensional lattice gauge fields is bounded by 4d4d, sharply, so lattice $\SU(N)$ Yang--Mills theory has a unique infinite-volume state with a positive mass gap for ∣β∣<1/(8d)|\beta|<1/(8d). Every von Mises--Fisher law on the three-sphere moves by at most a quarter of its parameter in Kantorovich distance; consequently four-dimensional $\SU(2)$ theory has a mass gap for βW<2/9\beta_W<2/9, the ceiling of all single-link Dobrushin arguments. A gauge-invariant finite-box criterion for decay and the area law is also given. The continuum mass gap remains open.

A mix of human-written and AI-generated textHuman understanding: some partsBakry-Emery curvatureDobrushin uniquenessKantorovich distancelattice gauge theorymass gapvon Mises-Fisher law
Oct 18, 2026PDF ↗View work →
hexagon:2610.00342v1

math-ph — Mathematical Physics

Ghosts in Poisson Brane Gases

Contributed by Deep Bhattacharjee, Ushashi Bhattacharya

A Poisson gas of branes with mass intensity ν\nu dresses the graviton propagator by the random entire function ∏k(1+p2/tk)\prod_k(1+p^2/t_k). We prove that the gas average of the propagator equals $p^{-2}\exp[-\int p^2\nu(\dd t)/(p^2+t)]$, so that the massive states carry total weight e−ν(0,∞)−1<0e^{-\nu(0,\infty)}-1<0. For $\nu=\lambda(t)\,\dd t/t$ the averaged spectrum consists of ghosts alone exactly when λ≤1\lambda\le1, and every average with a finite four-dimensional tadpole has states of both signs. Frozen gases keep alternating residues.

A mix of human-written and AI-generated textHuman understanding: some partsKallen-Lehmann representationLaguerre-Polya classPoisson point processbrane gascomplete Bernstein functionghost
Oct 18, 2026PDF ↗View work →
hexagon:2610.00323v1

cs.CG — Computational Geometry

A sqrt(17/2) Lower Bound for Depth Reduction in Explainable Planar k-Center Clustering

Contributed by YURAN XIU

We prove that the factor-22 lower bound for depth reduction in explainable planar kk-center clustering is not tight. For every integer k≥2k\ge2, an explicit set of 4k4k distinct integer points has both ordinary and explainable kk-center radius one, while every axis-parallel threshold tree with at most kk nonempty leaves and depth less than k−1k-1 has radius at least 17/2\sqrt{17/2}. Thus, for every fixed depth multiplier HH and every C<17/2C<\sqrt{17/2}, arbitrarily large instances admit no such tree of depth at most H⌈log⁡2(k+1)⌉H\lceil\log_2(k+1)\rceil and radius at most CC times the optimal explainable radius. The point set is a rescaled tail of the ladder of Deng, Gavva, Karthik, Patel, and Srinivasan. The strengthened analysis uses a four-color packing bound and the exact cluster budget to prove rigidity of every sufficiently small-diameter partition, without an explainability assumption. The complete infinite-family theorem and its unbounded-size corollary have been checked in Lean. The existence of a larger universal constant for logarithmic-depth explanations remains unresolved. HAL deposit: hal-05800242v1.

Primarily AI-generated textHuman understanding: no partsLean formalizationapproximation lower boundsdepth reductionexplainable clusteringk-center
Oct 18, 2026PDF ↗View work →
hexagon:2610.00327v1

cs.CC — Computational Complexity

A Three-Polynomial Counterexample to the Generalized Effective Hypercube Nullstellensatz

Contributed by YURAN XIU

We give a counterexample to the proposed extension of the effective Hypercube Nullstellensatz from two polynomials to an arbitrary fixed number of polynomials. For every n≥1n\geq1, we construct three real polynomials in 2n+12n+1 variables, of degrees 2,2,12,2,1, respectively. Each is nonzero as a function on the Boolean cube, their product vanishes on the cube, and they have no common Boolean zero. Nevertheless, every polynomial certificate ∑i=13higi=1\sum_{i=1}^3 h_i g_i=1 on the cube satisfies deg⁡h1g1‾≥n+1\deg\overline{h_1g_1}\geq n+1, where the bar denotes multilinearization. The construction applies a fresh selector variable to the hard pair of Kothari, Kovacs-Deak, Wang, and Yang. Thus its new ingredient is a short transfer of their existing degree obstruction to the product-zero setting. The full unbounded-degree counterexample has been formalized and checked in Lean 4. HAL deposit: hal-05800244v1.

Primarily AI-generated textHuman understanding: no partsBoolean cubeLean formalizationNullstellensatzdegree lower boundspolynomial certificates
Oct 18, 2026PDF ↗View work →
hexagon:2610.00328v1

cs.CC — Computational Complexity

A Counterexample to Affine-Subspace Union Stability under Small Deletions

Contributed by YURAN XIU

We construct a family of affine coordinate subspaces of F2N\mathbb{F}_2^N whose union is the entire space, but for which deleting a 1/N1/N fraction from each member removes a fraction larger than N−cN^{-c} from the union, for every fixed c>0c>0 and arbitrarily large NN. Each subspace has codimension log⁡2N\log_2 N, and the family has at most 2N22N^2 members. The construction uses all monochromatic coordinate conditions of size kk on 2k2k distinguished coordinates, where N=2kN=2^k, and deletes their common intersection with the middle Hamming layer. The exact global loss is (2kk)/4k\binom{2k}{k}/4^k. This disproves the affine-union conjecture of Alekseev and Gaevoy, already for their fixed parameters q=2q=2 and r=1r=1. The all-exponent, arbitrarily-large-dimension counterexample has been formalized and checked in Lean 4. HAL deposit: hal-05800246v1.

Primarily AI-generated textHuman understanding: no partsBoolean cubeLean formalizationaffine subspacescounterexampleunion stability
Oct 18, 2026PDF ↗View work →
hexagon:2610.00337v1

cs.CC — Computational Complexity

An Approximate Solution to the Minimum Vertex Cover Problem: The Salvador Algorithm

Contributed by Frank Vega

Minimum Vertex Cover has a classical linear-time ratio of 22, and under the Unique Games Conjecture no polynomial-time algorithm achieves a fixed ratio below 22 unless P=NP\mathrm{P}=\mathrm{NP}. We present version 0.1.4 of \textsc{Salvador}, a linear-time ensemble of seventeen strategies, numbered in the order in which they are computed: twelve base strategies (component amplification before a maximal matching, the maximal matching itself, degree and weight heuristics, reductions to auxiliary problems that are solved exactly, a decomposition into bipartite layers, a weighted subdivision reduction and a bounded-treewidth dynamic program), followed by five improvers (a union pass, local search, reduce-and-search, consensus forcing and a swap-maximize refinement). We prove that every strategy runs in O((n+m) α(n))O((n+m)\,\alpha(n)) time, and that the returned cover has at most 2τ−r2\tau-r vertices, where rr is the number of components with an edge, so the ratio is at most 1.9999999991.999999999 whenever τ≤109r\tau\le10^{9}r. We prove exactness or a bounded ratio on several classes of graphs, among them every bipartite graph on which the Hopcroft--Karp phases of the layer strategy reach a maximum matching, and we give a per-instance certificate: a cover with at most 2L−∣M∣2L-|M| vertices, for a lower bound L≤τL\le\tau and the maximal matching MM, is within ratio 3/23/2 on that instance. In a reproducible suite the returned cover satisfies ∣C∣≤2τ−∣M∣|C|\le2\tau-|M| on all 291291 tested graphs with a known optimum and is certified on the six without one, although single strategies violate it; on the 6868 DIMACS clique complements it is never worse than Hvala and optimal on 3737 instances against 1818. Whether ∣C∣≤2τ−∣M∣|C|\le2\tau-|M| holds on every graph is stated as a conjecture: a proof would give a linear-time 3/23/2-approximation and would refute the Unique Games Conjecture unless P=NP\mathrm{P}=\mathrm{NP}.

Primarily AI-generated textHuman understanding: all partsApproximation AlgorithmBipartite LayersEnsemble HeuristicsLinear TimeMaximal MatchingP versus NPSplit GraphUnique Games ConjectureVertex Cover
Oct 18, 2026PDF ↗View work →
hexagon:2610.00331v1

math.RA — Rings and Algebras

Values of the Huang–Ma invariant

Contributed by Qiyue Tang

We prove the binary-value conjecture of Huang and Ma for integer matrices admitting a fixed positive diagonal skew-symmetrizer. We determine the exact set of values in every size and construct matrices realizing each value.

A mix of human-written and AI-generated textHuman understanding: some partsCluster Algebra
Oct 18, 2026PDF ↗View work →
hexagon:2610.00330v1

math.NT — Number Theory

A construction of the sphere-packing magic functions in dimensions 8 and 24

Contributed by Thomas Hales

We develop an alternative route to the solutions of the sphere-packing problem in dimensions 8 and 24, through the auxiliary functions in the Cohn--Elkies Fourier bound. In each dimension we construct a radial Schwartz function with the prescribed lattice zeros by solving a countable system of linear equations in absolutely summable coefficients. We prove existence and uniqueness after normalization, without using the known magic functions or Fourier interpolation. Through a Cauchy boundary problem, solutions of the homogeneous equations are identified with global sections of a rank-six holomorphic vector bundle over the compactified modular curve of the full modular group, with its orbifold structure retained. Riemann--Roch shows that this bundle has Euler characteristic one, forcing a nonzero global section and hence a nontrivial solution of the equations. A separate argument proves uniqueness after normalization. An equivalent positive operator equation has a bounded inverse. The construction is motivated by the coefficient method for planar circle packing. A subsequent comparison identifies our solutions with the functions of Viazovska and of Cohn, Kumar, Miller, Radchenko, and Viazovska. The route to sphere packing is not yet independent in its entirety: we do not prove the required global sign inequalities from the coefficient equations. Those inequalities are inherited from the known functions after identification.

Primarily AI-generated textHuman understanding: some partsSphere packing
Oct 18, 2026PDF ↗View work →
hexagon:2610.00322v1

math.NT — Number Theory

The Willow Transform and the Blind Zone Theorem: A Sharp Obstruction in the Turán Hierarchy for the Riemann ξ-Function

Contributed by Changxia Lin

Let Ξ(t)=ξ(1/2+it) denote the Riemann ξ-function in the critical-line parametrisation, let Ξ(t)=Σ_{k≥0}(-1)^k c_k t^{2k} be its even Taylor expansion at the origin, and let D(n,r)=det[c_{n+i-j}]_{i,j=0}^{r-1} be the associated Toeplitz minors. By the Schoenberg--Edrei characterisation of Pólya frequency sequences, positivity of D(n,r) for all n≥0 and all r≥1 is equivalent to the Riemann hypothesis (RH); for each fixed r the inequalities D(n,r)≥0 supply a necessary condition for RH, and for r=2 they were proved unconditionally by Csordas, Norfolk and Varga, so that the second level of the resulting hierarchy is not discriminating. We show that this failure of discrimination persists far beyond level 2, and we determine the range over which it does so: every level r≤43 is non-discriminating. Parametrising the zeros of the generating function G(z)=Σ_{k≥0}c_k z^k by β_j=-1/z_j, the dual Jacobi--Trudi identity yields the exact identity D(n,r)=c_0^r s_{(r^n)}(β), where s_{(r^n)} denotes the Schur function of the rectangular partition (r^n) in the alphabet β. A zero of ζ off the critical line contributes to β a conjugate pair ρ e^{±iθ} whose argument θ coincides with the vertical angle of the corresponding violating pair, whereas zeros on the critical line contribute positive real variables. For an alphabet of cardinality two we prove the closed form s_{(a,b)}(ρ e^{iθ}, ρ e^{-iθ}) = ρ^{a+b} sin((a+1-b)θ)/sin θ = ρ^{a+b} U_{a-b}(cos θ), where U_k is the Chebyshev polynomial of the second kind; the sign is therefore governed by the criterion U_k(cos θ)>0 if and only if (k+1)θ<π. Through the coproduct expansion s_λ(X⊔Y)=Σ_μ s_μ(X)s_{λ/μ}(Y), the Littlewood--Richardson expansion s_{λ/μ}=Σ_ν c^λ_{μν}s_ν of each skew factor, and the positivity of Schur functions on positive real alphabets, the sign analysis reduces to two-variable constituents. Since c^λ_{μν}>0 forces ν⊆λ=(r^n), the index k=ν_1-ν_2 of each constituent is bounded by the number of columns r and is independent of the shift n. All constituents then have the same sign, so no cancellation occurs. The same bound persists for an alphabet containing several conjugate pairs: iterating the coproduct over the pairs and using the fact that the entry 1 occurs at most once in each column of a semistandard tableau bounds every constituent index by ν_1≤r, independently of the number of pairs. This yields the following result. Blind Zone Theorem. Let the alphabet contain any number of violating pairs, each subtending a vertical angle at most θ_max, and suppose θ_max<π/(r+1). Then every minor D(n,r') with r'≤r is strictly positive, notwithstanding the presence of non-real zeros. The critical strip together with γ_1=14.134725141... forces θ≤θ_max=2 arctan(1/(2γ_1))=0.07071826... radians, whence π/θ_max=44.424...; consequently every order r≤43 is non-discriminating: for all n≥0 and all r≤43 the minor D(n,r) is positive if RH fails and non-negative if RH holds, so no minor of order r≤43 can certify either the truth or the falsity of RH. The bound is on the order r and not on the shift n; the corresponding n-based assertion is false, and the mechanism responsible is exhibited in the remarks section. The threshold is established for an arbitrary number of violating pairs; the case of several pairs is settled in the coproduct section and requires no separation condition on the moduli and no bound on the number of pairs. No claim of a proof of the Riemann hypothesis is made.

Primarily human-written textHuman understanding: all parts1 Riemann zeta function 2 xi-function 3 Turan inequalities 4 Toeplitz minors
Oct 18, 2026PDF ↗View work →
hexagon:2610.00312v1

math.DS — Dynamical Systems

Sharp equilibrium and stable-state capacities of multisite phosphorylation

Contributed by Michael Mislan

For the sequential distributive nn-site phosphorylation cycle with one kinase and one phosphatase, the maximal number of positive equilibria is 2n−12n-1 and the maximal number of locally asymptotically stable equilibria is nn, for every n≥1n\ge1. The stable-state ceiling includes nonhyperbolic attractors. Both bounds are attained simultaneously at common conserved totals by rational positive rate constants and rational hyperbolic equilibria: nn sinks alternate with n−1n-1 saddles, each with one unstable direction. This configuration persists on a nonempty open subset of the full parameter space. An explicit polynomial recurrence and interlacing construct the equilibria. Stability follows by separating equilibrium geometry from kinetic time scales, retaining enzyme-bound substrate in the slow variables, and controlling a path matrix with positive rank-one feedback. Further results give a diagonal Lyapunov certificate, a quantitative eigenvalue splitting law, exact finite-size witnesses and a three-site robustness and recovery certificate. An accompanying registered Lean theorem establishes equilibrium attainment; the broader capacity results are proved here by conventional arguments.

Primarily AI-generated textHuman understanding: some partsmass-action kineticsmultisite phosphorylationmultistabilitysteady states
Oct 17, 2026PDF ↗View work →
hexagon:2610.00298v1

math.GT — Geometric Topology

Almost all simple lengths are unique up to isometry

Contributed by Nhat Minh Doan

For every fixed hyperbolic torus with one cusp or one geodesic boundary, we prove that, among simple curves of length at most LL, the number of isometry orbits and the number of distinct lengths differ by o(L2)o(L^2). Thus almost every complete length level is a single isometry orbit of at most six curves, and multiplicity converges in mean to the generic orbit size. The modular specialization is exactly Chen's density theorem for Markoff uniqueness. We also prove the full Schmutz--Schaller bound for every punctured torus having a simple trace that is not an algebraic integer, including any transcendental trace, and for dense families with integral traces. More strongly, every rational length class on these surfaces contains at most two curves. Transcendental twists give multiplicity one, while symmetric families with geodesic boundary attain the sharp bounds four and six. The density proof extends Chen's method using the stable-norm estimates of Doan-Li-Nguyen.

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

math.MG — Metric Geometry

An explicit finite cylinder cover of the regular tetrahedron saving 3.86×10−43.86\times10^{-4} below the half-area bound

Contributed by Ricardo Pinho

We give an explicit cover of a regular tetrahedron by 40964096 cylinders with compact triangular perpendicular bases. The sum of their base areas, divided by the tetrahedron's minimum orthogonal projection area, lies in [0.499613830783714148, 0.499613830783714149)[0.499613830783714148,\,0.499613830783714149). Thus the saving below 1/21/2 exceeds 0.0003861692162858510.000386169216285851. The construction uses a finite tilt in the angular-sector framework of OpenAI's September 2026 preprint and rationally specified radial cutoffs. Coverage is certified by exact linear-programming dual witnesses, and independently verified by exhaustive rational polyhedron clipping. We describe the geometric reduction, the certificate obligations, and reproducible verification of the full closed tetrahedron and the perpendicular base areas. No optimality is asserted.

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

math.MG — Metric Geometry

A converse to the discrete four-vertex theorem

Contributed by Kristoffer Josefsson

Tabachnikov asked whether every cyclic sequence of positive numbers with at least two local maxima and two local minima is the sequence of radii of the circles through consecutive vertex triples of a convex polygon whose circumcenters lie inside the corresponding vertex angles. We prove this for every n ≥ 4, with extrema counted as plateaus. This is the sharp form: by Dahlberg’s discrete four-vertex theorem the condition is also necessary for nonconstant sequences. Locally near every nonconstant admissible sequence the polygon can be chosen to depend continuously (indeed C1) on the sequence, but in general not globally: we give an explicit path of admissible hexagon data along which no continuous choice of realizing polygons exists. The existence and continuity results are formalized in Lean 4 with Mathlib. We also prove the corresponding characterization for circles tangent to three consecutive supporting lines, using a separate tangential-polygon construction and Wegner’s forward theorem.

A mix of human-written and AI-generated textHuman understanding: all partsfour-vertex theorempolygons
Oct 17, 2026PDF ↗View work →
hexagon:2610.00309v1

math.PR — Probability

Quantitative analysis of critical-window profiles for autocatalytic emergence

Contributed by Michael Mislan

The critical-window law for reflexively autocatalytic and food-generated (RAF) sets in the reversible binary-polymer model states that, when the mean number of reactions catalysed per molecule grows like λn\lambda n, the RAF probability converges to Sν(1−e−λ)S_\nu(1-\mathrm{e}^{-\lambda}), where SνS_\nu is the probability that ordinary reversible closure of the food set is unbounded in an infinite field of independently open reaction channels. The law is known for the ordered split-position catalogue (ν=sp\nu=\mathrm{sp}) and for the commuting-factor quotient catalogue (ν=qt\nu=\mathrm{qt}). It is an existence theorem: it names the limit but says nothing effective about its value, its shape near zero, or what a finite network actually does. This paper answers those three questions. For both profiles, a construction gives a terminating algorithm which, given rational openness aa and rational tolerance ε\varepsilon, returns a rational interval of width below ε\varepsilon containing Sν(a)S_\nu(a), with an explicit approximation error 1/m+(2L+1−2)(1−aL+1)r1/m+(2^{L+1}-2)(1-a^{L+1})^r for a computable seed length LL and record index rr, uniform on every openness interval bounded away from zero. The key estimate is a finite-cap record contraction proved without conditioning on survival and without independence between repair attempts. Second, tracking total word length along productive closure histories replaces a coefficient of order (Jr)\binom{J}{r} over enormous channel caps by Crν≤36r2r(r−1)/2C_r^\nu\le36^r2^{r(r-1)/2}, giving log⁡Sν(a)≤−log⁡2(1/a)/(2log⁡2)+O(log⁡(1/a))\log S_\nu(a)\le-\log^2(1/a)/(2\log2)+O(\log(1/a)) and exact certificates such as Sν(10−20)<10−629S_\nu(10^{-20})<10^{-629}. Third, at fixed word length nn the probability that some singleton RAF exists is exactly 1−(1−p)2481-(1-p)^{248} (split) or 1−(1−p)2341-(1-p)^{234} (quotient), so the finite RAF probability is linear in pp at zero while the limiting profile is flatter than every power; this order-of-limits effect is quantified with rational two-sided predictions and two fully explicit examples at n=16n=16. Further results give strict monotonicity of the profile, an effective global modulus of continuity, terminating inverse-probability brackets, and non-analyticity at zero. The effective evaluator, its error contract with the finite catalytic model and productive-history extraction are checked in Lean~4; the printed numerical bounds are checked by the accompanying replay script; the sharper counting theorem, the singleton law and the regularity results have conventional proofs and are labelled as such.

Primarily AI-generated textHuman understanding: some partsautocatalytic setscomputable analysiscritical windowfinite-size effectslow-intensity asymptotics
Oct 17, 2026PDF ↗View work →
hexagon:2610.00300v1

math.QA — Quantum Algebra

Low-rank Grothendieck rings: an AI-assisted classification project, constructions, and open problems

Contributed by Sebastien Palcoux

We present a public research project on the Grothendieck rings of complex fusion categories of rank at most eight. The project reports unrestricted classification theorems in ranks two, three, and four, and classifications within specified fusion-multiplicity bounds in ranks five through eight, with two rank-six categorification questions unresolved. Its resources include research manuscripts, an exact fusion-ring census, verification code, and an interactive atlas. We describe seven constructions that are promising candidates for new tensor categories, subject to a separate assessment of their novelty up to tensor equivalence. We also state the two open problems explicitly. This announcement records the project's claims and their verification status; it invites independent mathematical review and does not provide a new proof of the complete classification.

Primarily AI-generated textHuman understanding: some partsAI-assisted mathematicsFusion categoriesGrothendieck ringscategorificationfusion multiplicitylow ranknear-group categories
Oct 17, 2026PDF ↗View work →
hexagon:2610.00313v1

math.DS — Dynamical Systems

Attracting oscillations in sequential distributive multisite phosphorylation

Contributed by Michael Mislan

The sequential distributive nn-site phosphorylation cycle with one kinase and one phosphatase admits attracting positive periodic orbits under mass-action kinetics for every n≥3n\ge3. An explicit three-site family has a fixed positive equilibrium, a transversal imaginary-eigenvalue crossing, a stable complementary spectrum and a negative first Lyapunov coefficient. A site-addition argument extends the supercritical Hopf bifurcation to every larger site count. Together with the one-site calculation and Vassena's two-site exclusion, this makes three the exact threshold for Hopf bifurcation in this family. Dynamic sequestration of the shared enzymes supplies the feedback: the equilibrium, productive fluxes and statically eliminated vector field remain fixed while stability changes. Further results compare enzyme clamps and selective reduction, quantify flux and amplitude laws, validate two finite-amplitude attracting orbits, and give a driven thermodynamic realization. Exact algebra and interval certificates support the quantitative claims; numerical continuation is distinguished from proof. A registered Lean theorem independently establishes an existential affine family with attracting periodic orbits for every n≥3n\ge3. The manuscript's arbitrary-parent site-addition theorem and its quantitative extensions go beyond that registered statement.

Primarily AI-generated textHuman understanding: some partsHopf bifurcationattracting periodic orbitsenzyme sequestrationmultisite phosphorylation
Oct 17, 2026PDF ↗View work →
hexagon:2610.00302v1

math.CT — Category Theory

The Grothendieck construction between the telescope monad and contextads

Contributed by Kotaro Kamiya

A telescope is a list of stages in which each stage is a family indexed over the Grothendieck construction of the previous ones. The telescope monad stacks stages as the free-monoid 2-monad on spans, whereas a contextad collapses two stages into one by a dependent sum. This paper derives both from the span of single stages, and thereby explains why the strict algebras of the telescope monad are contextads. The link is the Grothendieck extension of a span. Because it is monoidal and preserves coproducts, it turns the telescopes into the free monad on the extension of the span of stages and the stage contextad into the Grothendieck monad, whose Kleisli arrows are the contextful arrows. The main theorem identifies the stage contextad with the pseudo-algebra of the telescope monad transported from the display contextad. Its structure map is the dependent sum, which the extension turns into the iterated multiplication of the Grothendieck monad.

A mix of human-written and AI-generated textHuman understanding: some partsGrothendieck constructioncomprehension categorycontextaddependent sumtelescope
Oct 17, 2026PDF ↗View work →
hexagon:2610.00297v1

math.CO — Combinatorics

Bounds for Erdős Problem #188: 7≤k≤607\le k\le 60

Contributed by Carson Crocker

Let ℓk\ell_k denote kk collinear points with consecutive distances 11. Erdős Problem #188 asks for the least kk such that the plane can be colored red and blue with no two red points at distance 11 and no blue copy of ℓk\ell_k. Previous work gives 6≤k≤63306\le k\le 6330, with the lower bound due to Tsaturian and the upper bound due to Currier, Mody, Xie and Zhang. We prove 7≤k≤607\le k\le 60. For the lower bound we show that every red/blue coloring of the plane contains two red points at distance 11 or a blue ℓ6\ell_6, following the skeleton of Arman and Tsaturian's proof in three dimensions; four distance lemmas are reduced to explicit unsatisfiable propositional formulas, certified by DRAT proofs. For the upper bound we give an explicit periodic coloring whose red set consists of 9090 closed regular 2424-gons of 4848 different sizes, all of diameter less than 0.9990.999, in each period, with rational centers and sizes. Any two cells are either far apart (all distances between their points exceed 11) or close together (all distances are less than 11), which is checked in exact arithmetic for all periodic translates and rules out red unit pairs. That every ℓ60\ell_{60} contains a red point is proved by a computer-assisted verification: for every unit direction uu, the sets R−juR-ju, j=0,…,59j=0,\dots,59, cover the period torus, with every inclusion checked in rigorous ball arithmetic. A second, separately written program, based on a reduction to one-dimensional covering problems solved in outward-rounded interval arithmetic, confirms this. The computations, the verification code and drafts of the text were produced with AI tools under the author's direction; all proof certificates and verification programs are public (doi:10.5281/zenodo.23405962).

Primarily AI-generated textHuman understanding: some partsDRATErdős problemsEuclidean Ramsey theorySATinterval arithmeticperiodic coloringunit distance
Oct 17, 2026PDF ↗View work →
hexagon:2610.00305v1

math.CO — Combinatorics

Three conjectures on the first two graph eigenvalues

Contributed by Idris Ali Shaik

Let λ₁(G) ≥ λ₂(G) be the two largest adjacency eigenvalues of a finite simple graph G on at least two vertices. We resolve the three conjectures appearing as 1.15–1.17 in Kannan, Kumar and Pragada. First, for every noncomplete graph, we prove λ₁(G)² + λ₂(G)² ≤ 2 Σ_{e∈E(G)} (1 − 1/c(e)), where c(e) is the largest order of a clique containing e. Second, we construct connected (K₅ minus one edge)-free graphs of arbitrarily large size that violate the exact color-critical bound proposed by Li, Liu and Zhang. Third, for every fixed F with χ(F) = r + 1 ≥ 3, we prove, uniformly over F-free graphs with m = e(G) → ∞, λ₁(G)² + λ₂(G)² ≤ 2(1 − 1/r)m − ((r − 2)/r)Δ(G) + o_F(m), where Δ(G) is the maximum degree. The coefficient of the degree term is best possible. The arguments use the half-plane complete-positivity theorem of Coutinho, Liu, Spier, Tang and Zhang, together with an explicit connected construction, weighted clique removal and spectral separation of vertices of high degree. Theorems 1.1–1.3 are formalized in Lean 4 and registered as PALOMAR-2026-10-15-000015 v1, PALOMAR-2026-10-16-000012 v1 and PALOMAR-2026-10-17-000005 v1, respectively.

A mix of human-written and AI-generated textHuman understanding: all partsadjacency eigenvaluesextremal graph theoryspectral graph theory
Oct 17, 2026PDF ↗View work →
hexagon:2610.00306v2

math.CO — Combinatorics

A Product Formula for Partition-Restricted Boundary Hypermatrix Counts

Contributed by YURAN XIU

We prove the Koprowski--Lewis product conjecture for nondegenerate 2×(k+1)×k2\times(k+1)\times k hypermatrices over finite fields with two partition-shaped layers of prescribed zeros. The result holds for every positive kk, every finite field, and every admissible pair of partitions. After fixing the first slice, nondegeneracy is equivalent to simplicity of a partial linear map. Applying the simple-extension theorem of Arora, Ram, and Venkateswarlu inside the successive allowed row spaces gives the product directly. We include an elementary proof of that extension theorem and justify the equivalence with the defining projective critical locus of the hyperdeterminant. The complete counting statement and its semantic equivalences have been checked in Lean. HAL deposit: hal-05800194v1.

Primarily AI-generated textHuman understanding: no partsLean formalizationenumerationfinite fieldshypermatrixproduct formula
Oct 17, 2026PDF ↗View work →
hexagon:2610.00316v2

math.CO — Combinatorics

Tools for proving that graphs are not graceful

Contributed by Boon Suan Ho

A graph with mm edges is graceful if its vertices can be labeled with distinct integers in [0,m][0,m] whose edge differences are exactly 1,…,m1,\dots,m. Graceful labelings have been constructed for sixty years, but there are few general methods for showing that a graph is not graceful. We start from a single generating-function identity that restates gracefulness, and derive three tools from it: residues at roots of unity, extending the classical parity condition; positivity on the unit circle, whose semidefinite form amounts exactly to the Goemans–Williamson max-cut relaxation tested against the minimum of the Dirichlet kernel; and the label interval itself, which forces the labels of a dense subgraph to have a large span. The consequences include new families of ungraceful graphs: every edge-transitive graph that contains K6K_6, the Paley graphs P(q)P(q) with q≥37q\ge37, the Kneser graphs K(n,k)K(n,k) with n≥5.61kn\ge5.61k, almost every dd-regular graph with d≥84d\ge84, and the polarity graphs ERq\mathrm{ER}_q with q≥23q\ge23, which contain no 44-cycle. For the semidefinite form of positivity we also determine exactly what it can prove, and we show that a planar refinement is strictly stronger: it excludes the Kneser graph K(11,2)K(11,2) with any seven edges deleted.

Primarily AI-generated textHuman understanding: some partsDirichlet kernelGolomb rulerdifference setsgraceful labelingmax-cutsemidefinite programming
Oct 17, 2026PDF ↗View work →
hexagon:2610.00317v1

math.CO — Combinatorics

No lattice tiling of Z35\mathbb{Z}^{35} or Z805\mathbb{Z}^{805} by Lee balls of radius three

Contributed by Deep Bhattacharjee, Ushashi Bhattacharya

We prove that there is no lattice tiling of Z35\mathbb{Z}^{35} or of Z805\mathbb{Z}^{805} by Lee balls of radius three. These were the only cases left open by Xiao and Zhou among the Lee balls of dimension at least three and radius at least two with fewer than 2302^{30} points, so the lattice Golomb--Welch conjecture holds for all of them.

A mix of human-written and AI-generated textHuman understanding: some partsGolomb-Welch conjectureLee metricgroup ringlattice tilingperfect code
Oct 17, 2026PDF ↗View work →
hexagon:2610.00318v1

math.CO — Combinatorics

A graph with three card types and five vertex orbits

Contributed by Deep Bhattacharjee, Ushashi Bhattacharya

We prove that the answer to part~(b) of Problem~20.71 of the Kourovka Notebook is yes: there is a connected graph on 6363 vertices with exactly three isomorphism types of vertex-deleted subgraphs whose automorphism group has five orbits on the vertices. The graph is a Cayley graph of a Suzuki 22-group of order 6464 with one vertex removed.

A mix of human-written and AI-generated textHuman understanding: some partsCayley graphSuzuki 2-groupdivisible design graphpseudosimilar verticesvertex-deleted subgraph
Oct 17, 2026PDF ↗View work →
hexagon:2610.00319v1

math.CO — Combinatorics

Every odd antihole is strongly chromatic-choosable

Contributed by Deep Bhattacharjee, Ushashi Bhattacharya

We prove the complete Fiujlaali--McDonald conjecture on odd antiholes unconditionally: for every ℓ≥3\ell\ge3 the only assignments of (ℓ−1)(\ell-1)-element lists from which the odd antihole $\cbar{2\ell-1}$ cannot be coloured are the constant ones. Consequently, an odd-hole-free kk-critical graph of maximum degree Δ\Delta containing an odd antihole of length 2(Δ−k)+72(\Delta-k)+7 is that antihole.

A mix of human-written and AI-generated textHuman understanding: some partschromatic-choosabilitycolouringcritical graphodd antiholeodd hole
Oct 17, 2026PDF ↗View work →
hexagon:2610.00320v1

math.CO — Combinatorics

The sl(2)\mathfrak{sl}(2) weight system at c=−3/32c=-3/32 extends to a graph 4-invariant

Contributed by Deep Bhattacharjee, Ushashi Bhattacharya

We prove unconditionally the conjecture of Fomichev, Karev, Pavutnitskiy and Usanov that the specialization of the sl(2)\mathfrak{sl}(2) weight system at c=−3/32c=-3/32 extends to a 44-invariant of graphs. The extension is ξ(G)=(−32)−nSG(−2)\xi(G)=(-32)^{-n}S_G(-2), where SG(N)S_G(N) counts with signs the assignments of 22-element subsets of {1,…,N}\{1,\dots,N\} to the nn vertices of GG.

A mix of human-written and AI-generated textHuman understanding: some partsClifford algebrafour-term relationintersection graphoscillator representationweight system
Oct 17, 2026PDF ↗View work →
hexagon:2610.00314v1

math.AP — Analysis of PDEs

Non-unique vanishing-viscosity solutions of 2D Euler with vorticity in LpL^p

Contributed by Umberto Pappalettera, Massimo Sorella

For every finite p>2p>2, we construct one real compactly supported zero-circulation initial vorticity in L1(R2)∩Lp(R2)L^1(\mathbb R^2)\cap L^p(\mathbb R^2) whose unforced Navier--Stokes evolutions have two distinct strong vanishing-viscosity accumulation paths. Both limits are renormalized unforced Euler solutions with the same strong initial trace. The construction uses a fixed infinite concentric stack, a smooth unstable fourfold profile, actual positive scalar envelopes, and a finite nonlinear expansion retaining the interacting harmonic histories. Discounted source history is controlled through the complete prospective receiver stop, and exact-cap normalization yields a depth-uniform outgoing reset. Protected first crossings, phase degree and a sparse phase assignment then separate the two limits. The analytical preliminaries, finite-sector spectral scope, source-reference comparison and uniform parameter order are included in the proof.

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

math.AG — Algebraic Geometry

The fifteenth cohomology of moduli spaces of stable curves

Contributed by zeming sun, guoxiong gao, shurui liu

We determine the fifteenth cohomology of the moduli stack of stable curves M‾g,n\overline{\mathcal{M}}_{g,n} in every genus gg and number of markings nn, with its symmetric-group action, by providing explicit multiplicity formulas for its simple constituents. We also prove the generalized Hodge conjecture in this case. The main result of this paper was obtained using the Pharos system. The author has reviewed the arguments and developed an understanding of the proof. On the basis of this review, the author believes the paper to be correct.

Primarily AI-generated textHuman understanding: some partsHodge structurescohomologygeneralized Hodge conjecturemoduli spaces of stable curvesmotives
Oct 17, 2026PDF ↗View work →
hexagon:2610.00303v1

math.AG — Algebraic Geometry

A Counterexample to Beauville's Stability Conjecture

Contributed by Yi Gu, Lifan Guan

We construct a morphism f:X→Yf: X\to Y from a genus-two curve to an elliptic curve such that f∗Lf_*\mathcal L is unstable for every $\mathcal L\in\Pic^3(X)$. This gives a counterexample to a conjecture of Beauville.

A mix of human-written and AI-generated textHuman understanding: all partsDirect imagesFrey–Kani construction.stability
Oct 17, 2026PDF ↗View work →
hexagon:2610.00315v1

math.AG — Algebraic Geometry

Dense Algebraic Loci of Hodge Classes

Contributed by Deep Bhattacharjee, Ushashi Bhattacharya

We prove unconditionally that the Hodge conjecture is equivalent to two statements about abelian varieties, that the locus on which either statement holds is dense in every family and is either the whole family or a meagre set, and that the real multiplications by 5\sqrt5, 6\sqrt6, 7\sqrt7 and by the cubic fields $\QQ(\zeta_{7})^{+}$ and $\QQ(\zeta_{9})^{+}$ are algebraic on explicit families of K3 surfaces, the cubic ones on the surfaces of Mumford type whose quaternion algebra is ramified at two real places. For each of the two statements we build the object it needs next, a complex on a product of two Weil fourfolds and a class on an abelian fourteenfold, prove what it does, and prove at which step it stops. Both statements remain open.

A mix of human-written and AI-generated textHuman understanding: some partsHodge conjectureK3 surfacesWeil classesabelian varieties
Oct 17, 2026PDF ↗View work →
hexagon:2610.00301v2

cs.CC — Computational Complexity

The Exact Junta Bound for Degree-Two Boolean Functions on q-ary Hamming Cubes

Contributed by YURAN XIU

We determine the maximum number of relevant variables of a Boolean function of degree at most two on a finite alphabet. For every integer q≥2q\geq2, this maximum is exactly max⁡{4,q+1}\max\{4,q+1\}. Here degree means Hamming, or junta, degree: the function is a sum of real-valued functions, each depending on at most two coordinates. We also prove that any such function with more than four relevant variables has a selector coordinate: after that coordinate is fixed, the function depends on at most one other coordinate. The proof combines saturation on a binary four-dimensional restriction with a rigidity argument that applies to every symbol of the original alphabet. Two disjoint interactions force a four-junta; a function with more than four relevant variables has a star of interactions. The exact bound and selector theorem have been formalized in Lean 4, with transitive dependencies using only the standard axioms of Lean and mathlib.

Primarily AI-generated textHuman understanding: no partsBoolean functionsHamming graphsLean formalizationdegree twojunta theoremrelevant variables
Oct 17, 2026PDF ↗View work →
hexagon:2610.00307v2

cs.CC — Computational Complexity

Set Cover by Cyclic Rotations Is NP-Complete

Contributed by YURAN XIU

Given an explicitly listed binary pattern of positive length nn and a nonnegative integer bb in binary, can at most bb cyclic rotations of the pattern cover all nn positions? We prove that this decision problem is NP-complete. The reduction constructs a pattern in a cyclic group of polynomial order and outputs its entire indicator word. Its principal ingredient is a replicated-marker construction: a cover within the budget must choose one translate in every layer, and each failed difference constraint leaves a block of more holes than the remaining translates can cover. Combining this construction with the known embedding of graph cliques into circulant graphs using distinct three-term sums gives a polynomial-time reduction from 33SAT. The theorem allows every subset, including the empty pattern, and every binary budget. A Lean formalization checks the mathematical reduction, the full-word polynomial-time programs, NP membership, and the unconditional NP-hardness foundation. HAL deposit: hal-05800233v1.

Primarily AI-generated textHuman understanding: no partsLean formalizationNP-completenesscyclic rotationsset cover
Oct 17, 2026PDF ↗View work →
hexagon:2610.00308v2

cs.CC — Computational Complexity

A Polynomial Separation for Adaptive Fourier-Overlap Parity Decision Trees

Contributed by YURAN XIU

Consider the parity decision tree rule that, at every nonconstant restriction, queries a nonzero character maximizing the intersection of the current Fourier support with its translate. We construct an explicit infinite family for which every adaptive policy obeying this rule has polynomial worst-case depth, although an unrestricted parity decision tree has logarithmic depth. For every ℓ≥1\ell\geq1, let R=2ℓR=2^\ell. Our function has n=4ℓ−1+R2ℓ+Rn=4\ell-1+R^2\ell+R input bits and exactly k=R6−R5+Rk=R^6-R^5+R nonzero Fourier coefficients. Every history-dependent maximizing policy terminates and computes the function, but has a feasible path of length at least R>k1/6R>k^{1/6}; an explicit unrestricted tree has depth at most 5ℓ≤log⁡2k5\ell\leq\log_2 k. The construction places one pointer behind each cell of a finite-field affine partition, with all pointers accessing a shared data table. After any sequence of equal-answer table comparisons, exact signed Fourier coefficients force every maximizing query to compare two remaining table blocks. This invariant accommodates all tie choices and all resulting table partitions. The complete separation, including the specified polynomial-field representation and the existence of every operational policy's finite run, has been checked in Lean. The result concerns this particular support-overlap rule; it is not a lower bound against arbitrary parity decision trees. HAL deposit: hal-05800236v1.

Primarily AI-generated textHuman understanding: no partsFourier analysisLean formalizationadaptive algorithmsparity decision trees
Oct 17, 2026PDF ↗View work →
hexagon:2610.00311v2

math.NT — Number Theory

On Landau--Siegel zeros

Contributed by Ben Green

This is a variant of the short OpenAI proof that there do not exist Landau-Siegel zeros. In v2, two parameters are decoupled to give a better constant in the main theorem.

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

math.NT — Number Theory

Polylogarithmic Descent for Almost All Collatz Orbits in Natural Density

Contributed by Idris Ali Shaik

Korec proved that, for each fixed θ > log 3/log 4, almost every positive integer n has a Collatz iterate below n^θ in natural density. Tao proved descent below every prescribed diverging threshold in logarithmic density. We obtain polylogarithmic descent in ordinary natural density within logarithmically many steps, with bounds on the preceding orbit values. The shortcut map T sends even n to n/2 and odd n to (3n+1)/2. The unaccelerated map Col sends even n to n/2 and odd n to 3n+1. For any prescribed positive function f(n) → ∞, however slowly, we prove that almost every positive integer n, in natural density, has nonnegative integers k = k(n) and ℓ = ℓ(n) satisfying T^k(n) = Col^ℓ(n) < (log n)^A_FP f(n), where A_FP ≈ 9.9911 is an explicit exponent. The shortcut time is k = c_* log n + O_f(√(log n log log n)), where c_* = 2/log(4/3). The leading time c_* log n is predicted by the average logarithmic contraction of the equally weighted multipliers 1/2 and 3/2. The unaccelerated time is ℓ = (3/2)c_* log n + O_f(√(log n log log n)). Both orbits are bounded by nf(n) up to their respective times. For each fixed A > A_FP, put q = A/(2A_FP) − 1/2. For sufficiently large X, all but at most C_A X/(log X)^q integers n ≤ X satisfy the same conclusions with target (log n)^A and bound n(log n)^q on both orbits. The constant C_A and the time-error constants depend only on A. The proof counts finite parity sequences exactly and follows first passages through decreasing thresholds. We count later failures among the original starting values, without assuming that values reached after a descent are uniformly distributed. For starting values 2^M ≤ n < 2^(M+1), only O(√(M log M)) cumulative passage times need to be counted at each threshold. A finite random-walk survival estimate supplies the additional saving needed at the critical exponent. Density-one descent below a fixed multiple of (log n)^A_FP is not established, and the pointwise Collatz conjecture remains open. The theorem for arbitrary f is formalized in Lean 4 with Mathlib and registered as PALOMAR-2026-08-26-000005, version 4.

A mix of human-written and AI-generated textHuman understanding: all partsCollatz mapalmost all Collatz orbitsfirst passagenatural densityparity vectorspolylogarithmic descentstopping time
Oct 17, 2026PDF ↗View work →
hexagon:2610.00294v1

math.NT — Number Theory

Rational points on elliptic curves that are primitive modulo a positive proportion of primes

Contributed by Manjul Bhargava

In 1977, Lang and Trotter conjectured that, subject to certain necessary arithmetic restrictions, a rational point PP of infinite order on an elliptic curve EE over $\Q$ should generate its reduction modulo infinitely many primes pp---and indeed should do so for a specified positive density of primes. However, to date, even this infinitude was not known unconditionally for any explicit pair (E,P)(E,P). For the curve E:y2=x3−2xE:y^2=x^3-2x and point P=(2,2)P=(2,2), we prove the existence of infinitely many---and indeed a positive lower density of---primes for which the reduction of PP generates $E(\F_p)$. More precisely, we prove that a common zero-free half-plane ℜs>1−1/N\Re s>1-1/N for Dedekind zeta functions gives a lower density of at least c/(Nlog⁡N)c/(N\log N), with c>0c>0 independent of NN. The announced theorem of Cureton and Thorner provides N=32N=32. Our proof combines this input with the marked Type~II estimates of OpenAI, a sieve with varying cofactor, and estimates for division fields and heights. The same method also applies to other CM elliptic curves and points.

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

math.AG — Algebraic Geometry

A Probabilistic Proof of a Positivstellensatz of Baldi-Sinn-Telek-Weigert

Contributed by Colin Tan

The AI gives a probabilistic proof of a uniform-denominator Positivstellensatz of Baldi--Sinn--Telek--Weigert for Laurent polynomials whose induced homogeneous form is strictly positive on the nonnegative part of a projective toric variety. Only this abstract was human-written. Three classical tools from mathematical statistics and probability theory were used by the AI: the Barndorff-Nielsen completion of discrete exponential families, sufficiency-based invariance under exponential tilting following Halmos--Savage and Van Campenhout--Cover, and the conditional limit theorem (equivalence of ensembles) of Diaconis--Freedman.

Primarily AI-generated textHuman understanding: no partsPositivstellensatzexponential familieslimit theoremtoric variety
Oct 16, 2026PDF ↗View work →
hexagon:2610.00291v1

math.PR — Probability

A nontrivial critical window for autocatalytic emergence in the binary polymer model

Contributed by Michael Mislan

The limiting probability is determined for a reflexively autocatalytic and food-generated (RAF) set in two reversible binary-polymer models. The models have the same molecules and food but distinguish reaction identities differently: the split-position catalogue retains ordered factorizations, whereas the quotient catalogue merges swapped factors exactly when they commute. With independent molecule--reaction catalysis, one mark shared by both directions, and mean catalysis fnf_n per molecule satisfying fn/n→λ>0f_n/n\to\lambda>0, the RAF probability converges in either model to Θν(λ)=Sν(1−e−λ),ν∈{sp,qt},\Theta_\nu(\lambda)=S_\nu(1-e^{-\lambda}),\qquad \nu\in\{\mathrm{sp},\mathrm{qt}\}, where SνS_\nu is the survival probability of infinite ordinary reversible food closure in the corresponding independent open-reaction field. Each profile is continuous and nondecreasing, lies strictly between zero and one at every finite positive intensity, and tends to zero and one at its two endpoints. Thus the entire linear scale is a nontrivial critical window, replacing the finite-step conjecture of Hordijk and Steel in the stated model. The common mechanism is uniform growth from a fixed supplied seed, followed by same-parameter richness and an exact law for complete catalytic pruning histories. A shared proof is given, including the explicit quotient transfer: deterministic closure and RAF equivalence project independent split marks to heterogeneous OR marks, rather than to the homogeneous quotient ensemble. The profiles satisfy Θsp(λ/2)≤Θqt(λ)≤Θsp(λ)\Theta_\mathrm{sp}(\lambda/2)\le\Theta_\mathrm{qt}(\lambda)\le\Theta_\mathrm{sp}(\lambda); productive food gateways give the conventional bounds Θsp(λ)≤1−e−32λ\Theta_\mathrm{sp}(\lambda)\le1-e^{-32\lambda} and Θqt(λ)≤1−e−30λ\Theta_\mathrm{qt}(\lambda)\le1-e^{-30\lambda}. The quotient gateway-conditioned bulk-factor limit is also identified. It concerns structural autocatalysis, without assertions about reaction kinetics or thermodynamic viability.

Primarily AI-generated textHuman understanding: some partsautocatalytic setsbinary polymer modelcritical windowreaction channelsreversible closure
Oct 16, 2026PDF ↗View work →
hexagon:2610.00262v2

math.CO — Combinatorics

A Formally Verified Certificate Proof of the Maximum Number of Stable Matchings for Six Men and Six Women

Contributed by YURAN XIU

We give a complete Lean 4 verification of the theorem that the maximum number of stable matchings for six men and six women with strict complete preferences is f(6)=48. Jo (2026) previously proved the unrestricted upper bound, and Benjamin, Converse, and Krieger (1995) supplied an attaining construction. Our contribution is an alternative, fully formalized proof using a finite certificate; the value 48 and the unrestricted theorem are already known. We reduce stable matchings of arbitrary profiles to order ideals of sequences of cyclic partner exchanges in which no man revisits a partner. A weighted frontier recurrence counts these ideals, and a sum of permanents bounds every future continuation. These bounds yield a finite certificate with 135,828 states. The complete argument, including the reduction for arbitrary profiles, certificate soundness, all concrete checks, and an attaining profile, has been formalized and checked in Lean 4. The final unconditional theorem depends only on the standard axioms of Lean and mathlib.

Primarily AI-generated textHuman understanding: no partsLeanextremal combinatoricsformal verificationstable marriagestable matchings
Oct 16, 2026PDF ↗View work →
hexagon:2610.00279v1

math.CO — Combinatorics

Pattern-avoiding binary arrays and a Stirling-type table: explicit formulas, exact recurrence orders, and non-D-finiteness

Contributed by Yunkun Song

Let ak(n)a_k(n) be the number of n×kn\times k binary arrays in which no row contains 001001 or 010010 and no column contains 001001 or 011011 as three consecutive entries (OEIS A207123). Splitting the rows by parity gives ak(n)=Uk(⌈n/2⌉) Uk(⌊n/2⌋)a_k(n)=U_k(\lceil n/2\rceil)\,U_k(\lfloor n/2\rfloor), where Uk(m)U_k(m) counts sequences in {0,…,m}k\{0,\dots,m\}^k in which every three consecutive entries (a,b,c)(a,b,c) satisfy b=cb=c or a≥max⁡(b,c)a\ge\max(b,c); equivalently, Uk(m)U_k(m) counts the multichains of length mm in a subposet Λk\Lambda_k of the Boolean lattice. We prove three main results. First, for each mm the minimal order of a linear recurrence in kk is exactly 3m+13m+1, and a unique factorization into blocks gives a positive double-sum formula for Uk(m)U_k(m) in terms of Stirling and rr-Stirling numbers. Second, the bivariate generating function is not D-finite, and every polynomial-coefficient recurrence that holds on a quadrant is a left multiple of the defining four-term recurrence; the same holds for an associated Stirling-type triangle N(k,q)N(k,q), and UU is not Stirling-like in the sense of Kauers. Third, the numerators hk(t)h_k(t) of ∑mUk(m)tm=hk(t)/(1−t)k+1\sum_mU_k(m)t^m=h_k(t)/(1-t)^{k+1}, analogues of the Eulerian polynomials, have only simple real zeros; equivalently, the chain polynomials of the posets Λk\Lambda_k are real-rooted, and the rows of NN are log-concave. We also determine all binomial shapes with nonnegative parameters in which Uk(m)U_k(m) is a single sum, and show that the near-diagonal entries N(k,k−d)N(k,k-d) are polynomials in kk starting exactly at k=2d+2k=2d+2. The reduction, the exact orders, the explicit formula, the non-D-finiteness, the description of the quadrant recurrences and the near-diagonal theorem are formalized in Lean 4 with Mathlib.

Primarily AI-generated textHuman understanding: some partsD-finite power seriesLean 4OEIS A207123Ore algebrasStirling numberschain polynomialsformal verificationpattern-avoiding arraysr-Stirling numbersreal-rootedness
Oct 16, 2026PDF ↗View work →
hexagon:2610.00286v1

math.CO — Combinatorics

Gallai's conjecture with two exceptional even vertices

Contributed by Idris Ali Shaik

Gallai conjectured that every connected finite simple graph on n vertices admits an edge partition into at most ⌈n/2⌉ simple paths. Botler and Sambinelli proved this when every even-degree vertex has at most three even neighbours. Fan, Hou and Zhou exempted one designated even vertex of positive degree and ensured that at least two paths ended there. Xie obtained the same endpoint conclusion for either of two adjacent designated even vertices, in separate partitions, when every other even vertex has at most three even neighbours. We prove that the same endpoint conclusion holds without requiring the two designated even vertices to be adjacent. Let F be the subgraph induced by the even-degree vertices of a connected finite simple graph G on n vertices, and let h and x be distinct vertices of F. Suppose every other vertex of F has degree at most three in F. Then for each of h and x there is an edge partition into at most ⌈n/2⌉ simple paths, at least two of which end at that vertex. Consequently, Gallai's bound holds whenever at most two vertices of F have degree greater than three. The two choices may use different partitions. We also obtain one partition with at least two paths ending at each member of the pair, using at most ⌊n/2⌋ + 1 paths. At odd order this is Gallai's bound. At even order the extra path can be necessary: K₄ minus an edge requires three paths when both degree-two vertices are prescribed. The ceiling and endpoint bounds are formalized in Lean 4 with Mathlib and registered as PALOMAR-2026-10-04-000006, version 1.

A mix of human-written and AI-generated textHuman understanding: all partsGallai's conjectureLean formalizationeven-degree verticesgraph theorypath decomposition
Oct 16, 2026PDF ↗View work →
hexagon:2610.00276v1

math.GT — Geometric Topology

Fixed-Level TQFT Transport of Marked Handleslide Coherence: Disjoint Cubes and a Three-Handle Pentagon

Contributed by Hao-Yu Sun

Fix an ordinary level K≥1K\geq1 and a fully specified family of pairwise disjoint positive handleslides on a compression body. The main question is how a literal geometric relation becomes a literal finite-level operator relation. We construct a finite reduced skein fibre and one normalized isomorphism $$ Q_{K,d}:\mathcal M_{K,d}\xrightarrow{\sim}\mathcal V^+_{K,d} $$ to the corresponding scalar-extended Walker--TQFT state space. Reusing this map at every vertex sends the supplied weight-zero slide cylinders to EKE_K-linear automorphisms: geometric squares become operator squares, finite slide orders give the same operator, and forward/reverse maps telescope for all declared phases and integer weights. The construction is fibrewise and makes no comparison between levels. These operator relations are transported images of the geometric relations proved in Papers~1 and~2; they are not new geometric coherence theorems. We then treat a fully specified positive three-handle pentagon. Its vertex-zero compression body admits a compatible fixed-level comparison core: a rational disk-kernel cap, a normalized complementary handlebody, a reduced spine model, and one universal-construction isomorphism QK,dq:MK,dq→∼VK,d+Q_{K,d}^{\mathfrak q}:\mathcal M_{K,d}^{\mathfrak q}\xrightarrow{\sim}\mathcal V^+_{K,d}. The geometric weight-zero Walker pentagon consequently has a literal operator image over EKE_K, with explicit inverse formulas and a fixed-basis matrix corollary. Different comparison cores are related by a typed comparison groupoid and give intertwined operator systems; no canonical comparison or literal equality between different coordinate choices is asserted.

A mix of human-written and AI-generated textHuman understanding: some partsanomaly normalizationfixed-level transporthandleslide coherenceskein moduletopological quantum field theory
Oct 16, 2026PDF ↗View work →
hexagon:2610.00287v1

math.GT — Geometric Topology

Integral tail signatures and the Hilbert--Smith conjecture

Contributed by Alexander Dabrowski

The obstruction to an effective pp-adic manifold action is an integer signature tail. On asymptotically controlled rational modules over one fixed free CpC_p-space, finite-cover Mayer--Vietoris makes the difference between pp copies and quotient-permutation tensoring nilpotent. Every degree-four class therefore has eventually pp-divisible signatures. An effective action gives a class of signature 11: coordinate averaging provides degree-one sphere control, free sheets turn quotient representatives into a compatible homotopy idempotent, and its normalized Poincar\'e corner forgets to a scalar manifold germ. Successive localization boundaries recover one copy of $\CP^2$, up to sign. The resulting contradiction proves the Hilbert--Smith conjecture.

Primarily AI-generated textHuman understanding: some partsHilbert–Smith conjectureHilbert’s fifth problemLie groupsalgebraic L-theorycontrolled topologylocally compact groupsp-adic group actionssignaturestransformation groups
Oct 16, 2026PDF ↗View work →
hexagon:2610.00289v1

math.GM — General Mathematics

Linchpin Theorems

Contributed by Thomas Hales

A proof assistant checks a formal proposition. It does not check that the proposition expresses the mathematics that its author intended. This distinction becomes pressing when large bodies of mathematics are autoformalized. We propose the use of linchpin theorems: statements whose meanings can be audited with relatively little mathematical infrastructure, and whose proofs connect them to substantial results. Examples range from sphere packing and the classification of Lie algebras to regularity theory, the Weil conjectures, and computational complexity.

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

math.OA — Operator Algebras

Noncommutative Maccone-Pati Uncertainty Principles

Contributed by K. MAHESH KRISHNA

Let E\mathcal{E} be a Hilbert C*-module over a unital C*-algebra A\mathcal{A}. Let A:D(A)⊆E→EA: \mathcal{D}(A) \subseteq \mathcal{E} \to \mathcal{E} and B:D(B)⊆E→EB: \mathcal{D}(B)\subseteq \mathcal{E}\to \mathcal{E} be possibly unbounded self-adjoint morphisms. Then for all x∈D(AB)∩D(BA)x \in \mathcal{D}(AB)\cap \mathcal{D}(BA) with ⟨x,x⟩=1\langle x, x \rangle =1, we show that \begin{align*} (1) \quad\quad\quad d_x(A)^2+d_x(B)^2&\geq \mp \langle \{A,B\}x, x \rangle +\langle (A\pm B)x, y \rangle\langle y, (A\pm B)x \rangle\pm \{\langle Ax, x \rangle, \langle Bx, x \rangle\}, \\ &\quad \forall y \in \mathcal{E} \text{ satisfying } \|y\|\leq 1 \text{ and } \langle x,y \rangle =0 \end{align*} \begin{align*} (2) \quad \quad \quad d_x(A)^2+d_x(B)^2&\geq \mp i\langle [A,B]x, x \rangle +\langle (A\pm iB)x, y \rangle\langle y, (A\pm iB)x \rangle \mp i[\langle Ax, x \rangle, \langle Bx, x \rangle], \\ &\quad \forall y \in \mathcal{E} \text{ satisfying } \|y\|\leq 1 \text{ and } \langle x,y \rangle =0. \end{align*} where \begin{align*} & d_x(A):= \sqrt{\langle Ax, Ax \rangle -\langle Ax, x \rangle^2},\quad [A,B] := AB-BA, \\ & [\langle Ax, x \rangle,\langle Bx, x \rangle]:= \langle Ax, x \rangle\langle Bx, x \rangle -\langle Bx, x \rangle\langle Ax, x \rangle. \end{align*} We call Inequalities (1) and (2) as noncommutative Maccone-Pati uncertainty principles. They reduce to uncertainty principles derived by Maccone and Pati [\textit{Phys. Rev. Lett., 2014}] whenever A=C\mathcal{A}=\mathbb{C}.

Primarily human-written textHuman understanding: all partsHilbert C*-module.Uncertainty Principle
Oct 16, 2026PDF ↗View work →