Browse

All works

Browse the Hexagon catalog.

Newest works

1110 works

math.QA — Quantum Algebra

Solutions of the set-theoretic quantum Yang--Baxter equation arising from posets

Contributed by G. Militaru

We extend Victoria Lebed’s construction of idempotent solutions of the braid equation by introducing four families of solutions associated with posets. We show that every group can be realized as the automorphism group of such a solution, and establish a classification of solutions that either preserve or interchange the components of each pair. We also characterize when two solutions arising from posets are isomorphic. Finally, for finite posets, we construct two families of involutive solutions whose automorphism groups are explicitly described in terms of the automorphisms and anti-automorphisms of the underlying posets.

A mix of human-written and AI-generated textHuman understanding: all partsYang–Baxter equationposet
Nov 15, 202619 pages
PDFView work

math.LO — Logic

Self-embedding monoids and the existential Thomas conjecture

Contributed by Dr. András Pongrácz

We give a countable homogeneous finitely bounded Ramsey structure in a finite relational language with finitely many reducts up to first-order interdefinability but infinitely many self-embedding monoids of reducts. The reducts producing these monoids are first-order interdefinable, while their monoids form a strictly increasing chain. This refutes the existential strengthening of Thomas' conjecture even under the Ramsey hypothesis. The example is an ordered expansion of an equivalence-relation structure. Before the order is added, that structure has exactly five reducts up to first-order interdefinability. We also give a revised proof of the classification of self-embedding monoids for reducts of the countable existentially closed binary branching semilinear order. Exactly five monoids occur, refining its three-class first-order classification. The proof transfers the known classification for the homogeneous binary branching CC-relation from antichains to arbitrary finite configurations. The additional step is a connectivity argument on finite labelled trees, using both preservation and reflection of the reduct's basic relations.

Primarily human-written textHuman understanding: all parts
Nov 15, 202634 pages
PDFView work

math.NT — Number Theory

Automorphisms of the modular curves XΔ(N)X_\Delta(N)

Contributed by Filip Najman

We show that every automorphism of a modular curve XΔ(N)X_\Delta(N) of genus at least 22, where Γ1(N)⊆ΓΔ(N)⊆Γ0(N)\Gamma_1(N)\subseteq \Gamma_\Delta(N)\subseteq \Gamma_0(N), is induced by the normalizer of ΓΔ(N)\Gamma_\Delta(N) in PSL2(R)\mathrm{PSL}_2(\mathbb{R}), except for five curves, namely X0(37)X_0(37), X0(63)X_0(63), X0(108)X_0(108), a curve of level 3737 found by Jeon, Kim and Schweizer, and a curve of level 6363 whose non-modular automorphisms had, to our knowledge, not been noticed before. In particular every automorphism of X1(N)X_1(N) normalizes the group of diamond operators, as claimed for square-free NN in an unpublished preprint of Momose. The proof combines a twisted Hecke relation, which comes from the Galois action on the Tate module of the Jacobian, with a uniform bound for the dimension of the CM part of the Jacobian and with computations for finitely many levels.

Author comments: 30 pages. Code and logs: https://github.com/F-Najman/automorphisms_XDelta. Lean formalization: https://github.com/F-Najman/normalizer-lean

Primarily AI-generated textHuman understanding: some partsautomorphism groupsintermediate modular curvesmodular curves
Nov 15, 202630 pages
PDFView work

math.MG — Metric Geometry

The Barker--Larman problem in dimension three A counterexample to the Barker--Larman problem in dimension three

Contributed by Sihan Chen

We construct an origin-symmetric convex body of revolution in R3\R^3, with real-analytic boundary and positive principal curvatures, whose planar sections tangent to a concentric inner ball all have the same area. The body is nonspherical and has the same section data as a centered ball. The construction bifurcates from the unit ball at height 1/31/\sqrt{3}, where degree two is the only even Legendre resonance. We construct approximate solutions to arbitrary order and correct them by a Newton iteration on nested closed parameter sets. A finite-order reduction of the linearized section operator and measure estimates for its small divisors provide the inverse bounds needed for convergence.

Primarily AI-generated textHuman understanding: some partsBarker--Larman problemLegendre polynomialsgeometric tomographyparallel sectionssmall divisor
Nov 15, 202628 pages
PDFView work

math.AG — Algebraic Geometry

A proof of the HLRV conjecture

Contributed by Qiyue Tang

We prove the Hausel–Letellier–Rodriguez-Villegas conjecture on the mixed Hodge polynomials of generic semisimple GLn\mathrm{GL}_n character varieties.

Author comments: I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

Primarily AI-generated textHuman understanding: no parts
Nov 15, 2026129 pages
PDFView work

math.NT — Number Theory

Growth criteria for reciprocal series with nonincreasing weights

Contributed by twinheterodox

Fix nonincreasing positive integer weights w0,…,wd−1w_0,\ldots,w_{d-1} and define c>1c>1 by (c−1)2∑j=0d−1wjcj=w0(c-1)^2\sum_{j=0}^{d-1}w_jc^j=w_0. If the total weight is at least two, we prove irrationality of ∑n≥11/(anw0⋯an+d−1wd−1)\sum_{n\ge1}1/(a_n^{w_0}\cdots a_{n+d-1}^{w_{d-1}}) whenever the positive integers ana_n are strictly increasing and lim sup⁡n→∞(log⁡an)/cn=∞\limsup_{n\to\infty}(\log a_n)/c^n=\infty. For every nonconstant nonincreasing weight profile, this lowers the sufficient base in the general criterion of Barreto, Kang, Kim, Kovač and Zhang (Bull. Lond. Math. Soc. 58 (2026), e70457, Theorem 3), with the classical base-2 criterion included in the comparison. For weights (3,2,1)(3,2,1) the base becomes 43\sqrt[3]{4}; staircase weights (d,d−1,…,1)(d,d-1,\ldots,1) give (d+1)1/d(d+1)^{1/d}. Irregular growth is allowed. A more general form permits nondecreasing sequences and positive integer numerators under polynomial size bounds.

Author comments: 9 pages. Extends the two-weight result in Hexagon 2611.00428v1 to all fixed nonincreasing positive integer weight profiles. Includes a general numerator criterion and a comparison with finite-product substitutions. Source and build instructions: https://github.com/twinheterodox/weighted-reciprocal-growth

Primarily AI-generated textHuman understanding: some partsgrowth criteriairrationalityreciprocal series
Nov 15, 20269 pages
PDFView work

cs.CC — Computational Complexity

An edge comparison with constant 3/2 and the coefficient 6/sqrt(2 pi) for the average sensitivity of polynomial threshold functions

Contributed by David Niedbala Giraudin

For every real polynomial threshold function f of degree at most d on the uniform cube {-1,1}^n we prove AS(f) <= min{n, 6 d b_n (n+d)/(n+2d)} <= (6/sqrt(2 pi)) d sqrt(n) < 2.394 d sqrt(n), where b_n = E|B_n - n/2| for B_n ~ Bin(n,1/2). The previous coefficient was 8/sqrt(2 pi) = 3.1915... The new ingredient is an edge comparison with constant 3/2 in place of 2 in OpenAI's weighted-grading argument: for every positive weight and every sign function h, the number of ordered equal-sign edges of h is at most (3/2)||MH+HM||_HS^2. The proof rests on the exact identity (Z_i M Z_i - M)^2 = I - A_i^2, where A_i is the grade-diagonal part of the multiplication by x_i. Combined with OpenAI's original coupling estimate alone, the lemma already gives AS(f) <= 6 d sqrt(n).

Primarily AI-generated textHuman understanding: no partsBoolean functionsaverage sensitivitycoupling inequalitypolynomial threshold functionstotal influenceweighted grading
Nov 15, 20264 pages
PDFView work

math.MP — Mathematical Physics

Electric-field hotspot packing and power channels in dielectric media

Contributed by Daniel Wang

We study quantified versions of two questions on field concentration and power channels posed by Miller and Monticone in OQ14. At a fixed driving frequency and under a common positive permittivity bound, we construct arbitrarily many simultaneous localized electric-field peaks in a single driven field, both in a two-dimensional invariant setting and in finite three-dimensional dielectrics. We also construct arbitrarily many localized peaks in a single normalized outgoing mode of a finite smooth dielectric, with prescribed real part of the complex resonance frequency and an arbitrarily high quality-factor target. The modal normalization is a reciprocal-residue normalization. Its relation to other possible interpretations of the original modal-volume question requires separate justification. For a specified channel definition, we construct, for every finite NN, an NN-dimensional counted input space through the same square section at fixed frequency, material bounds, and thresholds. The construction applies when the permitted absolute-bypass threshold exceeds the required passage threshold and when the selected output is the complete outgoing scattering map, including reflection. Thus the corresponding unrestricted uniform finiteness assertion fails. The result does not decide stricter bypass conditions or receiving-only output formulations. These quantified results do not resolve every interpretation of the original OQ14. The formal verification and its scope are described in the manuscript.

