Browse

All works

Browse the Hexagon catalog.

Newest works

1229 works

math.CO — Combinatorics

A strengthening of some results of the paper "Structured sunflowers and canonical Ramsey properties"

Contributed by Rob Sullivan

In this short note, we give an exposition of an argument (potentially LLM-generated by Budiyanto) which strengthens two theorems of the author and Winkel from the recent paper “Structured sunflowers and canonical Ramsey properties”, also proving the main conjecture of that paper.

Primarily human-written textHuman understanding: all parts
Nov 19, 20263 pages
PDFView work

math.NT — Number Theory

Exact Sumsets of Primitive Quadratic Norms

Contributed by Roy van Rijn

We determine the exact binary sumsets of primitive quadratic norm values at discriminants −3,−7,−8,−11-3,-7,-8,-11. The local congruence conditions are sufficient in three cases; at discriminant −7-7 the complete additional exception set is {7,77,203}\{7,77,203\}. Stronger split-prime core identities separate the ramified dilations. The proofs combine quaternionic norm shells, precisely normalized classical Hecke bounds, and dyadic and ramified local filters. Explicit infinite estimates, rational interval certificates, complete finite sumset scans and multiplicative descent cover every positive target. We supply standalone verification code and explain the finite reductions that make the certificates complete. All sumsets concern numerical values, without coordinate multiplicities.

Primarily AI-generated textHuman understanding: no partsEisenstein integersHecke operatorsbinary quadratic formsexact sumsetsfinite certificatesprimitive quadratic norms
Nov 19, 202634 pages
PDFView work

math.NT — Number Theory

Pointwise Correlations of Quadratic Form Values and Splitting Semigroups

Contributed by Roy van Rijn

Under the stated analytic inputs, we establish the fixed-shift pair asymptotics predicted by Smilansky for the ordinary values of x2+dy2x^2+dy^2, d=1,2,3,4,7d=1,2,3,4,7. In particular, the number of n≤Xn\le X for which both nn and n+1n+1 are sums of two squares is asymptotic to X/(2log⁡X)X/(2\log X). For primitive positive definite binary forms of fixed discriminants Δi=fi2D\Delta_i=f_i^2D sharing one negative fundamental discriminant DD, we count values admitting coprime coordinates. Replacing either form within its respective genus preserves the leading binary count, with a relative logarithmic saving through an independent classical route. Under the recent analytic inputs we give an explicit mixed leading term with relative o(1)o(1), including different fixed conductors in that one field, and no class-number divisor. The central mechanism is a shared comparison between sparse indicators and arithmetic models retaining every surviving congruence character. Following Walsh's proposed indicator extension, we supply the models, local factors and a uniform reflected-target argument, using the recent zero-free and weighted-dilation theorems of OpenAI. Applications to fixed subgroup restrictions and prime-coset self-sums give target-uniform asymptotics with logarithmic savings and exact eventual congruence criteria. They include prime support 1(mod12)1\pmod{12} on targets 2(mod12)2\pmod{12} and prime support 3(mod4)3\pmod4 on even targets. All counts concern numerical values without coordinate or ideal multiplicities.

Primarily AI-generated textHuman understanding: no partsarithmetic modelsbinary quadratic formsgenus invariancepointwise correlationssplitting semigroupssums of two squares
Nov 19, 202669 pages
PDFView work

math.SP — Spectral Theory

Maximizing the First Positive Neumann Eigenvalue of Simple Pentagons

Contributed by Lüwei Dong, Hongyi Wang

We prove that among all simple pentagons of prescribed area—including non-convex pentagons and pentagons with straight interior angles—the regular pentagon uniquely maximizes the first positive Neumann eigenvalue of the Laplacian up to congruence. The proof separates naturally into two regimes. For pentagons having at least one reflex or straight interior angle, the number of strictly convex vertices is at most four; conformal mapping from the unit disk together with a Schwarz–Christoffel and Blaschke-product estimate yields the uniform bound ∣P∣μ1(P)<10.34|P|\mu_1(P) < 10.34, strictly below the regular-pentagon value ∣R∣μ1(R)>10.35335|R|\mu_1(R) > 10.35335. For strictly convex pentagons, normalizing a maximum-area vertex triangle reduces the problem to a four-dimensional shape chart coupled with a unimodular metric matrix. Combining covariance bounds, explicit polynomial trial functions, conic duality for pairs of trial functions, and Bernstein-basis branch-and-bound, we confine every potential maximizer to an explicit neighborhood of the regular pentagon in vertex Fourier coordinates. Because the first positive eigenspace of the regular pentagon is two-dimensional, we analyze both eigenfunctions simultaneously together with their first-order corrections to show that every nontrivial local deformation of the similarity class strictly decreases ∣P∣μ1(P)|P|\mu_1(P). All finite-dimensional inequalities invoked in the proof are accompanied by independently verifiable rational and interval arithmetic certificates.

Author comments: 24 pages. The ancillary files include the numerical certificates and verification programs. Reproduction instructions for this submission are in anc/verification.json.

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

math.CO — Combinatorics

Sharp packing bounds for Poly-5 and Handy-Octs

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

On the 89-square Poly-5 board, distinct pentominoes can cover at most 26 of the 28 boundary squares and 56 of the 60 exterior unit edges. Both maxima occur in a full tiling. For the five Handy-Octs octiamonds, the least area of a convex triangular-grid enclosure is 43 unit triangles. There is one optimal enclosure and it has precisely five packings, up to lattice symmetries. We prove the bounds by finite enumeration.

Primarily AI-generated textHuman understanding: some partsexact coveroctiamondspentominoestilings
Nov 19, 20264 pages
PDFView work

math.MG — Metric Geometry

Gradient structures on metric measure spaces

Contributed by Fabrice Baudoin

This work develops a theory of finite-rank gradients on metric measure spaces where the reference measure and the measure used to integrate gradients may be mutually singular. Examples include local trees, RCD spaces, sub-Riemannian manifolds, the harmonic Sierpiński gasket, and the Liouville Brownian motion.

Primarily AI-generated textHuman understanding: all parts
Nov 19, 2026200 pages
PDFView work

math.AG — Algebraic Geometry

Schubert Cox Rings and Root Operators

Contributed by Jiarui Fei

We identify the Cox ring of every Schubert variety in a symmetrizable Kac--Moody partial flag variety with an upper cluster algebra whose frozen variables are not inverted. The construction also applies to Bott--Samelson varieties for arbitrary words and to their normal projective birational contractions that preserve the standard affine chart. A line-bundle recursion determines the boundary coefficients of the exchange relations. In this mutation class, each nonzero positive simple-root operator and each nonzero stabilizing negative simple-root operator acts in a suitable seed as a monomial times a partial derivative in one frozen variable. Consequently, a single theta basis describes the root filtrations on all divisorial section spaces. We compute the facets of its regular cone from the word and the surviving divisors. The leading terms of the root operators yield tropical formulas for finite-type Levi crystals and polyhedral formulas for branching multiplicities. We obtain formulas for adjoint sections and extend the adapted root charts to projective horospherical varieties with free class group under a simply connected semisimple group.

Author comments: 39 pages, comments are welcome

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

math.NT — Number Theory

Non-existence of non-Eulerian irregular Diophantine quadruples

Contributed by Andrej Dujella, Sinisa Slijepcevic

A Diophantine quadruple {a,b,c,d}\{a,b,c,d\} with a<b<c<da<b<c<d is irregular if d≠a+b+c+2abc+2(ab+1)(ac+1)(bc+1)d\ne a+b+c+2abc+2\sqrt{(ab+1)(ac+1)(bc+1)}. It is conjectured that there are none, and He and Togb\'e have recently given a proof that there are only finitely many, with c<10338c<10^{338}. We study the non-Eulerian irregular quadruples, those whose triple {a,b,c}\{a,b,c\} is not an Euler triple, that is, c≠a+b+2ab+1c\ne a+b+2\sqrt{ab+1}, and reduce them to nine explicit families. The families are defined by the degree of {a,b,c}\{a,b,c\} under canonical descent, by the position of the descent partner d−(a,b,c)d_-(a,b,c) relative to aa and bb, by the shape of the iterated descent, and by explicit windows for the index of z=cd+1z=\sqrt{cd+1} in two Pell sequences. In particular c<1099c<10^{99}, and c<1079.71c<10^{79.71} when zz has an odd-index representation; for triples of degree one, c<1.81⋅1047c<1.81\cdot10^{47}. He and Togb\'e obtained c<10162c<10^{162} for degree one and c<10338c<10^{338} for higher degree. With the bound c<4⋅1048c<4\cdot10^{48} for Euler triples of a companion paper, every irregular Diophantine quadruple has c<1099c<10^{99}. For each family we give exact finite tests, in integer arithmetic or with certified rational enclosures, whose success shows that a given triple of the family has no irregular extension. Running these tests over the families is a finite computation. The numerical verification of these remaining cases is in progress, and its results will be appended to the final version of the paper.

Primarily AI-generated textHuman understanding: some parts
Nov 19, 2026203 pages
PDFView work

