Browse

All works

Browse the Hexagon catalog.

Newest works

1351 works

math.CA — Classical Analysis and ODEs

Half-line density and the structure of crystalline measures

Contributed by Jamie Martin

Let µ be a crystalline measure on the real line. Both µand its Fourier transform are locally finite sums of point masses. We prove that µ is a finite sum of translated and modulated lattice Dirac combs if and only if its support and its spectrum each have finite lower linear density on at least one half-line. The two half-lines and the sequences of radii may be chosen independently. If the support of a nonzero measure has lower half-line density d<∞, then d is the infimum of the frequency widths of the nonzero exponential polynomials vanishing on the support. In particular, the number of atoms per unit interval is uniformly bounded. If µ is not a generalized Dirac comb, its spectrum contains at least (1/(2d2)−o(1))T2 points in every interval of length T, uniformly in the position of the interval as T →∞. The proof combines a spectral gap theorem with a finite difference equation for the spectral masses. For a prescribed set Λ of lower density d<∞on one half-line, we describe the space of measures with support and spectrum in Λ and prove the sharp upper bound ⌊d2⌋for its dimension.

Primarily AI-generated textHuman understanding: no parts
Nov 20, 202612 pages
PDFView work

math.NT — Number Theory

On several conjectures concerning p-adic continued fractions

Contributed by Tomislav Pejkovic

Let pp be an odd prime and let h≥2h\ge2 be even. If (p,h)≠(3,2)(p,h)\ne(3,2), infinitely many real and infinitely many imaginary quadratic fields have the form Q(D)\mathbb Q(\sqrt D), where DD is an integer whose pp-adic square roots have least period hh under Browkin's second algorithm. For (p,h)=(3,2)(p,h)=(3,2), we give two radicands and bound all such radicands in terms of their preperiods. We prove eventual periodicity for quadratic inputs to the fourth algorithm of Wang and Deng at p=5p=5 and to Yasutomi's simultaneous algorithm for real quadratic fields at p=3p=3. The real approximation error after nn digits is O(n−3)O(n^{-3}) for Ruban's expansion of a quadratic irrational and for Schneider's expansion of a quadratic pp-adic unit. For both Browkin algorithms and the alternating algorithm of Murru and Romeo, we determine the real and pp-adic approximation exponents in terms of the reduced denominator for Haar-almost every input. The real limit is transcendental and has finite irrationality exponent. In each cubic field embedded in Qp\mathbb Q_p, a suitable generator gives eventual periodicity for every basis 1,x,y1,x,y in a variant of the algorithm of Saito, Tamura and Yasutomi that computes the translation after inversion and row reduction. Computing the translation from the input gives nonperiodic expansions on a dense set of bases in every degree at least two. For the pp-adic Jacobi–Perron algorithm we construct pairs of Liouville numbers on a rational line with infinite expansions that are not eventually periodic. We also prove an irreducibility conjecture for a sequence of polynomials arising from a Pell equation.

Primarily AI-generated textHuman understanding: some partsJacobi–Perron algorithmQuadratic irrationalsp-adic continued fractionsperiodicityreal convergence
Nov 20, 202645 pages
PDFView work

math.NT — Number Theory

Mixed character moments and a zero-free half-plane for unitary Hecke L-functions

Contributed by Baiying Liu

We prove that for every number field K and every continuous unitary Hecke character ω, the function LK (s,ω) has no zeros in Re s>θ_G, where .8733326374459049352 <θ_G <.8733326374459051924. The same bound holds for Artin L-functions and for L-functions of finite-dimensional continuous unitary Weil representations. We estimate a mixed moment of two ordinary character sums with unequal lengths. Asecond Poisson summation in a signed correlation reduces the estimate to moments at a combined sextic character parameter. A differential equation describes the limiting range of the mixed moment and gives the optimal threshold within the specified reflected numerator comparison. We also determine the optimal saving for a centered cube-free sum in terms of the poles of a quotient of Hecke L-functions.

A mix of human-written and AI-generated textHuman understanding: some partsRiemann Zeta Functionquasi Riemann Hypothesis
Nov 20, 202668 pages
PDFView work

math.CO — Combinatorics

A counterexample to the cocircuit diameter conjecture

Contributed by Peter Graham

A rationally realizable uniform rank-41 oriented matroid on 80 elements has cocircuit-graph diameter at least 42>41=n−r+242>41=n-r+2, refuting the general cocircuit diameter conjecture. We build on the rank-21 example of Adler, De Loera, Klee and Zhang, the non-Hirsch polytope of Matschke, Santos and Weibel, Santos's product construction, and the source certification of Allamigeon, Canu and Strub. A count of negative coordinates confines every potentially shorter walk to two affine sections; projection to the product factors then gives the lower bound. Two rational perturbations make the resulting oriented matroid uniform. Lean 4 separately verifies the matrix existence and walk lower bound for a different realizing matrix; the printed perturbations are proved here, not checked in Lean. This work has not yet been reviewed by experts. The proofs, the Lean formalization, the certificate checkers and the text were produced by AI models, working under the author's direction.

Author comments: Zenodo archive: https://doi.org/10.5281/zenodo.23765669. Lean 4 development, in its folder lean: https://github.com/6/clank-lab/tree/cocircuit-diameter-counterexample-v1/results/cocircuit-diameter-counterexample . What Lean checks (Lean 4.19.0 with a pinned Mathlib; axioms propext, Classical.choice and Quot.sound only): the theorem ADKZPricing.Generated.source_frozen_endpoint, that some rational 80x41 matrix with every 41-row minor nonzero has two real signed cocircuits, with complementary 40-element zero sets and positive entries elsewhere, that no walk of at most 41 edges joins in the full cocircuit graph (all signed cocircuits as vertices). Seven Lean theorems show that its cocircuit, adjacency and walk definitions agree with those of Section 1. Lean also checks the source matrix M_0's vertex and edge certificate and the bound d_P(u,v) >= 21. What Lean leaves outside: (1) the passage from the sign covectors of a real matrix to the realizable oriented matroid of Theorem 1, the standard interpretation; (2) the matrix of Section 3: Lean's matrix is given only existentially, from its own positive functional and perturbations, and is not identified with the printed one, whose Vandermonde perturbations are proved only in the text; (3) the printed positive functional of Appendix A, proved in the text and checked by an exact Python checker; (4) the upper bounds d_P(u,v) = 21 (exact Python checkers) and 42 (Remark 8, written). The full Lean build needs about 88 GiB of memory and half a day. License: the paper text is deposited here under CC BY 4.0; the Lean development and the checkers stay under Apache-2.0 in the published repository.

Primarily AI-generated textHuman understanding: some partscocircuit graphdiameteroriented matroiduniform perturbation
Nov 20, 202611 pages
PDFView work

math.GN — General Topology

Common Periodic Points of Commuting Interval Maps

Contributed by Luke Hammer

We construct pairs of commuting continuous self-maps of the compact interval with disjoint periodic-point sets. More precisely, every finite union of sets of positive multiples, including the empty union, is the set of integers n for which two commuting nth iterates have a common fixed point. In the other direction, we show that if either generator has zero topological entropy, the generators act as mutually inverse cyclic permutations on a common finite orbit. We also establish a common fixed-point theorem for two commuting maps that are each monotone on a finite partition, with constant pieces allowed.

Primarily AI-generated textHuman understanding: no partsInterval dynamics
Nov 20, 202619 pages
PDFView work

math.NT — Number Theory

A Polynomial Kontsevich–Zagier Theorem for Compact Exponential Periods on the Affine Line

Contributed by Christopher D. Long, Antoine-Auguste Le Blanc

Let q,r∈Q‾[x]q,r\in\overline{\mathbb{Q}}[x], let Δ\Delta be a finite degree-zero zero-cycle on A1(Q‾)\mathbb{A}^1(\overline{\mathbb{Q}}) with coefficients in Q‾\overline{\mathbb{Q}}, and let Γ\Gamma be any finite piecewise C1C^1 one-chain in C\mathbb{C} with ∂Γ=Δ\partial\Gamma=\Delta. We consider compact exponential periods \[ \int_\Gamma r(x)e^{q(x)}\,dx \] and the zero-dimensional exponential periods eλe^\lambda, λ∈Q‾\lambda\in\overline{\mathbb{Q}}. The companion linear theorem identifies every numerical linear relation among these periods with a formal consequence of bilinearity, functoriality, and twisted Stokes. We prove the corresponding polynomial theorem for the commutative algebra generated by the same periods. Every polynomial numerical relation is generated by the companion linear relations, multiplication, and the identities \[ e^0=1,\qquad e^\lambda e^\mu=e^{\lambda+\mu},\qquad e^\lambda\int_\Gamma r e^q\,dx =\int_\Gamma r e^{q+\lambda}\,dx. \] Equivalently, the period map is injective on the tensor-generated formal algebra of compact exponential periods on the affine line. The new input is a uniform description of the functional polynomial-relation ideal. After adjoining the finitely many exponential functions coming from endpoint values and constant shifts, the affine Picard–Vessiot group of the inhomogeneous moment system has a vector translation kernel and reductive homogeneous quotient. Horizontal projectors are Laurent polynomials in the adjoined exponentials. An explicit gauge built from the spectral projectors of the constant connection matrix separates the coordinates already in the base ring from a full translation block, and the latter coordinates are algebraically independent. Hence the complete functional relation ideal is generated by affine-linear relations. Beukers' lifting theorem transfers this statement to values, and the companion linear Kontsevich–Zagier theorem makes every specialized generator formal.

Author comments: Paper III of the Exponential Integral Theorem series. Source and audit records: https://github.com/long-mathematics/exponential-integral-theorem/tree/92db79eedeb064694ff20e9201d73fc2bc0857f4

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

math.NT — Number Theory

A Linear Kontsevich–Zagier Theorem for Compact Exponential Periods on the Affine Line

Contributed by Christopher D. Long, Antoine-Auguste Le Blanc