Author comments: Initial manuscript. The channel counterexample concerns the specified quantified formulation with the complete outgoing scattering map, including reflection; it does not settle stronger bypass or receiving-only formulations.

Primarily AI-generated textHuman understanding: no partsMaxwell equationsdielectric resonatorsfield localizationoptical channelsscattering theory
Nov 15, 2026112 pages
PDFView work

math.NT — Number Theory

Subrings and cotypes of truncated polynomial rings

Contributed by Ramin Takloo-Bighash, Sarthak Chimni

We study unital finite-index subrings of Rn=Z[t]/(tn)R_n=\Z[t]/(t^n). We compute the cubic cotype function and the quartic total and cocyclic functions at every prime, including the exceptional factors at 22, and prove the corresponding global counting theorems in degrees three, four, and five. Explicit Hermite sums with determinantal weights give full cotype formulas for n=4,5n=4,5, without an asserted closed rational evaluation. We extend these calculations by a linear lifting recursion for every degree and by a two-parameter description of every cocyclic subring for n≥4n\ge4. The latter gives $2-2/(n-1)\le\alpha_n^{\cc}\le2$ for the global cocyclic convergence abscissa, and hence $\alpha_n^{\cc}\to2$. An exact quadratic family of quintic diagonal counts gives absolute convergence of the residual Dirichlet series for $\Rea s>19/13$. All asymptotics are obtained by elementary summation and absolutely convergent convolution.

A mix of human-written and AI-generated textHuman understanding: all partsIntegral ringsp-adic integration
Nov 15, 202636 pages
PDFView work

math.NT — Number Theory

Aigner's Three Monotonicities from Fibonacci Matrices and Six Snake Pieces

Contributed by Elleard Felix Webster Heffern

Starting from the established fact that Markov numbers count perfect matchings of their Markov snake graphs, we give a self-contained proof of the fixed-sum, fixed-numerator, and fixed-denominator orderings proposed by Aigner. The author's Fibonacci-matrix normalization begins with (AC)11−(B2)11=2(AC)_{11}-(B^2)_{11}=2 for consecutive odd-indexed Fibonacci blocks. Fibonacci matrices prove normalization and fixed-numerator monotonicity. The author's six-piece decomposition proves the remaining fixed-sum comparison and fixed-denominator monotonicity. We credit the matching correspondence to its original 2002–2003 REACH development and distinguish that history from the later ordering theorems.

Author comments: Standalone v4, 6 pages, 2 figures. The normalization and three ordering proofs also appear in Section 5 of Meridians; this standalone presentation makes them easier to find and cite. Earlier proofs of the orderings and the 2002–2003 matching correspondence retain their citations. The general Markov uniqueness conjecture remains open. Linked chronology: 8 November 2026: standalone v3: https://zenodo.org/records/24053747 11 November 2026: standalone v4, source, figures and finite-check reports: https://zenodo.org/records/24146546 12 November 2026: v4 PDF mirrored on ResearchGate: https://www.researchgate.net/publication/417809122_Aigner's_Three_Monotonicities_from_Fibonacci_Matrices_and_Six_Snake_Pieces 12 November 2026: corrected Meridians v22: https://zenodo.org/records/24167894 ; its Aigner arguments and figures are unchanged. The v4 source's version note records its original synchronization with v21. 13 November 2026: Meridians published on Hexagon: https://hexagonmath.org/2611.00410 Related computational supplements (2 November 2026): https://zenodo.org/records/23874075 ; current trillion-verification evidence accompanies the corrected Meridians archive above. Earlier project announcements, not announcements of this standalone proof: 21 October 2026, 15:18:25 UTC: X, earlier billion-scale verification: https://x.com/webystar/status/2112926487091282350 23 October 2026, 14:54:57.771 UTC: LinkedIn, earlier 9.3-billion verification: https://www.linkedin.com/posts/elleard-felix-webster-heffern-joseph-by-confirmation-2953a3104_markovnumbers-activity-7519411048115003392-4NaJ No separate social announcement for this paper has been independently verified.

A mix of human-written and AI-generated textHuman understanding: all partsAigner's conjecturesFibonacci matricesMarkoff numbersMarkov numberscombinatorial number theoryfixed-denominator monotonicityfixed-numerator monotonicityfixed-sum monotonicityperfect matchingssnake graphs
Nov 15, 20266 pages
PDFView work

math.AG — Algebraic Geometry

An explicit determinantal formula for Sinkhorn limits of matrices and tensors

Contributed by Shankar Sivarajan

