Papers
Topics
Authors
Recent
Search
2000 character limit reached

Periods of Ehrhart coefficients of rational polytopes

Published 30 Jan 2026 in math.CO | (2601.22992v1)

Abstract: Let P⊆Rn\mathcal{P} \subseteq \mathbb{R}^{n} be a polytope whose vertices have rational coordinates. By a seminal result of E. Ehrhart, the number of integer lattice points in the kkth dilate of P\mathcal{P} (kk a positive integer) is a quasi-polynomial function of kk -- that is, a "polynomial" in which the coefficients are themselves periodic functions of kk. It is an open problem to determine which quasi-polynomials are the Ehrhart quasi-polynomials of rational polytopes. As partial progress on this problem, we construct families of polytopes in which the periods of the coefficient functions take on various prescribed values.

Citations (4)

Summary

  • The paper shows that the periods of the individual coefficient functions in rational polytopes do not necessarily follow a monotonic sequence.
  • The authors provide explicit constructions for convex and non-convex polytopes to demonstrate that the periods of a polytope can vary in certain dimensions. We can use the cancellation identity between a pentagon and a segment to construct the desired polytopes. =
  • For polytopes of dimension $3 11$ and $13$, the constructed polytopes are non-convex. The non- monotonic periods violate Mccullens bound

This paper, by Tyrrell B. McAllister and Hene O. Rochais (2601.22992), addresses the problem of determining which quasi-polynomials arise as Ehrhart quasi-polynomials of rational polytopes, focusing on the possible periods of the individual coefficient functions. Its main contribution is a pair of explicit constructions showing that the period sequences of rational polytopes need not be monotone, thereby extending the class of realizable period sequences beyond those produced by Beck, Sam, and Woods (2601.22992).

Background and problem statement

For a rational polytope P⊆RnP \subseteq \mathbb{R}^n, Ehrhart's theorem gives

ehr⁡P(k)=∑i=0ncP,i(k) ki,\operatorname{ehr}_P(k) = \sum_{i=0}^{n} c_{P,i}(k)\, k^i,

where each coefficient function cP,ic_{P,i} is a periodic function Z→Q\mathbb{Z} \to \mathbb{Q} with finite minimum period pip_i. The paper defines the period sequence of PP to be (p0,…,pn)(p_0, \dotsc, p_n) and asks which period sequences occur. McMullen's theorem bounds each pip_i above by the ii-index of PP, and Beck, Sam, and Woods showed that these bounds are always tight in the top two degrees; moreover, for any divisibility chain ehr⁡P(k)=∑i=0ncP,i(k) ki,\operatorname{ehr}_P(k) = \sum_{i=0}^{n} c_{P,i}(k)\, k^i,0, there is a convex polytope with period sequence ehr⁡P(k)=∑i=0ncP,i(k) ki,\operatorname{ehr}_P(k) = \sum_{i=0}^{n} c_{P,i}(k)\, k^i,1 (2601.22992). That construction forces ehr⁡P(k)=∑i=0ncP,i(k) ki,\operatorname{ehr}_P(k) = \sum_{i=0}^{n} c_{P,i}(k)\, k^i,2, and the present paper's constructions deliberately violate this monotonicity — equivalently, they exhibit cases in which a particular McMullen bound is arbitrarily far from tight.

The key cancellation mechanism

The constructions rest on a two-dimensional "complementarity" fact, due to McAllister and Moriarity, concerning the segment ehr⁡P(k)=∑i=0ncP,i(k) ki,\operatorname{ehr}_P(k) = \sum_{i=0}^{n} c_{P,i}(k)\, k^i,3 and a pentagon ehr⁡P(k)=∑i=0ncP,i(k) ki,\operatorname{ehr}_P(k) = \sum_{i=0}^{n} c_{P,i}(k)\, k^i,4 with vertices ehr⁡P(k)=∑i=0ncP,i(k) ki,\operatorname{ehr}_P(k) = \sum_{i=0}^{n} c_{P,i}(k)\, k^i,5, ehr⁡P(k)=∑i=0ncP,i(k) ki,\operatorname{ehr}_P(k) = \sum_{i=0}^{n} c_{P,i}(k)\, k^i,6, and ehr⁡P(k)=∑i=0ncP,i(k) ki,\operatorname{ehr}_P(k) = \sum_{i=0}^{n} c_{P,i}(k)\, k^i,7, where ehr⁡P(k)=∑i=0ncP,i(k) ki,\operatorname{ehr}_P(k) = \sum_{i=0}^{n} c_{P,i}(k)\, k^i,8. Both have a single nonconstant coefficient of period ehr⁡P(k)=∑i=0ncP,i(k) ki,\operatorname{ehr}_P(k) = \sum_{i=0}^{n} c_{P,i}(k)\, k^i,9, and these periodic parts cancel:

cP,ic_{P,i}0

