Matching works

10 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.QA — Quantum Algebra

Another proof of quantum Laurent positivity, II

Contributed by Qiyue Tang

We give a further combinatorial proof of Laurent positivity for skew-symmetric quantum cluster algebras.

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

Primarily AI-generated textHuman understanding: some parts
Nov 11, 202650 pages
PDFView work

math.RA — Rings and Algebras

A Counterexample to the Subtraction-Free Conjecture for Bounded Ratios of Minors

Contributed by Qiyue Tang

We disprove the subtraction-free conjecture of Boocher and Froehle for bounded ratios of minors of totally positive matrices. We construct products (P,M,Q) of ordinary minors of a matrix of order (3207) such that [ 0<\frac{P}{MQ}\leq\frac1{64} ] throughout the totally positive locus, whereas (MQ-P) has a coefficient equal to (-1) in the standard bidiagonal parameters.

Primarily AI-generated textHuman understanding: some parts
Nov 11, 202616 pages
PDFView work

math.CO — Combinatorics

Reflexive Descent to Minimal Seeds in the Kreuzer--Skarke List

Contributed by Deep Bhattacharjee, Ushashi Bhattacharya

Kreuzer and Skarke built the list of reflexive polytopes by growing it from small seed polytopes. We ask how far a polytope can be from its seeds when it is shrunk through reflexive polytopes only, one at a time and without skipping any. Such a descent always exists and always ends at a seed. In four dimensions no descent takes more than 348 steps, which proves the conjecture of a uniform transition depth, and in two and three dimensions the exact maxima are five and eleven. In four dimensions two polytopes with thirty-seven lattice points need exactly twenty-two steps, so the maximum lies between twenty-two and 348.

A mix of human-written and AI-generated textHuman understanding: some partsCalabi–Yau threefoldsKreuzer–Skarke listlattice polytopesreflexive polytopes
Oct 22, 202618 pages
PDFView work

math.OC — Optimization and Control

Additive Rounding for LP-Tight Three-Item Bin Packing

Contributed by Ruixue Yuan, Da Teng, Zhenyu Sun

We consider bin-packing instances with 3m3m items of sizes in (1/4,1/2)(1/4,1/2), total size mm, and configuration linear programming value mm. Let dd be the relative dimension of the polytope of zero-sum multiplicity patterns obtained by centering sizes at 1/31/3. We determine the maximum additive integrality gap for every d≤10d\le10. It is zero for d≤4d\le4 and one for 5≤d≤105\le d\le10. More generally, a representation of the multiplicity vector by at most five zero-sum patterns admits an integral packing, and a representation by at most eleven patterns requires at most one additional bin. The integral-packing result has a structural proof; the additive-one result combines structural restrictions with exact finite enumeration. For arbitrary dd, we construct an LP-tight subinstance with at most 6d+36d+3 items and no smaller additive gap. An integer representation preserving the signs of triple sums then yields a finite rational family attaining the worst gap, which is computable in time 2O((d+1)2)2^{O((d+1)^2)}. Finally, we construct a sharp family with simplex pattern polytopes and a linearly growing zero-sum matching deficit. Its eleven-dimensional member violates the zero-sum remainder condition used in the ten-dimensional proof. Thus the bound of eleven fractional patterns in that condition is sharp.

Primarily human-written textHuman understanding: all partsbin packingconfiguration linear programminghypergraph matchinglattice polytopeszero-sum patterns
Oct 20, 202618 pages
PDFView work

math.CO — Combinatorics

An Arbor Polytope with Nonreal Ehrhart Roots

Contributed by YURAN XIU

We construct a singleton-labeled arbor on 243 vertices whose Ehrhart polynomial has a nonreal root. This disproves the conjecture that the Ehrhart roots of every arbor polytope are real and lie in [−1,0][-1,0]. The polynomial factors as (m+1)230(7m+2)8f(m)/6144(m+1)^{230}(7m+2)^8 f(m)/6144, where ff is an explicit quintic. We derive this identity by counting lattice points for every nonnegative integer dilation, using three moments of subtree deficits. A negative value of f′2−ff′′f'^2-ff'' at −3/10-3/10 gives an exact nonreal-root certificate. The lattice-count identity and the resulting counterexample have been formalized and checked in Lean. The source release and reproduction evidence are archived at https://doi.org/10.5281/zenodo.23435787.

Primarily AI-generated textHuman understanding: no partsEhrhart polynomialsLean formalizationarbor polytopescounterexamplereal-rootedness
Oct 14, 20265 pages
PDFView work

math.QA — Quantum Algebra

Finite quantum theta functions for skew-symmetrizable seeds

Contributed by Qiyue Tang

For integral compatible skew-symmetrizable seeds, finite quantum theta functions form a bar-invariant, mutation-compatible basis of an algebra between the cluster and upper cluster algebras. We prove leading-coefficient positivity, valuative independence, unit Newton vertex coefficients, and independence under coefficientwise base change. We obtain upper theta bases for large cluster complexes, reddening classes, and Markov matrices and their one-way acyclic extensions. In mutation-acyclic classes, these are also bases of the cluster algebra.

Primarily AI-generated textHuman understanding: no partsquantum cluster algebra
Oct 12, 202649 pages
PDFView work

math.QA — Quantum Algebra

A Finite Polyhedral Construction of the Rank-Two Quantum Greedy Basis

Contributed by Qiyue Tang

We give a finite polyhedral construction of the quantum greedy basis for coefficient-free rank-two quantum cluster algebras. The construction specializes coefficientwise to the classical polyhedral construction at v = 1. Corresponding classical and quantum coefficients and auxiliary margins have identical zero sets, and the Newton polytopes are affine images of the classical carriers.

A mix of human-written and AI-generated textHuman understanding: some partsquantum cluster algebra
Oct 03, 202625 pages
PDFView work

math.CO — Combinatorics

Tilings of an equilateral triangle by at most five lattice trapezoids with 60° base angles: a complete structural classification

Contributed by Gonzalo Barria

We study tilings of an equilateral triangle of side n in the triangular grid by k lattice trapezoids with base angles 60°, the objects behind the OEIS sequences A389392 (k = 4) and A391498 (k = 5). We prove two angle identities valid for every such tiling and a lemma relating the number of boundary vertices to the number of pieces having a side on the boundary. With these tools we show that there are exactly 1, 2 and 13 combinatorial types of tilings for k = 3, 4, 5. For k = 3 every tiling is a pinwheel. For k = 4 every tiling belongs to one of the two categories used in A389392, a fact that had previously been taken for granted. For k = 5 the thirteen types refine the eight categories of A391498; in three of them a piece has no side on the boundary. As a consistency check, the volumes of the parameter polytopes together with the generic multiplicities reproduce the leading coefficient 7/36 of the conjectured quasi-polynomial for A391498. All lemmas were checked against an exhaustive enumeration of the tilings with pairwise distinct pieces for n ≤ 15. Finally, the classification turns the thirteen types into eight explicit families of sets of shapes, and an inclusion–exclusion over them reduces the conjectured generating function of A391498 to twelve elementary counting statements, and we settle all twelve: the resulting closed formula reproduces the sequence for every n ≤ 127.

A mix of human-written and AI-generated textHuman understanding: all partsOEIS A391498lattice trapezoidsquasi-polynomialrational generating functiontilings of an equilateral triangle
Oct 01, 202623 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations