Browse

All works

Browse the Hexagon catalog.

Newest works

1229 works

math.NT — Number Theory

Modularity of the factors of an automorphic tensor product

Contributed by Luis Dieulefait

Let FF be a totally real field and let ρ1,ρ2\rho_1,\rho_2 be two-dimensional pp-adic representations of GFG_F which are Lie-irreducible and potentially modular, each over its own extension. We prove the following: if ρ1⊗ρ2\rho_1\otimes\rho_2 is attached to a regular L-algebraic cuspidal automorphic representation Π\Pi of $\GL_4(\A_F)$, then ρ1\rho_1 and ρ2\rho_2 are modular and Π≃π1⊠π2\Pi\simeq\pi_1\boxtimes\pi_2. This is a converse to Ramakrishnan's automorphy of the Rankin--Selberg product. The proof combines the descent of Hundley--Sayag from $\GL_4$ to $\GSpin_4$ with LL-function arguments based on potential modularity. To pin down the weights of the factors we use the Galois representations attached to the adjoint lifts $\ad\pi_i'$ on $\GL_3$; this rules out factors of mixed parity.

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

math.NT — Number Theory

Complete modulus locking in the exceptional set of the abc conjecture

Contributed by Zeng Chunping

Let Nλ(X)N_\lambda(X) count primitive positive triples a+b=c≤Xa+b=c\le X with rad(abc)<cλ\mathrm{rad}(abc)<c^\lambda. We prove, using inherited anatomic estimates and a new finite exact-rational implication, that Nλ(X)≪λ,εXU+εN_\lambda(X)\ll_{\lambda,\varepsilon}X^{U+\varepsilon} for 0<λ≤10<\lambda\le1, where U=1168000720000012<73125=0.584U=\frac{11680007}{20000012}<\frac{73}{125}=0.584. The new arithmetic-computational step exhausts all third-letter whole-value modulus sets: index 11 is eliminated by a one-Lipschitz argument, leaving 3232 subsets of {2,3,4,5,6}\{2,3,4,5,6\}, and grouped power-difference bounds are used in every fixed degree 2≤e≤62\le e\le6. A branch-and-bound tree with 65,57665{,}576 leaves is verified by an independent standard-library checker which reconstructs every inequality and checks every rational multiplier; floating-point linear programming is used only to discover the tree. We also prove that the enlargement is mathematically essential: an explicit rational point feasible for the old modulus family has D=403/690D=403/690, whereas FullOC gives the collision bound 53/9253/92 at the same point, and a second explicit point gives 7/12≤DFullOC∗7/12\le D^*_{\mathrm{FullOC}}. These are statements about exponent programs, not lower bounds for abc triples. No assertion of abc, Szpiro, finiteness of the exceptional set, or an Arakelov degeneration functor is made.

Author comments: First version. Computer-assisted theorem with exact rational certificates (65,576 leaves); the certificate tree and verification scripts are archived on Zenodo (DOI: 10.5281/zenodo.24354214). The abstract-level statement is verified by an independent standard-library checker; floating-point LP is used only to discover the tree.

A mix of human-written and AI-generated textHuman understanding: all partsabc conjecture; exceptional set; radical; collision inequality
Nov 19, 202617 pages
PDFView work

math-ph — Mathematical Physics

On sequential ideal measurements in the exceptional Jordan algebra

Contributed by Robert R. MacGregor

Real, complex and quaternionic quantum theory have one exceptional relative, the Albert algebra H3(O)H_3(\mathbb O), which single-system reconstructions leave standing. Sequences of measurements on a single system can still tell it apart, provided the measurements are ideal. A yes–no test is ideal if it disturbs the state no more than its answer requires, as under the projection postulate. Ideal tests of finitely many pure states of H3(O)H_3(\mathbb O) are then matched by ideal measurements on a real, complex or quaternionic Hilbert space of any dimension exactly when those states fail to generate the algebra. When they generate it, an ideal Hilbert-space model matching every sequence from even one starting state would yield a faithful representation of the algebra and its Jordan product by operators, which Albert ruled out in 1934. Three states never generate it; whether four do is decided by one number, proportional to a squared octonion associator. Even when four do, the difference is slow to show: from the maximally mixed state, a random choice between two quaternionic qutrits matches every sequence of up to six outcomes, and only at seven is every Hilbert-space model excluded. If the tests need not be ideal, then for any finite set of tests a finite-dimensional quantum device with sharp answers matches every sequence, of any length.

Author comments: 132 pages. The LaTeX source of the companion paper, Finite certificates for sequential measurements in the exceptional Jordan algebra (56 pages), is in the source archive at companion/macgregor-finite-certificates.tex.

Primarily AI-generated textHuman understanding: no partsAlbert algebraLeanexceptional Jordan algebraoctonionsprojection postulatequantum foundationssequential measurements
Nov 19, 2026132 pages
PDFView work

cs.CC — Computational Complexity

Circle configurations and the hardness of promise graph and hypergraph coloring