We give an explicit formula, as a single determinant, for the polynomial satisfied by any entry of the limit obtained by scaling a positive tensor of format n1×⋯×nrn_1\times\dots\times n_r to arbitrary prescribed one-dimensional margins (Sinkhorn--Knopp scaling, Kruithof's method, iterative proportional fitting). The polynomial is the multilinear resultant, on the Segre variety $\PP^{n_1-1}\times\dots\times\PP^{n_r-1}$, of the linear forms expressing the margin conditions. Its degree is the multinomial coefficient N=(dn1−1,…,nr−1)N=\binom{d}{n_1-1,\dots,n_r-1} with d=∑k(nk−1)d=\sum_k(n_k-1), and for generic tensors its roots are the corresponding entries of all complex solutions of the scaling equations. A Sylvester matrix turns it into an explicit N×NN\times N generalized eigenvalue problem, whose null vector recovers the whole limit. The leading coefficient is the principal AA-determinant of the product of simplices, that is, the product of the hyperdeterminants of all faces of the tensor. The constant term is likewise a product of face hyperdeterminants, and the faces avoiding the chosen entry split off as a factor independent of that entry. For matrices we also give a short proof, in Pl\"ucker coordinates, of a diagonal form of the eliminant. For every positive tensor, the limit is the unique root for which the Sylvester matrix has a positive null vector of monomials. Generically, the other roots are the corner entries of the solutions of the same scaling equations with complex scaling factors.

Primarily AI-generated textHuman understanding: all partsSinkhorn scaling
Nov 15, 202612 pages
PDFView work

math.NT — Number Theory

Irrationality of χ2(1/q)\chi_2(1/q), Ti2(1/q)\mathrm{Ti}_2(1/q) and χ2(2/q)\chi_2(2/q)

Contributed by Shawn Krisman

Let χ2(z)=∑n≥0z2n+1/(2n+1)2\chi_2(z)=\sum_{n\ge0}z^{2n+1}/(2n+1)^2 be Legendre's chi function and Ti2(z)=∑n≥0(−1)nz2n+1/(2n+1)2\mathrm{Ti}_2(z)=\sum_{n\ge0}(-1)^nz^{2n+1}/(2n+1)^2 the inverse tangent integral. We prove three theorems: χ2(1/q)\chi_2(1/q) is irrational for every integer q≥3q\ge3 with q≠4q\ne4; Ti2(1/q)\mathrm{Ti}_2(1/q) is irrational for every integer q≥5q\ge5; and χ2(2/q)\chi_2(2/q) is irrational for every odd integer q≥175q\ge175. All three come from one construction: the Hankel determinants of a moment functional with half-integer poles and geometric weight ww, read at w=q−2w=q^{-2}, w=−q−2w=-q^{-2} and w=4q−2w=4q^{-2}. Their denominators are bounded prime by prime, their size by a discrete log-gas argument against explicit dual certificates, and their nonvanishing by a reduction modulo an auxiliary prime. The three cases differ at the prime 22, where each needs its own lemma, in the certificates, and in how the nonvanishing lemma is transferred. For large qq the three statements follow from the linear independence criteria of David, Hirata-Kohno and Kawashima; for the first two, a 1990 criterion of Hata, which we could not consult, also applies from a threshold unknown to us. Below these ranges the results are new as far as we know. All three theorems are formalised in Lean 4 with Mathlib and checked by the Lean kernel, using only Lean's three standard axioms.

Primarily AI-generated textHuman understanding: no partsHankel determinantsLeanLegendre chi functionPadé approximationdilogarithmformal verificationinverse tangent integralirrationalitylogarithmic potential theory
Nov 13, 202646 pages
PDFView work

math.NT — Number Theory

Regularity criteria and an effective bound for irregular extensions of Euler triples

Contributed by Sinisa Slijepcevic, Andrej Dujella

An Euler triple is a Diophantine triple {a,b,c}\{a,b,c\} with a<b<c=a+b+2ab+1a<b<c=a+b+2\sqrt{ab+1}. It extends to the regular Diophantine quadruple {a,b,c,d+}\{a,b,c,d_+\}, and it is conjectured that it has no other extension d>cd>c. We prove that an irregular extension forces c<4⋅1048c<4\cdot10^{48}, against c<1098c<10^{98} in recent work of He and Togb\'e. The proof squeezes the index mm of the extension, which locates a common term of two Pell sequences, between a floor from congruences, c<8m4c<8m^4, valid for every irregular extension, and ceilings from linear forms in logarithms. The same squeeze, with other bounds, gives three regularity criteria: by the size of b/ab/a, which confines irregular extensions to 1+11538<b/a<335521+\frac1{1538}<b/a<3355^2; by pair coordinates, through the hypergeometric method; and by coprime divisors of the index combinations, which settles every Euler triple with two elements in a ratio j:kj:k with jk≤300jk\le300. As applications, the three-parameter family of Cipu, Fujita and Mignotte extends only regularly when νA≥2\nu A\ge2 and K≥643K\ge643, and when K=1K=1, A∈{2,3}A\in\{2,3\} and ν≥2\nu\ge2; the latter contains the Hoggatt--Bergum triples, for which this recovers Dujella's theorem for extensions d>cd>c.

A mix of human-written and AI-generated textHuman understanding: some partsDiophantine quadruplesEuler triples
Nov 13, 202672 pages
PDFView work

math.RT — Representation Theory

A proof of Lusztig's connectedness conjecture in finite type

Contributed by Qiyue Tang

We prove that every equal-parameter Kazhdan–Lusztig left cell in a finite Weyl group is connected by simple left multiplications.

Author comments: v2(2026/11/14):Added a link in the manuscript to the supplementary verification files hosted on GitHub.

Primarily AI-generated textHuman understanding: no parts
Nov 13, 202630 pages
PDFView work

math.CO — Combinatorics

An Upper Bound Exponent of 0.9999873 for Square-Difference-Free Sets

Contributed by Eric Naslund

Let A⊆{1,…,N}A\subseteq\{1,\ldots,N\} contain no two distinct elements whose difference is a nonzero square, and let s(N)s(N) be the largest possible size of such a set. We prove \[ s(N)\le CN^{0.9999873} \] with an absolute constant CC. A recent preprint of OpenAI proves $s(N)\le CN^{1-\eps}$ for some absolute $\eps>0$. Their proof utilizes a certain average of the Fourier transform over (24!)161(24!)^{161} points, and for the parameter choices displayed there we calculate that they obtained $\eps\approx \exp_{10}(-\exp_{10}(\exp_{10}(5782.77)))$, in the sense that $\log_{10}\log_{10}\log_{10}(1/\eps)\approx5782.77$. We follow the same overall strategy, with new work at almost every quantitative step. The largest gain is the use of 7272 slots (positions at which the Fourier transform is evaluated) in place of (24!)161(24!)^{161}: the exponent is roughly a fixed constant divided by the number of slots, so this alone gains many orders of magnitude, but leaves far less room for loss elsewhere. Other savings come from the local construction at each prime. Small primes are handled jointly rather than one by one; and errors are measured in the actual half-distributions of the laws being compared, not bounded term by term against a product model. Where sums over the primes of a block of Weil-type error terms of size O(p−1/2)O(p^{-1/2}) would be too weak, we prove bounds of order O(p−1)O(p^{-1}) for the same error terms using \'etale cohomology over finite fields (Deligne's theorems and Katz--Sarnak monodromy for families of curves), the representation theory of GL2(Fp)\mathrm{GL}_2(\mathbf F_p), exact counts at p≡3(mod4)p\equiv3\pmod4, and a modular evaluation of Ahlgren and Ono. Dependence in our distributions is controlled by the correlation inequalities of Peyre and Kassabov. The remaining finitely many numerical inequalities are verified by exact computer arithmetic, listed in the appendices; all analytic steps are proved in the text. The companion repository \cite{NaslundUpperRepository2026} contains a partial Lean 4 formalization, totaling over 600,000 lines of lean. It establishes s(N)≤CN0.99999s(N)\le C N^{0.99999}, conditional on five named analytic inputs and explicit numerical hypotheses. This formalizes the most critical parts of the proof.

Primarily AI-generated textHuman understanding: some parts
Nov 13, 2026603 pages
PDFView work

math.NT — Number Theory

The central charge of an arithmetic system: a seven-world framework

Contributed by Zeng Chunping

To an arithmetic system (prime elements, norms, weights, LL-functions) we attach the central charge Cν=∑p(log⁡Np)ν/(Np(Npν−1))⋅(weight of Frobp)−1C_\nu=\sum_{\mathfrak p}(\log N\mathfrak p)^\nu/(N\mathfrak p(N\mathfrak p^\nu-1))\cdot(\text{weight of }\mathrm{Frob}_{\mathfrak p})^{-1}. Seven worlds share it: number fields, function fields, graphs, finite-type dynamics, knots, tropical geometry, and arithmetic dynamics. We record four universal laws with their exact status. (I) Index-set identity in all seven worlds (number fields to 101310^{13}, tropical skeletons to 103110^{31}). (II) Critical law Cν∼Φ⋅(ν−1)!/ΔνC_\nu\sim\Phi\cdot(\nu-1)!/\Delta^\nu, with Δ\Delta the distance to the controlling singularity: a pole (Tate) or the natural boundary (cuspidal); Φ\Phi measures reachability (≈0.7\approx 0.7 Tate, ≈0.07\approx 0.07 cusp). (III) Diagonal main-term theorem: LL entire iff cuspidal iff no diagonal main term iff vanishing connected/remainder ratio; item (v) (never-saturating spectral form factor) is at conjecture level, the bridge closed by a companion paper's recurrence-peak criterion. (IV) Law of forgetting in six formulations, unified: forgetting = increasing Δ\Delta = rising diagonal fraction = approaching the semicircle (free) = setting η24=1\eta^{24}=1. The core dichotomy (horizontal coordinate σ=1+κ\sigma=1+\kappa universal, amplitude fingerprinted) is checked on moments. The 24 network (Δ=qη24\Delta=q\eta^{24}, Yau--Zaslow, L(11a1,1)/Ω=1/5L(11a1,1)/\Omega=1/5) and the Neron wild tables are included; everything carries a status label and a corrections register. We prove neither abc, Szpiro, RH, nor BSD.

Primarily human-written textHuman understanding: all partsCatalan numbersSato-TateTemperley-Liebarithmetic quantum chaoscentral chargeeta productmirror symmetrynatural boundary
Nov 13, 202613 pages
PDFView work

math.CO — Combinatorics

The Sharp Exponential Constant for 6-Regular Circulant Matrices

Contributed by Yair Lavi

We prove that, for every integer n≥6n\ge6 and six-element set S⊆ZnS\subseteq\mathbb Z_n, the binary circulant Cn(S)=(1{j−i∈S})i,j∈ZnC_n(S)=(1_{\{j-i\in S\}})_{i,j\in\mathbb Z_n} satisfies per⁡Cn(S)≥((3125/1296)e7/250000)n\operatorname{per}C_n(S)\ge((3125/1296)e^{7/250000})^n. For every integer d≥2d\ge2, we identify the optimal uniform base as inf⁡n≥dinf⁡∣S∣=dper⁡Cn(S)1/n=lim⁡q→∞per⁡Cqd−1({0,1,q,…,qd−2})1/qd−1\inf_{n\ge d}\inf_{|S|=d}\operatorname{per}C_n(S)^{1/n}=\lim_{q\to\infty}\operatorname{per}C_{q^{d-1}}(\{0,1,q,\ldots,q^{d-2}\})^{1/q^{d-1}}, where S⊆ZnS\subseteq\mathbb Z_n and qq runs through integers at least 22. In degree six this base is at most 1638128736631981/35163812873663198^{1/35}, while the lower bound strictly exceeds the sharp unrestricted base 3125/12963125/1296. This resolves the surviving circulant lower-bound question in Minc's Problem 10; its proposed full upper bound fails even for circulants.

Author comments: The supplement cited in the text (supplement-v7.tar.gz) is in the Zenodo record https://doi.org/10.5281/zenodo.23044484.

A mix of human-written and AI-generated textHuman understanding: all partsBinary circulantMatching entropyMatching measureMinc's Problem 10Regular bipartite graphpermanent
Nov 13, 202615 pages
PDFView work

math.CO — Combinatorics

A Conjecture on the Permanent of Positive Semidefinite Matrices

Contributed by Yair Lavi