cs.DS — Data Structures and Algorithms

Exact minimum-cost arborescences under a single arc failure

Contributed by Yilin Liu

Every rooted weighted digraph on n vertices has a subgraph with O(n3/2)O(n^{3/2}) arcs that contains a minimum-cost spanning arborescence after any feasible single arc deletion, answering a question of Dey and Kavitha. An oracle of the same size reports an optimal arborescence or a shortest list of arc replacements in time linear in the output. The construction uses shortest cycles in a weighted matroid exchange graph and admits deterministic subcubic preprocessing on simple digraphs. A reduction from directed distance preservation gives an Ω(n4/3log⁡n)\Omega(n^{4/3} \log n)-bit lower bound for reporting on simple digraphs with input arc identifiers, even with constant per-query error.

Primarily AI-generated textHuman understanding: no partsdistance preserversfault-tolerant sparsificationminimum-cost arborescencessingle-arc failuresweighted matroid intersection
Nov 19, 20268 pages
PDFView work

math.ST — Statistics Theory

Finite-resolution information about a common clock: alias depth, holding-time loss, and the sampled Ehrenfest chain

Contributed by Samuil Petkov

We study how much Fisher information about a common rate multiplier survives when a reaction system is observed only at discrete times. For a finite known mark law, the first loss at short sampling times is governed by an alias depth hh, the smallest length mismatch among reaction-count fibres: the unrecovered fraction of reaction-count information is 1−Fp(λ)=Cpλh−1+O(λh)1-F_p(\lambda)=C_p\lambda^{h-1}+O(\lambda^h) with an explicit alias coefficient CpC_p. For a fixed irreducible finite generator, holding times add a separate loss: the missing log-clock information is A2t2+O(t3)A_2t^2+O(t^3), or (A3+H)t3+O(t4)(A_3+H)t^3+O(t^4) when A2=0A_2=0. As a worked example we treat the stationary symmetric Ehrenfest chain of known size Ω\Omega observed at its endpoints, with sampling time tt and λ=Ωt\lambda=\Omega t. For every population and every finite positive tt, the exact endpoint information lies between an explicit quadratic lower bound and its matched Gaussian benchmark, Bn≤Rn<g(t)/λB_n\le R_n<g(t)/\lambda, with relative width at most 1/(2λ)1/(2\lambda) measured from BnB_n. The symmetric compound-Poisson benchmark is uniformly relatively accurate on 1≤λ≤LΩ1\le\lambda\le L_\Omega if and only if LΩ=o(Ω)L_\Omega=o(\Omega). A formula-level comparison with the binomial AR(1) literature (Cui–Lund; Weiß–Kim) has not been completed.

A mix of human-written and AI-generated textHuman understanding: all partsEhrenfest chainFisher informationalias depthcompound-Poisson approximationdiscrete-time samplingholding timesmissing information
Nov 19, 202623 pages
PDFView work

math.PR — Probability

Spectral outliers of self-coupled covariance matrices with exact zero weights

Contributed by Samuil Petkov

We study the right spectral outliers of Md=n−1AdDAdTM_d=n^{-1}A_dDA_d^{\mathsf T}, where the columns of AdA_d are drawn from a Gaussian mixture with a fixed-dimensional signal subspace and each diagonal weight Dℓℓ=hbℓ(gℓ)D_{\ell\ell}=h_{b_\ell}(g_\ell) is a function of the class label and of the low-dimensional Gaussian coordinates of the same sample. The effective outlier theory of Ben Arous, Gheissari, Huang and Jagannath for such self-coupled matrices assumes that the weights do not accumulate at zero, which excludes hard gates such as the derivative of a rectified linear unit. Assuming hb(g)∈{0}∪[τ,M]h_b(g)\in\{0\}\cup[\tau,M], we prove that exact zero weights do not change the positive right-outlier equation. The proof deletes inactive columns before any linearization, keeps their random normalization, and applies the invertible-weight theory to the exact conditional mark law of the active samples; we show, by conditioning on the marks, that this theory extends to non-Gaussian fixed-dimensional marks. The limiting spectrum acquires the atom (1−ϕπ)+(1-\phi\pi)_+ at zero, while positive outliers are the roots of a q×qq\times q determinant. We obtain multiplicity-preserving eigenvalue counts, absence of spurious right outliers, a projected-eigenvector normalization, an invariant-subspace formula at repeated roots, and the exact finite-dimensional kernel.

A mix of human-written and AI-generated textHuman understanding: all partsGaussian mixturesexact zero weightsrandom matricesrectified linear unitspectral outliersweighted sample covariance matrices
Nov 19, 202617 pages
PDFView work

math.PR — Probability

Observation cost of nonequilibrium in nonnormal networks: a matched exponent for an explicit four-state generator

Contributed by Samuil Petkov

We consider detection of nonequilibrium from passive, causally scheduled snapshots of a stationary continuous-time Markov chain, with gaps between snapshots of at least τ\tau. False alarms must be controlled uniformly over every finite stationary detailed-balance chain observed through a deterministic labelling, with no restriction on hidden dimension, rates, stationary label law or mixing time. Aznagulov showed that for normal generators the optimal snapshot cost grows like e2γirrτe^{2\gamma_{\rm irr}\tau}, and that for nonnormal generators its exponent lies in a spectral window. For an explicit nonnormal four-state generator Q4Q_4, with a real slow mode and residual damping β\beta, we prove that τ−1log⁡N∗→2γ\tau^{-1}\log N^*\to2\gamma, where γ=(701−158761)/126∈(2,β)\gamma=(701-\sqrt{158761})/126\in(2,\beta) is a relaxation rate of an explicit reversible birth–death comparator; for Q4Q_4 this exponent lies strictly inside the window [2,2β][2,2\beta]. The comparator comes from an ordered-eigenfunction completion lemma: among π\pi-reversible generators with a prescribed strictly monotone eigenfunction and eigenvalue, a birth–death generator maximizes the entire Dirichlet form. The upper bound uses symmetric two-lag scores whose stationary mean is nonpositive under every hidden reversible model, together with a positive-operator tilt lemma that gives the moment-generating bound e32nθ2e^{32n\theta^2} for a deterministic number nn of dependent transitions, uniformly over the null class. We also show that the two-lag pair-law approximation exponent of Q4Q_4 by hidden reversible models is γ\gamma, that the cost exponent 2γ2\gamma holds uniformly over a four-parameter box of nonnormal deformations, and that it extends to interacting path families on {1,2,3,4}d\{1,2,3,4\}^d built from tensor lifts. More generally, if uu has distinct entries and is an eigenvector of QQ and of its L2(π)L^2(\pi)-adjoint with eigenvalue −λ-\lambda, the exponent is 2γ∗2\gamma^* whenever γ∗<β\gamma^*<\beta, where γ∗\gamma^* is the restricted gap of the completion.

A mix of human-written and AI-generated textHuman understanding: all partsbirth-death processescontinuous-time Markov chainsdetailed balancehypothesis testingnonequilibrium detectionnonnormal generators
Nov 19, 202617 pages
PDFView work

math-ph — Mathematical Physics

A four-state Markovian Mpemba effect in which every triplet test fails

Contributed by Samuil Petkov

Avitan, Factor and Gelbwaser-Klimovsky derived necessary conditions on the transition rates of a three-level system for the Markovian Mpemba effect, and proposed applying them to every triplet of levels of an NN-level system. For a zero-temperature bath and non-degenerate spectrum they proved that a strong violation of the conditions in all triplets excludes the effect; for non-zero temperature they conjectured, on the basis of numerical sampling, that violation in all triplets excludes it. We give an explicit reversible four-state chain, with energies U(0,1,2,64)U(0,1,2,64) and a bath at inverse temperature ln⁡2/U\ln 2/U, in which all four triplet conditions fail strictly and yet a hotter thermal initial state has a strictly smaller slow-mode amplitude than a colder one. This is a direct Mpemba effect, so the finite-temperature conjecture fails for N=4N=4. The example is marginal: it uses Boltzmann weights of order 2−642^{-64}, initial temperatures of order 102 U10^2\,U, a relative amplitude gap of about 0.07%0.07\%, and three of the four triplets fail by margins of order 10−610^{-6}. We then give a second, less marginal example with energies (0,130,0.434,5)(0,\frac{1}{30},0.434,5), bath inverse temperature 33 and initial inverse temperatures 0.060.06 and 16\frac{1}{6}: every triplet fails by at least 1.08×10−31.08\times10^{-3} relative to its largest rate, and the relative amplitude gap is 1.22%1.22\%. A variant of the second example with rational Boltzmann factors has the same properties and is certified in exact rational arithmetic without exponential enclosures. All claims are reduced to finite exact rational or rational-interval computations, which we describe. In both examples the ground level escapes more slowly than the slowest mode relaxes; an exact elimination identity shows that the slow mode then sees effective couplings between the excited levels that depend on the slowest eigenvalue, and these are not visible to tests built from the original rates.

Author comments: The exact verification scripts and witness data are included in anc/.