Contributed by Yuwen Zhou

In 2017 Brakensiek and Guruswami conjectured that promise graph homomorphism is NP-hard for every non-bipartite source and loopless target admitting a homomorphism from the source. At CCC 2016 they conjectured hardness of properly coloring a uniform hypergraph promised a strong coloring with one more color than its uniformity. We prove both conjectures by a configuration theorem on the circle. For any fixed finite configuration of distinct rational phases, the theorem gives a reduction whose satisfiable instances place every edge near a translate of the configuration and whose unsatisfiable instances have arbitrarily small independence ratio. An antipodal pair gives hardness for every odd cycle against every fixed clique of size at least three. A regular hh-gon gives a strong (h+1)(h+1)-coloring and a rainbow (h−1)(h-1)-coloring of the same instance. A circle coloring built from single-coordinate changes gives hardness of PCSP(R,NAEh(d))\mathrm{PCSP}(R,\mathrm{NAE}_h^{(d)}) for every nonempty symmetric reconfigurable relation RR with R→NAEh(d)R\to\mathrm{NAE}_h^{(d)}, and the monochromatic-clique dichotomy of Banakh, Barsukov, and Nakajima without the Rich 22-to-11 Conjecture. For triples we obtain hardness of linearly ordered coloring for all fixed palettes 3≤c≤d3\le c\le d. The proof subtracts an average of translated distance functions to detect an independent set, then uses conditional mean zero and a finite Ramsey alignment argument to decode a Label Cover assignment.

Primarily AI-generated textHuman understanding: some partsBrakensiek–Guruswami conjectureGraph coloringLabel Coverhardness of approximationhypergraph coloringpromise constraint satisfaction
Nov 19, 202625 pages
PDFView work

math.NT — Number Theory

A Chebyshev bound for the constant in the Prouhet-Tarry-Escott problem

Contributed by David Niedbala Giraudin

Let (A,B) be an ideal solution of size n of the Prouhet-Tarry-Escott problem, with constant C defined by prod_i (x - a_i) - prod_i (x - b_i) = C, and let L be the diameter of A u B. We prove |C| <= 4 (L/4)^n, with equality exactly for the configuration given by the roots of T_n -/+ 1, where T_n is the Chebyshev polynomial of the first kind. Equality is attained by integer solutions for n <= 3 and, by Niven's theorem, is impossible for n >= 4; for n = 4, n = 5 and n = 6, however, we exhibit infinite families of integer solutions, governed by a Pell equation, along which the ratio 4^(n-1)|C|/L^n tends to 1, so that the constant 4^(n-1) cannot be improved. The bounds on C in the standard references are p-adic throughout: they determine which prime powers divide C, and the present inequality appears to be the first of archimedean type. Two further consequences are recorded: an unconditional lower bound for the height of any ideal solution, in terms of the known divisors of the universal constant C_n, which yields the first such statements for sizes 17 <= n <= 20, where no search has been published; and the observation that the extremal configuration is exactly the trigonometric configuration of Chen Shuwen, for which the analogous extremality statement for the individual variables is an open conjecture. The present result is its proven counterpart for the constant.

Primarily AI-generated textHuman understanding: no partsChebyshev polynomialsDiophantine equationsPell equationProuhet-Tarry-Escott problemideal solutions
Nov 19, 202610 pages
PDFView work

math.NT — Number Theory

Sums of three composite triangular numbers

Contributed by David Niedbala Giraudin

A triangular number T_k = k(k+1)/2 is composite for every k >= 3, the only non-composite ones being 0, 1 and 3. We ask which integers are sums of three composite triangular numbers, a restricted form of Gauss's Eureka theorem; equivalently, when 8n+3 is a sum of three squares none of which is 1, 9 or 25. We prove that every integer n > 194 is a sum of three composite triangular numbers, with at most three possible exceptions, all larger than 8.4*10^9. Such exceptions can occur only if Tatuzawa's form of Siegel's theorem, with eps = 1/20, has an exceptional discriminant -N*, and then only for 8n+3 in {N*, 9N*, 25N*}. Up to 8.4*10^9 the integers that are not such sums are exactly 41 explicit values, the largest being 194. Under the Generalized Riemann Hypothesis these 41 values are the complete list. The proof combines an elementary lemma, a union bound for the representations that use a forbidden square, the class number formula for sums of three squares, Tatuzawa's theorem, and explicit bounds for a divisor-type function. The analytic range begins at 8n+3 = 3.4561*10^10 and overlaps the computed range by a factor 1.944. The computed range is certified by two independent algorithms, supplied as ancillary files together with a verifier for every constant.

Primarily AI-generated textHuman understanding: no partsGauss Eureka theoremSiegel-Tatuzawa theoremclass numberscomputer-assisted proofsums of three squarestriangular numbers
Nov 19, 20267 pages
PDFView work

math.OA — Operator Algebras

Spectral measure blowup for Hadamard subfactors

Contributed by Teo Banica

