Period-1 Polytopes: Exact Scaling in Lattice Enumeration
- Period-1 polytopes are geometric figures whose lattice-point counts or Minkowski lengths scale linearly with dilation, eliminating periodic fluctuations.
- They play a key role in Ehrhart theory and toric surface codes, providing insights into integrality conditions and period collapse phenomena.
- Examples include restricted Birkhoff polytopes, irrational triangles, and graph-associated cases, highlighting diverse applications in combinatorics and coding theory.
Period-1 polytopes are polytopes for which a dilation invariant loses its expected periodic fluctuation and becomes exactly linear or polynomial in the dilation parameter. In the Ehrhart-theoretic usage, a period-1 polytope is one whose lattice-point enumerator is an honest polynomial rather than a quasi-polynomial; in the toric-code usage developed for lattice polytopes, a period-1 polytope is one for which Minkowski length scales exactly by dilation, for all . These usages are closely related in spirit but concern different invariants, and the modern literature treats both as structurally important instances of “period collapse” or exact linearization under scaling (McAllister, 2020, Gibbs et al., 25 Sep 2025, Alexandersson et al., 2022).
1. Definitions and competing usages
Two technical meanings of “period-1 polytope” are current.
| Notion | Defining condition | Typical setting |
|---|---|---|
| Ehrhart period-1 | The Ehrhart quasi-polynomial has period sequence , so the counting function is a polynomial | Rational or irrational lattice-point enumeration |
| Minkowski-length period-1 | for all | Lattice polytopes and toric surface codes |
For a rational polytope , the Ehrhart function is
and Ehrhart’s theorem states that this is a degree- quasi-polynomial,
with periodic coefficient functions . The associated period sequence is 0, where 1 is the minimal period of 2 and the leading coefficient is always constant (McAllister, 2020).
In the toric-code literature, Gibbs, Hogan, Jabbusch, Plute, and Toloczko define a lattice polytope 3 to have period 1 when
4
where 5 is the Minkowski length, defined as
6
Here “period” refers not to Ehrhart coefficients but to the exact scaling law of Minkowski length under dilation (Gibbs et al., 25 Sep 2025).
2. Ehrhart period 1 and polynomial lattice-point enumeration
For integral polytopes, all Ehrhart coefficients are constant, the period sequence is 7, and the Ehrhart function is an ordinary polynomial (McAllister et al., 30 Jan 2026). This gives a universal sufficient condition for Ehrhart period 1. More generally, McMullen’s bounds state that the minimal period 8 of 9 divides the 0-index 1, the minimal integer such that every 2-face of 3 contains a lattice point in its affine span; in particular, integral polytopes have all indices equal to 4 (McAllister et al., 30 Jan 2026).
A central phenomenon is Ehrhart period collapse: the Ehrhart quasi-polynomial has period strictly smaller than the denominator predicted by the rational vertex data, possibly equal to 5 (Alexandersson et al., 2022). Restricted Birkhoff polytopes supply a prominent example. The Birkhoff polytope 6 consists of 7 nonnegative real matrices with all row sums and column sums equal to 8, and the restricted polytope 9 is obtained by imposing, for every upright lattice path from 0 to 1, the inequality that the sum along the path is at most 2. There are 3 such inequalities (Alexandersson et al., 2022).
For 4 and 5, 6 is not integral: besides five permutation-matrix vertices, it has the rational vertex
7
Nevertheless,
8
so the Ehrhart quasi-polynomial is an honest polynomial (Alexandersson et al., 2022). The proof proceeds through a continuous, piecewise-linear, homogeneous bijection
9
that is essentially Pak’s numerical version of the Robinson–Schensted–Knuth correspondence. Although 0 is not an integral equivalence, it gives a bijection between lattice points in 1 and 2 for every integer 3, and 4 is integrally equivalent to a Gelfand–Tsetlin polytope whose Ehrhart function is always a polynomial (Alexandersson et al., 2022).
3. Non-integral and irrational period-1 examples
The class of Ehrhart period-1 polytopes extends beyond integral rational polytopes. Cristofaro-Gardiner, Li, and Stanley study triangles
5
with 6, and characterize when the Ehrhart function is quasi-polynomial or polynomial even when 7 is irrational (Cristofaro-Gardiner et al., 2015).
Their theorem states that if 8 is irrational, then 9 is primitive and pseudo-rational if and only if there exist positive integers 0 such that
1
and in this case the period of the Ehrhart quasi-polynomial divides 2. The triangle is primitive and pseudo-integral, meaning its Ehrhart function is a polynomial, if and only if these conditions hold and, in addition, either 3 or 4 (Cristofaro-Gardiner et al., 2015). The same source then records under its explicit examples that the case 5 is “Not possible” for positive irrational 6 and 7, while the pairs 8 and 9 do produce pseudo-integral irrational triangles (Cristofaro-Gardiner et al., 2015).
The paper also gives higher-dimensional irrational examples. In dimension 0, the simplex with vertices
1
has polynomial Ehrhart function
2
These constructions show that period collapse to 3 can occur even for polytopes with infinite denominator, and the same work relates several such examples to symplectic embedding problems, especially to four-dimensional ellipsoids (Cristofaro-Gardiner et al., 2015).
4. Period sequences, arbitrary periods, and the role of convexity
Ehrhart period 1 is the extreme case of a broader period-sequence problem. For a rational polytope, the coefficient periods 4 of the Ehrhart quasi-polynomial form the period sequence 5, and a major open problem is to determine which quasi-polynomials arise as Ehrhart quasi-polynomials of rational polytopes (McAllister et al., 30 Jan 2026).
A constructive answer for arbitrary prescribed periods is given for nonconvex polytopal balls. For any positive integers 6, there exists an 7-dimensional rational polytopal ball 8, not necessarily convex, such that the period of the coefficient of 9 in the Ehrhart quasi-polynomial of 0 is exactly 1 for 2 (McAllister, 2020). The proof starts from building blocks whose periodicity is confined to a single coefficient: a line segment 3, special pentagons in 4, and the 5-fold pyramid over 6, which yields an 7-simplex with period sequence 8. For each coefficient index 9, an 0-dimensional polytope
1
is constructed from products of cyclic polytopes and pyramidal blocks, translated into appropriate halfspaces so that only the degree-2 coefficient has period 3 (McAllister, 2020).
The cyclic-polytope input uses F. Liu’s recursion
4
and for each 5,
6
The final object is the union
7
with sufficiently large translations to keep the glued polytopes in convex position (McAllister, 2020).
This construction removes the divisibility restrictions that occur in the convex case. Earlier work of Beck, Sam, and Woods showed that convex polytopes can realize any sequence 8 subject to
9
whereas arbitrary periods become possible only after allowing nonconvex polytopal balls (McAllister, 2020). Period 1 for all coefficients is therefore one endpoint of a much larger design space.
Some summaries formulate integrality as the defining source of period-1 Ehrhart behavior, while explicit period-collapse families exhibit polynomial Ehrhart functions for non-integral rational and even irrational polytopes (McAllister et al., 30 Jan 2026, Alexandersson et al., 2022, Cristofaro-Gardiner et al., 2015). This suggests that integrality is a robust sufficient condition, but that any converse must be read with careful attention to the hypotheses of the specific subclass under discussion.
5. Minkowski-length period 1 and toric surface codes
In toric surface code theory, period-1 behavior concerns Minkowski length rather than Ehrhart coefficients. A lattice polytope 0 has period 1 if
2
and this property is preserved under lattice equivalence by 3 (Gibbs et al., 25 Sep 2025). For general polytopes one has only 4; equality is the special feature singled out by the term.
In dimension 5, the class of period-1 polytopes is described up to lattice equivalence in terms of maximal Minkowski decompositions. Primitive line segments are period-1 polytopes, simplices 6 are period-1 polytopes, and so are rectangles, parallelograms, and zonotopes built from primitive segments. The unique exception among maximal decomposition summands is the exceptional triangle
7
for which
8
The paper summarizes the planar classification by stating that line segments and simplices are period-1 polytopes and that the exceptional triangle is the only polytope which can appear in a maximal decomposition that has period greater than 9 (Gibbs et al., 25 Sep 2025).
This exact scaling law has direct coding-theoretic consequences. For toric codes associated to a polytope 00, the block length is 01 and the dimension is 02. For
03
and under the additional conditions 04 and the existence of subgroups of certain order in 05, the minimum distance is
06
where 07 (Gibbs et al., 25 Sep 2025). The proof uses maximal decompositions into primitive segments, explicit products
08
and inclusion-exclusion to count zeros.
A second family,
09
is analyzed by the method of Little and Schwarz. Here a length-10 staircase configuration and the Vandermonde matrix 11 are used to show linear independence of evaluations, leading to
12
In this setting, period-1 behavior makes the minimum-distance formulas tractable because the combinatorics of maximal Minkowski decompositions scale without periodic deviation (Gibbs et al., 25 Sep 2025).
6. Graph-associated period-1 polytopes and conceptual scope
Another Ehrhart-theoretic family with period 13 arises from 14-graphs. A 15-graph is a graph whose nodes have degree 16 or 17. Liu and Osserman associated polytopes 18 and 19 to such graphs, and the period behavior depends sharply on the graph class. For connected 20-graphs, the Ehrhart quasi-polynomial 21 has period 22 if and only if 23 is a 24-tree; for 25, period 26 occurs only in trivial cases, and for trees 27 has period exactly 28 (Fernandes et al., 2021).
The geometric reason is explicit. For a 29-tree 30, 31 is a 32 polytope: its vertices are exactly the characteristic vectors of collections of disjoint leaf-paths in 33. Hence 34 is integral, and Ehrhart’s theorem implies that 35 is a polynomial (Fernandes et al., 2021). For the three-edge tree, the paper gives
36
whereas
37
has period 38 (Fernandes et al., 2021).
Across these examples, period-1 behavior is best understood not as a single rigid class but as a family of exact-scaling phenomena attached to different invariants. In Ehrhart theory it includes integral polytopes, restricted Birkhoff polytopes, certain irrational triangles and higher-dimensional simplices, and the 39-polytopes of 40-trees (Alexandersson et al., 2022, Cristofaro-Gardiner et al., 2015, Fernandes et al., 2021). In toric-code theory it identifies lattice polytopes whose Minkowski length scales linearly, with the exceptional triangle as the canonical obstruction in dimension 41 (Gibbs et al., 25 Sep 2025). The common theme is the disappearance of periodic fluctuation under dilation, but the mechanism may be integrality, a piecewise-linear bijection such as RSK, a special irrational parametrization, or the exclusion of particular decomposition summands.