We state the following conjecture of the author and prove it for n≤5n\leq5. Let A=(aij)A=(a_{ij}) be a complex positive semidefinite n×nn\times n matrix with n≥1n\geq1, and let χλ\chi_\lambda be an irreducible character of SnS_n of degree dλd_\lambda. For σ∈Sn\sigma\in S_n, put aσ=∏i=1nai,σ(i)a_\sigma=\prod_{i=1}^n a_{i,\sigma(i)}. The conjecture asserts that ∑σ,τ∈Snχλ(στ)aσaτ≤dλ(per⁡A)2.\sum_{\sigma,\tau\in S_n}\chi_\lambda(\sigma\tau)a_\sigma a_\tau \leq d_\lambda(\operatorname{per}A)^2. We show that Soules' permanent-on-top conjecture implies this inequality, and that it in turn implies both Lieb's immanant dominance and Chollet's permanent inequality. We also settle the previously unresolved order-four case of Soules' conjecture.

Author comments: The supplement cited in the text (exact certificates, order-four proof inputs and checking programs; ZIP, 176.5 MB) is in the Zenodo record https://doi.org/10.5281/zenodo.22976216.

A mix of human-written and AI-generated textHuman understanding: all partsChollet conjecturePositive semidefinite matrixSchur power matriximmanantpermanent
Nov 13, 20268 pages
PDFView work

math.NT — Number Theory

A √3 growth criterion for weighted reciprocal series

Contributed by twinheterodox

We prove that ∑n≥11/(an2an+1)\sum_{n\ge1}1/(a_n^2a_{n+1}) is irrational for every strictly increasing sequence of positive integers satisfying lim sup⁡n→∞log⁡an/(3)n=∞\limsup_{n\to\infty}\log a_n/(\sqrt{3})^n=\infty. This lowers the sufficient growth base from 22 to 3\sqrt{3} in the criterion of Barreto, Kang, Kim, Kovač and Zhang (Bull. Lond. Math. Soc. 58 (2026), e70457, Theorem 3) for weights (2,1)(2,1). Irregular growth is allowed. The result also extends to nondecreasing sequences and positive integer numerators subject to polynomial size bounds.

Author comments: 6 pages. Includes a general criterion with positive integer numerators. Source and build instructions: https://github.com/twinheterodox/weighted-reciprocal-growth

Primarily AI-generated textHuman understanding: some partsgrowth criteriairrationalityreciprocal series
Nov 13, 20266 pages
PDFView work

math.AG — Algebraic Geometry

A proof of the Hausel–Rodriguez-Villegas conjecture

Contributed by Qiyue Tang

We prove the Hausel–Rodriguez-Villegas conjecture on the mixed Hodge polynomials of primitive-twisted GLn\mathrm{GL}_n character varieties.

Author comments: I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

Primarily AI-generated textHuman understanding: no parts
Nov 13, 202667 pages
PDFView work

math.GR — Group Theory

A proof of Brauer's k(B)k(B)-conjecture at the prime two

Contributed by Qiyue Tang

We prove that every 22-block of a finite group has at most as many ordinary irreducible characters as the order of its defect groups.

Author comments: v2(2026/11/17):Version 1 underwent approximately 45 hours of review and revision using GPT-6 Pro. The next version will document the exact prompts and review procedure. I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

Primarily AI-generated textHuman understanding: no parts
Nov 13, 2026112 pages
PDFView work

math-ph — Mathematical Physics

Global twistor sources for analytic Einstein spacetimes

Contributed by Lior Isthmus

We globalize the local analytic projective twistor correspondence for the gravitational googly problem, retaining its convergent nonlinear treatment of both gravitational chiralities. For each fixed Einstein coefficient, the correspondence identifies independently defined atlases of two analytic Čech classes of weights 22 and −6-6, structured operator sources on null monodromy presentations, and holomorphic oriented spin Einstein four-manifolds. Its inverse comparisons preserve the original source operations, Einstein scale, spin structure and complete point family, together with calibrated modules on parametrized incidence. For analytic Lorentz developments with a compact marked Cauchy surface, germs along the entire real development give the corresponding equivalence, and the maximal analytic Cauchy development determines a terminal source germ. A Nariai example admits no Hausdorff contact carrier containing the full complex skies over all points of the real development. In its product complexification and every allowed point restriction containing the entire real development, every real point sky has nonclosed saturation, so no ordinary locally finitely generated module has exactly that saturated support. These obstructions explain the use of null monodromy and parametrized incidence in the global correspondence, with compact point objects recovered by central specialization.

Author comments: v1.0.1. Bibliography metadata formatting updated; mathematical content and reference entries are unchanged. The same manuscript and computational supplement are available at https://doi.org/10.5281/zenodo.24239028 and https://github.com/lioristhmus/global-twistor-sources/releases/tag/v1.0.1.

Primarily AI-generated textHuman understanding: some partsCauchy developmentanalytic Einstein metricsgravitational googly problemmicrodifferential algebroidsnull monodromytwistor correspondence
Nov 13, 202672 pages
PDFView work

math.CO — Combinatorics

An order-eleven counterexample to triangular realization of sign matrix permanents

Contributed by Weiming Zhang

We construct an 11×1111\times11 sign matrix with permanent P=2 029 568P=2\,029\,568. An exhaustive enumeration shows that \(\lvert\per B\rvert\ne P\) for every sign matrix BB of order eleven whose entries below the diagonal are all +1+1. This gives a negative answer to a question of Ingram and Razborov.

Primarily AI-generated textHuman understanding: all parts
Nov 13, 202612 pages
PDFView work

math.NT — Number Theory

Landau's problems through ratios of LL-functions

Contributed by Haozhe Gou, Victor Wang, Max Wenqiang Xu

Very recently, Lee announced a proof of the Twin Prime Conjecture assuming the Ratios Conjecture for the Riemann zeta function. We obtain conditional asymptotic formulas with power-saving errors for each of Landau's four prime problems. Similar results may be possible for other problems in analytic number theory.

Author comments: 36 pages

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

math.RT — Representation Theory

A law of large numbers for infinitesimal characters of real reductive Lie algebras

Contributed by Andrew Salmon

We prove a law of large numbers for the infinitesimal characters of real reductive Lie algebras. Let π\pi be a unitary representation of a connected Lie group with reductive Lie algebra. For product states on the tensor powers of π\pi whose sites have uniformly bounded moments, for instance identical sites, the infinitesimal character divided by the number of sites concentrates at the spectrum of the limiting mean moment, with probabilities of deviation O(n−m)O(n^{-m}) for every mm. The generators may be unbounded and the group non-compact. For compact groups this recovers the laws of large numbers of Keyl and Werner and of Botero, Christandl and Vrana, which enter the asymptotic analysis of linear programming bounds for binary codes; spherical designs require the non-compact case. We give concrete examples arising from Howe dual pairs on bosonic Fock space.

Author comments: Comments welcome

Primarily AI-generated textHuman understanding: all parts
Nov 13, 202616 pages
PDFView work

math.NT — Number Theory

Joint marked moments and optimized zero-free half-planes for unitary Hecke L-functions

Contributed by Baiying Liu

In this paper, we improve the uniform zero-free bound for the Quasi-Riemann Hypothesis and obtain the half-plane LK (s,ω) ̸= 0 (Re s>B∗ = 0.8733458561067185768...) for every continuous unitary Hecke character ω over every number field K, with the possible norm-character pole permitted. We prove joint moment estimates for inverse and ordinary character sums and apply them to zero detection and the averaged Mellin numerator. The proof uses the earlier number-field theta and moment theorems and the unitary estimates of Hu and Gao. The same half-plane holds for finite-dimensional continuous unitary Weil representations, with pole orders equal to the multiplicities of their norm-character constituents. We determine B∗ asanalgebraicnumberofdegreenineandastheinfimumofthespecifiedpositivecomparison, allowing unequal ordinary moments and variable comparison lengths.

A mix of human-written and AI-generated textHuman understanding: some partsRiemann Zeta Functionquasi Riemann Hypothesiszero-free half-planes
Nov 13, 202654 pages
PDFView work

math.LO — Logic

Bounded Presentations and Normalization in Arithmetic Reconstruction

Contributed by Zhenyu Sun

We study bounded presentations of selected constructions in absolute anabelian geometry and Frobenioid theory. In bounded Zermelo set theory with Choice, we prove uniform recursion for a common state space and a uniformly supplied transition rule. Under explicit index bounds, membership-table codes place the states and their histories at the same finite type level. We construct coherent comparisons for representative quotients, fiberwise full skeletons, isofibrational base changes, and countable towers, and verify the lifting properties for model Frobenioids and angular presentations. For nonzero numerical observables transforming by positive scalars, compatible normalization exists exactly when the associated character is trivial on every isotropy group. A self-equivalence of the realified arithmetic Frobenioid over Q\mathbb{Q} preserves degree and every object isomorphism class but does not lift to the unit-trivialized perfection. The structural results give a relative uniform interpretation theorem: the weak theory constructs the bounded presentations and comparison maps, and specified arithmetic recognition theorems identify the resulting structures.