We study the spectral measures of the Hadamard subfactors coming from the deformed Fourier matrices FX⊗QFYF_X\otimes_QF_Y. After preliminaries on small-index graphs and exceptional root measures, we express the law through a Gram matrix over a compact abelian group, interpret this as an abelian covering, and compute the moment growth. At index 6 the generic law comes from the honeycomb and kagome lattices, and finite cases correspond to Eisenstein ideals. Circulant families at square index give planar random walk laws. We locate the first Jacobi defect and construct finite-depth laws with arbitrarily long generic moment sequences.

Primarily AI-generated textHuman understanding: some partsHadamard subfactorspectral measure
Nov 19, 202644 pages
PDFView work

math.NT — Number Theory

Irrational values of Dirichlet series with periodic coefficients

Contributed by twinheterodox

Let ff be a nonzero rational-valued function of period DD, and write Lf(j)=∑n≥1f(n)n−jL_f(j)=\sum_{n\ge1} f(n)n^{-j}. For either prescribed parity we give an explicit lower bound of order slog⁡log⁡s/log⁡s\sqrt{s\log\log s/\log s} for the number of exponents 2≤j≤s2\le j\le s of that parity for which Lf(j)L_f(j) is irrational. The bound is uniform in ff for fixed DD. It applies, for example, to every nonzero rational projection of a quartic Dirichlet character modulo five. If ff is even or odd, at most D−1D-1 exponents j≥2j\ge2 of the matching parity give zero. The nonzero values at distinct exponents of that parity are linearly independent over the algebraic numbers.

Author comments: 11 pages. This paper extends irrationality counts for odd zeta values and even Dirichlet beta values to rational periodic coefficients. Related papers: https://arxiv.org/abs/2611.16156 and https://hexagonmath.org/2611.00600v1

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

math.NT — Number Theory

The alternating sum of reciprocal Fibonacci cubes is irrational

Contributed by twinheterodox

We prove that the alternating sum of the reciprocal cubes of the Fibonacci numbers is irrational. The result extends to the Lucas sequences of the first kind associated with real quadratic units greater than one, including the Pell numbers. For every such sequence and every fixed positive integer kk, the reciprocal cubes with indices k,2k,3k,…k,2k,3k,\ldots, taken with signs +,−,+,…+,-,+,\ldots, also have an irrational sum.

Author comments: 8 pages. Extends the ordinary Lucas reciprocal-cube theorem of Hexagon:2611.00491v1 to alternating signs and fixed strides. The source archive includes the independent exact and numerical check programs.

Primarily AI-generated textHuman understanding: some partsFibonacci numbersHankel determinantsLucas sequencesirrationality
Nov 19, 20268 pages
PDFView work

math.CO — Combinatorics

Counterexamples to coefficient conjectures for plane Penrose polynomials

Contributed by Yair Lavi

We give counterexamples to coefficient-sign alternation and coefficient nonvanishing for the plane Penrose polynomial PH(q)=∑A⊆E(H)(−1)∣A∣qcH(A)P_H(q)=\sum_{A\subseteq E(H)}(-1)^{|A|}q^{c_H(A)}. Here HH is a graph embedded in the sphere, and cH(A)c_H(A) counts boundary components after replacing vertices by disks and edges by bands and half-twisting the bands in AA. Weak alternation means that coefficients, read in descending powers from a positive leading coefficient, are alternately nonnegative and nonpositive. We construct a simple bridgeless plane graph on ten vertices whose Penrose polynomial is monic of degree eight and has linear coefficient 160160, contrary to weak alternation. A bridgeless plane multigraph on eleven vertices has zero linear coefficient. We also give a simple bridgeless cubic example on twelve vertices, where cubic means that every vertex has degree three; its linear and quadratic coefficients both have the wrong signs. These examples answer Aigner's questions on coefficient nonvanishing and sign alternation negatively. Replacing each degree-kk vertex of the first two examples by a kk-cycle, with the incident edges attached in their embedding order, gives counterexamples to both coefficient conjectures of Kauffman, Silver and Williams. A known triangle-replacement identity gives infinite families, and connected sums give arbitrarily many vanishing initial coefficients for the Penrose–Kauffman polynomial. The cycle matroid of the ten-vertex example is an explicit planar minor-minimal obstruction to coefficient alternation, answering Aigner's question about minor-minimal binary-matroid obstructions negatively.

Author comments: The supplement cited in the text (supplement-v7.tar.gz: an exact verifier in Python 3.10+, its saved output and a README) is archived with the paper in the Zenodo record https://doi.org/10.5281/zenodo.24351582.

A mix of human-written and AI-generated textHuman understanding: all partsBinary matroidCoefficient signsPenrose polynomialPenrose–Kauffman polynomialPlane graphcounterexample
Nov 19, 202616 pages
PDFView work

math.NT — Number Theory

Power-saving bounds for balanced radical triples via small Pell discriminants

Contributed by Zeng Chunping