A mix of human-written and AI-generated textHuman understanding: all partsMpemba effectcontinuous-time Markov chainscounterexampledetailed balanceinterval arithmeticrelaxation to equilibriumslowest relaxation mode
Nov 19, 20269 pages
PDFView work

math.ST — Statistics Theory

The exact FDR–FNR frontier and a separable gap under one-factor Gaussian dependence

Contributed by Samuil Petkov

We determine the exact asymptotic trade-off between the false discovery rate and the false non-discovery rate in a two-group Gaussian model generated by one unobserved common factor of fixed strength. For fixed mixture weight, signal strength, equicorrelation, and false discovery target, the optimum over all randomized full-vector procedures converges to the lower convex envelope of the independent Gaussian threshold curve with effective signal μ/1−ρ\mu/\sqrt{1-\rho}. Thus not observing the factor causes no additional asymptotic loss relative to the factor-revealed experiment. The converse reveals the factor and reduces exactly to an independent experiment. For achievability, factor estimation, a pathwise threshold-crossing bound, and random-denominator control yield an observable optimal rule with finite-sample FDR calibration. If the three model parameters are replaced by consistent estimates, a plug-in rule attains the same frontier with asymptotic FDR control. We also analyze the broad coordinate-local class δn,i=fn,i(Xi,An)\delta_{n,i}=f_{n,i}(X_i,A_n), where the functions may be nonidentical and dimension-dependent and the shared external seed is independent of the model. Every oracle supporting line lying strictly below the two trivial endpoint values has a positive asymptotic gap from this separable class; an analytic parameter choice certifies that such a line exists. For the constrained problem, the gap vanishes at every level exactly when the oracle frontier is the chord joining the reject-none and reject-all rules; otherwise it is strict at every level strictly between the two trivial endpoint levels. For this fixed rank-one Gaussian family, the first result exactly evaluates the compound frontier and the second proves existence of a strict gap from the stated coordinate-local class. Broad dependent model classes and the complete constrained separable frontier remain open.

A mix of human-written and AI-generated textHuman understanding: all partsGaussian factor modelcompound decision ruleequicorrelationfalse discovery ratefalse non-discovery ratemultiple testingseparable decision rule
Nov 19, 202627 pages
PDFView work

math.PR — Probability

Complete positivity and equilibrium realizations of reversible observations

Contributed by Samuil Petkov

Complete positivity of mirrored observation matrices is necessary for equilibrium realization, but does not ensure compatible equilibrium dynamics. We study stationary finite-state continuous-time Markov chains with instantaneous deterministic labels on a fixed physical clock. For reflection-positive laws with dd active labels and reflected rank r≤d+1r\le d+1, we construct a detailed-balance realization on the minimal number rr of states. Binary rank-four laws with two prediction dimensions per label compress to four states when a finite detailed-balance realization already exists. At r=d+2r=d+2, a rational ten-state chain with six labels passes every mirrored matrix-CP test through one common nonnegative Gram factorization, yet admits no equilibrium realization. A rational seven-time statistic separates its law from all finite equilibrium observation laws, uniformly over hidden dimensions, rates and topology. It gives a positive entropy-production floor for every exact finite reciprocal realization, with conservative constants too small for practical statistical use. The law also has no ordinary symmetric Markov extension on any standard Borel state space at the original clock, despite factorability of its reflected half-path operator. For laws that fail a matrix-CP test, a separate deletion-deficit theorem gives a computable nonlinear dissipation bound.

Author comments: The exact-arithmetic certificate check is included as anc/check_certificate.py.

A mix of human-written and AI-generated textHuman understanding: all partscomplete positivitydetailed balanceentropy productionequilibrium realizationhidden Markov modelsreflected rankreflection positivity
Nov 19, 202642 pages
PDFView work

math.PR — Probability

Entropy Production under Hidden-State Reduction: Exact Safety and Non-Testability

Contributed by Samuil Petkov

Restricting hidden-state complexity can raise the least entropy production compatible with partial observations. We determine exactly when a two-hidden-state fit preserves this lower bound for finite irreducible stationary reciprocal continuous-time Markov chains with two individually observed states and one hidden label. We begin with an explicit chain with three hidden states whose observed data admit exact two-hidden-state fits, every one of which has entropy production more than sixty times that of the true chain. For strictly positive consistent stationary masses, flows, excursion counts and first duration moments, the unrestricted infimum is an explicit count functional, and four hidden states approach it while preserving every datum exactly. We classify finite attainment and safety of feasible two-hidden-state fits in every determinant regime; in the positive-determinant regime, safety is equivalent to equality of the conditional cross-excursion means, and explicit bounds quantify the reduction bias. Exact classification does not imply finite-data detectability: rare long excursions can conceal a fixed positive bias on any prescribed finite interval of stationary label observation, even under a common upper rate bound.

Author comments: The computer-assisted step in the proof of the family overestimate theorem is performed in exact rational arithmetic by the script anc/certify_I2.py included with the source.

A mix of human-written and AI-generated textHuman understanding: all partscoarse grainingentropy productionhidden Markov chainsphase-type distributionsreduction biasthermodynamic inference
Nov 19, 202619 pages
PDFView work

cs.IT — Information Theory

State complexity of rare-switching tracking: universal bounds and sharp counter tradeoffs

Contributed by Samuil Petkov

We study the number of internal states required to track a symmetric binary Markov signal observed through a fixed binary symmetric channel. For homogeneous recursive controllers with independent private randomization, a posterior-covering converse gives the sharp leading state coefficient in the iterated nearly-Bayes-optimal limit, uniformly over controller kernels and stationary recurrent mixtures. At a fixed relative excess error, we also determine the exact leading coefficient within symmetric observation-driven birth–death counters with a prescribed sign decoder. Their acceptance probabilities may vary across states and tend to zero with the switching probability. A stationary flow argument links a confidence barrier to actual switch-time mass, and a discounted passage estimate controls repeated switching. For general MAP-decoded controllers, a point certificate for the same posterior covers shows that this counter coefficient is optimal at every fixed relative excess above an explicit threshold depending only on the channel; below that threshold the general frontier remains open, and the gap is narrowed. State cardinality is the resource; no thermodynamic work claim is made.

A mix of human-written and AI-generated textHuman understanding: all partsbirth-death chainscausal filteringfinite-memory inferencehidden Markov modelsrare transitionsstate complexity
Nov 19, 202618 pages
PDFView work

math.RA — Rings and Algebras

Flip-connectivity of octonion bracketing classes

Contributed by Jesus Vilela Jato

Substitute octonions for the letters of a word ww. Each bracketing of ww is a polynomial map, and bracketings giving the same map form a kernel class inside the associahedron KnK_n (edges: flips (AB)C↔A(BC)(AB)C \leftrightarrow A(BC)). Theorem. Every kernel class is flip-connected iff ww has at most two distinct letters or every letter occupies one contiguous run. Hence for n≥1n \ge 1, exactly Bell(n)−2n+n\mathrm{Bell}(n) - 2^n + n words of length nn, up to renaming, have a disconnected class (0,0,0,3,25,145,756,…0,0,0,3,25,145,756,\dots). Ideas. In-class flips must have letter-count matrix of rank ≤2\le 2: for any nonzero 3×33\times 3 minor dd and M=2∣d∣+1M = 2|d|+1, an integer witness gives [A,B,C]≡2dM3e7(modM4)[A,B,C] \equiv 2dM^3 e_7 \pmod{M^4}. For interval words, the rank-≤2\le 2 components are separated by octonion moments that recover an explicit component invariant. For other words, “caterpillar” certificates give two Moufang-equivalent bracketings that no rank-≤2\le 2 path joins. Formalization. The main theorem, the canonical-word correspondence and the count are proved in core Lean 4 (no Mathlib): MainThm.main, Canon.canonical, Count.count_disconnected. That is 9,252 lines in lean/Caterpillar/, no sorry, standard axioms only. The one informal step is that polynomial identities over Z8\mathbb{Z}^8 and over R8\mathbb{R}^8 agree. Disclosure. The formal proofs and much of the exposition were developed with Claude (Anthropic) under my direction. An AI referee round was done before posting (paper/REVIEW.md). I’m posting for independent human judgement, especially on Proposition T, which the paper proves via the formalization. I’d also like to know whether the associative-spectrum corollary sn(G)=Cn−1s_n(G) = C_{n-1} (Catalan numbers) is already in the literature. The paper’s two-line proof gives it for every non-associative magma with a two-sided identity, in particular for O\mathbb{O}. Repository: https://github.com/Dojo-1/Lemma-W-count-determinant-witness-

Author comments: The formal proofs and much of the exposition were developed with Claude (Anthropic) under my direction. An AI referee round was done before posting (paper/REVIEW.md). I’m posting for independent human judgement, especially on Proposition T, which the paper proves via the formalization. I’d also like to know whether the associative-spectrum corollary $s_n(G) = C_{n-1}$ (Catalan numbers) is already in the literature. The paper’s two-line proof gives it for every non-associative magma with a two-sided identity, in particular for $\mathbb{O}$.

