Matching works

8 works

math.CO — Combinatorics

Wills' (1981) conjecture holds if and only if the dimension is at most 4, and other miscellanea

Contributed by Dave Goel

Let PP be a lattice polytope in Rn\mathbb R^n that is symmetric about the origin and has the origin as its only interior lattice point. In 1981 Wills conjectured that each coefficient gi(P)g_i(P) of the Ehrhart polynomial of PP is at most the corresponding coefficient of the cube [−1,1]n[-1,1]^n, that is, gi(P)≤2i(ni)g_i(P)\le 2^i\binom ni. Wills proved this for n≤3n\le3, and Henze showed in 2014 that it fails for every n≥7n\ge7; the dimensions 44, 55 and 66 remained open. We settle them. In dimension 44 the conjecture holds; the new bounds are g1(P)≤8g_1(P)\le8 and g2(P)≤24g_2(P)\le24, and, up to unimodular equivalence, g1(P)=8g_1(P)=8 only for the cube, one explicit 2424-cell and one explicit cross-polytope. In dimension 55 we give a polytope with 5050 vertices in [−1,1]5[-1,1]^5 whose linear Ehrhart coefficient is 101/10>10101/10>10; products with segments then give counterexamples in every dimension n≥6n\ge6. Hence Wills' conjecture holds in Rn\mathbb R^n if and only if n≤4n\le4. The proof in dimension 44 combines Ehrhart reciprocity, the lower bound theorem for triangulated 33-spheres and an exhaustive computer enumeration of about three million sets of lattice points, listed up to symmetry. This expanded version also gives a second proof of the case in which the integer functionals bounded by 11 on PP do not span R4\mathbb R^4, determines the second largest value of g2g_2 in dimension 44, discusses a width-two approach, describes the computer search for the counterexample, and describes all computations used in the proofs.

Author comments: First version: November 3, 2026. This is the expanded version of the paper "Wills' (1981) conjecture holds if and only if the dimension is at most 4", which is at https://hexagonmath.org/2611.00540 on Hexagon.

A mix of human-written and AI-generated textHuman understanding: some partsEhrhart polynomialWills' conjecturecentrally symmetric polytopeinterior lattice pointlattice polytope
Nov 16, 202626 pages
PDFView work

math.CO — Combinatorics

Wills' (1981) conjecture holds if and only if the dimension is at most 4

Contributed by Dave Goel

Let PP be a lattice polytope in Rn\mathbb R^n that is symmetric about the origin and has the origin as its only interior lattice point. In 1981 Wills conjectured that each coefficient gi(P)g_i(P) of the Ehrhart polynomial of PP is at most the corresponding coefficient of the cube [−1,1]n[-1,1]^n, that is, gi(P)≤2i(ni)g_i(P)\le 2^i\binom ni. Wills proved this for n≤3n\le3, and Henze showed in 2014 that it fails for every n≥7n\ge7; the dimensions 44, 55 and 66 remained open. We settle them. In dimension 44 the conjecture holds; the new bounds are g1(P)≤8g_1(P)\le8 and g2(P)≤24g_2(P)\le24, and, up to unimodular equivalence, g1(P)=8g_1(P)=8 only for the cube, one explicit 2424-cell and one explicit cross-polytope. In dimension 55 we give a polytope with 5050 vertices in [−1,1]5[-1,1]^5 whose linear Ehrhart coefficient is 101/10>10101/10>10; products with segments then give counterexamples in every dimension n≥6n\ge6. Hence Wills' conjecture holds in Rn\mathbb R^n if and only if n≤4n\le4. The proof in dimension 44 combines Ehrhart reciprocity, the lower bound theorem for triangulated 33-spheres and an exhaustive computer enumeration of about three million sets of lattice points, listed up to symmetry.

Author comments: First version: November 3, 2026. The expanded version of this paper, "Wills' (1981) conjecture holds if and only if the dimension is at most 4, and other miscellanea", is at https://doi.org/10.5281/zenodo.23955454 on Zenodo.

A mix of human-written and AI-generated textHuman understanding: some partsEhrhart polynomialWills' conjecturecentrally symmetric polytopeinterior lattice pointlattice polytope
Nov 16, 202613 pages
PDFView work

math.NT — Number Theory

Almost all kk-Markov numbers are unique