For 0<λ≤10<\lambda\leq 1, let Bλ(N)\mathcal{B}_{\lambda}(N) be the set of integers n≤Nn\leq N for which rad(n(n+1)(2n+1))<(2n+1)λ\mathrm{rad}(n(n+1)(2n+1))<(2n+1)^{\lambda}. The elementary radical-box estimate gives ∣Bλ(N)∣≪Nλ/3+ε|\mathcal{B}_{\lambda}(N)|\ll N^{\lambda/3+\varepsilon}. We prove a strict power-saving refinement of this exponent: there is an absolute constant C>0C>0 such that ∣Bλ(N)∣≪λ,εNλ/3−Cλ3+ε|\mathcal{B}_{\lambda}(N)|\ll_{\lambda,\varepsilon}N^{\lambda/3-C\lambda^{3}+\varepsilon}. The argument uses Diao's uniform bound for the number of small fundamental solutions to Pell equations, together with a squarefree-kernel transfer for the three unit-difference equations, a fixed-support radical-box lemma, and a three-branch dyadic optimization. We also formulate the resulting estimate for high-quality values and for Chinese-remainder orbits, and quantify the variable-right-hand-side obstruction to a direct extension to arbitrary abc triples. No assertion of the abc or Szpiro conjecture is used, and no pointwise abc inequality is claimed. The only non-elementary external input is Diao's Theorem 1.3 in arXiv:2610.28001v1, whose statement and preprint status are recorded explicitly.

Primarily human-written textHuman understanding: all partsradical,abc conjecture, Pell equation
Nov 19, 202616 pages
PDFView work

math.MP — Mathematical Physics

The Assumption Package of the Yang–Mills Construction: Formal Definitions and Derivations

Contributed by Zeng Chunping

This is a companion document for the conditional mass‑gap theorem for four‑dimensional pure Yang‑Mills theory. We collect formal definitions and derivations for the full set of external hypotheses (RG1–RG5, UV1, PH1–PH3, AN1, Y1–Y4, B1, C1) employed in the lattice‑based construction. A volume‑consistent revised condition RG4' is established, repairing a potential volume‑divergence issue in the original formulation. Several algebraic identities are cross‑validated against the Lean 4 formal‑verification repository. We emphasize that this package of assumptions is not sufficient to prove the mass gap: counterexamples satisfy all these hypotheses while having zero mass gap. Three further open mathematical components remain required for the mass‑gap result: a volume‑uniform log‑Sobolev inequality, an Euclidean‑to‑Hamiltonian correspondence theorem, and a non‑perturbative Callan–Symanzik Ward identity implementing dynamical mass generation.

A mix of human-written and AI-generated textHuman understanding: all partsOsterwalder-Schrader axiomsYang-Mills theoryformal prooflattice gauge theorymass gapquantum field theoryrenormalization group
Nov 19, 20268 pages
PDFView work

math.NT — Number Theory

Old and new Drinfeld cusp forms of level t in characteristic 2: the weights k = 2^m + 1

Contributed by David Niedbala Giraudin

Let q = 2, A = F_2[t], and let U_t be the Atkin operator on the space S_k(Gamma_0(t)) of Drinfeld cusp forms of level t. For every weight k = 2^m + 1 we prove that S_k(Gamma_0(t)) is the direct sum of its oldforms and its newforms, that k/2 is the largest slope of U_t, and that no oldform has slope k/2. This is Conjecture 1.2(3) of Bandini and Valentino, and their conjectured old/new decomposition, for this infinite family of weights in characteristic 2, where the known methods do not apply. We also obtain the characteristic polynomial of U_t in closed form in terms of that of the Hecke operator T_t in level one, and the bound: every slope of T_t on S_k(GL_2(A)) is at most J_m = (2^m - (-1)^m)/3. The proof rests on a combinatorial theorem: the leading principal minors of the Bandini-Valentino matrix are nonzero exactly at the Jacobsthal numbers; equivalently, the number of perfect matchings of the graph of nonempty subsets of {1, ..., m} joined when disjoint or nested is odd exactly when the number of vertices plus one is a Jacobsthal number.

Primarily AI-generated textHuman understanding: no partsAtkin operatorDrinfeld cusp formsJacobsthal numberscharacteristic 2oldforms and newformsperfect matchingsslopes
Nov 19, 20268 pages
PDFView work

math.NT — Number Theory

Uniform intervals for irrational even beta values

Contributed by twinheterodox

For every positive integer qq, at least one of the Dirichlet beta values β(2q+2),β(2q+4),…,β(2⌊33q/2⌋)\beta(2q+2),\beta(2q+4),\ldots,\beta(2\lfloor33q/2\rfloor) is irrational. This gives an explicit interval from every even starting index at least four. For every positive odd mm, some even ss with m+1≤s≤(299/20)m+Cm+1\le s\le(299/20)m+C has β(s)\beta(s) irrational, where CC is absolute. This reduces the previous upper-endpoint multiplier 18.5818.58 to 14.9514.95 up to a bounded additive term. For every odd m≥4,000,000,001m\ge4{,}000{,}000{,}001, the explicit endpoint s<15ms<15m suffices.