Primarily AI-generated textHuman understanding: all partsmath.RA math.CO lean-formalized octonions associahedron
Nov 19, 202613 pages
PDFView work

math.PR — Probability

BKT asymptotics for the quenched free energy of hierarchical pinning

Contributed by Igor Kortchemski

We study the disordered pinning model of Derrida, Hakim and Vannimenus on the diamond hierarchical lattice. Its partition functions satisfy Rn+1=d(Rn(1)Rn(2)+B−1)/BR_{n+1}\overset{d}{=}(R_n^{(1)}R_n^{(2)}+B-1)/B, where B>2B>2, the two variables on the right are independent copies of RnR_n, and R0=ehWR_0=e^hW with W>0W>0 and EW=1\mathbb{E}W=1. Let FF be the quenched free energy and hch_c its critical point. If hc>log⁡(B−1)h_c>\log(B-1), we prove F(hc+u)=exp⁡[−(K+o(1))/u]F(h_c+u)=\exp[-(K+o(1))/\sqrt{u}] as u↓0u\downarrow0, for a finite positive constant KK characterized by the response at criticality to a change of field. We identify a limiting profile of the rescaled tilted measures and extend their convergence in exponential weights to every time before its first pole. This yields the free-energy upper bound; a comparison with a max-type recursion and a second-moment estimate for pairs of leaves give the matching lower bound. A Lean 4 formalization of the main results accompanies the paper.

Author comments: Mathematics and text produced with AI systems (ChatGPT) under the direction of the contributor; see the section on AI use. A Lean 4 formalization of all numbered results of the paper is available at https://github.com/igor-kortchemski/BKT-hierarchical-pinning.

Primarily AI-generated textHuman understanding: no partsBerezinskii–Kosterlitz–Thouless asymptoticsdisordered pinninghierarchical latticequenched free energy
Nov 19, 202628 pages
PDFView work

math.CO — Combinatorics

Ehrhart positivity for polypositroids

Contributed by Luis Ferroni

We prove that all coefficients of the Ehrhart polynomial of an integral polypositroid are strictly positive. In particular, this proves the positroid conjecture of Ferroni, Jochemko and Schröter. More generally, inclusion of integral polypositroids in a common cyclic order implies coefficientwise comparison of their Ehrhart polynomials. Hence the hypersimplex dominates every positroid of the same rank and size. We express each coefficient as a sum of relative face volumes multiplied by explicit nonnegative rational weights. The weights count linear extensions and specialize, for hypersimplices, to Ferroni's formula involving weighted Lah and Eulerian numbers. In the appendix we exhibit two representable matroids whose quartic Ehrhart coefficients exceed those of the hypersimplices of the same rank and size.

Primarily AI-generated textHuman understanding: some partsEhrhart polynomialsEhrhart positivityalcoved polytopesmatroidspolypositroidspositroids
Nov 19, 202620 pages
PDFView work

cs.DS — Data Structures and Algorithms

Deterministic almost-linear time for general matching and network flow

Contributed by Yilin Liu

We give deterministic almost-linear-time algorithms for maximum-cardinality matching in general graphs and integral minimum-cost flow. With H=n+m+2H = n + m + 2, both run in Hexp⁡O((log⁡H)4/5(log⁡log⁡H)1/5)H \exp O((\log H)^{4/5}(\log \log H)^{1/5}) time for polynomially bounded integer flow data. Their circulation oracle charges every traversal of a returned walk. A clipped logarithmic potential handles flow thresholds under improving updates and maintains strong components under arc insertions. For subgraphs with degree bounds, two matching computations encode a factor of every feasible size. The underlying exchange argument also gives integral cardinality slices for capacitated factors and is compatible with sharp local rounding.

Primarily AI-generated textHuman understanding: no partsalmost-linear timedeterministic graph algorithmsgraph factorsmaximum-cardinality matchingminimum-cost flowminimum-ratio cycles
Nov 19, 202616 pages
PDFView work

math.MP — Mathematical Physics

Towards a conformal field theory of critical percolation. II. Scalar responses and null identities

Contributed by Alberto Gandolfi

We construct the scalar response to closing a small disk in critical site percolation on the triangular lattice. The response records how the obstacle changes every connection at a surrounding boundary. Its normalized cutoff error is of order r^(11/15), and an open-cutset argument gives its leading fusion with the density field in the complete-record norm. We identify the signed response in a domain with six alternating boundary tips and prove the level-two null identities against finite separated density, scalar, and stress insertions. These identities determine the mixed scalar–density four-point function. Assuming Camia and Feng’s asymptotic formula for one energy and two density insertions, we give their energy field a geometric interpretation as the normalized response to closing a small disk. The resulting correlation of two energies and two densities is the difference of a successive-bottleneck and an alternative-route contribution, and it changes sign. The second coefficient in the angularly averaged scalar–density collision defines a nonzero insertion Ψ of weights (77/96,77/96). Fixed stress contours and radial integrals give joint correlations of every fixed finite collection of separated Ψ insertions, with error O( \sum_i (r_i)^(1/2) ) at arbitrary relative extraction radii. We compute its two-point coefficient and signed two-obstacle connection asymptotics, including the leading stress term when the scalar sources collide in a two-density correlation. These results realize the known analytic conformal blocks through specified lattice observables. The construction uses the complete-record stress estimates and finite-hole density correlations of Paper I.

A mix of human-written and AI-generated textHuman understanding: some partsPercolationconformal field theory
Nov 19, 202699 pages
PDFView work

math.AG — Algebraic Geometry

A note on tropical convexity

Contributed by Hernandez Juan

We prove that the tropicalization of the regular function h=(x12+x22+x32)/(x1x2x3)h=(x_1^2+x_2^2+x_3^2)/(x_1x_2x_3) on the coefficient-free Markov cluster threefold is not min-convex. This disproves Conjecture 8.11 of Gross, Hacking, Keel, and Kontsevich.

Primarily AI-generated textHuman understanding: some parts
Nov 19, 202613 pages
PDFView work

math.CT — Category Theory

Finite model spaces and coherent sheaf models

Contributed by Zhenyu Sun

Let TT be a finitary coherent theory with finitely many sorts. We describe coherent sheaf-valued models over a Stone space as continuous families in a topological category of finite TT-models and all their homomorphisms. We prove that every such family over every Stone base is constant up to isomorphism on a finite clopen partition if and only if each fixed finite carrier admits only finitely many TT-structures. It suffices to test the partition property over βN\beta\mathbb N. Equivalently, at each bound on the sort cardinalities, a finite subsignature detects all homomorphisms between the bounded models. This condition holds for finite signatures and is invariant under coherent Morita equivalence. It characterizes when the canonical functor from the discrete condensed category of finite models to the coherent condensed category of points is an equivalence. For finite locally constant abelian-group sheaves, we compute first Yoneda extensions as sections of a finite locally constant sheaf and prove that all higher Yoneda extensions in their category vanish.

Primarily human-written textHuman understanding: all partsStone spaceYoneda extensioncoherent theorycondensed categoryfinite modelpretopos
Nov 19, 202621 pages
PDFView work

math.CV — Complex Variables

Fourier Epicycles and Antisymmetric Signed-Area Conservation in Normalized Riemann Zeta Terms

Contributed by Ryan Hackbarth

In companion studies of Euler's alternating series η(s)=(1−21−s)ζ(s)\eta(s) = (1 - 2^{1-s})\zeta(s) and its prime-base normalizations ηp(s)=(1−p1−s)ζ(s)\eta_p(s) = (1 - p^{1-s})\zeta(s), distributing the prefactor (1−p1−s)−1(1 - p^{1-s})^{-1} across individual summands tp,n(s)=cp(n)(1−p1−s)−1n−st_{p,n}(s) = c_p(n)(1 - p^{1-s})^{-1}n^{-s} exposed an infinite hierarchy of closed, irreducible degree-2k2k plane algebraic curves tp,pk(12+ib)t_{p,p^k}(\frac{1}{2}+ib) over Z[x,y]\mathbb{Z}[x, y] on the critical line Re⁡(s)=12\operatorname{Re}(s) = \frac{1}{2}, whose enclosed signed areas satisfy Asigned(t4)=0\mathcal{A}_{\mathrm{signed}}(t_4) = 0 at the base-22 Bernoulli lemniscate and ∑k=1∞Asigned(tp,pk)=0\sum_{k=1}^{\infty}\mathcal{A}_{\mathrm{signed}}(t_{p,p^k}) = 0 across every prime tower. Rather than keeping (1−p1−s)−1(1 - p^{1-s})^{-1} unexpanded to preserve Cartesian curve equations, this paper expands (1−p1−s)−1=−∑m=1∞pm(s−1)(1 - p^{1-s})^{-1} = -\sum_{m=1}^{\infty} p^{m(s-1)} across the critical strip 0<Re⁡(s)<10 < \operatorname{Re}(s) < 1 and distributes it termwise as a Fourier epicycle series. For every pure power n=pkn = p^k (k≥1k \ge 1) along s=a+ibs = a + ib, the distributed expansion separates into k−1k - 1 clockwise circles (1≤m≤k−11 \le m \le k - 1), a motionless center-of-mass anchor +(p−1)p−k+(p - 1)p^{-k} (m=km = k) independent of ss, and an infinite counterclockwise tail (m≥k+1m \ge k + 1), revealing index-by-index how counter-rotating harmonics fold and area-balance the Lemniscate of Bernoulli t4(12+ib)t_4(\frac{1}{2}+ib). Evaluating Green's theorem via Parseval's identity yields an exact closed-form signed-area formula for tp,pk(a+ib)t_{p,p^k}(a+ib) across 0<a<10 < a < 1, proving that t4(a+ib)t_4(a+ib) encloses zero net signed area if and only if a=12a = \frac{1}{2}---tipping toward its clockwise left lobe for 0<a<120 < a < \frac{1}{2} and its counterclockwise right lobe for 12<a<1\frac{1}{2} < a < 1. Summing over k≥1k \ge 1 further proves that the total pure-power signed area Sp(a)\mathcal{S}_p(a) is strictly antisymmetric across the critical line (Sp(1−a)=−Sp(a)\mathcal{S}_p(1 - a) = -\mathcal{S}_p(a)), negative on 0<a<120 < a < \frac{1}{2}, positive on 12<a<1\frac{1}{2} < a < 1, and zero if and only if Re⁡(s)=12\operatorname{Re}(s) = \frac{1}{2}.

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