Let q,r∈Q‾[x]q,r\in\overline{\mathbb{Q}}[x], let Δ=∑αdα[α]\Delta=\sum_\alpha d_\alpha[\alpha] be a finite degree-zero zero-cycle on A1(Q‾)\mathbb{A}^1(\overline{\mathbb{Q}}) with coefficients in Q‾\overline{\mathbb{Q}}, and let Γ\Gamma be any finite piecewise C1C^1 one-chain in C\mathbb{C} with ∂Γ=Δ\partial\Gamma=\Delta. We consider \[ I_{q,r,\Delta}(z)=\int_\Gamma r(x)e^{zq(x)}\,dx \] and the compact exponential period Iq,r,Δ(1)I_{q,r,\Delta}(1). We define the formal exponential-period space on smooth affine curves using bilinearity, functoriality, and twisted Stokes, and consider the subspace generated by the affine-line periods above and by the zero-dimensional exponential periods eβe^\beta, β∈Q‾\beta\in\overline{\mathbb{Q}}. We prove that the period map is injective on this subspace. Equivalently, every Q‾\overline{\mathbb{Q}}-linear numerical relation among these compact exponential periods is generated by the standard Kontsevich–Zagier operations. The proof first reduces every polynomial differential uniquely modulo R↦R′+q′RR\mapsto R'+q'R. Direct sums of the moment systems from the companion paper Algebraic Exponential Integrals are then used to lift a numerical relation by Beukers' theorem. A direct-sum residue argument makes the resulting relation submodule constant and forces an exponential-polynomial identity. A common finite tree and a Cauchy transform show that its combined inverse-branch densities vanish edge by edge. Finally, a simultaneous finite Galois cover realizes every such functional relation by functoriality in the formal period space.

Author comments: Paper II of the Exponential Integral Theorem series. Source and audit records: https://github.com/long-mathematics/exponential-integral-theorem/tree/92db79eedeb064694ff20e9201d73fc2bc0857f4

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

math.NT — Number Theory

Algebraic Exponential Integrals: Transcendence and Linear Relations

Contributed by Christopher D. Long, Antoine-Auguste Le Blanc

Let q∈Q‾[x]q\in\overline{\mathbb{Q}}[x] be nonconstant, and let Δ=∑αdα[α]\Delta=\sum_\alpha d_\alpha[\alpha] be a finite degree-zero zero-cycle on A1(Q‾)\mathbb{A}^1(\overline{\mathbb{Q}}) with coefficients in Q‾\overline{\mathbb{Q}}. If Γ\Gamma is any finite piecewise C1C^1 one-chain in C\mathbb{C} with ∂Γ=Δ\partial\Gamma=\Delta, put \[ I_{q,\Delta}(z)=\int_\Gamma e^{zq(x)}\,dx. \] We prove that every nonzero function Iq,ΔI_{q,\Delta} is a purely transcendental EE-function: for every ξ∈Q‾×\xi\in\overline{\mathbb{Q}}^\times, Iq,Δ(ξ)I_{q,\Delta}(\xi) is transcendental. Equivalently, \[ I_{q,\Delta}(1)\in\overline{\mathbb{Q}} \quad\Longleftrightarrow\quad I_{q,\Delta}\equiv0. \] In particular, ∫ABeq(x)dx\int_A^B e^{q(x)}dx is transcendental for every pair of distinct algebraic endpoints. For a fixed polynomial qq, we also determine all Q‾\overline{\mathbb{Q}}-linear relations among finite families of these values: they are exactly the specializations of constant-coefficient functional relations, and the latter are characterized by vanishing of explicit inverse-branch densities on a finite tree in the target of qq. The proof combines Beukers' lifting theorem with a homogeneous moment connection. A Fourier–Laplace description proves semisimplicity, while an explicit residue calculation shows that every rational horizontal endomorphism is constant. An algebraic value therefore forces an exponential-polynomial identity. Constant-coefficient annihilation and a Cauchy-transform argument then force the original exponential period function to vanish identically.

Author comments: Paper I of the Exponential Integral Theorem series. Source and audit records: https://github.com/long-mathematics/exponential-integral-theorem/tree/92db79eedeb064694ff20e9201d73fc2bc0857f4

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

math.PR — Probability

On the Monotonicity of the Speed of Biased Random Walks on GW Trees

Contributed by Heng Ma

On a Galton--Watson tree without leaves, the λ\lambda-biased random walk (Xn)(X_n) chooses its next step with weight λ>0\lambda>0 for the parent and weight one for each child. When λ\lambda strictly less than the mean offspring mm, the walk is transient, with a positive speed v(λ):=lim⁡n→∞∣Xn∣/n.v(\lambda): =\lim_{n\to\infty}|X_n|/n. We study the monotonicity of v(⋅)v(\cdot), and prove that: \begin{itemize} \item If the GW tree has at least two children, then v(⋅)v(\cdot) is decreasing on (0,m)(0,m); \item v(⋅)v(\cdot) is decreasing on (0,1)∪(3+52,m)(0,1) \cup (\frac{3+\sqrt{5}}{2}, m). \end{itemize} We also sketch a computer-assisted proof of strict decrease on (0,m)(0,m) using exact checks of about 750,000750{,}000 rational coefficients. The full proof appears in the companion GitHub version~\cite{FullVersion}.

Primarily AI-generated textHuman understanding: some partsbiased random walkmonotonicityspeed
Nov 20, 202624 pages
PDFView work

math.AG — Algebraic Geometry

The maximum likelihood degree of no-three-way interaction models

Contributed by Shankar Sivarajan

We prove that for all I,J,K≥2I,J,K\ge2 the maximum likelihood degree of the no-three-way interaction model of I×J×KI\times J\times K contingency tables is \[ (-1)^{(I-1)(J-1)}\int\beta(M_A)^K\,d\chi(A), \] an integral with respect to the Euler characteristic over the I×JI\times J matrices AA with nonzero entries modulo row and column scaling, where β(MA)\beta(M_A) is the beta invariant of the matroid of the columns of $[\Id_I\mid A]$. By a theorem of Clarke, Ho\c{s}ten, Kushnerchuk, and Oldekop, β(MA)\beta(M_A) is the maximum likelihood degree of the independence model scaled by AA. Closed forms were previously known only when one variable is binary, and the formula recovers them. For fixed II and JJ the maximum likelihood degree is an exponential polynomial in KK; the coefficient of its largest base (I+J−2I−1)\binom{I+J-2}{I-1} is the maximum likelihood degree of the moduli space X(I,I+J)X(I,I+J) of points in linearly general position, which counts solutions to the generalized scattering equations of Cachazo, Early, Guevara, and Mizera. The same argument for a generically scaled model expresses the degree of MI,J,K\mathcal M_{I,J,K} as an Euler-characteristic integral of products of beta invariants. For 3×33\times3 matrices the integral reduces to counting strata of line arrangements, and the maximum likelihood degree of the 3×3×K3\times3\times K model is 26⋅6K−60⋅5K+36⋅4K+6⋅3K−9⋅2K+126\cdot6^K-60\cdot5^K+36\cdot4^K+6\cdot3^K-9\cdot2^K+1; in particular the 3×3×33\times3\times3 model has maximum likelihood degree 511511.

Primarily AI-generated textHuman understanding: some partsEuler characteristicalgebraic statisticsbeta invariantcontingency tablesline arrangementsmatroid stratificationmaximum likelihood degreeno-three-way interaction modelscattering equationstoric varieties
Nov 20, 202610 pages
PDFView work

math.AG — Algebraic Geometry

Two shapes of maximal degree 135 in the plane Jacobian problem: exclusion of the degree pairs (135,90) and (90,135) with corners (9,36) and (17/9,4)

Contributed by David Niedbala Giraudin

In the list of Guccione, Guccione, Horruitiner and Valqui of the possible shapes of a counterexample to the plane Jacobian conjecture with degrees at most 150, two shapes have starting corner (9,36) and final corner (17/9,4): the standard (3,2)-pairs of degrees (135,90) and the standard (2,3)-pairs of degrees (90,135). We show that no such pair exists, when it is normalised as in Corollary 5.21 of Guccione-Guccione-Valqui. The two sides of the Newton polygon are described by the results of Guccione-Guccione-Valqui. In suitable polynomial coordinates the pair is confined to an explicit finite system of polynomial equations. Its leading part is a pair of polynomials of degrees 12 and 8 in one variable with 3 p3 q2' - 2 p3' q2 constant, which is unique up to the symmetries of the system and has rational coefficients; the remaining equations are then solved by three steps of linear algebra over Q, and the 29 compatibility conditions, polynomials in five unknowns, generate the unit ideal. The computation is exact and is reproduced by an ancillary script (SymPy, and Singular for one Groebner basis). All statements are proved relative to the cited results. Nothing in this note has been checked by a third party.

Primarily AI-generated textHuman understanding: no partsJacobian conjectureKeller mapNewton polygonminimal counterexampleplane Jacobian conjectureregular corner
Nov 20, 20266 pages
PDFView work

math.PR — Probability

Extremizers of the expected missing mass under an entropy constraint

Contributed by Christopher D. Long

For a discrete probability distribution p=(pi)p=(p_i), the expected mass of symbols absent from tt independent samples is Φt(p)=∑ipi(1−pi)t\Phi_t(p)=\sum_i p_i(1-p_i)^t. For every positive integer tt and finite entropy budget h≥0h\ge0, we prove that every ℓ1\ell^1-local maximizer under H(p)≤hH(p)\le h has at most two distinct positive coordinate values, and all but at most one positive coordinate are equal. This holds on finite and countably infinite alphabets and improves the four-size bound of Berend, Kontorovich, and Zagdanski (2017). On a countably infinite alphabet, we give an exact finite classification of all global maximizers: a unique one-light or uniform candidate is compared with an explicitly bounded family of one-heavy candidates, whose masses are uniquely specified by entropy equations. The one-light or uniform candidate is uniquely optimal for t=1,2t=1,2. For fixed h>0h>0, the optimal value Bt(h)B_t(h) satisfies \[ \frac{h}{B_t(h)}=\log t+\log\log t+2 +O_h\!\left(\frac{\log\log t}{\log t}\right). \] Every optimizer is eventually one-heavy, with mt∼htm_t\sim ht equal light atoms of size qt∼1/(tlog⁡t)q_t\sim1/(t\log t). The two-size proof combines a three-coordinate entropy-curvature estimate with a finite coefficient comparison. Crossing theorems describe the winning intervals of the candidate distributions, and the classification gives exact extrema for singleton counts, discovery increments, and expected coverage.