Author comments: 10 pages. Improves the uniform upper endpoint of Hexagon 2611.00160v2 and recovers the fixed intervals of Hexagon 2611.00346v1 and 2611.00601v1. The ancillary files include all five finite certificates and their verification programs. https://github.com/twinheterodox/beta4/tree/main/uniform-even-beta-intervals

Primarily AI-generated textHuman understanding: some partsDirichlet beta functionirrationalitylinear forms
Nov 19, 202610 pages
PDFView work

math.CO — Combinatorics

Three Roles and One Bit: All Optimal Tables and Equality Graphs

Contributed by Viktor Diakin

We study a randomized one-bit fingerprint for distinguishing graphs on a common labeled vertex set. Each vertex independently receives one of three roles according to a common probability distribution. A symmetric Boolean table assigns bits to pairs of roles, and the fingerprint is the parity of these bits over the graph's edges. We prove that, for every n≥4n \geq 4, the optimal worst-case detection probability over all symmetric Boolean tables and role distributions is exactly 8/278/27. Every optimal distribution is uniform. For n≥5n \geq 5, we classify exactly 21 optimal tables with fixed role labels; one additional table is optimal when n=4n=4. We characterize all graphs attaining the minimum, up to isomorphism and isolated vertices: the four-cycle C4C_4 occurs for every optimal table, while the three-vertex path P3P_3 occurs additionally for 15 tables. For the canonical optimal table, we establish that the second distinct minimum is 80/24380/243 when n≥6n \geq 6, attained precisely by K2,4K_{2,4} with possible isolated vertices. For n=4,5n=4,5, the second minimum is 1/31/3. Our analytic proofs use homogeneous quadratic forms over the finite field F4\mathbb{F}_4, supported by reproducible exhaustive computations. The results also apply to differences of interlacement graphs associated with double-occurrence words.

Primarily AI-generated textHuman understanding: some partsCombinatoricsMinimax optimizationRandomized fingerprintingcoding theoryfinite fieldsgraph theory
Nov 19, 202611 pages
PDFView work

math.RT — Representation Theory

Invariant tensor dimensions as Hamburger moments

Contributed by Teo Banica, Sebastien Palcoux

For a self-dual object in a complex tensor category, we characterize the Hamburger moment property of its invariant tensor dimensions by a Cauchy--Schwarz inequality on sums of its tensor powers. Imposing the inequality on all pairs of objects determines the indecomposables in each block and the tensor rules of the unit block. For the additive group, the even invariant dimensions recover the Jordan type. In a finite tensor category of fusion type, Hamburger positivity for the projective cover of the unit forces unimodularity. If the identity and double dual are naturally isomorphic as additive functors, this positivity is equivalent to semisimplicity. A zero Cartan eigenvalue yields an explicit negative Hankel square in the unimodular case. We also prove semisimplicity of every finite categorification of the even sl2\mathfrak{sl}_2 Verlinde ring at every odd level. Finally, we give a Stieltjes criterion for X⊗X∗X\otimes X^* and a six-dimensional representation whose doubled sequence has a 42-atom representing measure through degree 83 and fails at degree 84.

Primarily AI-generated textHuman understanding: some partsTensor categoryspectral measure
Nov 19, 202650 pages
PDFView work

math.NT — Number Theory

Counting powerful products of consecutive integers

Contributed by Danny Plymesser

We show that the number of n≤xn\le x for which nn and n+1n+1 are both powerful is Oε(x1/4+ε)O_\varepsilon(x^{1/4+\varepsilon}), improving the exponent 29/10029/100 of Reuss. For each fixed k≥3k\ge 3 we show that the number of n≤xn\le x for which (n+1)(n+2)⋯(n+k)(n+1)(n+2)\cdots(n+k) is powerful is Ok,ε(x77/320+ε)O_{k,\varepsilon}(x^{77/320+\varepsilon}), and we prove the same exponent uniformly over all widths k≥3k\ge3. The new ingredient is a per-interval count in Reuss's form of Heath-Brown's approximate determinant method: in lattice-reduced coordinates, the solutions on an auxiliary curve of bidegree (α,β)(\alpha,\beta) become integral points of height at most L13T12L_1^3T_1^2 on an affine curve of degree 2α+3β2\alpha+3\beta, to which the uniform bound of Castryck, Cluckers, Dittmann and Nguyen applies. The proofs are formalized in Lean 4 with Mathlib and checked by Lean's kernel and an independent kernel; the formal statements take six theorems from the literature as explicit hypotheses. The results and exposition were produced and reviewed using AI systems; no human mathematical review has been performed. Section 10 describes the verification and its scope.

Author comments: The manuscript is also available on Zenodo (version 1.0.1): https://doi.org/10.5281/zenodo.23615335. The accompanying Lean 4 formalization, theorem statements, and replay receipt are available in the matching v1.0.1 release: https://github.com/dannyply/math-frontier/tree/v1.0.1

