- 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⊆Rn, Ehrhart's theorem gives
ehrP(k)=i=0∑ncP,i(k)ki,
where each coefficient function cP,i is a periodic function Z→Q with finite minimum period pi. The paper defines the period sequence of P to be (p0,…,pn) and asks which period sequences occur. McMullen's theorem bounds each pi above by the i-index of P, and Beck, Sam, and Woods showed that these bounds are always tight in the top two degrees; moreover, for any divisibility chain ehrP(k)=i=0∑ncP,i(k)ki,0, there is a convex polytope with period sequence ehrP(k)=i=0∑ncP,i(k)ki,1 (2601.22992). That construction forces ehrP(k)=i=0∑ncP,i(k)ki,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 ehrP(k)=i=0∑ncP,i(k)ki,3 and a pentagon ehrP(k)=i=0∑ncP,i(k)ki,4 with vertices ehrP(k)=i=0∑ncP,i(k)ki,5, ehrP(k)=i=0∑ncP,i(k)ki,6, and ehrP(k)=i=0∑ncP,i(k)ki,7, where ehrP(k)=i=0∑ncP,i(k)ki,8. Both have a single nonconstant coefficient of period ehrP(k)=i=0∑ncP,i(k)ki,9, and these periodic parts cancel:
cP,i0
where cP,i1 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,i2
The first main result states that for every positive integer cP,i3 and every dimension cP,i4, there exists a convex rational polytope in cP,i5 with period sequence cP,i6 (2601.22992). The polygonal case cP,i7 follows from the heptagon construction of McAllister and Moriarity: a rectangle cP,i8 combined with the pentagon cP,i9 yields Z→Q0.
For Z→Q1, the authors first prove a pyramiding lemma: the equivalence Z→Q2 is preserved under Z→Q3-fold pyramids, because Ehrhart series transform as Z→Q4. They then form the prism Z→Q5 over an Z→Q6-fold pyramid Z→Q7 over Z→Q8 (which itself has period sequence Z→Q9), and the pyramid pi0 over an pi1-fold pyramid over pi2. The convex hull pi3 decomposes as pi4 with all pairwise intersections integral, so
pi5
giving period sequence pi6. Since pi7 is arbitrary, the coefficient period in degree pi8 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 pi9
The second main result constructs nonconvex polytopes with period sequence P0 — the nonconstant coefficient now in degree P1 — for dimensions P2 and P3 (2601.22992). The construction depends on solutions to the ideal Prouhet–Tarry–Escott (PTE) problem: integers P4 and P5 with equal power sums P6 up to degree P7. Known solutions cover P8 variables from P9 through (p0,…,pn)0 and (p0,…,pn)1, which yields the dimension restriction; no solution in (p0,…,pn)2 variables is known. Wright conjectured that solutions exist for every number of variables (p0,…,pn)3, but Borwein gives a heuristic argument against this, so the dimensional gap at (p0,…,pn)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)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)6, so the difference of the two products (p0,…,pn)7 and (p0,…,pn)8 collapses to the single monomial (p0,…,pn)9. Consequently,
pi0
so every coefficient function is constant except the one in degree pi1, which has period pi2. The method is uniform in pi3: 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 pi4 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 pi5. Second, the dimension restriction to pi6 and pi7 is entirely contingent on the availability of ideal PTE solutions; the cases pi8 and pi9 are unresolved, and Wright's conjecture that PTE solutions exist in every arity i0 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 i1, remains open.
Conclusion
The paper enlarges the known set of realizable Ehrhart period sequences in two directions: convex polytopes realizing i2 in every dimension, and nonconvex polytopes realizing i3 in dimensions i4–i5 and i6. 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.