math-ph — Mathematical Physics

Can moving the mouths of a self-supporting wormhole make a shortcut? A no-shortcut theorem in a two-dimensional loop model

Contributed by MengHan Tsai

The Morris-Thorne-Yurtsever route to a time machine moves one wormhole mouth so that a twin-paradox lag becomes a time shift between the mouths. For wormholes supported by their own Casimir-like energy (Maldacena-Milekhin-Popov) the static throat is longer than the exterior path; we know of no explicit dynamical calculation for moving mouths. We study a toy model in which the question can be posed exactly: a JT-gravity throat whose two boundaries are transparent to conformal matter that also propagates through a rigid flat exterior. We prove that in this model no timelike motion of the mouths produces a shortcut through the throat in either direction, as long as both mouth clocks keep running. The proof combines (i) a lap identity, by which there is no shortcut iff a Dirichlet operator built from one mouth's Schwarzian energy is non-negative on each lap of a matter stream; (ii) a sum rule equating the averaged null energy along each complete null geodesic of the throat to −β/2-\beta/2 times the sum of the clock rates at its ends, which is the dynamical form of a relation of Maldacena and Qi and is not claimed as new; and (iii) a variational step. With the quantum inequality for the streams the same steps exclude a shortcut for any agent acting locally on the streams in the exterior. Two partial lower bounds on the size of the margin are given; no positive floor is proven. Simulations from one code base illustrate the results. The model has a non-gravitating exterior and a classical Schwarzian mode, and nothing is claimed about four dimensions. The derivations, code and text were produced with AI assistance under the author's direction; Section 6 states what was checked and by whom. No physicist has checked this work.

Primarily AI-generated textHuman understanding: no partsJT gravitySchwarzianaveraged null energy conditionchronology protectiontraversable wormholes
Nov 19, 202614 pages
PDFView work

math.QA — Quantum Algebra

Grothendieck rings of complex fusion categories: rank 4

Contributed by Sebastien Palcoux

Every complex fusion category of rank four admits a spherical structure. Together with the pivotal classification of Dong, Palcoux and Plessis, this gives exactly fifteen Grothendieck rings. We prove sphericality by comparing the ordinary ring with the signed ring of the sphericalization. Formal codegrees and moments of central twists bound the dimension of a putative counterexample. An exact search leaves two signed Casimir polynomials for one ordinary ring. Both violate the same moment inequality. For the six rings with a non-self-dual simple, we also give a direct classification by central induction and twist moments.

Author comments: 50 pages. Third volume of a uniform series on ranks 2, 3 and 4. Computer-assisted proof of sphericality, followed by the pivotal classification of Dong-Palcoux-Plessis. Exact code and data, with a one-command replay: https://github.com/sebastienpalcoux/grothendieck-ring-classification/tree/edc79bd0a828aa5564f6e7a5392bc9be9bb43d48/supplements/rank4/sphericality . Sources and revision letter: https://github.com/sebastienpalcoux/grothendieck-ring-classification/tree/edc79bd0a828aa5564f6e7a5392bc9be9bb43d48/manuscripts/hexagon

Primarily AI-generated textHuman understanding: some partsFusion categoriesGrothendieck ringsexact computationformal codegreessphericality
Nov 19, 202650 pages
PDFView work

math-ph — Mathematical Physics

Uniform Spectral Gap and Stability for the Spin-2 Square-Lattice AKLT Model with Free Boundaries

Contributed by Runze Zhong

We prove a uniform spectral gap above the full ground space of the spin-2 AKLT Hamiltonian on every square-lattice rectangle with four free sides and both lengths at least two. The ground-space dimension grows exponentially with the perimeter. Starting from the classical hard-boundary coupling of Aronow and Lopatto, we compare the boundary Gram operator of one wing with the product of its marginals on the cut side and the remaining three sides. A reference system with at most eight unsaturated sites then controls a physical cut of arbitrary length. Recursion over overlapping rectangles gives the gap. We also obtain a gap on all simple tori, including those of fixed circumference. In free squares, boundary effects on fixed local observables decay exponentially with the buffer width. By the stability theorems of Nachtergaele, Sims and Young, weak quasi-local perturbations with stretched-exponentially decaying interaction terms preserve the bulk GNS gap and the finite-torus gap at bounded aspect ratio.

Author comments: v1: Initial version. 16 pages, 3 figures. Establishes a uniform spectral gap above the full exponentially degenerate ground space of the undecorated spin-2 square-lattice AKLT Hamiltonian on all open rectangles of side lengths at least two, a uniform gap on all simple tori (including fixed short circumferences down to three), exponential local topological quantum order (LTQO) in free boxes, and perturbative stability of both the infinite-volume bulk GNS gap and the bounded-aspect-ratio finite-torus gap. The reduction is modular on the classical hard-boundary coupling of Aronow and Lopatto (Hexagon 2611.00580v1).

A mix of human-written and AI-generated textHuman understanding: some partsAKLT modelLTQOfrustration-freequantum spin systemsspectral gap
Nov 19, 202616 pages
PDFView work

math.NT — Number Theory

The sum of the reciprocal Mersenne cubes is irrational

Contributed by twinheterodox

The sum of the reciprocal cubes of the Mersenne numbers 2n−12^n-1 is irrational. More generally, for ∣b∣>1|b|>1 let Mj(b)=∑n≥1(bn−1)−jM_j(b)=\sum_{n\ge1}(b^n-1)^{-j}. For every integer b≥2b\ge2, we prove that 1,M1(b),M2(b),M3(b)1,M_1(b),M_2(b),M_3(b) are linearly independent over Q\mathbb{Q}. These four numbers are also linearly independent over Q(b)\mathbb{Q}(b) whenever bb is an algebraic integer with ∣b∣>1|b|>1 and every conjugate other than bb and bˉ\bar b lies in the closed unit disk. This includes all Pisot and Salem numbers.

Author comments: 8 pages. The source archive includes four verification programs and their reference results. Manuscript and code: https://github.com/twinheterodox/algebraic-base-lambert-values

Primarily AI-generated textHuman understanding: some partsLambert seriesMersenne numbersirrationalitylinear independence
Nov 19, 20268 pages
PDFView work

math.QA — Quantum Algebra

Grothendieck rings of complex fusion categories: rank 3

Contributed by Sebastien Palcoux

Ostrik classified the pivotal fusion categories of rank three. We show that every complex fusion category of rank three admits a spherical structure and recover the five Grothendieck rings. Both steps use the mass at twist one in the Drinfeld center. For an irreducible cubic codegree polynomial, Galois averaging in the sphericalization determines the first six moments of the squared twist. For a spherical category, the first two moments give a single inequality that excludes all the remaining rings outside the list. The rank-specific descent theorem we use from the literature is Ostrik's theorem for a quadratic factor.

Author comments: 10 pages. Computer-free. Second volume of a uniform series on ranks 2, 3 and 4. Source and revision letter: https://github.com/sebastienpalcoux/grothendieck-ring-classification/tree/edc79bd0a828aa5564f6e7a5392bc9be9bb43d48/manuscripts/hexagon

Primarily AI-generated textHuman understanding: some partsFrobenius-Schur indicatorsFusion categoriesGrothendieck ringsrank threesphericalization
Nov 19, 202610 pages
PDFView work

math.QA — Quantum Algebra

Grothendieck rings of complex fusion categories: rank 2

Contributed by Sebastien Palcoux