Contributed by Qiyue Tang

For every fixed nonnegative integer kk, we prove that almost every positive integral solution of [x^2+y^2+z^2+k(xy+xz+yz)= 3(k+1)xyz]is uniquely determined, up to permutation, by its largest coordinate.

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

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

math.NT — Number Theory

GRAM OBSERVATIONS AND THETA-SERIES RECONSTRUCTION OF EUCLIDEAN LATTICES

Contributed by Changxia Lin

A finite collection of lattice-vector lengths probes a positive-definite Gram matrix through rank-one linear functionals. We use this observation map to give a local criterion for non-identifiability and to construct an exact three-dimensional collision at a closed squared-length cutoff of one: two non-isometric lattices have identical complete truncated vector-length data, although their Gram determinants are different. A signed-cycle construction gives a higherdimensional family whose complete rank-one length multisets agree at every cutoff below an explicit threshold, with an exact first-shell discrepancy. We then turn to multi-vector data. The full degree-n Gram theta data determines every rank-n Euclidean lattice, by a basis-witness and covolume-index argument. On each compact subset of lattice moduli space, the same argument yields a finite cutoff; a determinant-one cusp family shows that the basis-witness cutoff supplied by this method cannot be uniform on the full moduli space. Finally, a published rank-32 theta-series coincidence, together with a minimum-shell spanning identity, is stabilized by orthogonal direct sums to every rank n ≥ 32. If k(n) denotes the least degree of full Gram theta data that universally determines rank-n Euclidean lattices, we obtain 4 ≤ k(n) ≤ n for n ≥ 32. The paper separates proved statements, cited lattice-theoretic input, and computational checks; it does not claim a solution of the exact minimum-degree problem.

Primarily human-written textHuman understanding: all parts
Nov 04, 202612 pages
PDFView work

math.MG — Metric Geometry

Finite Truncated Lattice-Length Data on Three-Dimensional Flat Tori

Contributed by Changxia Lin

We study what finite truncations of the lattice-length multiset can determine about a three-dimensional flat torus. For a full-rank lattice \Lambda \subset \mathbb{R}^3, let \lambda_1(\Lambda) \leq \lambda_2(\Lambda) \leq \lambda_3(\Lambda) be its successive minima, and let \mathcal{L}_T(\Lambda) record the lengths of all nonzero lattice vectors of norm at most T, counted with vector multiplicity. First, on the class defined by \lambda_1 = a and \lambda_2 > T, we prove an exact volume classification: the set of possible covolumes is (F(a,T), \infty), where F(a,T) = \frac{aT}{2}\sqrt{3T^2 - a^2}. The lower bound uses Oppenheim's classical determinant-minimization theorem for Minkowski-reduced ternary forms; an explicit perturbed basis proves every larger volume is attained. Second, we give a pair of positive-definite Gram matrices with equal diagonal entries and matching two-coordinate data but different determinants. This yields a quantitative obstruction to uniform finite identification and gives the lower bound \sqrt{3} for the worst-case identification-radius constant. Schiemann's finite theta-series determination theorem supplies the complementary upper bound \sqrt{7/2} after conversion from squared lengths to radii. We also record a cubic sign-product identity for the eight signed basis vectors and explain its limitations. All contributions are separated from classical inputs, and the possible optimality of the constant \sqrt{3} and the broader topological question are left open.

Primarily human-written textHuman understanding: all partslattice geometry; flat tori
Oct 26, 202611 pages
PDFView work

math.NT — Number Theory

Almost all Markoff numbers are unique.

Contributed by William Y. Chen

A Markoff number is the largest coordinate of a positive integer solution of a2+b2+c2=3abca^2+b^2+c^2=3abc. Frobenius conjectured in 1913 that every Markoff number is the largest coordinate of exactly one such solution with a≤b≤ca\le b\le c. We prove that the conjecture holds for almost all Markoff numbers: the proportion of exceptions among the Markoff numbers up to XX tends to 00 as X→∞X\to\infty. Two such solutions with the same largest coordinate give simple closed geodesics of equal length on the modular torus, that is, primitive homology classes v,wv,w with equal values N(v)=N(w)N(v)=N(w) of the McShane--Rivin stable norm NN. Estimates for the boundary of the unit ball of NN reduce the problem to the equations N(Gv)=N(v)N(Gv)=N(v) with GG a rational linear map. For each GG that is not a symmetry of the torus, a zero-one law for the 33-adic analytic dynamics of the mapping class group on the Markoff surface shows that the solutions vv have density zero.

