The Minimum Period of the Ehrhart Quasi-polynomial of a Rational Polytope
Combinatorics
2016-09-07 v1
Abstract
If is a rational polytope, then i_P(n):=#(nP\cap \Z^d) is a quasi-polynomial in , called the Ehrhart quasi-polynomial of . The period of must divide . Few examples are known where the period is not exactly . We show that for any , there is a 2-dimensional triangle such that but such that the period of is 1, that is, is a polynomial in . We also characterize all polygons such that 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.
Keywords
Cite
@article{arxiv.math/0310255,
title = {The Minimum Period of the Ehrhart Quasi-polynomial of a Rational Polytope},
author = {Tyrrell B. McAllister and Kevin M. Woods},
journal= {arXiv preprint arXiv:math/0310255},
year = {2016}
}
Comments
9 pages, 2 figures