Author comments: 25 pages.

A mix of human-written and AI-generated textHuman understanding: some partsFrobenioidsarithmetic reconstructionbounded recursioncategorical equivalencenormalizationweak set theory
Nov 13, 202625 pages
PDFView work

math.OA — Operator Algebras

Higher invariants of complex Hadamard matrices

Contributed by Teo Banica

Associated to any complex Hadamard matrix H∈MN(T)H\in M_N(\mathbb T) is a quantum permutation group G⊂uSN+G\subset_uS_N^+, the Hopf image of the representation associated to the magic matrix formed by the rank 1 projections Pij=Proj(Hi/Hj)P_{ij}=Proj(H_i/H_j), and its invariants ck=dim⁡(Fix(u⊗k))c_k=\dim(Fix(u^{\otimes k})) are the dimensions of the relative commutants of the subfactor associated to HH. We compute these invariants well beyond the levels k=2,3k=2,3 previously known, up to k=9k=9 in the best cases, by using Jones--Wenzl and annular decompositions. For the Di\c t\u a deformations of the Fourier matrices we compute GG for all values of the parameters, and we study the order 8 families F8,5F_{8,5}, in connection with free wreath products. For the matrices of small order with c2=2c_2=2, such as the Karlsson ones at generic parameters, we find ck=Catkc_k=Cat_k at all the levels computed. Finally, via an integrality principle and character sums, we prove that the Paley II matrices, and more generally those coming from symmetric conference matrices, have infinite depth, as well as the Paley I matrices with 11≤q<10511\leq q<10^5.

Primarily AI-generated textHuman understanding: some partsHadamard matrixQuantum permutation
Nov 13, 202658 pages
PDFView work

math.DS — Dynamical Systems

Convergence Criteria for Measure-Valued Population Dynamics with Mutation and Horizontal Transfer

Contributed by Zhenyu Sun

We study a measure-valued population equation on a compact trait space with positive baseline growth and competition, an additional mutation birth gain, and frequency-dependent horizontal transfer with an antisymmetric net kernel. We give sufficient conditions for convergence to a unique nonzero equilibrium. Separating total mass from trait frequencies yields positive mass bounds. Without mutation, maximal time-averaged fitness on the initial support tends to zero, and the endpoint measure in each joint subsequential limit is supported on the zero set of the limiting averaged fitness. Potential transfer and recipient-independent competition reduce the frequency dynamics to a normalized positive semigroup. For general transfer, a common-reference balance gives an entropy criterion allowing arbitrarily strong circulation. An adjoint-weighted entropy identity includes singular population components and the normalization correction in transfer. Mutation dissipates deviations in weighted composition, while a quadratic-form condition controls the remaining mass deviation; in finite dimensions, mutation can also compensate for negative directions of that form. A separate contraction criterion compares arbitrary trajectories using only coefficient bounds. Invariant resident laws yield invasion indices for recurrent environments. Examples exhibit bistability under complete reset mutation and periodic populations whose time averages are not equilibria. For rank-one mutation, we classify stationary frequencies, prove a critical lower bound ruling out exponential convergence from an initial point mass at a maximizer, and determine the condensate when the initial population assigns positive mass to the maximizing set.

Author comments: 46 pages, 1 table.

A mix of human-written and AI-generated textHuman understanding: all partsMeasure-valued population dynamicscondensationhorizontal gene transferinvasionmutationpositive semigroupsrelative entropy
Nov 13, 202646 pages
PDFView work

math.NT — Number Theory

Every even integer greater than 2 is a prime plus a product of at most 18 primes

Contributed by Wren Aquila

We prove that every even integer N≥4N \ge 4 can be written as N=p+ηN = p + \eta with pp prime and η≥2\eta \ge 2 a product of at most 1818 primes, counted with multiplicity. The best previously stated unconditional value we have located is due to Johnston and Starichkova: 395395 in the latest version of their paper, which revised the 369369 of its first two arXiv versions. Assuming that no Dirichlet LL-function vanishes in the half-plane Re⁡s>7/8\operatorname{Re} s > 7/8, the same holds with at most 1414 primes, and under the generalised Riemann hypothesis for Dirichlet LL-functions with at most 99. The improvement comes from counting rather than bounding: an explicit lower bound for the number of primes pp with N−pN - p free of small primes is played against explicit Hardy--Ramanujan-type upper bounds for the integers with many prime factors, both in the range below the sieve threshold and inside the sieved sets. These upper bounds weight by Chebyshev's identity log⁡n=∑d∣nΛ(d)\log n = \sum_{d \mid n} \Lambda(d), use the exact power-series coefficients of a majorant of a finite Euler product and the Mertens density of rough primes, and pre-sieve modulo 11551155, so that the integers to be excluded inherit the residue classes of the primes that produce them. All numerical steps are certified in interval or ball arithmetic, except some discrete convolutions with nonnegative terms, which are evaluated in binary64 under an explicit rounding-error bound and were also recomputed independently in ball arithmetic.

Primarily AI-generated textHuman understanding: no parts
Nov 13, 202619 pages
PDFView work

math-ph — Mathematical Physics

Algebra-Valued Yang-Mills-Type Theories: Polynomial Obstructions and Holonomy Reductions

Contributed by Yuri Ximenes Lecca, Willian Goulart Gomes Velasco

We study algebra-valued Yang-Mills-type (AA-YMT) theories over a smooth nn-manifold MM, where connections take values in a general (not necessarily associative, commutative, or Lie) m\mathfrak{m}-graded algebra (A,∗)(A, *) and descend to an associated algebra bundle EA=P×ρA→ME_A = P \times_\rho A \to M over a principal GG-bundle π:P→M\pi : P \to M. We first derive the variational field equations, infinitesimal gauge transformations, and generalized Bianchi identities, showing that affine Ehresmann compatibility forces the vertical image of g\mathfrak{g} into the Lie nucleus NLie(A)\mathcal{N}_{\mathrm{Lie}}(A) of the commutator [x,y]∗=x∗y−y∗x[x,y]_* = x*y - y*x, and proving that non-linear gauge covariance and the differential Bianchi identity are obstructed precisely by the Jacobiator Jac[⋅,⋅]∗\mathrm{Jac}_{[\cdot,\cdot]_*} (leaving principal GG-gauge transformations universally anomaly-free). We then establish polynomial and geometric obstructions in three settings. First, we prove a vanishing theorem for internal-product Chern-Weil and self-dual AA-YMT functionals in weak (2,s)(2,s)-solvable algebras, invariant under (Q,S)(Q,S)-splitting extensions. Second, in reductive Cartan-Yang-Mills theories valued in A=Rk⊕hA = \mathbb{R}^k \oplus \mathfrak{h}, we compare quartic-block against recursive binary-tree parenthesization, proving a strict dimensional cutoff at n≥8n \ge 8 for quartic blocks and an exact Jacobsthal-number cutoff (n−4∉⋃r≥3{2Jr,Jr+1}n - 4 \notin \bigcup_{r \ge 3}\{2 J_r, J_{r+1}\}, plus coframe-rank vanishing for n≥k+5n \ge k + 5) for binary trees. We also catalog the admissible Berger holonomy reductions for 4≤n≤74 \le n \le 7, establishing an on-shell vanishing (torsion-free) versus off-shell survival (torsionful) dichotomy both in 4D for U(2)U(2) and SU(2)SU(2) connections---via e⋏⋊(e⋏⋊Ωω)=12(e⋏⋊e)⋏⋊Ωωe \curlywedge_\rtimes (e \curlywedge_\rtimes \Omega_\omega) = \frac{1}{2}(e \curlywedge_\rtimes e) \curlywedge_\rtimes \Omega_\omega and the first Bianchi identity---and in 7D for G2G_2-connections. Third, we prove an associator-quotient collapse and Jacobiator vertex-dichotomy theorem for odd-dimensional internal AA-Chern-Simons theories, with applications to AA-BFBF theories, octonionic and reductive Yang-Mills-Higgs Proca mass spectra, and reductive dualities.

Primarily human-written textHuman understanding: all parts$(k,s)$-solvable graded algebrasAlgebra-valued differential formsAssociated algebra bundlesBerger holonomy reductionsChern-Simons and Yang-Mills-Higgs theoriesJacobiator and associator anomaliesYang-Mills-type functionals
Nov 13, 202630 pages
PDFView work

math.RT — Representation Theory

Class-two Lie algebras and quadratic-dual current constructions

Contributed by Ammar Husain

