Ehrhart Quasi-Polynomials of Rational Simple Polytopes

• Ehrhart quasi-polynomials are functions that count lattice points in rationally dilated simple polytopes, exhibiting periodic and piecewise-polynomial behavior.
• They detail the combinatorial structure of rational polytopes through methods like vertex cone decompositions, Barnes polynomials, and inclusion-exclusion formulas.
• Efficient computation via algorithms such as Barvinok’s method connects these quasi-polynomials to applications in toric geometry and discrete optimization.

A rational simple polytope is a convex polytope in $\mathbb{R}^d$ with rational vertices such that exactly $d$ facets meet at each vertex. The lattice-point counting function

$L_P(r) = \#(r P \cap \mathbb{Z}^d)$

for $r \in \mathbb{Q}_{\ge 0}$ generalizes the classical case of integer dilates and encodes the discrete geometric structure of $P$ under rational scaling. The resulting function is described by the theory of Ehrhart quasi-polynomials, which in the rational setting exhibits rich periodic, piecewise-polynomial, and combinatorial behavior strongly influenced by the denominators of $P$ and the dilations.

1. Rational Simple Polytopes and Rational Ehrhart Quasi-Polynomials

Let $P \subset \mathbb{R}^d$ be a simple rational $d$-polytope, i.e., all vertices of $P$ are in $\mathbb{Q}^d$ and at each vertex exactly $d$0 facets meet. The minimal positive rational $d$1 such that $d$2 is integral is called the rational denominator of $d$3 (Linke, 2010).

For every $d$4, the rational dilation $d$5 may not be a lattice polytope, and the behavior of $d$6 reflects the interaction of the scaling factor with the underlying lattice. The lattice-point counting function $d$7 is then a rational quasi-polynomial: $d$8 where each $d$9 is a periodic, piecewise-polynomial function of $L_P(r) = \#(r P \cap \mathbb{Z}^d)$0 with period equal to the $L_P(r) = \#(r P \cap \mathbb{Z}^d)$1-index $L_P(r) = \#(r P \cap \mathbb{Z}^d)$2, defined as the minimal positive $L_P(r) = \#(r P \cap \mathbb{Z}^d)$3 such that every $L_P(r) = \#(r P \cap \mathbb{Z}^d)$4-face $L_P(r) = \#(r P \cap \mathbb{Z}^d)$5 satisfies $L_P(r) = \#(r P \cap \mathbb{Z}^d)$6 (Linke, 2010).

2. Structure and Properties of Rational Quasi-Polynomials

For a rational simple polytope $L_P(r) = \#(r P \cap \mathbb{Z}^d)$7 of dimension $L_P(r) = \#(r P \cap \mathbb{Z}^d)$8 and rational denominator $L_P(r) = \#(r P \cap \mathbb{Z}^d)$9, $r \in \mathbb{Q}_{\ge 0}$0 is a degree-$r \in \mathbb{Q}_{\ge 0}$1 rational quasi-polynomial of period $r \in \mathbb{Q}_{\ge 0}$2. Each coefficient $r \in \mathbb{Q}_{\ge 0}$3 is itself piecewise-polynomial of degree $r \in \mathbb{Q}_{\ge 0}$4, with periodicity given by the $r \in \mathbb{Q}_{\ge 0}$5-index $r \in \mathbb{Q}_{\ge 0}$6 (Linke, 2010). The function is locally polynomial away from finitely many discontinuities, occurring precisely at values of $r \in \mathbb{Q}_{\ge 0}$7 where the dilated facets cross lattice hyperplanes.

In symbols, on each interval of constancy, $r \in \mathbb{Q}_{\ge 0}$8 has a representation

$r \in \mathbb{Q}_{\ge 0}$9

with the intervals $P$0 arising from the crossing patterns of the facets with the lattice.

The leading coefficient $P$1 is constant, equal to $P$2, while lower coefficients exhibit explicit piecewise-polynomial structure reflecting the combinatorics of the faces of $P$3 (Linke, 2010, Beck et al., 2021).

3. Closed-Form Expressions in the Simple Case

Simple polytopes admit closed expressions for the rational quasi-polynomial via explicit inclusion-exclusion or local primary decomposition. For the rational simplex $P$4 with $P$5, the Ehrhart quasi-polynomial for rational $P$6 is

$P$7

with the combinatorial minors possibly themselves periodic (Linke, 2010).

For the rational cube $P$8, it follows that

$P$9

and each coefficient $P$0 is an explicit sum of polynomials in fractional parts $P$1 for subsets $P$2 of the indices (Linke, 2010).