Author comments: Lean 4 formalization, manuscript correspondence, and final audit: https://github.com/long-mathematics/entropy-constrained-missing-mass/tree/cfc6f0e70596b36c2309cccbb931a1c84f63ad7f

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

math.CO — Combinatorics

Boxes with cyclic tiling groups have one layer or size 2 × 2 × 4

Contributed by twinheterodox

Kuperberg asked how a box's dimensions determine its tiling group. We prove Conlon's conjecture that this group is cyclic exactly when one side has length one or the box has dimensions 2×2×42\times2\times4 in some order. For every box, we also show that the minimum number of generators of its tiling group equals the largest multiplicity of a cyclotomic factor of prime-power index in MacMahon's volume polynomial. This polynomial counts stacks by the number of cubes they contain. It also determines the Smith factors over Q[q,q−1]\mathbb{Q}[q,q^{-1}] of the box's weighted Carlitz matrix, which presents the tiling group at q=1q=1. Each cyclotomic factor of multiplicity ee occurs in exactly the last ee Smith factors, once in each.

Author comments: 13 pages, 5 figures. The source includes editable figures, six verification programs, and their reference results. The manuscript and code are available at https://github.com/twinheterodox/boxed-plane-partitions

Primarily AI-generated textHuman understanding: some partsCyclotomic PolynomialsKasteleyn cokernelsSmith normal formboxed plane partitionslozenge tilings
Nov 20, 202613 pages
PDFView work

math.CO — Combinatorics

Peaceable queens on boards of size 16 to 20

Contributed by Jason Davies

Let a(n)a(n) be the largest mm such that mm white and mm black queens can be placed on an n×nn\times n board with no queen attacking a queen of the other colour (OEIS A250000). The refereed literature and the OEIS gave a(n)a(n) for n≤15n\le15, and in 2026 Arevalo determined a(16)a(16), a(17)a(17) and a(18)a(18) in an unrefereed, AI-assisted computational note. We prove a(19)=52a(19)=52 and a(20)=58a(20)=58, which were open, and we confirm a(16)=37a(16)=37, a(17)=42a(17)=42 and a(18)=47a(18)=47 independently, with two separately written programs. In each case a(n)=⌊7n2/48⌋a(n)=\lfloor7n^2/48\rfloor, so the constructions that Ainley gave in 1977 are optimal on these boards. The proof is computer-assisted. As in earlier work, we label each of the 6n−26n-2 lines of the board white or black, which turns the problem into maximising the smaller of two cell counts. Our new ingredient is the bound: for fixed rows and columns we bound that quantity by Lagrangian duality, and each Lagrangian subproblem is a minimum cut on the 4n−24n-2 diagonals. With symmetry breaking, the search for n=20n=20 meets 5.7×10105.7\times10^{10} row/column labellings up to symmetry, and a single family of minimum cuts prunes every one of them. That search took 221.9 CPU hours, mostly on cloud machines. A second implementation repeats the whole search for every n≤18n\le18. Orbit counts by Burnside's lemma confirm that every search is complete, and exact LP certificates and SAT proofs checked by drat-trim give further checks. As side results we find 26 and 5 inequivalent optimal configurations for n=16n=16 and n=17n=17 (OEIS A260680), and we confirm by computation that the 20×2020\times20 and 22×2222\times22 tori admit 51 and 64 queens of each colour but not more (A279405), values that also follow from Harries's exact formula for even tori.

Primarily AI-generated textHuman understanding: no partsLagrangian dualityOEIS A250000chessboard problemscomputer-assisted proofminimum cutpeaceable queenssymmetry breaking
Nov 20, 202611 pages
PDFView work

math.CO — Combinatorics

The Heawood family is not the complete list of excluded minors for Colin de Verdière invariant at most 5

Contributed by Peter Graham

We show that two intrinsically knotted graphs G1G_1 and G2G_2 with 23 edges, on 11 and 12 vertices, have Colin de Verdière invariant μ=6\mu=6 and no minor in the Heawood family, the 78 graphs obtained from K7K_7 and K3,3,1,1K_{3,3,1,1} by ΔY\Delta Y- and YΔY\Delta-transformations. So the Heawood family is not the complete list of excluded minors for μ≤5\mu\le5, as van der Holst proposed; Mattman and Pavelescu stated this proposal as a conjecture and derived from it that G1G_1 and G2G_2 have μ=5\mu=5. More precisely, either the common minor HH of G1G_1 and G2G_2, a 4-regular graph with 11 vertices and 22 edges, is an excluded minor for μ≤5\mu\le5, or G1G_1 and G2G_2 both are. It follows that the following two conjectures of van der Holst cannot both hold: (a) a graph is 4-flat if and only if μ≤5\mu\le5; (b) the Heawood family is the complete list of excluded minors for 4-flat graphs. The lower bound μ≥6\mu\ge6 is proved by explicit matrices certified in interval and exact rational arithmetic, and the minor exclusion by exhaustive enumeration. This work has not yet been reviewed by experts. The proofs, the computer checks and the text were produced by AI models, working under the author's direction.

Author comments: Zenodo archive: https://doi.org/10.5281/zenodo.24128770. License: the paper text is deposited here under CC BY 4.0; the published code (checkers) and data stay under Apache-2.0 in their repository. Certificates and checkers, in its folders data and checks: https://github.com/6/clank-lab/tree/heawood-family-mu5-v1/results/heawood-family-mu5

Primarily AI-generated textHuman understanding: some parts4-flat graphsColin de Verdière invariantHeawood familyexcluded minorsintrinsically knotted graphs
Nov 20, 20268 pages
PDFView work

math.DS — Dynamical Systems

Complete periodicity of perpendicular billiards in rational triangles of prime denominator

Contributed by Joshua Boorstein