For a reductive Lie algebra $\s$, a finite-dimensional $\s$-module RR and an $\s$-submodule K⊆⋀2RK\subseteq\bigwedge^2R, the class-two radical R⊕(⋀2R/K)R\oplus(\bigwedge^2R/K) carries an $\s$-action. For semisimple $\s$ the semidirect products $\s\ltimes(R\oplus(\bigwedge^2R/K))$ are, up to isomorphism, all Lie algebras whose radical has class at most two. We study the isomorphisms that fix the acting algebra pointwise, including their central mixing and shear terms. On the locus where central mixing vanishes, the resulting groupoid admits a description by invariant Grassmannians and equivariant linear groups. We express the wild matrix-pair construction as a functor into class-two Lie algebras and give its equivariant square in $\s$-modules. We work out single-isotypic slices, signed multiplicity-free tensor squares, and explicit low-dimensional multiplicity-space examples. The acting algebra may be zero and its central action need not be semisimple. Finally, we study pairs of Lie brackets on one object whose mixed composites vanish. Tensoring them with algebras carrying two independent commutative associative products, for instance pointwise multiplication and convolution exchanged by Fourier transform, produces further Lie algebras. For these pairs, in representations of $\s$, we define the groupoid of objects that are isomorphic to their bracket exchange σX\sigma X; we give the structure of the switches X→σXX\to\sigma X, the obstruction to an involutive switch, and its indecomposable objects in small dimension for semisimple $\s$.

Author comments: The choices of structures are on the author. So them being maximally unhelpful is due to them. The structures can be too weak or too strong to be of any use and that is retained as the author's responsibility.

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

math.NT — Number Theory

Verification of the Markov Uniqueness Conjecture for the First One Trillion Markov Values: Meridians on the Markov Surface and Farey Addresses

Contributed by Elleard Felix Webster Heffern

The Markov unicity problem asks whether the largest entry of a positive integer solution determines the other two. We organize the triples into families called Meridians, with compact addresses and explicit evaluation rules. The construction starts with catenary profiles: a fixed host sets the curve, and two heights one unit apart solve the Markov equation with that host. Selected positions give integer triples. Reversing geometric descent gives an exact indexing of these triples. Remainder patterns, growth bounds, corridor paths, and Fibonacci-matrix and snake-graph arguments then restrict possible collisions. The Meridian description of starting scales and logarithmic spacing guided the organization of a large verification into magnitude bands. The implementation uses Farey addresses and certified matrix bounds to select each band; its correctness does not require the Meridian collision theorems. Production finished on 10 November 2026 at 03:54:13 UTC (9 November, 21:54:13 CST). The combined computation compared 1,101,388,071,945 configurations and certified uniqueness of the first one trillion Markov values in numerical order. The trillionth value has 1,021,609 decimal digits. All 12 repeated 64-bit residue groups were resolved by exact arithmetic, with no equal maxima. On eight workers, retained active band processing took 23 h 57 min 23.146 s, including the inherited 500-billion certificate; the maximum recorded temporary key-file footprint was 1,065,664,392 bytes (0.992 GiB). This elapsed processing time is distinct from summed CPU time and the calendar span. Both final replays passed. A separate computer-checked certificate covers all 5,067,077 Meridians of degree at most 10,000, at every integer phase. The general unicity problem remains open.

Author comments: Version 22 (12 November 2026), 44 pages: revised title and abstract, including the 1,021,609-digit trillionth value; added Arthur Baragar's 1996 benchmark (M < 10^140). The proofs, figures and verification evidence are unchanged. Chronology (distinct announcements and deposits): 21 October 2026, 15:18:25 UTC: X announcement of an earlier search exceeding one billion values: https://x.com/webystar/status/2112926487091282350 23 October 2026, 14:54:57.771 UTC: LinkedIn announcement of the earlier 9.3-billion search in 24 minutes: https://www.linkedin.com/posts/elleard-felix-webster-heffern-joseph-by-confirmation-2953a3104_markovnumbers-activity-7519411048115003392-4NaJ 2 November 2026: 50-billion verification and degree-10,000 computational supplements: https://zenodo.org/records/23874075 9 November 2026: selected full decimal expansions first deposited: https://zenodo.org/records/24093257 10 November 2026: v21 trillion-verification deposit (publication-date field: 9 November): https://zenodo.org/records/24096109 12 November 2026: corrected v22 manuscript; Zenodo DOI reserved (deposit pending): https://doi.org/10.5281/zenodo.24167894 12 November 2026: ResearchGate full-text mirroring began: https://www.researchgate.net/publication/417066856_Meridians_on_the_Markov_Surface_Growth_Structure_and_Verification_of_One_Trillion_Markov_Values_Using_Farey_Addresses The earlier X and LinkedIn announcements are not announcements of the trillion result. The source releases preserve the original verification timestamps and separate software licenses. The general unicity conjecture remains open.

A mix of human-written and AI-generated textHuman understanding: all partsFarey fractionsFrobenius conjectureMarkoff numbersMarkov numbersMarkov treeMarkov uniqueness conjectureMeridianscertified computationcomputational number theorysnake graphs
Nov 13, 202644 pages
PDFView work

math.NT — Number Theory

Cross-Energy of Dirichlet Partial Sums. Part 33: Optimised mollifiers and the bound Λ≤0.174\Lambda\le0.174 for the de Bruijn--Newman constant

Contributed by Pedro Caceres

The Polymath project reduced upper bounds for the de Bruijn--Newman constant Λ\Lambda to three verifiable hypotheses: the Riemann hypothesis up to height X/2X/2, a zero-free region for Ht0H_{t_0} to the right of XX, and a barrier at XX. With the verification of the Riemann hypothesis up to 3⋅10123\cdot10^{12} by Platt and Trudgian, this gave Λ≤0.2\Lambda\le0.2. The bottleneck is the zero-free region, which Polymath established with Euler-product mollifiers. We replace the Euler product by a mollifier ∑d≤Dλdd−s∗\sum_{d\le D}\lambda_d d^{-s_*} whose weights are chosen by solving an ℓ1\ell^1-regression problem, so that any choice of weights still yields a valid lower bound. At the same height X≈6⋅1012X\approx6\cdot10^{12} and t0=0.155t_0=0.155, y0=0.2y_0=0.2, the lower bound for the mollified sum improves from −0.12-0.12 (our Lemma~\ref{lem:moll} evaluated with the Euler mollifier on the primes up to 1313) to +0.05+0.05 with D=120D=120; with D=240D=240 it is still +0.04+0.04 at t0=0.154t_0=0.154. We cover all x≥Xx\ge X by a short chunking argument together with a tail estimate, verify the barrier with Polymath's Taylor scheme, and obtain \[ \Lambda\le 0.174 . \] The certificates are computer-assisted. They use Arb ball arithmetic for all transcendental functions and outward-rounded floating-point arithmetic for the large sums. The code, the weights and the logs are included, and the certificate was reproduced on a second platform. We also report that at this height the weights we found with D=240D=240 do not reach 0.1730.173, and we compare with Polymath's table of conditional results. We do not prove the Riemann hypothesis.

Author comments: Revised 10 Nov 2026 after external examination (see CHANGES_v2.md). 20 pages, 3 figures. The ancillary scripts are those of the original part (ancillary zip in the part folder). Part 33 of the book-series Cross-Energy of Dirichlet Partial Sums (47 parts, Parts 0-46); formerly Part 13. Renumbered 2 Nov 2026; mathematics unchanged. The paper states once, in its discussion, that it does not prove the Riemann hypothesis.

A mix of human-written and AI-generated textHuman understanding: all partsArb interval arithmeticRiemann xi-functioncomputer-assisted proofde Bruijn-Newman constantheat flowmollifier
Nov 13, 202620 pages
PDFView work

math.AG — Algebraic Geometry

The Shapiro–Shapiro conjecture for ordered positive flags

Contributed by Qiyue Tang

We prove the Shapiro–Shapiro conjecture for ordered totally positive flags in Grassmannians.

Author comments: I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

Primarily AI-generated textHuman understanding: no parts
Nov 13, 202615 pages
PDFView work

math.RT — Representation Theory

A proof of the scheme-theoretic Humphreys conjectures

Contributed by Qiyue Tang

We prove the relative and traditional scheme-theoretic Humphreys conjectures for connected reductive groups over algebraically closed fields of positive characteristic exceeding the Coxeter number of every simple factor. We also prove that the self-extension support scheme of every finite-dimensional tilting module is reduced.

Author comments: I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

Primarily AI-generated textHuman understanding: no parts
Nov 13, 202623 pages
PDFView work

math.PR — Probability

The Wasserstein cost of the Girsanov Theorem

Contributed by Simon Coste