Primarily AI-generated textHuman understanding: no partsLean 4consecutive integersdeterminant methodformal verificationintegral points on curvespowerful numberssquarefull numbers
Nov 19, 202618 pages
PDFView work

math.NT — Number Theory

Two shorter intervals of even Dirichlet beta values

Contributed by twinheterodox

We prove that each of the sets {β(6),β(8),…,β(66)}\{\beta(6),\beta(8),\ldots,\beta(66)\} and {β(8),β(10),…,β(98)}\{\beta(8),\beta(10),\ldots,\beta(98)\} contains an irrational number. These sets contain 3131 and 4646 values, respectively, improving the previous intervals with the same lower endpoints, which contained 3535 and 5252 values.

Author comments: 10 pages. Shortens the known intervals beginning at 6 and 8 to 31 and 46 even beta values, respectively. Includes exact seed computations and version-specific audit records. https://github.com/twinheterodox/beta4/tree/main/beta-intervals

Primarily AI-generated textHuman understanding: some partsDirichlet beta functionirrationalitylinear forms
Nov 19, 202610 pages
PDFView work

math.NT — Number Theory

An asymptotic lower bound for the number of irrational even beta values

Contributed by twinheterodox

For even ss, let I(s)I(s) count the irrational values among β(2),β(4),…,β(s)\beta(2),\beta(4),\ldots,\beta(s). We prove lim inf⁡s→∞2∣sI(s)slog⁡log⁡s/log⁡s≥2ζ(2)ζ(3)3ζ(6)≈1.6098018250\liminf_{\substack{s\to\infty\\2\mid s}} \frac{I(s)}{\sqrt{s\log\log s/\log s}} \geq 2\sqrt{\frac{\zeta(2)\zeta(3)}{3\zeta(6)}} \approx 1.6098018250. Here β\beta denotes the Dirichlet beta function and ζ\zeta the Riemann zeta function. The bound improves the growth rate in our earlier counting result by a factor log⁡log⁡s\sqrt{\log\log s}. It has the same growth rate as the recent theorem of Fischler, Lai, Sprang and Zudilin for irrational odd zeta values, with 1/31/\sqrt3 of their leading constant. The conclusion remains valid after any fixed initial set of even beta values is omitted.

Author comments: 13 pages. The earlier paper (Hexagon 2611.00139v1) gives an explicit lower bound for every even s ≥ 160. The present paper improves the growth rate by a factor of √(log log s). The ancillary files contain the exact checker, its reference output, and the reviews of the original and strengthened proofs. https://github.com/twinheterodox/beta4/tree/main/asymptotic-even-beta-counts

Primarily AI-generated textHuman understanding: some partsDirichlet beta functionHankel determinantsirrationality
Nov 19, 202613 pages
PDFView work

math.NT — Number Theory

Equal prime divisors in disjoint blocks of consecutive integers

Contributed by Sunay Venkat

We construct infinitely many disjoint pairs of consecutive blocks, of lengths three and four in that order, whose products have identical prime divisors. Their starting positions disprove the finiteness and separation predictions in Erdős’s 1976 formulation. The modern Erdős problem 931 requires the earlier block to be at least as long as the later one and remains open. For any fixed lengths k,ℓ≥2k,\ell\ge2, the number of equal-support pairs with increasing first terms at most XX, even allowing overlap, is Ok,ℓ,ε(X2/3+ε)O_{k,\ell,\varepsilon}(X^{2/3+\varepsilon}). In the modern length order, we prove finiteness on fixed conics, on fixed equations in separated rational functions, and for pairs admitting two independent multiplicative relations. We also give exact counts in three strips of bounded separation, without a bound on either starting term.

Author comments: 37 pages. Counterexamples to the 1976 formulation, with quantitative and special-case results. The modern ordered Erdős problem 931 remains open.

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

math.NT — Number Theory

Ramanujan primes and primes of exponent one in products of consecutive integers

Contributed by Sunay Venkat

Let M(L)M(L) be the minimum number of primes occurring to exponent one in a product of LL consecutive positive integers. Assuming the ordinary abcabc conjecture, we prove that, for all sufficiently large LL, M(L)M(L) equals the number of Ramanujan primes at most LL. Thus the least length threshold guaranteeing kk such primes is the kkth Ramanujan prime for every sufficiently large kk. The identity holds unconditionally if the last entry is at most exp⁡(c(log⁡L)3/2/log⁡log⁡L)\exp(c(\log L)^{3/2}/\sqrt{\log\log L}), for an absolute c>0c>0. We determine the limiting count at every fixed ratio of the starting offset to the length. We also prove unconditionally that the factorial count can exceed the minimum by an unbounded amount, and that ordinary primes contain arbitrarily long runs of consecutive non-Ramanujan primes.

Author comments: 7 pages. The main large-length identity is conditional on the abc conjecture; the parent Erdős problem 137 remains open.

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