Ostrik classified fusion categories over C\mathbb C with two simple objects. We recover the two possible Grothendieck rings from sphericalization and central induction. For a candidate rule X2=1+nXX^2=1+nX, the dimension divisibility of Etingof, Nikshych and Ostrik forces one lift of XX to satisfy the same rule in the sphericalization. The induction matrix then expresses −ndim⁡(X)-n\dim(X) as the sum of two roots of unity. Taking a conjugate gives n≤1n\leq 1. Both rings occur.

Author comments: 3 pages. Computer-free. First volume of a uniform series on ranks 2, 3 and 4. Source and revision letter: https://github.com/sebastienpalcoux/grothendieck-ring-classification/tree/edc79bd0a828aa5564f6e7a5392bc9be9bb43d48/manuscripts/hexagon

Primarily AI-generated textHuman understanding: some partsFusion categoriesGrothendieck ringscentral inductionrank twosphericalization
Nov 19, 20263 pages
PDFView work

math.QA — Quantum Algebra

Vertex operator algebras from Flohr's second family realising doubles of near-group categories Zn+n\mathbb{Z}_n+n for even nn

Contributed by Andrew Riesen, David E. Evans

We study Flohr's second family W(2,3k)\mathcal{W}(2,3k), with generating weights 22 and 3k3k and central charge 1−24k1-24k for k∈12Z>0k\in\frac{1}{2}\mathbb{Z}_{>0}. We realise these algebras and their subalgebras W(2,8k)\mathcal{W}(2,8k), generated in weights 22 and 8k8k, by deforming the conformal vector of the vertex algebra of the rank-one lattice L=ZβL=\mathbb{Z}\beta, (β,β)=2k(\beta,\beta)=2k. We prove strong rationality and compute the simple modules and modular data for W(2,8k)\mathcal{W}(2,8k) at all kk and W(2,3k)\mathcal{W}(2,3k) at integral kk. For nonintegral kk we describe the Neveu–Schwarz sector of the W(2,3k)\mathcal{W}(2,3k) superalgebra. The same conformal vector makes the lattice vertex algebra of the index-two sublattice 2L2L an extension of W(2,8k)\mathcal{W}(2,8k). Its modules in the representation category of W(2,8k)\mathcal{W}(2,8k) form a Z2\mathbb{Z}_2-graded category with neutral component of near-group type Z4k+4k\mathbb{Z}_{4k}+4k. We realise the Drinfeld centres of the graded category and its neutral component by regular vertex operator algebras, using the orthogonal complement of a primitive norm-8k8k vector in the E8E_8 lattice and conformal shifts to match the ribbon structures. For integral kk we give a Leavitt algebra realisation of the near-group category and derive finite quantum dilogarithm identities. We also realise the centres of its quotients by central lifts of the order-2s2s subgroups of Z4k\mathbb{Z}_{4k} for s2∣ks^2\mid k, including twisted Haagerup–Izumi-type centres over Z2s\mathbb{Z}_{2s} when k=s2k=s^2. We classify the Galois conjugates of the centre modular data with positive categorical dimensions, determine the Witt classes of the W(2,3k)\mathcal{W}(2,3k) representation categories for integral kk, and describe the near-group module categories and their Morita duals.

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

math.NT — Number Theory

A weighted reciprocal Lucas sum lies outside ℚ(√5)

Contributed by twinheterodox

For the even-indexed Lucas numbers L2nL_{2n}, the reciprocal sums with numerators 11 and n2n^2 are known to be transcendental. We prove that the intermediate sum ∑n≥1n/L2n\sum_{n\ge1}n/L_{2n} lies outside Q(5)\mathbb{Q}(\sqrt{5}), and that the same conclusion holds with L2anL_{2an} in the denominator for every integer a≥1a\ge1. More generally, the weight-two value β1/b(2)=∑n≥1n/(bn+b−n)\beta_{1/b}(2)=\sum_{n\ge1}n/(b^n+b^{-n}) of the qq-analogue of Dirichlet's beta function lies outside Q(b)\mathbb{Q}(b) for every real algebraic integer b>1b>1 whose other conjugates have modulus at most one.

Author comments: 8 pages. Includes the irrationality of the weighted even-indexed Lucas reciprocal sum at every positive integer stride and a field-exclusion theorem for the weight-two q-beta value. The source archive includes the exact three-pole check. Source and verification code at https://github.com/twinheterodox/weighted-even-lucas-reciprocals

Primarily AI-generated textHuman understanding: some partsLucas numbersPisot and Salem numbersirrationalityq-series
Nov 19, 20268 pages
PDFView work

math.NT — Number Theory

A height criterion for irrational weight-three Lambert sums

Contributed by twinheterodox

For an algebraic number bb with ∣b∣>1|b|>1, the weight-three Lambert sum is Z(b)=∑n≥1n2/(bn−1)Z(b)=\sum_{n\ge1}n^2/(b^n-1). We prove that Z(b)Z(b) lies outside Q(b)\mathbb{Q}(b) whenever the Mahler measure M(b)M(b) satisfies log⁡M(b)<(352π2/2889) rlog⁡∣b∣\log M(b)<(352\pi^2/2889)\,r\log|b|, where r=1r=1 for a real base and r=2r=2 otherwise. The criterion allows several conjugates outside the unit disk and applies to nonintegral bases. In particular, Z(3+3)∉Q(3)Z(3+\sqrt{3})\notin\mathbb{Q}(\sqrt{3}), although both conjugates of the base exceed one.

Author comments: 5 pages. Companion to The weight-three Lambert sum at the golden ratio is irrational (Hexagon 2611.00623v1). The source archive includes the verification code and expected results. Source and verification code at https://github.com/twinheterodox/algebraic-base-lambert-values

Primarily AI-generated textHuman understanding: some partsLambert seriesMahler measurealgebraic numbersirrationality
Nov 19, 20265 pages
PDFView work

math.CO — Combinatorics

Hadamard matrices of orders 668, 716, 892, 1132, 1244, 1388, 1436, 1676, 1772, 1916, 1948 and 1964

Contributed by Erisa Hasani, Abhinav Nellore, Rachel Ward

We construct Hadamard matrices of orders 668, 716, 892, 1132, 1244, 1388, 1436, 1676, 1772, 1916, 1948 and 1964, the twelve multiples of 4 below 2000 for which none was known, and a second, inequivalent matrix of order 668. Five come from the Goethals–Seidel array with circulant blocks invariant under a multiplier group, four from the width-4 bordered array of Wallis and Whiteman, and four from bordered Goethals–Seidel arrays of widths 12, 20 and 28 whose corner is itself a Hadamard matrix. To our knowledge borders wider than 4 with a Hadamard corner are new; the first two arrays are classical. The four matrices with a border of width 4, of orders 668, 716, 1676 and 1772, are instances of a theorem of Miyamoto on Hadamard matrices of order 8m+48m+4, which Seberry and Yamada restated with their M-structures; the matrices to which the theorem applies were found here by computer search. The searches differ greatly in size. Those for the wider borders formed at most about 2442^{44} pairs of candidate blocks. Those for orders 716 and 668 with a border of width 4, made with no multiplier group, formed about 2662^{66} and 2592^{59}, and these two matrices, that of order 716 above all, are results of large-scale computation more than of a new construction. With these matrices, a Hadamard matrix of order nn is known for every n≡0(mod4)n\equiv 0\pmod 4 with n≤2000n\le 2000.

Author comments: 28 pages. The source also builds a marked copy showing every change from the original write-up (instructions at the top of the TeX file). The timing program of Appendix D, pairsum_bench.c, is at the end of the TeX source.

Primarily AI-generated textHuman understanding: some partsGoethals–Seidel arrayHadamard matrixM-structuresMiyamoto's constructionbordered arraycompression of sequencesdivisible difference familymeet-in-the-middle searchmultiplier groupsupplementary difference sets
Nov 19, 202628 pages
PDFView work

math.NT — Number Theory

Daboussi's elementary proof of the prime number theorem, reconsidered

Contributed by Paul Pollack

In 1984, Daboussi gave an "elementary" proof of the prime number theorem whose central actors are smooth numbers (numbers with no large prime factors). We explain a variant of his argument that might be considered even more elementary.

A mix of human-written and AI-generated textHuman understanding: all partsMöbius functionprime number theoremsmooth numbers
Nov 19, 20269 pages
PDFView work

cs.FL — Formal Languages and Automata Theory

The Černý (1969) conjecture holds for quasi-Eulerian automata of degree one

Contributed by Dave Goel

An automaton with nn states is quasi-Eulerian of degree dd if there are positive letter weights summing to one, a set XX of dd exceptional states and a further state ss such that every state outside X∪{s}X\cup\{s\} receives total weight one and every edge that starts in XX ends in X∪{s}X\cup\{s\}. Berlinkov bounded the reset threshold of strongly connected synchronizing ones by 2d(n−d+1)(n−1)2^d(n-d+1)(n-1). We prove that every synchronizing quasi-Eulerian automaton of degree one has a reset word of length at most (n−1)2(n-1)^2, so the Černý (1969) conjecture holds for this family; the Černý automata belong to it and attain the bound. The same bound holds for every synchronizing automaton whose transition matrix, weighted by some positive, possibly irrational, letter weights, has a positive stationary vector that is constant on all states but one; for this family Berlinkov's bound was 2n(n−1)2n(n-1). For synchronizing quasi-Eulerian automata of degree two, the bound holds whenever the automaton is not strongly connected, whenever its two exceptional states form a block of a congruence, and, for binary strongly connected automata, in 4646 of the 4949 configurations (up to renaming) of the edges at the two exceptional states. The key step in degree one is elementary: a shortest word that takes the exceptional state out of a set KK of states that contains it has length at most ∣K∣|K|, and one that takes it into a set KK that does not contain it has length at most n−∣K∣n-|K|.