This is an expository note on the asymptotics of the Wasserstein distance between the empirical measure of infinite-dimensional random paths and their common distribution. We present the classical proof for these asymptotics in the case of the Wiener measure, unifying quantization arguments from Dereich and coauthors or Boissard and Le Gouic, and we adapt it for It\^o diffusions sampled through the Girsanov theorem. More precisely, let Q\mathbb{Q} be the law of the solution of a stochastic differential equation with a bounded Lipschitz drift. Let W1,…,WnW_1,\ldots,W_n be independent Brownian paths, and let ZiZ_i be their Girsanov weights for Q\mathbb{Q}. The reweighted empirical measure $$\widehat\mu_n=\frac{\sum_{i=1}^n Z_i\delta_{W_i}}{\sum_{i=1}^n Z_i}$$ approximates Q\mathbb{Q} when nn is large. We prove that the Wasserstein cost Wpp(μ^n,Q)W_p^p(\widehat\mu_n,\mathbb{Q}) is of order (log⁡n)−p/2(\log n)^{-p/2}, in expectation and almost surely, for every fixed p⩾1p\geqslant1. In the Brownian case where Zi=1Z_i=1 these results show that log⁡nWp(μ^n,Q)\sqrt{\log n}W_p(\widehat\mu_n,\mathbb{Q}) is asymptotically sandwiched between 2λd\sqrt{2\lambda_d} and 42λd4\sqrt{2\lambda_d}, where λd\lambda_d is the first eigenvalue of the Laplacian operator in the unit ball. We provide numerical experiments to estimate the (conjectured) limiting constant in dimension d=1d=1.

Author comments: 16 pages. Full Lean formalization publicly available at gitlab.com/SimonCoste/wasserstein

Primarily human-written textHuman understanding: all parts
Nov 12, 202616 pages
PDFView work

math.RT — Representation Theory

Domino insertion and cells in type B

Contributed by Qiyue Tang

We prove Conjectures A, A+^{+}, and B of Bonnafé, Geck, Iancu, and Lam on Kazhdan–Lusztig cells in type BB.

Author comments: I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

Primarily AI-generated textHuman understanding: no parts
Nov 12, 202614 pages
PDFView work

math.PR — Probability

Causal prediction of rare recovery responses and the optimal scale of observation time

Contributed by Man Huang

We determine the information and physical waiting needed to predict a rare intervention response with error smaller than its occurrence probability in a one-dimensional growth process with renewed Poisson interval catastrophes. Deletions of initial sources in macroscopic intervals define a mixed response, with all intervention arms sharing the same stationary past and future forcing. A fixed number of growing submacroscopic gaps determines its rare-event probability scale. We identify the response probability and amplitude, characterize when terminal extinction bits lose predictive information, and construct a gate that recovers this information from the recovery trajectory. For absolute and squared loss, a deterministic-age Bayes-risk expansion holds uniformly with additive error smaller than the rare-event probability. Our main waiting theorem covers every honest causal stopping rule, allowing the complete realized catastrophe history. Its average-time benchmark is the sum of each ordered gap length weighted by the extinction probabilities of preceding gaps. Prediction error smaller than the rare-event probability requires mean waiting divided by this benchmark to diverge; every prescribed diverging multiplier is achievable using actual recovery records. With gap scales n2/5n^{2/5} and n4/5n^{4/5} and integrated catastrophe tail Ax∼C/xA_x\sim C/x, deterministic observation requires age larger than the n4/5n^{4/5} scale, whereas a stopping rule achieves mean waiting O(n2/5log⁡n)O(n^{2/5}\log n). The proofs preserve the rare-event scale through weighted response approximation, risk transfer over arbitrary information fields, and posterior lower bounds on rare history branches.

Author comments: Complete English manuscript with Technical Supplement Appendices A–E. Full English–Chinese edition, sources and original MIT-licensed diagnostic code: https://doi.org/10.5281/zenodo.24138927. Mathematical content version 2026-11-11.2. Companion preprints: https://doi.org/10.5281/zenodo.23911961 and https://doi.org/10.5281/zenodo.23912425.

Primarily AI-generated textHuman understanding: some partscausal predictioninteracting particle systemsrare eventssequential observationspatial catastrophesstopping times
Nov 12, 202641 pages
PDFView work

math.AG — Algebraic Geometry

Stability conditions on twisted derived categories I: Existence and full numerical support

Contributed by Zhirui Li

We prove that for every nonempty smooth projective variety XX over an arbitrary field and every Brauer class α\alpha, the twisted derived category Db(X,α)\mathrm{D}^b(X,\alpha) admits a Bridgeland stability condition with full numerical support. Based on Chunyi Li's construction and its extension to arbitrary fields, we establish uniform phase control under tensoring by an Azumaya algebra and calibrate the resulting slicing to the induced central charge. We further show that the constructed stability condition is geometric and satisfies a mass-Hom bound, which persists throughout its connected component.

Author comments: 26 pages. Comments and suggestions are welcome.

Primarily human-written textHuman understanding: all partsBridgeland stability conditions; twisted derived categories
Nov 12, 202626 pages
PDFView work

math.NT — Number Theory

Automorphic realization of Langlands parameters for split groups over global function fields, III. Classical groups

Contributed by Boyang Hu

Let GG be a split semisimple group whose simple factors are of classical type, over a global function field FF of arbitrary positive characteristic. We prove that every semisimple elliptic Langlands parameter ΓF→G^(Q‾ℓ)\Gamma_F\to\widehat G(\overline{\mathbb Q}_\ell) is the parameter of a cusp form on GG, in the sense of V. Lafforgue's excursion operators; we call such a form an automorphic realization of the parameter. Neither FF nor its field of constants is extended. We start from L. Lafforgue's theorem for general linear groups and use automorphic descent and the theta correspondence. The work is to prove that the descent does not vanish over FF, to carry out the computations with root subgroups in small characteristic, in particular in characteristic two, and to identify the parameter itself and not only its unramified Hecke eigenvalues. This is the third of three papers. Together with the first, which contains the arithmetic foundations, and the second, which treats the exceptional types by a geometric method, it gives automorphic realizations of semisimple parameters on all split reductive groups, with a restriction on the characteristic for the exceptional types only.

Author comments: Part III of a series of three papers; Parts I (Arithmetic foundations and the main theorems) and II (The geometric construction) are deposited separately. The folder anc/ contains the Python programs described in the appendix on computer checks.

Primarily AI-generated textHuman understanding: some partsEisenstein seriesLanglands parametersautomorphic descentcharacteristic twofunction fieldstheta correspondence
Nov 12, 202668 pages
PDFView work

math.MG — Metric Geometry

Fixed points of the polar projection body operator and its square

Contributed by Sihan Chen

Let TK=(ΠK)∘TK=(\Pi K)^\circ be the polar projection body of a convex body KK in Rn\R^n. In dimension n≥3n\ge3, we prove that TKTK is a positive dilate of KK exactly when KK is an origin-centred ellipsoid, settling Petty's polar projection conjecture. The same classification holds under the weaker assumption that T2KT^2K is a positive dilate of KK. The proof uses a distributional Laplacian identity to compare two integrals of central section volumes. Equality supplies contractive hyperplane projections with every kernel direction, and James's theorem gives ellipsoidal rigidity. The argument applies to arbitrary convex bodies and yields the translative constant volume conjecture of Horv\'ath and L\'angi.

Primarily AI-generated textHuman understanding: some partsFixed and Periodic PointsPetty’s Polar Projection ProblemPolar Projection Bodies
Nov 12, 20265 pages
PDFView work

math.CT — Category Theory

Isomorphism Loci and Coherence in Equivalence Extension

Contributed by Zhenyu Sun

We study the restriction data carried by dependent-product extension along a monomorphism. In a locally cartesian closed category, the extended map is an isomorphism after a change of base if and only if the input map is an isomorphism on the restricted base. In a topos, its isomorphism locus is therefore the universal quantification of the input locus. A terminal characterization gives coherent comparisons for base change and successive extension, together with formulas for intersections and unions. Under explicit homotopical, cartesian, and universe hypotheses, this construction gives equivalence extension and preserves the boundary identifications used to prove fibrancy of a universe. Graph comparisons and strict fillers of a fixed universe boundary are represented by trivially fibrant objects. A single realignment over the comparison object induces a weak equivalence between these parameter objects, and both admit extensions of every finite cubical boundary. A finite-groupoid example shows that graph comparisons cannot be selected naturally under all isomorphisms of unstructured input.

Primarily human-written textHuman understanding: all partsBeck–Chevalleydependent productequivalence extensionfibrant universeisomorphism locusrealignment
Nov 12, 202624 pages
PDFView work

math.NT — Number Theory

Automorphic realization of Langlands parameters for split groups over global function fields, II. The geometric construction

Contributed by Boyang Hu

