Enumerative combinatorics
Note: Maximal periods of (Ehrhart) quasi-polynomials
Journal of Combinatorial Theory Series A
Periodicity of hyperplane arrangements with integral coefficients modulo positive integers
Journal of Algebraic Combinatorics: An International Journal
Rational Ehrhart quasi-polynomials
Journal of Combinatorial Theory Series A
Enumerating colorings, tensions and flows in cell complexes
Journal of Combinatorial Theory Series A
Hi-index | 0.00 |
If P ⊆ Rd is a rational polytope, then ip(n) := #(nP ∩ Zd) is a quasi-polynomial in n, called the Ehrhart quasi-polynomial of P. The minimum period of ip(n) must divide D(P) = min{n ∈ Z 0:nP is an integral polytope}. Few examples are known where the minimum period is not exactly D(P). We show that for any D, there is a 2-dimensional triangle P such that D(P) = D but such that the minimum period of ip(n) is 1, that is, ip(n) is a polynomial in n. We also characterize all polygons P such that ip(n) is a polynomial. In addition, we provide a counterexample to a conjecture by T. Zaslavsky about the periods of the coefficients of the Ehrhart quasi-polynomial.