Author comments: First version: October 24, 2026.

A mix of human-written and AI-generated textHuman understanding: some partsSynchronizing automatonquasi-Eulerian automatonreset wordstationary vectorČerný conjecture
Nov 19, 202620 pages
PDFView work

cs.CC — Computational Complexity

Black-box identity testing for affine orbits of read-once oblivious algebraic branching programs

Contributed by Yilin Liu

For every fixed width, we construct a polynomial-size hitting set for read-once oblivious algebraic branching programs under an unknown invertible affine change of variables. A width bound in a single unknown order suffices. The resulting deterministic black-box identity test runs in time polynomial in the number of variables and the total degree over every field with more elements than the degree. The construction preserves the generic ranks of consecutive matrix products in descending order. At fixed dimension and width, the query count is linear in the total degree in characteristic zero or above the individual degree in the hidden coordinates. When the width bound holds in every order, cut ranks give linear dependence up to logarithmic factors even in small characteristic. We also treat multivariate layers with bounded overlap and obtain a linear query bound for bivariate programs of width two.

Primarily AI-generated textHuman understanding: no partsaffine orbitshitting setspolynomial identity testingread-once oblivious algebraic branching programs
Nov 19, 202618 pages
PDFView work

cs.CC — Computational Complexity

Parameterised complexity of graph homomorphism to odd cycles

Contributed by Jason Davies

A nonbipartite graph has an odd-cycle core precisely when it maps to its shortest odd cycle. Core recognition and homomorphism to an input odd cycle are both XNLP-complete for the width of a supplied path decomposition, XALP-complete for the width of a supplied tree decomposition, and W[SAT]-hard and in W[P] for feedback vertex number. Hardness persists on connected, 2-degenerate NN-vertex sources of girth Ω(N1−ε)\Omega(N^{1-\varepsilon}) for any fixed 0<ε<10<\varepsilon<1. Our reduction encodes lists by cycles sharing an edge. On inputs with an edge it increases treewidth and feedback vertex number by exactly two. Lean 4 checks this structural transfer. For feedback edge number rr, we compute the exact circular chromatic number in 2O(r)2^{O(r)} time up to polynomial factors, which gives the same upper bound for both decision problems.

Primarily AI-generated textHuman understanding: no partsLeanXNLPcircular chromatic numberfeedback vertex setgraph homomorphismodd cycleparameterized complexitypathwidthtreewidth
Nov 19, 202615 pages
PDFView work

math.NA — Numerical Analysis

Numerical evidence for the almost Hadamard conjecture

Contributed by Teo Banica

We report on encouraging numerical evidence for the almost Hadamard conjecture, stating that any local maximizer of the 11-norm on UNU_N must have all entries of modulus 1/N1/\sqrt{N}, or equivalently that every complex almost Hadamard matrix H=N UH=\sqrt{N}\,U must be a complex Hadamard matrix, with computations at the key values N=4,5N=4,5 arising from our attempts to both prove and disprove the conjecture, and adding to the previous abstract evidence.

Primarily AI-generated textHuman understanding: some partsAlmost HadamardHadamard matrix
Nov 19, 202630 pages
PDFView work

math.QA — Quantum Algebra

An Extremal Vertex Operator Algebra of Central Charge c=64

Contributed by Gerald Höhn

Starting with the standard self-dual (−1)(-1)-orbifold of the Barnes--Wall lattice VOA of central charge 3232, we construct a simple-current extension of a fixed-point subalgebra of its tensor square. The resulting vertex operator algebra is self-dual of central charge 6464 and has no nonzero Virasoro highest-weight vector of weight 11 or 22. We give the twisted conformal weights, an elementary proof of the group-cohomological detection statement needed to trivialize the twisted-module associator class, and a permutation-cover argument determining the relevant absolute module weights. This identifies the complete weight-two obstruction set in a 5656-dimensional binary quadratic space. An explicit 2828-dimensional totally singular graph avoids that set; its exhaustive verifier is included. The final algebra object and its multiplication are also explicit. To my knowledge, this is the first new central-charge value of an extremal self-dual vertex operator algebra since the examples discussed in my 1995 thesis.

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

math.CO — Combinatorics

The shortest word containing every permutation of ten symbols as a subsequence has length 83

Contributed by Jason Davies

A word is universal for an alphabet if it contains every permutation of the alphabet as a subsequence. We prove that no word of length 82 is universal for ten symbols. Together with the known construction of length 83, this shows that the shortest universal word on ten symbols has length 83. The proof cuts a word at the copies of one symbol: universality is equivalent to complementary prefix and suffix conditions at consecutive copies. A counting argument confines a least frequent symbol to four, five, six or seven copies and excludes four. In the remaining cases, frequency tests reduce the possibilities to finitely many block templates, and machine-checked propositional refutations exclude every ordering of each. The computation also reproduces the nine-symbol value 66.

Primarily AI-generated textHuman understanding: no partsLean 4RUP certificatesSATcomputer-assisted proofpermutationsshortest common supersequencesubsequencesuniversal words
Nov 19, 20268 pages
PDFView work

math.SP — Spectral Theory

The equilateral triangle maximises the first Steklov eigenvalue among triangles

Contributed by Jason Davies

Let σ1(T)\sigma_1(T) be the first nonzero Steklov eigenvalue of a triangle TT and L(T)L(T) its perimeter. Among triangles the equilateral triangle EE uniquely maximises σ1L\sigma_1 L. If the shortest and longest sides of TT have lengths a≤ba\le b, then σ1(E)L(E)−σ1(T)L(T)≥(b−a)/(2b)\sigma_1(E)L(E)-\sigma_1(T)L(T)\ge (b-a)/(2b). Since ∣T∣/L(T)2|T|/L(T)^2 is also maximal at EE, the equilateral triangle uniquely maximises σ1∣T∣\sigma_1\sqrt{|T|} as well. This settles the case n=3n=3 of the Steklov analogue of the Pólya–Szegő conjecture for nn-gons, for both normalisations. The extremal value satisfies 3.8724615957722≤σ1(E)L(E)≤3.87246159577343.8724615957722\le \sigma_1(E)L(E)\le 3.8724615957734. For side length one, σ1(E)=σ2(E)<σ3(E)=23<σ4(E)\sigma_1(E)=\sigma_2(E)<\sigma_3(E)=2\sqrt3<\sigma_4(E). Under displacement of the apex over a fixed unit base, the first two perimeter-normalised eigenvalues split linearly with equal and opposite slopes independent of direction. The proof is computer-assisted. Near EE we transplant the first eigenspace of EE affinely; away from EE the trial function cos⁡(πx)\cos(\pi x) suffices. We verify the finite matrix and interval inequalities in ball arithmetic.

Primarily AI-generated textHuman understanding: no partsPólya–Szegő conjectureSteklov eigenvaluescomputer-assisted proofinterval arithmeticshape optimizationtriangles
Nov 19, 202614 pages
PDFView work

math.AG — Algebraic Geometry

Christol’s Conjecture for Non-Resonant Globally Bounded ₃F₂(a₁, a₂, a₃; b, 1; x) Series

Contributed by David Jordan

Christol conjectured that every globally bounded, D-finite power series with rational coefficients is the diagonal of a rational function. We prove this for the hypergeometric series 3F2(a1,a2,a3;b,1;x){}_3F_2(a_1,a_2,a_3;b,1;x) with rational parameters such that aia_i, bb and ai−ba_i-b are not integers: if such a series is globally bounded, then it is the diagonal of an algebraic power series in two variables, and hence of a rational function in three variables; three is the least possible number of variables. This includes Christol's example 3F2(19,49,59;13,1;x){}_3F_2(\frac19,\frac49,\frac59;\frac13,1;x) from 1987, and the series 3F2(17,27,47;12,1;x){}_3F_2(\frac17,\frac27,\frac47;\frac12,1;x), which Christol suggested as a possible counterexample to his conjecture. By a result of Rivoal and Roques, under the Rohrlich-Lang conjecture the latter is a diagonal that is not a Hadamard product of algebraic power series. The proof is Hodge-theoretic and not constructive: it shows that such diagonal representations exist, but does not produce them. Using Fedorov's formula for the Hodge numbers of hypergeometric local systems, we show that the series is globally bounded exactly when every Galois conjugate of its local system carries a complex variation of Hodge structure with two adjacent Hodge levels. The restriction of scalars of the local system then underlies a polarized integral variation of Hodge structure of weight one. By a theorem of Deligne the series is therefore a period of an abelian scheme, and hence of a family of curves, where it is an integral over vanishing cycles of a semistable degeneration. Expanding this integral at the nodes of a regular model gives the diagonal representation.

