The Minimum Period of the Ehrhart Quasi-polynomial of a Rational Polytope
Tyrrell B. McAllister, Kevin M. Woods
Abstract
If P⊂ d is a rational polytope, then iP(n):=#(nP d) is a quasi-polynomial in n, called the Ehrhart quasi-polynomial of P. The period of iP(n) must divide (P)= \n ∈ > 0 nP is an integral polytope\. Few examples are known where the period is not exactly (P). We show that for any , there is a 2-dimensional triangle P such that (P)= but such that the 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.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.