Let Δ\Delta be a triangle with angles πai/N\pi a_i/N, gcd⁡(a0,a1,a2)=1\gcd(a_0, a_1, a_2) = 1, and NN odd. The directions perpendicular to the sides of Δ\Delta form one orbit under the reflection group, and a companion note showed that this direction class is completely periodic whenever it has no swapped pair: two vertex-to-vertex billiard paths, each the reverse of the other, that meet no side at a right angle. Let pp be the number of swapped pairs. We prove that when NN is prime there are no swapped pairs, so the class is completely periodic and every regular orbit in it meets a side at a right angle. This answers the note's conjecture at prime NN and proves Boshernitzan's Conjecture 2.2(b) for every rational triangle with prime denominator placed with a side horizontal. The proof has two halves: a residue modulo 1−ζN1 - \zeta_N rules out paths between distinct vertices (at an odd prime power ℓk\ell^k it forces ℓ\ell to divide the third angle's numerator), and at prime NN, where the first homology is one-dimensional over Q(ζN)\mathbb{Q}(\zeta_N), a closed path is homologous to its mirror image, which an orientation-reversing involution forbids unless they coincide. At composite odd NN swapped pairs exist, but if no signed sum of their lengths vanishes, every regular orbit of the class still meets a side at a right angle; so p≤1p \leq 1 never breaks complete periodicity at odd NN, unlike at even NN. This criterion applies with pp unbounded: the triangles (3,6m+2,12m+4)(3, 6m + 2, 12m + 4) and (3,6m+1,12m+5)(3, 6m + 1, 12m + 5) have exactly p=mp = m, with independent lengths for all practical mm (computer-assisted). And it is sharp: on four explicit intervals of triangles a pair of mirror-image cylinders meets no side at a right angle (computer-assisted).

Author comments: First version. Builds on "Singular perpendicular orbits and complete periodicity in rational triangles" (hexagon:2611.00304). Code: https://doi.org/10.5281/zenodo.24251628

Primarily AI-generated textHuman understanding: some partsBoshernitzan conjecturecomplete periodicitycyclotomic fieldsperpendicular orbitsprime denominatorrational billiardsrational trianglessaddle connectionstranslation surfaces
Nov 20, 202626 pages
PDFView work

math-ph — Mathematical Physics

Semiclassical Asymptotics of Wigner 3j and 6j Symbols at Growing Rank: Phase Horizons and Turning Connections

Contributed by Antony Lewis

Wigner 3j and 6j symbols encode angular-momentum coupling and recoupling. Their large-spin asymptotics connect to tetrahedral geometry, three-dimensional quantum gravity and quantum topology. We study the intermediate regime in which the rank of a two-large/one-small 3j, one-small 6j, or one-small q-6j symbol grows with the large scale N. In Weyl-midpoint coordinates j+1/2, their exact rank recurrences belong to a common class of even centered Jacobi chains. For this class we identify a generic phase-coherence horizon at rank of order N^{2/3}, where the leading quadratic phase-defect coefficient chi is nonzero. On compact turning-free corridors, a Hamilton-Jacobi effective-angle pullback approximates the physical solution to O(N^{-2}) in natural gauge, uniformly from fixed rank to fixed positive rank ratio; a real discrete-flux amplitude improves the bound to O(N^{-3}) without a new phase correction. Bulk zeros are located to O(N^{-4}), with an O(N^{-3}) Bohr-Sommerfeld law. At simple rank turns with lattice-quantized action we obtain a physically normalized Airy connection; under a forbidden-side bound, its turning-layer bracket is Ai(t) + N^{-4/3} varpi Ai'(t) + O(N^{-2}). Exact hyperbolicity proves that bound for all three symbol families and extends the uniform Airy law through a fixed forbidden-side neighbourhood except for an O(N^{-1} log N) collar at the outer end of that neighbourhood. For 6j and q-6j the rank momentum is a Euclidean or hyperbolic tetrahedral dihedral angle, and the q-6j turning action obeys an exact Schlafli-type quantization identity.

Author comments: Sequel to Hexagon 2611.00533v1 (fixed-rank asymptotics). 90 pages, 1 figure. A companion technical supplement and the verification programs are in the GitHub repository cited in the paper.

Primarily AI-generated textHuman understanding: no partsAiry turning pointHahn polynomialsRacah polynomialsWigner 3j symbolsWigner 6j symbols
Nov 20, 202693 pages
PDFView work

math.AG — Algebraic Geometry

The degree pair (88,132) in the plane Jacobian problem: exclusion of the shape with starting corner (11,33) and final corner (19/4,8)

Contributed by David Niedbala Giraudin

In the list of Guccione, Guccione, Horruitiner and Valqui of the possible shapes of a counterexample to the plane Jacobian conjecture with degrees at most 150, exactly one shape has maximal degree 132, up to the exchange of the two polynomials: the standard (2,3)-pairs of degrees (88,132) with starting corner (11,33) and final corner (19/4,8). We show that no such pair exists, when it is normalised as in Corollary 5.21 of Guccione-Guccione-Valqui. The two sides of the Newton polygon are described by the results of Guccione-Guccione-Valqui. In suitable polynomial coordinates the pair is confined to an explicit finite system of polynomial equations. Its leading part has exactly two solutions, defined over Q(sqrt(-3)) and exchanged by its non-trivial automorphism; for each of them the system is solved order by order by linear algebra over that field, and the compatibility conditions of the first twelve orders, six polynomials in three unknowns, generate the unit ideal. The computation is exact and is reproduced by an ancillary script (SymPy, and Singular for three Groebner bases). All statements are proved relative to the cited results. Nothing in this note has been checked by a third party.

Primarily AI-generated textHuman understanding: no partsJacobian conjectureKeller mapNewton polygonminimal counterexampleplane Jacobian conjectureregular corner
Nov 20, 20266 pages
PDFView work

math.NT — Number Theory

Cases of the Agashe–Ribet–Stein Conjecture

Contributed by Hernandez Juan

We prove the Agashe–Ribet–Stein inequality for optimal elliptic curves over (\mathbb{Q}) at every prime (p\geq 5), at (p=3) when (v_3(N)\leq 4), and at (p=2) when (v_2(N)\leq 3), where (N) is the conductor.

Primarily AI-generated textHuman understanding: no parts
Nov 20, 2026103 pages
PDFView work

math-ph — Mathematical Physics

Quantum permutations and the Standard Model algebra

Contributed by Teo Banica

The finite part of the Standard Model, in the Chamseddine--Connes approach, has algebra AF=C⊕H⊕M3(C)A_F=\mathbb C\oplus\mathbb H\oplus M_3(\mathbb C), and its quantum isometry groups were computed by Bhowmick, D'Andrea and Dabrowski. We explain how the quantum automorphism group of the complex algebra BF=C⊕C⊕M2(C)⊕M3(C)B_F=\mathbb C\oplus\mathbb C\oplus M_2(\mathbb C)\oplus M_3(\mathbb C) generated by AFA_F, with its canonical trace, is a cocycle twist of the quantum permutation group S15+S_{15}^+, and how the color parts of the quantum isometry groups are twists of S9+S_9^+, and of a quantum group G3⊂S9+G_3\subset S_9^+ preserving an oriented area tensor on F32\mathbb F_3^2. We prove that G3G_3 is infinite, with classical version of order 216216, while the quantum symmetry group of the unoriented area tensor is classical, of order 432432. With the trace coming from the fermions, the coaction preserves the weak and color summands separately, and the quantum automorphism group becomes a twist of S4+ ∗^ S9+S_4^+\,\hat{*}\,S_9^+. We also discuss matrix models and maximality, the fermions and the Heisenberg group of order 2727, the untwisting of color, which leads to color Lie algebras in the sense of Rittenberg, Wyler and Scheunert, the spectral action, and the mixing matrices.

Primarily AI-generated textHuman understanding: some partsQuantum permutationStandard Model
Nov 20, 202638 pages
PDFView work

math.AC — Commutative Algebra

Vasconcelos' conjecture on the module of differentials

Contributed by Chung Pang Mok, Yiqi Xu

Let kk be a field and let SS be a local kk-algebra essentially of finite type whose module of Kähler differentials ΩS/k\Omega_{S/k} has finite projective dimension. A conjecture of Vasconcelos, in the form studied by Herzog and Briggs, asserts that SS is then a complete intersection when char⁡k=0\operatorname{char}k=0. We give a complete proof, in particular one independent of the Eisenbud--Mazur conjecture, that SS is a reduced complete intersection when char⁡k=0\operatorname{char}k=0, and, over an arbitrary field, when some minimal prime of SS is a generic point at which SS is a field separably generated over kk; in the latter case pd⁡SΩS/k≤1\operatorname{pd}_S\Omega_{S/k}\le1 and SS is essentially smooth at all of its generic points. In positive characteristic pp, Vasconcelos' conjecture for reduced algebras holds for every such algebra exactly when [k:kp]≤p[k:k^p]\le p.

A mix of human-written and AI-generated textHuman understanding: all partsKähler differentialschange of ringscomplete intersectionsconormal moduleimperfect fieldsprojective dimension
Nov 20, 202623 pages
PDFView work

math.CO — Combinatorics

The ordered 2x2 corner pattern: a removal exponent of at least 9/2, and other partial results

Contributed by David Niedbala Giraudin

Let P = [[1,0],[1,1]]. An ordered induced copy of P in a binary matrix is given by rows i<j and columns c<d with entries (1,0) in row i and (1,1) in row j. Whether P admits a polynomial removal lemma is, to our knowledge, open; it is the last open 2x2 case. This note does not settle it and records partial results. Main result: for every q >= 2 we construct a square binary matrix of side n = 6q^3, with exactly n/6 copies of P, each on a pair of adjacent rows, these pairs being disjoint, whose distance to P-freeness is exactly (n/6)^{4/3} + n/6 entry changes; consequently any removal exponent for P is at least 9/2. Further results: (1) if the columns are split into m consecutive intervals on each of which the matrix is P-free, and any two rows can be made P-free by deleting at most K columns, then the n x n matrix is within 6 m n^{3/2} sqrt(K) + 3mn entry changes of a P-free matrix; (2) two explicit families show that no bound of the form CK per row, or CKn in total, holds with an absolute constant, even for two intervals; (3) for matrices made of two interleaved "staircase" classes we give a repair with at most 4K changes per row; (4) the block-repair lemma used by Lupini for the 2x2 identity has no direct analogue for P; (5) for matrices in which every copy uses two adjacent rows, we give two safe repair moves and a matrix with a single copy at linear distance from P-freeness. Statements are labelled proved, computed or open. The results are established facts whose novelty has not been verified. The note was prepared with an AI model; the proofs were examined by independent AI reviews and by computation, and nothing has been checked by a third party.

Primarily AI-generated textHuman understanding: no partsedit distanceforbidden submatrixordered binary matricespolynomial removalproperty testingremoval lemma
Nov 20, 202611 pages
PDFView work

math.OC — Optimization and Control

All-Order Robust Strictly Positive Real Synthesis for Wide-Interval Polynomial Families

Contributed by Tiancheng Xu

We establish a uniform all-order existence theorem for robust strictly positive real (SPR) synthesis of Hurwitz-stable interval polynomial families. Specifically, for every order n≥1n \ge 1, we prove that a common real SPR numerator of exact degree nn always exists whenever the lower endpoint of each interior coefficient interval is at most 10−510^{-5} times its upper endpoint, while the constant and leading coefficients vary over arbitrary compact positive intervals. The threshold 10−510^{-5} is independent of both the polynomial order nn and the stability margin of the family. Under whole-box Hurwitz stability, such wide interior variation forces geometric separation between successive characteristic frequency scales, decoupling the synthesis constraints into nn frequency bands; combining Brouwer's fixed-point theorem in small-margin bands with bandwise strict convexity yields a common exact-degree-nn SPR numerator across the entire family.

Primarily AI-generated textHuman understanding: some partsHurwitz stabilitycommon numeratorinterval polynomialsscale separationstrictly positive real synthesis
Nov 20, 20267 pages
PDFView work

math.OC — Optimization and Control

Counterexamples to Robust Strictly Positive Real Synthesis for High-Order Interval Polynomials

Contributed by Tiancheng Xu

We show that robust Hurwitz stability does not guarantee equal-degree strictly positive real (SPR) synthesis for high-order interval polynomial families. Specifically, for every order n≥10n \ge 10, we construct a monic Hurwitz-stable interval polynomial family with rational endpoints and positive width in every nonleading coefficient such that every nonzero real numerator of degree at most nn produces a strictly negative real part at some member and some positive frequency. At order ten, twelve fixed vertex--frequency evaluations on four Kharitonov vertices form a matrix of full column rank 1111 admitting a strictly positive linear dependence, ruling out all nonzero real numerators of degree at most 1010 (even weakly). An additional negative moment enables inductive low-end degree lifting a(s)↦sa(s)+ηa(s) \mapsto s a(s) + \eta to propagate this finite obstruction to every order n≥10n \ge 10.

Primarily AI-generated textHuman understanding: some partsHurwitz stabilitycounterexamplesdegree liftinginterval polynomialsstrictly positive real synthesis
Nov 20, 20266 pages
PDFView work

math.AG — Algebraic Geometry

The degree pair (56,140) in the plane Jacobian problem: exclusion of the shape with starting corner (7,21) and final corner (13/7,3)

Contributed by David Niedbala Giraudin

In the list of Guccione, Guccione, Horruitiner and Valqui of the possible shapes of a counterexample to the plane Jacobian conjecture with degrees at most 150, the family F_11 contributes one shape: the standard (2,5)-pairs of degrees (56,140) with starting corner (7,21) and final corner (13/7,3). We show that no such pair exists, when it is normalised as in Corollary 5.21 of Guccione-Guccione-Valqui. The two sides of the Newton polygon are described by the results of Guccione-Guccione-Valqui; the left side is reduced as in the treatment of the corner (7,21) by the four authors for the degrees (56,84). In suitable polynomial coordinates the pair is then confined to an explicit finite system of polynomial equations, which has no solution: a chain of linear eliminations with rational coefficients leads to 840=0. The eliminations are reproduced by an ancillary script, which also confirms the result by a Groebner basis computation. All statements are proved relative to the cited results. Nothing in this note has been checked by a third party.

Primarily AI-generated textHuman understanding: no partsJacobian conjectureKeller mapNewton polygonminimal counterexampleplane Jacobian conjectureregular corner
Nov 20, 20265 pages
PDFView work

math.NT — Number Theory

Rational points on intersections of cubic and quadric hypersurfaces in 2828 variables

Contributed by ESRAFIL ALI MOLLA

Let X⊂Pn−1X\subset\mathbb{P}^{n-1} be a non-singular complete intersection of a cubic and a quadric hypersurface defined over Q\mathbb{Q}. Browning, Dietmann and Heath-Brown established that XX satisfies the Hasse principle when n≥29n\geq 29. In this article we improve this result to n≥28n\geq 28. More precisely, we establish an asymptotic formula for a smoothly weighted count of the integral points on XX in an expanding box, and we deduce that XX satisfies weak approximation.

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

math.NT — Number Theory

A remark on the independence step in Shkredov's approach to Zaremba's conjecture

Contributed by David Niedbala Giraudin

The proof of Proposition 35 in Shkredov's preprint arXiv:2603.14116v2 applies a repulsion inequality (Corollary 34) to three denominators x, y, z, which must be C-independent for the vector C of formula (116) of that paper. We show that, in the situation of that proof, this independence cannot hold: the identity (75) of the paper, d(y,z)x + d(z,x)y + d(x,y)z = 0, is a nonzero integer relation whose coefficients lie in the box defined by C as soon as two of the three inequalities needed for the contradiction in that proof are satisfied. The same holds for the triple (x, y_0, z) to which Lemma 32 is applied. We also record that the deduction drawn from Proposition 35 in Section 5.2 does not address the second alternative of that proposition. These remarks concern the proofs only: they do not contradict the statements of the theorems of that paper, nor of arXiv:2605.02518v2, whose Section 4 follows the same framework. Nothing in this note has been checked by a professional mathematician or by any third party.

Primarily AI-generated textHuman understanding: no partsZaremba's conjecturebounded partial quotientscontinued fractionsconvergentslinear independencerepulsion inequality
Nov 20, 20264 pages
PDFView work

math.AG — Algebraic Geometry

The starting corner (7,35) in the plane Jacobian problem: the point (18/7,4) is not a regular corner

Contributed by David Niedbala Giraudin

The note hexagon:2611.00710 excludes the standard (2,3)-pairs of degrees (84,126) with starting triple ((7,35),(2,0),(7,-1)) under the additional condition that the polynomial h of degree 5 attached to the first edge has a single root; for the only other pattern left open by elementary arithmetic, a root of multiplicity 4 and a simple root, that note relied on the list of Guccione, Guccione, Horruitiner and Valqui. We show that (18/7,4) is not a regular corner of any (2,3)-pair in K[x^{+-1/7},y]. Hence the condition on h is automatic, and the theorem of that note holds for every pair satisfying the other standing data of that note. The proof uses only the propositions of Guccione-Guccione-Valqui on regular corners, applied to every root of the edge polynomial, together with elementary arithmetic, which is reproduced by an ancillary script. The argument has not yet been examined by specialists.

Primarily AI-generated textHuman understanding: no partsJacobian conjectureKeller mapNewton polygonminimal counterexampleplane Jacobian conjectureregular corner
Nov 20, 20264 pages
PDFView work

math.AG — Algebraic Geometry

A shape of maximal degree 150 in the plane Jacobian problem: the point (18/5,8) is not a regular corner

Contributed by David Niedbala Giraudin

In the list of Guccione, Guccione, Horruitiner and Valqui of the possible shapes of a counterexample to the plane Jacobian conjecture with degrees at most 150, one shape of maximal degree 150 consists of the standard (3,2)-pairs whose chain of corners is (10,40), (18/5,8), (8/5,3). We show that (18/5,8) is not a regular corner of any (3,2)-pair in K[x^{+-1/5},y]; hence, by a theorem of the four authors, no such pair exists. As in the note hexagon:2611.00709 on the degree pair (126,84), the proof of the theorem uses only results of Guccione-Guccione-Valqui, applied to every root of the edge polynomial, together with elementary arithmetic, which is reproduced by an ancillary script. The argument has not yet been examined by specialists.

Primarily AI-generated textHuman understanding: no partsJacobian conjectureKeller mapNewton polygonminimal counterexampleplane Jacobian conjectureregular corner
Nov 20, 20264 pages
PDFView work

math.QA — Quantum Algebra

Quantum affine representations and cluster characters

Contributed by Hernandez Juan

We prove that cluster monomials in the shifted cluster algebra of finite simply laced type represent real simple classes. We establish the correspondence between rigid objects and real simple modules in every finite Hernandez--Leclerc window after removing frozen tensor factors, including the correspondence between indecomposable objects and prime modules, and prove the generic-kernel formula for their truncated qq-characters. We disprove Hernandez's conjectural description of simple modules over truncated shifted quantum affine algebras by a type G2G_2 counterexample.

Primarily AI-generated textHuman understanding: some parts
Nov 20, 202661 pages
PDFView work

math-ph — Mathematical Physics

A Finite-Regulator Variational–Stochastic Programme: Geometry, Gauge Fields, Matter, and the Arrow of Time

Contributed by Shipei Hu

We develop a finite-regulator variational–stochastic programme organized by four principles: structured admissible change; compatible transport, dissipation and fluctuations; selection relative to a reference path law; and consistent observation across descriptions. The central question is which relationships between motion, statistics and response follow from shared dynamical data. An exactly solved finite model shows how one transition operator gives thermal relaxation, growth-weighted population dynamics and Bayesian updating. Its unweighted occupancy, selected population endpoints and driven histories have distinct limiting distributions, all determined by the same specified rates. Equilibrium and kinetic inputs then predict a selection response. A martingale constraint gives a financial probability selection, while an underdamped oscillator connects Hamiltonian motion, thermal relaxation and fluctuation–response through one matched reservoir. These examples expose the common operations and the additional meanings supplied by each application. For the regulated field law we derive Gibbs invariance, relative free-energy balance and a quadratic path-irreversibility rate under specified boundary, covariance and reversal conditions. Matched coframe and connection variations recover Einstein–higher-curvature and Yang–Mills equations; quantified remainders delimit their usual low-energy forms. Canonical Yang–Mills dynamics require constant kinetic coefficients. Stable-pole, stress Ward-identity and universal-coupling assumptions connect matter masses, WKB trajectories and tensor-sector inertial–gravitational mass equality. A boundary-dependent Schur criterion characterizes conditional Machian closure. Additive vacuum shifts show why equilibrium alone does not select the cosmological constant, and the declared 331 candidate is a realization rather than a unique group-selection theorem. Coefficient-identification bounds and observation theorems determine which reduced quantities shared calibrated inputs fix. Exact Haar–Gaussian Gram bounds identify six lattice-action coefficients, including a volume-uniform normalized estimate on a periodic family; hidden states, sampling and operator choice delimit this identification. Finite fluid, quantum-noise and scalar-source models supply further balance and response relations. The matched finite-Galerkin fluid projection has injection, transfer and dissipation balances without establishing a continuum cascade. Bell-local, measurement-independent classical models obey CHSH, and shared noise parameters constrain coherence and repeated-readout correlations. For a specified metric common-weight scalar branch, a nonlinear conformal-slope bound, massive-fluid balance and coercive static-response estimate connect its coupling to a source-conditioned circular-radiation threshold. The trace-response illustration lies below three published binary-summary errors; it neither supplies nuclear sensitivities nor excludes arbitrary scalar theories. The construction distinguishes a shared variational organization from a uniquely selected microscopic theory. Physical entropy production requires explicit reservoirs and local detailed balance; quantum completion requires positive physical states and measurement rules, with reflection positivity additionally needed for Euclidean reconstruction. Synthetic and retrospective calculations illustrate conditional predictions. Regulator-independent quantization, unique group–matter selection, independently fixed fundamental parameters, the Yang–Mills mass gap and continuum turbulence remain separate research problems.

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

math.AG — Algebraic Geometry

The degree pair (84,126) in the plane Jacobian problem: exclusion of the shape with final corner (19/7,5)

Contributed by David Niedbala Giraudin

In the list of Guccione, Guccione, Horruitiner and Valqui of the possible shapes of a counterexample to the plane Jacobian conjecture with degrees at most 150, two shapes have maximal degree 126. One of them consists of the standard (2,3)-pairs of degrees (84,126) with starting corner (7,35) and final corner (19/7,5), normalised as in Corollary 5.21 of Guccione-Guccione-Valqui. We show that no such pair exists. The two sides of the Newton polygon are described by the results of Guccione-Guccione-Valqui; in suitable polynomial coordinates they confine the pair to an explicit finite system of polynomial equations, which is solved order by order and has no solution. All statements are proved relative to the cited results; the final step is an exact computation, reproduced by an ancillary script (SymPy, and Singular for one ideal membership). The other shape of maximal degree 126 is the subject of a companion note. The argument has not yet been examined by specialists.

Primarily AI-generated textHuman understanding: no parts
Nov 20, 20265 pages
PDFView work

math.AG — Algebraic Geometry

The degree pair (126,84) in the plane Jacobian problem: the point (16/3,10) is not a regular corner

Contributed by David Niedbala Giraudin

In the list of Guccione, Guccione, Horruitiner and Valqui of the possible shapes of a counterexample to the plane Jacobian conjecture with degrees at most 150, two shapes have maximal degree 126. One of them consists of the standard (3,2)-pairs of degrees (126,84) whose chain of corners is (12,30), (16/3,10), (11/6,3). We show that (16/3,10) is not a regular corner of any (3,2)-pair in K[x^{+-1/3},y]; hence no such pair exists, and the shape of maximal degree 144 of the same list whose chain passes through (16/3,10) does not occur either. The proof uses only the propositions of Guccione-Guccione-Valqui on regular corners, applied to every root of the edge polynomial at that corner and not only to the root which generates the next corner of the chain, together with elementary arithmetic, which is reproduced by an ancillary script. The other shape of maximal degree 126 is the subject of a companion note. The argument has not yet been examined by specialists.

Primarily AI-generated textHuman understanding: no partsJacobian conjectureJacobian pairKeller mapsNewton polygonplane Jacobian problemregular corners
Nov 20, 20264 pages
PDFView work

math.PR — Probability

The exact Poisson–binomial comparison in every dimension

Contributed by Christopher D. Long

For coordinatewise ordered Bernoulli parameters with a prescribed total mean gap, the maximum difference of count tails is minimized by homogeneous parameters. For a nondegenerate gap 0<Δ<n0<\Delta<n, in odd dimension n=2m+1≥3n=2m+1\ge3 the two minimizers are the homogeneous pairs whose likelihood ratios equal one at count mm or m+1m+1; in even dimension n≥4n\ge4 the unique minimizer is the complementary homogeneous pair. We prove the comparison and these equality statements by a global stationary-point reduction, with all boundary faces included. A normalized switch-mass identity orders the homogeneous switching values. The same extremizers give the exact product total-variation minimum. The exceptional two-dimensional equality families are classified in the appendix.

Author comments: Lean 4 formalization and verification ledger: https://github.com/long-mathematics/poisson-binomial-comparison/tree/b34cde620016c85e5c7d5461630c0fde3f098d4b

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

math.CO — Combinatorics

Existence of locally toroidal regular 4-polytopes

Contributed by Peter Graham

We prove the existence half of Schulte–Weiss Problem 16 (2006) and McMullen–Schulte Conjecture 10C7 (2002): the universal regular 4-polytope {{4,4}(s,0),{4,4}(u,0)}\{\{4,4\}_{(s,0)},\{4,4\}_{(u,0)}\} exists for every pair of distinct odd integers s,u≥3s,u\geq3, with no coprimality assumption. Here {4,4}(s,0)\{4,4\}_{(s,0)} is the quotient of the square tessellation by sZ2s\mathbb Z^2. Finiteness and group classification remain open. The proof constructs four matrices over a finite field of characteristic two whose local subgroups are isomorphic to the prescribed toroidal groups. A commutator obstruction shows that these subgroups meet exactly in the subgroup on their two shared generators; this equality lifts to the universal presentation. The group theorem, the geometric identification of the toroidal maps, and the construction and universality of the resulting abstract polytope are formalized in Lean. This work has not yet been reviewed by experts. The proofs, the Lean formalization and the text were produced by AI models, working under the author's direction.

Author comments: Version 4 of the work published at https://doi.org/10.5281/zenodo.23753810 (October 29, 2026). Lean 4 development, in its folder lean: https://github.com/6/clank-lab/tree/locally-toroidal-polytopes-v4/results/locally-toroidal-polytopes (Lean v4.32.2; Mathlib pinned in lake-manifest.json). Lean checks exactly two headline theorems, for all distinct odd s, u >= 3: P16c.Main.p16c (Main.lean), the group statement: in the presented group Gamma(s,u) the four generators are involutions, adjacent products have order exactly 4, non-adjacent generators commute, the intersection property holds for every pair of generator subsets, and its facet and vertex-figure subgroups are isomorphic, generator to generator, to [4,4]_(s,0) and [4,4]_(u,0), of orders 8s^2 and 8u^2; and P16c.p16c_polytope_geometric (StatementTorus.lean), the polytope statement: the coset poset of Gamma(s,u) is a regular 4-polytope on which Gamma(s,u) acts as its automorphism group, its facets and vertex-figures are isomorphic to the square tori {4,4}_(s,0) and {4,4}_(u,0) (defined from grid faces modulo the lattice), and it covers every regular 4-polytope with these facets and vertex-figures. Both use only the standard axioms propext, Classical.choice and Quot.sound: Axioms.lean guards their #print axioms output with #guard_msgs, so any other axiom fails the build. No Lean files are part of this deposit. The paper text is deposited under CC BY 4.0; the Lean code stays Apache-2.0 in its published repository.

Primarily AI-generated textHuman understanding: some partsSchulte-Weiss Problem 16abstract regular polytopeslocally toroidal polytopesstring C-groupstoroidal maps
Nov 20, 202610 pages
PDFView work

math.ST — Statistics Theory

An explicit determinantal formula for limits of iterative proportional fitting with a binary variable

Contributed by Shankar Sivarajan

Iterative proportional fitting rescales a table cyclically until it has prescribed margins. For a three-way table and its three two-way margins, the limit is in general an algebraic function of the data of degree greater than one, and from the uniform seed table it is the maximum likelihood estimate under the no-three-way-interaction model. We study tables in which one variable is binary, a setting that includes logistic regression of a binary response on two categorical factors and stratified 2×22\times2 tables with a common odds ratio. For 2×2×K2\times2\times K tables, we show that the limit is determined by a root of the determinant of an explicit 2K×2K2^K\times2^K matrix, built from one 2×22\times2 companion pencil per stratum, and we identify all of its roots. For the uniform seed, this exhibits the unconditional maximum likelihood estimate of the common odds ratio as a root of a polynomial of degree 2K−12^K-1, and gives an elementary proof that this is the maximum likelihood degree of the model. For 2×J×K2\times J\times K tables and generic data, the fitting equations form a multiparameter eigenvalue problem, which yields a matrix pencil of size JK−1KJ−1J^{K-1}K^{J-1} whose eigenvalues are the values of one cell at all complex solutions. Finally, every complex solution is a fixed point of the iteration; we characterize the real ones that are linearly attracting, and show that for 2×2×K2\times2\times K tables and generic margins only the limit is attracting.

Primarily AI-generated textHuman understanding: some partscommon odds ratiocontingency tablesiterative proportional fittingmatrix pencilsmaximum likelihood degreemultiparameter eigenvalue problemno-three-way interaction model
Nov 20, 202615 pages
PDFView work

math.NT — Number Theory

Many odd-power reciprocal sums of Lucas sequences are irrational

Contributed by Shawn Krisman

Let a≥3a\ge3, let U0=0U_0=0, U1=1U_1=1, Un+1=aUn−Un−1U_{n+1}=aU_n-U_{n-1}, and let δ=±1\delta=\pm1. We prove that 11 and the numbers ∑n≥1δn/Unl\sum_{n\ge1}\delta^n/U_n^l, l=1,3,…,A−1l=1,3,\dots,A-1, span a Q\mathbb{Q}-vector space of dimension at least (π/12+π2+o(1))A(\pi/\sqrt{12+\pi^2}+o(1))\sqrt A. So infinitely many of these sums with ll odd are irrational, for instance infinitely many of ∑n1/F2nl\sum_n1/F_{2n}^l. With the known linear independence of 11, ∑nδn/Un\sum_n\delta^n/U_n and ∑nδn/Un3\sum_n\delta^n/U_n^3, one of ∑nδn/Unl\sum_n\delta^n/U_n^l, l=5,7,…,23l=5,7,\dots,23, lies outside the span of these three numbers. The proof adapts the author's construction for odd qq-zeta values at real quadratic units, with a weighted bilateral sum. No single sum such as ∑n1/Un5\sum_n1/U_n^5 is decided, and sequences of norm −1-1, such as the Fibonacci numbers, are not covered.

Primarily AI-generated textHuman understanding: no partsFibonacci numbersLambert seriesLucas sequencesNesterenko's criterionirrationalitylinear independencereciprocal sums
Nov 20, 202612 pages
PDFView work

math.NT — Number Theory

Products of two logarithms and arithmetic holonomy bounds

Contributed by Shawn Krisman

We prove, assuming the arithmetic holonomy bound of Calegari, Dimitrov and Tang (Theorem 7.0.1 of their preprint arXiv:2408.15403), that 11, log⁡(1+1/q)\log(1+1/q), log⁡(1−1/q)\log(1-1/q) and log⁡(1+1/q)log⁡(1−1/q)\log(1+1/q)\log(1-1/q) are linearly independent over Q\mathbb{Q} for every integer 26≤q≤5326\le q\le53. Together with Hata's theorem for q≥54q\ge54 this gives the four-term independence for every q≥26q\ge26. In particular the seven numbers log⁡(1+1/N)log⁡(1+1/(N+1))\log(1+1/N)\log(1+1/(N+1)), 25≤N≤3125\le N\le31, are irrational; irrationality was previously known for N≥32N\ge32 (Lysov). The proof feeds Lysov's explicit type II Hermite–Padé forms into the holonomy bound, and replaces the arithmetic of the forms by an analytic input: the monodromy of a minimal differential operator of order 13, which we show to be irreducible by interval-arithmetic certificates. Conditionally on the published form of the Calegari–Dimitrov–Tang argument for products of two logarithms, we also widen their Theorem C from ∣m/n−1∣<10−6|m/n-1|<10^{-6} to ∣m/n−1∣<3⋅10−6|m/n-1|<3\cdot10^{-6}, which gives infinitely many new irrational products log⁡(1+1/m)log⁡(1+1/n)\log(1+1/m)\log(1+1/n) with ∣m−n∣≥2|m-n|\ge2, and we show by pooling several pairs that at most one exceptional pair class exists with ∣m/n−1∣<5⋅10−5|m/n-1|<5\cdot10^{-5}, and at most two with ∣m/n−1∣<10−4|m/n-1|<10^{-4}. All certificates are exact or rigorous ball arithmetic and can be reproduced from the accompanying code.

Primarily AI-generated textHuman understanding: no partsHermite–Padé approximationarithmetic holonomy boundscomputer-assisted proofinterval arithmeticirrationalitylinear independencemonodromyproducts of logarithms
Nov 20, 202627 pages
PDFView work

math.NT — Number Theory

Linear independence of reciprocal and reciprocal-cube sums of Lucas sequences

Contributed by Shawn Krisman

Let η>1\eta>1 be a unit of a real quadratic order, of norm Q=±1Q=\pm1, and let Un=(ηn−ηˉn)/(η−ηˉ)U_n=(\eta^n-\bar\eta^n)/(\eta-\bar\eta) be its Lucas sequence. We prove that for each sign δ=±1\delta=\pm1 the three numbers 11, ∑n≥1δn/Un\sum_{n\ge1}\delta^n/U_n and ∑n≥1(δQ)n/Un3\sum_{n\ge1}(\delta Q)^n/U_n^3 are linearly independent over Q\mathbb{Q}. For the Fibonacci numbers this says that 11, ∑n(−1)n/Fn\sum_n(-1)^n/F_n, ∑nFn−3\sum_nF_n^{-3} are linearly independent, and so are 11, ∑nFn−1\sum_nF_n^{-1}, ∑n(−1)n/Fn3\sum_n(-1)^n/F_n^3; for F2nF_{2n} it gives 11, ∑nF2n−1\sum_nF_{2n}^{-1}, ∑nF2n−3\sum_nF_{2n}^{-3}. In particular ∑n(−1)n/Un3\sum_n(-1)^n/U_n^3 is irrational for every such sequence. The proof is the Hankel-determinant construction of our earlier papers on ∑nUn−3\sum_nU_n^{-3}, run with the operator c3θ(θ+1)+c1c_3\theta(\theta+1)+c_1, where the integers (c3,c1)(c_3,c_1) come from a hypothetical linear relation, and with a sign attached to the weights. The whole argument is formalised in Lean 4 with Mathlib, using only the standard axioms.

Primarily AI-generated textHuman understanding: no partsFibonacci numbersHankel determinantsLeanLucas sequencesPell numbersirrationalitylinear independence
Nov 20, 202617 pages
PDFView work

math.CA — Classical Analysis and ODEs

Erdős's 1974 distance-product volume problem resolved: the ball as unique maximizer, sharp inradius stability, and other miscellanea

Contributed by Dave Goel

We consider the set of all points of ℝ^d whose distances to n given points have product at most one. Erdős (1974) asks how large its volume can be. We show that in every dimension d ≥ 3, and for every integer n ≥ 1, this volume is at most that of the unit ball. Equality holds only and exactly when all n given points coincide. This completely answers Erdős's question; in the plane, the same statement is Pólya's theorem of 1928. In fact we settle a more general problem, with weighted points. Our theorem also shows that the two-point counterexample in dimension three, reported by Erdős in 1976 and repeated in 2018 and 2026, cannot exist. We also prove a sharp stability estimate: for each fixed d ≥ 3, if such a set falls short of the maximal volume by a small fraction D, it still contains a ball of radius at least 1 − (1/(d − 2) + o(1))D as D tends to zero, uniformly in the number, weights and positions of the points. The same holds for every compactly supported probability measure in place of the points. Two equally weighted points approaching each other show that the coefficient 1/(d − 2) cannot be lowered. Finally, the product of the distances is at most one exactly when their geometric mean is at most one, and we ask what happens when the geometric mean is replaced by the weighted power mean of order p. We show that the same volume bound holds for all placements exactly when p ≥ 2 − d, and that in this range equality again requires coincident points. For p ≥ 2 − d we deduce the bound from the weak estimate of Tang and Wang; for p < 2 − d the polarization theorem of Erdélyi and Saff gives placements that violate it. We prove the equality statement at the endpoint p = 2 − d directly, and for p < 2 − d we compute the leading term of the excess volume of the region of two nearby points.

Author comments: The short version is available on Zenodo: https://doi.org/10.5281/zenodo.24378921

A mix of human-written and AI-generated textHuman understanding: some partsGeometric mean of distancesNewtonian capacityequilibrium measureinradiusspatial lemniscate
Nov 20, 202620 pages
PDFView work

math.CA — Classical Analysis and ODEs

Erdős's 1974 distance-product volume problem resolved: the ball is always the unique maximizer in d ≥ 2

Contributed by Dave Goel

We consider the set of all points of ℝ^d whose distances to n given points have product at most one. Erdős (1974) asks how large its volume can be. We show that in every dimension d ≥ 3, and for every integer n ≥ 1, this volume is at most that of the unit ball. Equality holds only and exactly when all n given points coincide. This completely answers Erdős's question; in the plane, the same statement is Pólya's theorem of 1928. In fact we settle a more general problem, with weighted points. Our theorem also shows that the two-point counterexample in dimension three, reported by Erdős in 1976 and repeated in 2018 and 2026, cannot exist. Our second theorem is a stability estimate in dimension three: if such a set falls short of the maximal volume by a small fraction D, it still contains a ball of radius at least 1 − D − o(D) as D tends to zero, uniformly in the number, weights and positions of the points. The coefficient one is sharp. These results are verified in Lean.

Author comments: The expanded version is available on Zenodo: https://doi.org/10.5281/zenodo.24378911

A mix of human-written and AI-generated textHuman understanding: some partsGeometric mean of distancesNewtonian capacityequilibrium measureinradiusspatial lemniscate
Nov 20, 202617 pages
PDFView work

math.NT — Number Theory

Powerful values of quadratic polynomials

Contributed by Danny Plymesser

Let ff be a quadratic polynomial with integer coefficients, positive leading coefficient and nonsquare discriminant. We show that the number of n≤Nn\le N with f(n)f(n) powerful is O(Nϑ)O(N^{\vartheta}) for every ϑ>293/1220\vartheta>293/1220. A second bound has the exponent 389/1600389/1600 and a constant that grows only polynomially with the coefficients of ff; it is applied to pairs consisting of a 66-full or 88-full integer and a neighbouring powerful integer. A fixed-quadratic substitution also gives a bound for 1+a3t31+a^3t^3. The proofs factor f(n)f(n) in the quadratic field of its discriminant, apply a determinant method with two contact polynomials to the resulting equation of bidegree three and two, and count the points on the auxiliary curves with the lifted-curve estimate of Counting powerful products of consecutive integers. The main quadratic and mixed-full bounds are formalized in Lean 4 with Mathlib and checked by Lean’s kernel and an independent kernel; the formal statements take three 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 13 describes the verification and its scope.

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

Primarily AI-generated textHuman understanding: no partsLean 4determinant methodformal verificationintegral points on curvespowerful numbersquadratic polynomialssquarefull numbers
Nov 20, 202634 pages
PDFView work

math-ph — Mathematical Physics

A two-chirality twistor correspondence for smooth Lorentzian Ricci-flat germs

Contributed by Lior Isthmus

We give a local twistor presentation of each smooth pointed, oriented and time-oriented Lorentzian Ricci-flat four-germ with spin, at its physical scale. The two inputs are ordinary cohomology classes of weights 22 and −6-6 for the flat hypersurface twistor CR structure on R3×CP1\mathbb R^3\times\mathbb{CP}^1, whose projective line is the sphere of spin directions. In the selected weighted domain of the growth-controlled coefficient complexes, the coupled reality condition gives real transverse trace-free seeds for the metric and momentum. Starting with encoded test tensors, we take three successive normalized negative-chirality contact responses, recovering a tensor at each step. Contractions of the resulting tensors give the flat scalar and York inverses for the constraints. Initialized nonlinear transport yields maximal vacuum data and both spin gradient operators. Classical Cauchy evolution develops these data. Conversely, we extend normalized maximal-disk data to weighted vacuum data on R3\mathbb R^3, with exact agreement on a smaller disk, and decode the extension. The inverse gives a comparison class of presentations, with smooth local selections in finite-dimensional families and effective descent. A covariant wave kernel, determined modulo jointly smooth kernels, transports the degree-one evaluation section on each sky and its point connection between slices. Every pointed physical isometry with a specified actual spin lift has a unique full source lift modulo normalized presentation cells. On analytic germs we compare the wave source with the calibrated operator source of the analytic projective twistor correspondence. After real restriction and complete formal enrichment, the initialized comparison preserves coupled reality.

Author comments: This revision updates the bibliography format for indexing. The paper and computational supplement are available at https://doi.org/10.5281/zenodo.24385872.

Primarily AI-generated textHuman understanding: some partsCR cohomologyEinstein vacuum equationsRicci-flat Lorentzian metricsmicrolocal analysisspin geometrytwistor theory
Nov 20, 2026226 pages
PDFView work

math.GN — General Topology

Mosaic spaces generated by continua and by Peano continua: answers to three questions recorded by Lavallee

Contributed by Lucas Alves de Almeida

Lavallee (1964) recorded three questions about Davison's mosaic spaces: whether a locally (mm-strongly) connected mm-continuum space must be a quasi-curve space; whether the converse of her theorem on open subspaces of mm-continuum spaces holds; and Davison's question whether a locally arcwise connected mosaic space must be a quasi-curve space. We show that all three have negative answers. Davison's question is answered by published examples of Franklin and Smith-Thomas (1979) and of van Douwen (1981), once "path-determined" is identified with "curve space", and an example sketched by Curtis (1980) bears on the first question. We give self-contained constructions and proofs: a metric space without arcs, a completely regular space in which no metric continuum captures a certain convergent sequence, and a cone construction that answers the second question. We also prove affirmative results for first countable spaces. We claim no priority for these answers.

A mix of human-written and AI-generated textHuman understanding: some partsLean 4continuacurve spacesmosaic spacespath-determined spacessequential spaces
Nov 20, 202628 pages
PDFView work

math.OC — Optimization and Control

Linear-size sparsification from self-concordant barriers

Contributed by Yilin Liu

A θ\theta-self-concordant barrier gives ε\varepsilon-sparsifiers with O(θ/ε2+r)O(\theta / \varepsilon^2 + r) summands and rr exact linear weight constraints. The proof uses a cone-positivity bound with a sharp exponent. Constrained sparsification is monotone under closed lifts on both sides of duality, and jointly lower semicontinuous in the cone and error tolerance. We sharpen the deterministic support bound for hyperbolicity cones and determine the minimum closed hyperbolic lift degree of the nuclear-norm epigraph. We give matching support bounds for this epigraph, the quantum relative entropy cone, and its dual.

Primarily AI-generated textHuman understanding: no partscone sparsificationconic liftshyperbolicity conesnuclear normpartial coloringself-concordant barriers
Nov 20, 20268 pages
PDFView work

math.NT — Number Theory

tlog⁡tt^{\log t} is transcendental for almost all integers tt

Contributed by Shawn Krisman

Let L~=Q‾+Q‾L\widetilde{\mathcal{L}}=\overline{\mathbb{Q}}+\overline{\mathbb{Q}}\mathcal{L} be the Q‾\overline{\mathbb{Q}}-vector space spanned by 11 and the logarithms of nonzero algebraic numbers. We prove that #{2≤t≤X: (log⁡t)2∈L~}≤π(X)+O(X3/4)\#\{2\le t\le X:\ (\log t)^2\in\widetilde{\mathcal{L}}\}\le\pi(X)+O(X^{3/4}). Hence tlog⁡t=e(log⁡t)2t^{\log t}=e^{(\log t)^2} is transcendental for all integers t≥2t\ge2 outside a set of density zero, and no relation (log⁡t−B)(log⁡t−A)=C′+γν(\log t-B)(\log t-A)=C'+\gamma\nu with A,B,C′,γA,B,C',\gamma algebraic and ν\nu a logarithm of an algebraic number holds outside that set. The proof uses Roy's strong six exponentials theorem only through configurations of exponent vectors in dimensions 22 and 33, where it makes the primitive exceptional integers a multiplicative Sidon set, and then Erdős's bound for such sets. The prime numbers show that the bound π(X)\pi(X) is the limit of the method. We also show that the configurations of exponent vectors allowed by the strong six exponentials theorem can be much larger than in dimensions 22 and 33: there are such sets of 2r2^r points in Pn−1\mathbb{P}^{n-1} with n=1+r(r+1)/2n=1+r(r+1)/2. No individual number such as 2log⁡22^{\log 2} is decided.

Primarily AI-generated textHuman understanding: no partsalpha^{log alpha}linear forms in logarithmsmultiplicative Sidon setssix exponentials theoremtranscendence
Nov 20, 202611 pages
PDFView work

math.NT — Number Theory

Sharp finite cases of the Erdős–Surányi interval-product problem: g(4) = 5 and g(5) = 6

Contributed by John Tripodo

Let g(n)g(n) be the Erdős–Surányi function of Erdős Problem #708: the least kk such that, for every set AA of nn distinct integers at least 22 and every interval II of max⁡A\max A consecutive integers, some set of at most kk elements of II has product divisible by ∏a∈Aa\prod_{a\in A} a. We prove g(4)=5g(4)=5 and g(5)=6g(5)=6. The lower bound g(n)≥n+1g(n)\ge n+1 for n≥3n\ge 3 is due to Erdős and Surányi (1959). Our contribution is the matching universal upper bounds g(4)≤5g(4)\le 5 and g(5)≤6g(5)\le 6; to our knowledge these are the first exact values beyond g(3)=4g(3)=4. The four-modulus proof combines a Hall-matching reduction with gcd/lcm collision repair and an anchored proper-divisor lemma. The five-modulus proof classifies a maximal antichain-admissible assignment of the moduli to interval multiples by its occupancy shape; the hardest shapes are a squarefree four-prime exception and a (4,1)(4,1) configuration controlled by a propagation invariant. Both values, in the exact-cardinality reading of the original problem and in the at-most reading used by later work, are machine-checked in Lean 4. The formalization is registered in the Palomar registry as PALOMAR-2026-11-19-000019. The general question whether g(n)≤2ng(n)\le 2n remains open.

Author comments: First version. The lower bounds are due to Erdős and Surányi (1959); the contribution is the matching upper bounds. Both values are formalized in Lean 4 and registered in the Palomar registry as PALOMAR-2026-11-19-000019. The written arguments have had AI-assisted review only, not human refereeing. The general conjecture remains open.

Primarily AI-generated textHuman understanding: no partsErdős Problem 708Erdős–Surányi functionHall's theoremLean 4divisibility antichainsformal verificationinterval product-cover
Nov 20, 202619 pages
PDFView work

math.NT — Number Theory

Irrationality of odd q-zeta values at real quadratic units

Contributed by Shawn Krisman

For ∣q∣<1|q|<1 and odd l≥3l\ge3 let ζq(l)=∑m≥1ml−1qm/(1−qm)\zeta_q(l)=\sum_{m\ge1}m^{l-1}q^m/(1-q^m). Let qq be a unit of norm +1+1 in a real quadratic field Q(d)\mathbb{Q}(\sqrt d) with 0<∣q∣<10<|q|<1. We prove that the dimension of the Q\mathbb{Q}-vector space spanned by 1,d ζq(3),d ζq(5),…,d ζq(A−1)1,\sqrt d\,\zeta_q(3),\sqrt d\,\zeta_q(5),\dots,\sqrt d\,\zeta_q(A-1) is at least (π/12+π2+o(1))A(\pi/\sqrt{12+\pi^2}+o(1))\sqrt A, and that one of d ζq(5),…,d ζq(11)\sqrt d\,\zeta_q(5),\dots,\sqrt d\,\zeta_q(11) lies outside Q+Qd ζq(3)\mathbb{Q}+\mathbb{Q}\sqrt d\,\zeta_q(3); these seem to be the first results on odd qq-zeta values of weight at least five at an algebraic irrational qq. We also give an elementary proof that d ζq(3)\sqrt d\,\zeta_q(3) is irrational, formalised in Lean 4 with Mathlib using only the standard axioms. In particular, for a Lucas sequence (Um)(U_m) of a real quadratic unit η>1\eta>1, ∑m≥1m2(Um+1/Um−η)∉Q\sum_{m\ge1}m^2(U_{m+1}/U_m-\eta)\notin\mathbb{Q}, for instance ∑m≥1m2(Fm+1/Fm−φ)∉Q\sum_{m\ge1}m^2(F_{m+1}/F_m-\varphi)\notin\mathbb{Q}. The proofs use the very-well-poised basic hypergeometric series of Krattenthaler, Rivoal and Zudilin, whose coefficients turn out to be invariant or anti-invariant under q↦1/qq\mapsto1/q, up to a power of qq; at a unit with conjugate 1/q1/q this makes suitable integer linear forms in the twisted values d ζq(l)\sqrt d\,\zeta_q(l) small at both archimedean places. A stronger form of the weight-three statement has been claimed concurrently and independently in unverified preprints.

Primarily AI-generated textHuman understanding: no partsFibonacci numbersLambert seriesLeanLucas sequencesbasic hypergeometric seriesirrationalityq-zeta valuesreal quadratic units
Nov 20, 202621 pages
PDFView work

math.NT — Number Theory

Root separation for polynomials over Fq[T]\mathbb{F}_q[T]

Contributed by Tomislav Pejkovic

We study the minimum distance between distinct roots of a separable polynomial of degree d≥2d\ge2 over Fq[T]\mathbb{F}_q[T], with respect to the absolute value ∣T∣=q|T|=q. For reducible polynomials of height HH, the exponent d−1d-1 in the lower bound H−(d−1)H^{-(d-1)} is best possible in every degree. In characteristic two we construct absolutely irreducible polynomials that attain this bound at every height qNq^N, N≥1N\ge1. In odd characteristic pp, the exponent d−1d-1 is best possible for absolutely irreducible polynomials whenever d−1=pamd-1=p^a m with p∤mp\nmid m and m∣pa−1m\mid p^a-1. The separation exponents for irreducible and absolutely irreducible polynomials coincide for every qq and dd.

Primarily AI-generated textHuman understanding: some partsDiophantine approximationfunction fields of positive characteristicpolynomial heightroot separation
Nov 20, 202619 pages
PDFView work

math.SP — Spectral Theory

The equilateral triangle is the extremal triangle for the lowest Robin eigenvalue, for every boundary parameter

Contributed by Jason Davies

Let λ1(T,α)\lambda_1(T,\alpha) be the lowest eigenvalue of the Laplacian on a triangle TT with the Robin condition ∂νu+αu=0\partial_\nu u+\alpha u=0. Lotoreichik and Lu conjectured that, among triangles of given area, the equilateral triangle minimises λ1(T,α)\lambda_1(T,\alpha) when α>0\alpha>0 and maximises it when α<0\alpha<0. We prove both halves, with the equilateral triangle as the unique extremiser; the same holds at fixed perimeter. The proof is computer-assisted. For α>0\alpha>0 the result is new; previously the inequality was known for all triangles only when α∣T∣\alpha\sqrt{|T|} is smaller than an absolute but non-explicit constant (Ferudun). Thin triangles are handled by slicing, and α∣T∣≤1/100\alpha\sqrt{|T|}\le1/100 by an explicit vector field and a Schur-complement criterion. Near the equilateral triangle EE, the second-order perturbation constant of EE is bounded from above through certified lower bounds for two perturbed eigenvalue problems, uniformly in α\alpha. The remaining compact set of shapes is covered by 100 cells; an exact identity in the Klein model of the hyperbolic plane of shapes, together with concavity, reduces each cell to certified Crouzeix–Raviart lower bounds at its vertices, which are checked in exact integer and ball arithmetic. For α<0\alpha<0 the first proof is due to Ma (computer-assisted, 2026); ours was found independently. Write β=−α∣T∣\beta=-\alpha\sqrt{|T|}. For β≤6/5\beta\le6/5 two trial functions suffice. For β≥1.1531\beta\ge1.1531 an exact corner bound disposes of all triangles with a small angle, and on the remaining near-equilateral triangles three transplanted corner waves, with a one-step perturbation estimate, reduce the problem to a one-variable inequality, which is verified in ball arithmetic.

Primarily AI-generated textHuman understanding: no partsCrouzeix–Raviart elementsRobin LaplacianRobin eigenvaluecomputer-assisted proofinterval arithmeticisoperimetric inequalityshape optimizationtriangles
Nov 20, 202638 pages
PDFView work