Author comments: Supplementary material (independent checks, computations, verification logs and searches): https://github.com/bbrhuft/christol-3f2-diagonals; archived version on Zenodo: https://doi.org/10.5281/zenodo.24355840

Primarily AI-generated textHuman understanding: no partsChristol’s conjectureabelian schemesdiagonals of rational functionsglobally bounded power serieshypergeometric functionsvanishing cyclesvariations of Hodge structure
Nov 19, 202640 pages
PDFView work

cs.CC — Computational Complexity

Thermodynamic saturation and prescribed window barriers for Kleinian-code graded spaces

Contributed by Mohamed Fradj

We investigate prescribed graded-window dimensions for Kleinian-code characters, motivated by the four-leg construction of a subexponential 3-SAT algorithm, but without claiming new admissible algebraic operators. For every compact J⋐(0,∞)J\Subset(0,\infty), we prove, uniformly for isotropic additive codes S⊂KmS\subset K^m, $$ \rho_{\mathrm{win}}(V_S;h,\lambda)\geq \frac{1}{\sqrt{2}}+\eta_J-C_Jm^{-1/2}, $$ whenever h/m∈Jh/m\in J and 2λ≤dim⁡(VS)h2^\lambda\leq\dim(V_S)_h, where ηJ>0\eta_J>0 is specified by the proof but has not yet been evaluated as a certified numerical constant for any given compact interval. The fixed-density proof combines the central-window inequality, sectorwise thermodynamic estimates based on the isotropic local weight bound, finite-length concentration, and certified interval arithmetic (Arb, cross-checked with mpmath.iv) for specified sign inequalities. These numerical certificates do not formalize the complete proof. No concavity or convergence assumption on the code-weight spectrum is needed. For additive codes of 2-rank at most mm, we also prove that the maximally encoded prescribed-window cost converges uniformly to 1/21/\sqrt{2} as h/m→∞h/m\to\infty, with two-sided explicit errors of order O(m/h+(mh)−1/4)O(\sqrt{m/h}+(mh)^{-1/4}) for admissible h≥15mh\geq 15m and mh≥4000mh\geq 4000. These are statements about window dimensions, not intrinsic matrix ranks or implementations within a SAT algorithm.

Author comments: First public submission of this 26-page manuscript, dated 17 November 2026. The mathematical exploration, candidate proofs, manuscript preparation, and computational verification were developed with substantial assistance from ChatGPT (OpenAI) and Claude (Anthropic). The author understands the motivation and intended scope of the research but has not independently verified or fully mastered all technical proofs. Independent qualified human mathematical review and complete formal proof verification remain outstanding. Companion reproducibility software and recorded computational checks are available at: https://github.com/MFRADJ/graded-window-barrier-certificates/releases/tag/v1.1.0 The software release is distinct from this manuscript.

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

math.MG — Metric Geometry

An explicit formal dual for every configuration Γ(C,C⊥)\Gamma(C,C^\perp) of Bierbrauer–Edel's definition, and formal isoduality of the packings in dimensions 18, 28 and 30

Contributed by Antoine Olivier

Let CC be a binary linear [2k,k][2k,k] code with C≠C⊥C\neq C^\perp, and Γ=Γ(C,C⊥)\Gamma=\Gamma(C,C^\perp) the configuration of formula (1), the definition on p. 97 of Bierbrauer–Edel. Theorem A gives an explicit formal dual of Γ\Gamma in the sense of Cohn–Kumar–Reiher–Schürmann, in terms of CC, C⊥C^\perp and two auxiliary words. No hypothesis on minimum distance or parity is needed. The finite pair behind it has ∣S∣=∣T∣=2r+1|S|=|T|=2^{r+1} in a group of order 22r+22^{2r+2}, where r=k−dim⁡Rr=k-\dim R and R=C∩C⊥R=C\cap C^\perp is the hull of CC. Proposition I shows that this dual is an isometric copy of Γ/8\Gamma/8. So Γ\Gamma rescaled to unit density is formally isodual in the sense of Cohn–Kumar–Schürmann. A remark shows that it is formally self-dual exactly when 4∣n4\mid n and the hull is doubly even. Hence the packings 18.1, 28.1 and 30.1 are formally isodual and not formally self-dual. A further remark concerns codes with 1∈R\mathbf 1\in R and r=4,6,8r=4,6,8: an F2\mathbb F_2-linear identification turns SS into a graph {(x,F(x)):x∈F2r+1}\{(x,F(x)) : x\in\mathbb F_{2^{r+1}}\} with FF a permutation, formally self-dual under the trace pairing of Kölsch–Schüler. The same construction was also run for r=10,12r=10,12: computed, not reviewed.

Primarily AI-generated textHuman understanding: some partsBierbrauer–Edelbinary codesformal dualityisodualitylattice packings
Nov 19, 202625 pages
PDFView work

math.KT — K-Theory and Homology

Gersten exactness with invertible coefficients for excellent regular local surfaces

Contributed by Niels Feld

Let RR be an excellent regular local ring of dimension two, and let N≥2N\geq2 be a natural number invertible in RR. We prove exactness of the augmented Gersten complex for K(R;Z/N)K(R;\mathbb{Z}/N) in every degree. More generally, it suffices that the normalization of every reduced closed curve in Spec⁡R\operatorname{Spec} R be finite. The proof applies to ramified mixed-characteristic rings without a henselianity assumption. With coefficients of invertible order, we first prove that pushforward from a Cartier divisor on the spectrum of a noetherian semilocal ring annihilates every class coming from connective KK-theory. For a curve in Spec⁡R\operatorname{Spec} R, we then place its normalization and auxiliary regular curves as transverse Cartier divisors on a finite RR-scheme. A third curve carries a prescribed residue class, and a quotient of the two divisor equations moves that residue to an auxiliary curve. The residues on the auxiliary curves cancel after transfer to the residue field of RR. These constructions prove generic injectivity; vanishing of the closed-point pushforward then gives the full complex.

Author comments: 32 pages.

Primarily AI-generated textHuman understanding: all partsGersten conjecturealgebraic $K$-theoryfinite coefficientshenselian rigiditymixed characteristicregular local rings
Nov 19, 202632 pages
PDFView work

math.NT — Number Theory

Irrational values of Dirichlet series with growing period

Contributed by twinheterodox

Let ff be a nonzero rational-valued function of period DD. We count the exponents 2≤j≤s2\le j\le s of prescribed parity for which Lf(j)=∑n≥1f(n)n−jL_f(j)=\sum_{n\ge1}f(n)n^{-j} is irrational. For fixed 0<η<10<\eta<1 our lower bound of order slog⁡log⁡s/(Dlog⁡(sD))\sqrt{s\log\log s/(D\log(sD))} has explicit constants and holds simultaneously for all D≤s1−ηD\le s^{1-\eta} and all such ff. For the real and imaginary parts of the quartic character modulo five we improve the previous lower-bound coefficient at even exponents by a factor of 2/32/\sqrt3.

Author comments: 10 pages. Extends the fixed-period theorem to periods growing with the exponent cutoff and sharpens the even-exponent bound for the quartic character modulo five. The fixed-period paper is at https://hexagonmath.org/2611.00615v1. The source and verification programs are at https://github.com/twinheterodox/growing-period-dirichlet-values

Primarily AI-generated textHuman understanding: some partsHankel determinantsirrationalityperiodic Dirichlet seriesspecial values
Nov 19, 202610 pages
PDFView work

math.NT — Number Theory

The weight-three Lambert sum at the golden ratio is irrational

Contributed by twinheterodox

For ∣b∣>1|b|>1, define the weight-three Lambert sum by Z(b)=∑n≥1n2/(bn−1)Z(b)=\sum_{n\ge1}n^2/(b^n-1). For an algebraic integer bb in this range, we prove that Z(b)∉Q(b)Z(b)\notin\mathbb{Q}(b) if every conjugate outside the closed unit disk belongs to {b,bˉ}\{b,\bar b\}. This includes all Pisot and Salem bases. For a Salem base we bound the polynomial approximations even at conjugates on the unit circle, where the series diverges. At the golden ratio φ=(1+5)/2\varphi=(1+\sqrt{5})/2, the sum Z(φ)Z(\varphi) lies outside Q(5)\mathbb{Q}(\sqrt{5}) and is therefore irrational. A nonreal example is Z(1+i)∉Q(i)Z(1+i)\notin\mathbb{Q}(i).

Author comments: 7 pages. Covers Pisot and Salem bases, the golden ratio, and the Gaussian integer 1+i. The source archive includes the independent audit program and an exact check at a complex point. Code and results: https://github.com/twinheterodox/algebraic-base-lambert-values

Primarily AI-generated textHuman understanding: some partsLambert seriesPisot numbersSalem numbersirrationality
Nov 19, 20267 pages
PDFView work