For general simple rational polytopes, Brion's theorem provides a decomposition of $P$3 as a sum over the vertex cones, each being a rational generating function whose periodic and piecewise behavior can be accessed via finite Fourier analysis or the calculation of lattice-point transforms (Beck et al., 28 May 2025, Robins, 18 Jan 2026). In particular, Barnes polynomials and discrete moments of half-open parallelepipeds at each vertex allow a direct computation: $P$4 where $P$5 denotes Barnes polynomials and $P$6 the fundamental parallelepiped at vertex $P$7 (Robins, 18 Jan 2026).

4. Differentiation and Functional Relations Among Coefficients

A key structural property is that the coefficients of the rational quasi-polynomial satisfy derivation relations. For all $P$8,

$P$9

away from discontinuities, matching the formal derivative of $P \subset \mathbb{R}^d$0. This forms a triangular system tightly constraining the possible behavior of the coefficients (Linke, 2010, Robins, 18 Jan 2026).

This ODE structure extends to moments of higher-degree weights and provides a powerful handle for analytic and algorithmic manipulation (Robins, 18 Jan 2026).

5. Computation, Algorithms, and Complexity

For fixed dimension, explicit computation of the quasi-polynomial is feasible via Barvinok's algorithm for integer Ehrhart quasi-polynomials of rational polytopes, or by finite-difference recurrence. The transition to rational dilation $P \subset \mathbb{R}^d$1 leverages computation of the integer-dilate Ehrhart quasi-polynomial for $P \subset \mathbb{R}^d$2, with

$P \subset \mathbb{R}^d$3

where $P \subset \mathbb{R}^d$4 is the $P \subset \mathbb{R}^d$5th coefficient in the integral quasi-polynomial expansion (Linke, 2010). The periods for $P \subset \mathbb{R}^d$6 are controlled by the $P \subset \mathbb{R}^d$7-indices of $P \subset \mathbb{R}^d$8 and their scaling (Linke, 2010).

Efficient computation of step-polynomial quasi-coefficients is possible for the highest-degree terms even as $P \subset \mathbb{R}^d$9 grows, using patched generating-function techniques based on local cone decompositions and short rational expressions for half-open parallelepipeds (Baldoni et al., 2010). The essential complexity reduces to summing polynomially many terms over lattice fragments determined by the denominators and face structure—conjecturally polynomial time for fixed $d$0 and fixed degree in $d$1 (Robins, 18 Jan 2026).

6. Period Collapse and Piecewise-Polynomial Phenomena

While the generic period of the rational Ehrhart quasi-polynomial is the least common multiple of the denominators of the vertices (the denominator of the polytope), period collapse can occur, particularly for families with special symmetry or combinatorial structure (McAllister et al., 2015, Fernandes et al., 2021). In the plane, every pair $d$2 of positive integers arises as the minimal periods of the constant and linear coefficients $d$3, with the quadratic (leading) term always constant (McAllister et al., 2015). For higher-dimensional specific classes (e.g., polytopes attached to graphs), coset decompositions can force smaller-than-expected period to arise (Fernandes et al., 2021).

The piecewise-polynomial nature of the coefficients is tied to the interaction between dilation and the lattice: at specific $d$4 (rational thresholds where facets cross lattice points), the polynomial structure in $d$5 may jump (Linke, 2010). On fixed intervals of $d$6 between such thresholds, the coefficients are polynomial.

7. Extensions and Applications

The rational Ehrhart quasi-polynomial framework applies to parametric families: if a simple rational polytope has vertices that vary as rational functions of a parameter, the lattice point count remains an eventual quasi-polynomial (Chen et al., 2010). Applications include the study of (weighted) enumeration of discrete structures parameterized by rational polytopes, connections to toric geometry, and classification problems in combinatorics.

Rational simple polytopes occur naturally in zonotopal tilings, Coxeter arrangements, and combinatorics of alcoved polytopes, where the explicit knowledge of the Ehrhart quasi-polynomial and its constituent structure enables enumeration in algebraic, geometric, and topological contexts (Bullock et al., 2024, Ardila et al., 2020).

---

References:

• (Linke, 2010) Rational Ehrhart quasi-polynomials
• (Beck et al., 2021) Rational Ehrhart Theory
• (Baldoni et al., 2010) Computation of the highest coefficients of weighted Ehrhart quasi-polynomials
• (Robins, 18 Jan 2026) Ehrhart quasi-polynomials via Barnes polynomials and discrete moments of parallelepipeds
• (McAllister et al., 2015) Ehrhart quasi-period collapse in rational polygons
• (Fernandes et al., 2021) On the period collapse of a family of Ehrhart quasi-polynomials
• (Bullock et al., 2024) The Ehrhart series of alcoved polytopes
• (Chen et al., 2010) Generalized Ehrhart polynomials
• (Beck et al., 28 May 2025) A Closer Look at Chapoton's q-Ehrhart Polynomials
• (Ardila et al., 2020) The Arithmetic of Coxeter Permutahedra