where cP,ic_{P,i}1 denotes equivalence modulo polynomial quasi-polynomials. The period sequence is invariant under this equivalence, and if two rational polytopes intersect in an integral polytope, their union's Ehrhart function is equivalent to the sum of the two Ehrhart functions. This reduction principle is the engine of both constructions.

Convex polytopes with period sequence cP,ic_{P,i}2

The first main result states that for every positive integer cP,ic_{P,i}3 and every dimension cP,ic_{P,i}4, there exists a convex rational polytope in cP,ic_{P,i}5 with period sequence cP,ic_{P,i}6 (2601.22992). The polygonal case cP,ic_{P,i}7 follows from the heptagon construction of McAllister and Moriarity: a rectangle cP,ic_{P,i}8 combined with the pentagon cP,ic_{P,i}9 yields Z→Q\mathbb{Z} \to \mathbb{Q}0.

For Z→Q\mathbb{Z} \to \mathbb{Q}1, the authors first prove a pyramiding lemma: the equivalence Z→Q\mathbb{Z} \to \mathbb{Q}2 is preserved under Z→Q\mathbb{Z} \to \mathbb{Q}3-fold pyramids, because Ehrhart series transform as Z→Q\mathbb{Z} \to \mathbb{Q}4. They then form the prism Z→Q\mathbb{Z} \to \mathbb{Q}5 over an Z→Q\mathbb{Z} \to \mathbb{Q}6-fold pyramid Z→Q\mathbb{Z} \to \mathbb{Q}7 over Z→Q\mathbb{Z} \to \mathbb{Q}8 (which itself has period sequence Z→Q\mathbb{Z} \to \mathbb{Q}9), and the pyramid pip_i0 over an pip_i1-fold pyramid over pip_i2. The convex hull pip_i3 decomposes as pip_i4 with all pairwise intersections integral, so

pip_i5

giving period sequence pip_i6. Since pip_i7 is arbitrary, the coefficient period in degree pip_i8 can be made arbitrarily large relative to its neighbors — a strong statement about how far McMullen's bound can be from tight in intermediate degrees.

Nonconvex polytopes with period sequence pip_i9

The second main result constructs nonconvex polytopes with period sequence PP0 — the nonconstant coefficient now in degree PP1 — for dimensions PP2 and PP3 (2601.22992). The construction depends on solutions to the ideal Prouhet–Tarry–Escott (PTE) problem: integers PP4 and PP5 with equal power sums PP6 up to degree PP7. Known solutions cover PP8 variables from PP9 through (p0,…,pn)(p_0, \dotsc, p_n)0 and (p0,…,pn)(p_0, \dotsc, p_n)1, which yields the dimension restriction; no solution in (p0,…,pn)(p_0, \dotsc, p_n)2 variables is known. Wright conjectured that solutions exist for every number of variables (p0,…,pn)(p_0, \dotsc, p_n)3, but Borwein gives a heuristic argument against this, so the dimensional gap at (p0,…,pn)(p_0, \dotsc, p_n)4 reflects a genuine open problem in number theory rather than a limitation of the geometric method.

Given such a solution, the polytope is

(p0,…,pn)(p_0, \dotsc, p_n)5

a union of two rational polytopes with integral intersection. By Newton's identities, the power-sum conditions imply matching elementary symmetric functions up to degree (p0,…,pn)(p_0, \dotsc, p_n)6, so the difference of the two products (p0,…,pn)(p_0, \dotsc, p_n)7 and (p0,…,pn)(p_0, \dotsc, p_n)8 collapses to the single monomial (p0,…,pn)(p_0, \dotsc, p_n)9. Consequently,

pip_i0

so every coefficient function is constant except the one in degree pip_i1, which has period pip_i2. The method is uniform in pip_i3: any new PTE solution would immediately extend Theorem 2 to the corresponding dimension.

Limitations and open questions

The paper concedes two structural limitations. First, the pip_i4 construction is inherently nonconvex; the authors state that in some cases they are unable to find convex constructions and must consider nonconvex rational polytopes, so it remains open whether convex polytopes with such period sequences exist in dimensions pip_i5. Second, the dimension restriction to pip_i6 and pip_i7 is entirely contingent on the availability of ideal PTE solutions; the cases pip_i8 and pip_i9 are unresolved, and Wright's conjecture that PTE solutions exist in every arity ii0 is contradicted in spirit by Borwein's heuristic. More broadly, the paper makes only partial progress on the underlying problem: a full characterization of realizable period sequences, or even of Ehrhart polynomials of convex integral polytopes in dimension ii1, remains open.

Conclusion

The paper enlarges the known set of realizable Ehrhart period sequences in two directions: convex polytopes realizing ii2 in every dimension, and nonconvex polytopes realizing ii3 in dimensions ii4–ii5 and ii6. Both constructions exploit the same cancellation identity between a pentagon and a segment, combined respectively with pyramiding and with Prouhet–Tarry–Escott systems. The results demonstrate that McMullen's index bounds can be arbitrarily slack in intermediate degrees and that period sequences need not be monotone, while leaving open the convexity of the second family and the dimensions blocked by the PTE problem.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.