math.NT — Number Theory

Integrality and polynomiality in Somos recurrences

Contributed by Hernandez Juan

We prove that the standard Somos-kk sequence has a noninteger term for every k≥8k\geq 8 and give an explicit upper bound for the index of the first such term. We classify the three-term Somos recurrences with independent coefficients and all initial values equal to 11 for which every term is a polynomial with integer coefficients in the recurrence coefficients. For each recurrence outside this classification, we bound the first index at which polynomiality fails and determine the reduced denominator at that index. We also show that every odd prime dividing a term of the standard Somos-44 sequence occurs to arbitrarily high valuation, with an exact formula along an explicit subsequence, and determine the 22-adic valuation of every term.

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

math.PR — Probability

The Dimension-Degree Boundary for Gaussian Moment Vanishing

Contributed by Roy van Rijn

We classify complex polynomials of degree at most three in three independent standard real Gaussian variables whose positive moments all vanish. Up to a complex orthogonal linear change of coordinates and a nonzero scalar, every such polynomial has one-sided circular support or belongs to a single exceptional orbit. For every fixed polynomial QQ, its mixed moments E[QPm]\mathbb E[QP^m] vanish whenever m>3deg⁡Qm>3\deg Q, and the coefficient three is optimal. The proof extracts a Gaussian coordinate in which the polynomial is affine linear, then classifies that family using formal stationary frames and analytic period estimates. Combining this ternary-cubic result with Wilson's two-variable theorem, Liu's quadratic theorem and Long's counterexamples gives the exact dimension-degree boundary for the Gaussian Moments Conjecture: the implication from pure-moment vanishing to eventual mixed-moment vanishing holds universally precisely when there are at most two variables, the degree is at most two, or there are three variables and the degree is at most three. We reproduce the all-order moment identities for the two minimal failures.

Primarily AI-generated textHuman understanding: no partsGaussian Moments ConjectureGaussian integrationdifferential modulespolynomial moment vanishingstationary phaseternary cubics
Nov 19, 202657 pages
PDFView work

math.GT — Geometric Topology

Prime Knots with Augmentation-Rank Gaps at Unbounded Bridge Number

Contributed by Roy van Rijn

We construct explicit braid families containing infinitely many distinct hyperbolic prime knots of each bridge number b=5,6b=5,6 and each sufficiently large bb, with complex augmentation rank at most b−1b-1 and meridional rank bb. Alternating-group colorings force bb meridional generators, while two fixed meridian words let a local rank-one obstruction persist as the braid grows. An oriented diagram isotopy realizes the associated two-cusped exteriors as fillings of a single three-cusped exterior. Rigorous interval certificates establish hyperbolicity of that exterior and the two small-bridge exteriors used in the filling argument.

Primarily AI-generated textHuman understanding: no partsDehn fillingaugmentation rankbraid groupsbridge numberhyperbolic knotsknot theorymeridional rank
Nov 19, 202612 pages
PDFView work

quant-ph — Quantum Physics

Spontaneous X-rays Exclude Gaussian Covariant Classical–Quantum Gravity

Contributed by Marc Sperzel

In classical-quantum gravity the metric stays classical, and complete positivity ties the decoherence of matter to the diffusion of the metric. The covariant theory of Oppenheim and collaborators is viable by its authors' assessment, which does not evaluate the matter noise at keV frequencies. That noise conflicts with XENONnT's search for spontaneous X-rays, by two arguments that fail under different escapes. First, the covariant diffusion makes the conformal mode dynamical; near the light cone slow matter feels it through its rest mass, while Maxwell's equations do not. For translation-invariant kernels and every diffusion weight that is Lorentz invariant in the scalar sector, whatever its regulator or running in p2p^2, the trade-off forces matter noise s≥23∣f∣/p2s\geq\tfrac23|f|/p^2 on a conserved near-null source, in units of the Diósi-Penrose kernel. Where Newton's law is tested, ∣f∣=1|f|=1 and ∫s dp2≥9.2\int s\,dp^2\geq9.2, against a limit of 7.7×10−87.7\times10^{-8} from our likelihood fit to the published XENONnT spectrum: an exclusion by ≥1.1×108\geq1.1\times10^{8} (median expected 6.6×1076.6\times10^{7}). A frame in the scalar weight evades it. Second, general relativity's response to a conserved near-null source has a light-cone pole, which is purely tensor. The resulting bound holds for every positive diffusion weight, with or without a frame. It assumes general relativity's tensor propagator at keV momenta, but no transfer of static tests; an atom's Coulomb field gives the tensor source an order-one share. The margin, 1.7×1091.7\times10^{9} (median expected 9.8×1089.8\times10^{8}), is an estimate, not a bound. At linear order, a classical theory that survives both needs a frame or a non-perturbative mass above (0.34 μm)−1(0.34~\mu\mathrm{m})^{-1} in the scalar sector, and a tensor sector off the light cone, or with a form factor, at keV momenta, or a coupling blind to the atom's stress; or a frame carried by the matter coupling, or possibly by the state of an extra field (open); or noise outside the Gaussian class, which for a Poisson record of jumps must deliver its keV emission in multi-photon bursts.

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

math.NT — Number Theory

Pointwise representation counts for Eisenstein restricted sums

Contributed by Roy van Rijn

Let AA consist of the positive integers supported on primes 1 mod 31\bmod 3, including 11. We count distinct ordered representations n=a+bn=a+b for n≡2 mod 6n\equiv2\bmod6 and n=a+3bn=a+3b for n≡4 mod 6n\equiv4\bmod6, with a,b∈Aa,b\in A. In either family prescribe an interval of length HH centered at xx for one actual summand. Put M=min⁡(x,n−x)M=\min(x,n-x). For every fixed 0<ε<10<\varepsilon<1, if H≤MH\le M and H3≥n1+εMH^3\ge n^{1+\varepsilon}M, the count has order HJ(n)/log⁡nHJ(n)/\log n for every sufficiently large admissible nn. Here J(n)J(n) is the product of (p−1)/(p−2)(p-1)/(p-2) over the odd primes p≡2 mod 3p\equiv2\bmod3 dividing nn. In particular, central windows of width nθn^\theta are allowed for 2/3<θ<12/3<\theta<1, and windows at a prescribed small summand of size comparable to their width are allowed for 1/2<θ<11/2<\theta<1. The lower bound combines angular Hecke estimates with a sieve that prescribes small split factors in both summands.

Primarily AI-generated textHuman understanding: no partsEisenstein integersHecke operatorsquaternion algebrasrepresentation functionsrestricted prime factorssieve methods
Nov 19, 202612 pages
PDFView work

math.FA — Functional Analysis

Spectral measures for subfactors and Lie groups

Contributed by Cédric ARHANCET

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

Author comments: C\'edric Arhancet

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

math.NT — Number Theory

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

Contributed by Manvir Jaswal

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

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

math.CA — Classical Analysis and ODEs

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

Contributed by Oleksiy Babanskyy

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

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

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

math.AC — Commutative Algebra

Cluster monomials and finite type

Contributed by Jason Turner

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

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

math.MG — Metric Geometry

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

Contributed by Sihan Chen

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

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

math.AG — Algebraic Geometry

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

Contributed by Ryan Hackbarth

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

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

math.MG — Metric Geometry

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

Contributed by Sebastien Palcoux

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

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

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

math.LO — Logic

Relative independence of the simultaneous chromatic number at ℵ₁

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

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

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

math.LO — Logic

A finite-color partition relation for ω₁²

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

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

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

math.CV — Complex Variables

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

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

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

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

math.CO — Combinatorics

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

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

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

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

math.NT — Number Theory

Sharp growth and gap exponents for admissible sequences

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

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

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

math.MP — Mathematical Physics

Uniform Spectral Gap for the AKLT Model on the Square Lattice

Contributed by P. M. Aronow, Patrick Lopatto

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

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

math.NT — Number Theory

GPF-Tribonacci sequences admit no uniform linear bound

Contributed by Ryuya Hora

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

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

math.AP — Analysis of PDEs

Infinite cascades for the defocusing cubic nonlinear Schr\"odinger equation on the square torus

Contributed by Xi Chen

For each 1<s<21<s<2 we construct a solution of the defocusing cubic nonlinear Schr\"odinger equation on the square two-torus with initial data in HsH^s whose HsH^s norm tends to infinity as t→+∞t\to+\infty. The growth can be arbitrarily slow. More precisely, the squared norm agrees, up to a bounded error at all positive times, with the number of selected axial frequencies KjK_j for which Kjs≤tK_j^s\le t. The central construction couples a finite tree of orthogonal frequency pairs to a periodic one-dimensional solution of the same equation. Each transfer leaves a nonvanishing Fourier coefficient on the horizontal axis. Control on an entire half-line allows successive transfers to retain the coefficients produced earlier.

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

math.NT — Number Theory

An Averaged Iwasawa Approach to Mordell over Q

Contributed by Jit Wu Yap

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

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

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

quant-ph — Quantum Physics

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

Contributed by Soo-Jong Rey

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

Author comments: 69 pages+1 illustration

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

math-ph — Mathematical Physics

Schwinger–Strebel measures for planar four-point correlators

Contributed by Zhenyu Sun

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

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

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

math.CA — Classical Analysis and ODEs

Representation of Degrees of Convergence by Nonadditive Measures

Contributed by Paolo Leonetti

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

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

math.NT — Number Theory

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

Contributed by Zeng Chunping

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

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

math.NT — Number Theory

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

Contributed by David Niedbala Giraudin

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

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

math.NT — Number Theory

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

Contributed by David Niedbala Giraudin

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

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

math-ph — Mathematical Physics

Unique continuation for the Pauli-Fierz Hamiltonian

Contributed by Mihaly A. Csirik

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

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

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