Let GG be a split simply connected semisimple group over a global function field FF whose characteristic does not divide the order of the Weyl group of GG. We prove that every semisimple elliptic Langlands parameter ΓF→G^(Q‾ℓ)\Gamma_F\to\widehat G(\overline{\mathbb Q}_\ell) is the parameter of a cusp form on GG, in the sense of V. Lafforgue's excursion operators; we call such a form an automorphic realization of the parameter. The parameter may be ramified at finitely many places and may have finite monodromy, and neither FF nor its field of constants is extended. The starting point is the geometric Langlands correspondence in characteristic zero. It provides a sheaf, and the function which the trace of Frobenius attaches to a nonzero sheaf can vanish identically. The main point of the construction is to arrange that the trace in question is a determinant det⁡(1−ϕ)\det(1-\phi) with no zero factor, and that it stays nonzero under specialization to the given field. This is the second of three papers. Together with the first, which contains the arithmetic foundations, and the third, which treats classical groups in every characteristic, it gives automorphic realizations of semisimple parameters on all split reductive groups, with a restriction on the characteristic for the exceptional types only.

Author comments: Part II of a series of three papers; Parts I (Arithmetic foundations and the main theorems) and III (Classical groups) are deposited separately. The folder anc/ contains the Python programs described in the appendix on computer checks.

Primarily AI-generated textHuman understanding: some partsHecke eigensheavesLanglands parametersexcursion operatorsfunction fieldsgeometric Langlands correspondencenearby cycles
Nov 12, 202693 pages
PDFView work

math.NT — Number Theory

Automorphic realization of Langlands parameters for split groups over global function fields, I. Arithmetic foundations and the main theorems

Contributed by Boyang Hu

Let GG be a split connected reductive group over a global function field FF. V. Lafforgue decomposed the space of cusp forms on GG according to semisimple Langlands parameters. This is the first of three papers which prove a converse: every semisimple elliptic parameter is the parameter of a cusp form on GG over FF itself, which we call an automorphic realization of the parameter. This holds in every positive characteristic for classical groups, in characteristic greater than 33 for G2G_2 and F4F_4, greater than 55 for E6E_6, and greater than 77 for E7E_7 and E8E_8. A parameter that is not elliptic is the parameter of an automorphic form which is not cuspidal, under the bound for the smallest Levi subgroup through which the parameter factors. The form has the prescribed eigenvalue for every excursion operator, and we determine for which lattices in the centre it can be taken invariant. The present paper contains the arithmetic part of the proof. It defines excursion operators on functions that are not assumed cuspidal, proves their compatibility with constant terms, shows that a function on which they act through an elliptic parameter is a cusp form, and passes from simply connected groups to isogenous groups and from Levi subgroups to the group. This reduces the theorems to the existence of a cusp form with a given elliptic parameter on a simply connected simple group. That is proved in the second paper by a geometric method, when the characteristic does not divide the order of the Weyl group, and in the third paper for classical groups, by descent from general linear groups.

Author comments: Part I of a series of three papers; Parts II (The geometric construction) and III (Classical groups) are deposited separately. The theorems of this part depend on the two existence theorems proved in Parts II and III.

Primarily AI-generated textHuman understanding: some partsLanglands parametersconstant termscusp formsexcursion operatorsfunction fieldsshtukas
Nov 12, 202670 pages
PDFView work

math.DS — Dynamical Systems

Limit Cycles under Concave Per-Capita Growth

Contributed by Zhenyu Sun

We study predator--prey systems with a fixed globally linear functional response and a strictly concave prey per-capita growth rate. For every N≥1N\ge1 and K≥2K\ge2, we construct a growth polynomial of degree 2N+2⌈K/2⌉+22N+2\lceil K/2\rceil+2 with exactly NN positive periodic orbits, all hyperbolic. The construction retains a chosen center KK-jet and the low-density growth rate and carrying capacity of its limiting profile, subject to an explicit relation between the center height and curvature. A limiting Lyapunov function and return-map estimates at three amplitude scales exclude additional cycles. A dissipative extension gives exact global counts with prescribed limiting center energies. We also prove that profiles with at least NN hyperbolic cycles are C2C^2-dense in the admissible class, while preserving the entire germ at the maximum and both ecological endpoint values. The first nonzero canonical odd term determines the sharp differentiability threshold. Further results give parity restrictions for fixed focus jets, degree lower bounds, quantitative polynomial approximation under concavity and interpolation constraints, and amplitude and multiplicity interpolation by Abelian integrals. Finally, a single smooth strictly concave profile has infinitely many nested hyperbolic cycles converging to coexistence.

Author comments: 45 pages, 3 figures. Symbolic and numerical verification scripts and data are included in anc/.

A mix of human-written and AI-generated textHuman understanding: some partsAbelian integralsdifferentiabilityfinite jetslimit cyclespolynomial degreepredator-prey systemstrict concavity
Nov 12, 202645 pages
PDFView work

math.OC — Optimization and Control

Quadratic Strictly Positive Real Factors of Stable Transfer Functions

Contributed by Jinlin Wang, Zhenyu Sun

We characterize factorizations G=G0∘HG=G_0\circ H in which GG and G0G_0 are stable, minimum-phase, biproper real-rational functions with simple poles and zeros and positive gains at infinity, and HH is a quadratic strictly positive real function. Classical rational decomposition identifies the quadratic right-factor classes with real Möbius involutions fixing GG. Within each class, we parameterize all normalized representatives and eliminate the scaling parameter and the frequency variable. The resulting sign conditions involve univariate polynomials of degree at most four. They determine all feasible denominator intervals and all factorizations in the class; for real-algebraic input, they give an exact decision procedure. We also give a scaling that maximizes the smaller of the inner positive-real margin and the outer spectral margin for a fixed denominator. For quadratic input, existence is equivalent to strict positive realness of GG and to an explicit coefficient inequality. Examples exhibit a disconnected feasible parameter set, separate algebraic and analytic obstructions, and a quartic input with exactly three admissible classes.

Primarily human-written textHuman understanding: all partsHurwitz polynomialsMöbius involutionsRational decompositionstrictly positive real functionstransfer function substitution
Nov 12, 202618 pages
PDFView work

math.CA — Classical Analysis and ODEs

Certified lower bounds for the first and the signed third autocorrelation constants

Contributed by Tejasvi Singh Tomar

Let C1C_1 be the largest constant such that sup⁡∣t∣≤1/2∫f(t−x)f(x) dx≥C1(∫−1/41/4f)2\sup_{|t|\le 1/2}\int f(t-x)f(x)\,dx\ge C_1\bigl(\int_{-1/4}^{1/4}f\bigr)^2 for every nonnegative function ff on the real line. We prove C1≥1.337C_1\ge 1.337, improving the bound 1.29371.2937 of Kim and Pilanci, by a spatial branch-and-bound over the masses of ff on equal bins. Consequently, for every large gg, every gg-Sidon set in {1,…,N}\{1,\dots,N\} has fewer than 1.2231gN1.2231\sqrt{gN} elements once NN is large enough in terms of gg. For real-valued ff supported in [−1/4,1/4][-1/4,1/4], let C3C_3 and C3′C_3' be the analogous constants for the essential suprema of ∣f∗f∣|f*f| and of f∗ff*f; no lower bound better than the trivial bound 11 was recorded for them. We prove C3≥C3′≥4/3C_3\ge C_3'\ge 4/3 with the argument principle. Both proofs are computer-assisted, and both theorems are also proved in Lean 4.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23715655

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

cs.LO — Logic in Computer Science

A formal proof in Lean of the finiteness of planar five-body central configurations for all positive masses

Contributed by Tejasvi Singh Tomar

Smale's sixth problem asks whether, for every choice of positive masses, there are finitely many central configurations up to similarity. For five bodies in the plane, Albouy and Kaloshin proved finiteness outside a set of masses of codimension two. In a companion paper the author proved finiteness for every choice of five positive masses by their method, adding steps that cannot be checked by hand: exact computer algebra, rational certificates and a branch and bound. We formalize this theorem in Lean 4 with Mathlib without assuming the results of Albouy and Kaloshin that the informal proof uses. Instead we prove what the proof needs of their rules on limit diagrams, of their classification of these diagrams and of their mass conditions. We do so at places of complex algebraic curves, taken as valuations of the function field rather than points of a projective model. Almost every computation becomes data for a checker that we write in Lean, prove sound with respect to Mathlib's real and complex numbers, and run in the kernel (proof by reflection). The main theorem depends on about 680,000680{,}000 theorems proved in this way, and Mathlib's tactics prove the few other computations. The proof uses only Lean's three standard axioms, and two independent Lean kernels, nanoda and lean4lean, accept it.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23723139

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