Primarily AI-generated textHuman understanding: some partsMarkoff triplesmapping class group dynamicspunctured torus
Oct 16, 202634 pages
PDFView work

math.CO — Combinatorics

The Bannai–Munemasa–Venkov lattice method for strongly regular graphs: a uniform discriminant-form condition and new nonexistence results

Contributed by Anton Kovaľ

Bannai, Munemasa and Venkov, and later Nebe and Venkov, excluded tight spherical designs — among them strongly regular graphs of a special kind — by studying the lattice spanned by the design: they bound its discriminant group, pass to an even (over)lattice, and compare Gauss sums by the Milgram–Braun formula. We extend this method to arbitrary strongly regular graphs with integral eigenvalues. For an integral representation G=b(A-ρ I)+cJ that is positive semidefinite with even diagonal, an elementary identity for dual vectors ties every class of the discriminant form of a maximal even overlattice to the class of a rescaled sum of the vertex vectors. This gives a necessary condition on the parameters (v,k,λ,μ) alone: a finite quadratic module with a short list of properties must exist. Its simplest case applies the textbook congruence det≡(-1)^(n/2) (mod 4) for even lattices of odd determinant to the centred representation. A sweep of Brouwer's table (v≤1300) finds 70 complementary pairs of parameter sets listed as open that fail the condition, among them (96,35,10,14), the triangle-free set (176,25,0,4) and (169,42,5,12); the grade of evidence is given for each (hand proof, or exact computation by at least two independent programs). No existing parameter set of the table fails in any representation tested, real graphs satisfy every condition with their actual discriminant forms, and the method gives short independent second proofs of the known nonexistence of srg(75,32,10,16) and srg(289,54,1,12). The simplest case also yields an infinite family: if q is a power of a prime p≡1 (mod 4) and m is odd, there is no strongly regular graph with the parameters (q^2, m(q+1), -q+m^2+3m, m(m+1)) of the negative-Latin-square type NL_m(q). This family, the parity case and the nonexistence of srg(169,42,5,12) are formalized in Lean 4 with Mathlib. Also deposited on Zenodo with the full data archive (the citable record): https://doi.org/10.5281/zenodo.23281359

Primarily AI-generated textHuman understanding: some parts
Oct 14, 202621 pages
PDFView work

math.CO — Combinatorics

An Exponent of 1.043 for the Unit Distance Problem

Contributed by Eric Naslund

Let u(U)u(U) count the unordered pairs at distance one in a finite planar set UU. We construct finite sets UjU_j with ∣Uj∣→∞|U_j|\to\infty and u(Uj)/∣Uj∣1.043171→∞u(U_j)/|U_j|^{1.043171}\to\infty. The largest exponent previously claimed, apart from preliminary versions of the present work, is 1.03581.0358, in the author's unpublished manuscript. The method is the number-field construction of OpenAI and Sawin. Here unit distances come from elements of relative norm one in quadratic extensions K/FK/F in which FF has both real and complex places, and the fields come from an infinite pro-22 tower over $\Q(\sqrt{241})$, ramified only above 22, 33 and 55, with Frobenius conditions at the two primes above 2929 and at one prime above 4141. The relative zeta value is bounded through the dihedral quotients of the tower group: the tower group has 2727 quotients isomorphic to the dihedral group of order~88; fifteen of them detect, by a census, the residue degree of the primes that split completely in the Kummer field up to norm 4⋅10134\cdot10^{13}, and seven of them generate a field EW′′E_{W''} of degree 81928192 contained in every field of the tower. We write ζEW′′\zeta_{E_{W''}} as a product of LL-functions of degrees 22, 44 and~88, evaluate the 576576 of degrees 44 and 88 rigorously at 2121 real points near~11, and combine the values through a kernel inequality with coefficients of both signs. Finite facts and numerical inequalities are certified by exact computation and interval arithmetic. Partial formalization PALOMAR-2026-10-01-000018 v2

Primarily AI-generated textHuman understanding: some parts
Oct 02, 2026101 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations