Generalized Ehrhart polynomials

Abstract

Let $P$ be a polytope with rational vertices. A classical theorem of Ehrhart states that the number of lattice points in the dilations $P(n)=nP$ is a quasi-polynomial in $n$. We generalize this theorem by allowing the vertices of P(n) to be arbitrary rational functions in $n$. In this case we prove that the number of lattice points in P(n) is a quasi-polynomial for $n$ sufficiently large. Our work was motivated by a conjecture of Ehrhart on the number of solutions to parametrized linear Diophantine equations whose coefficients are polynomials in $n$, and we explain how these two problems are related.

18 pages, no figures; v2: Sections 4 and 5 added, proofs and exposition have been expanded and clarified

Cited by in corpus (7)

• Counting With Irrational Tiles
• Numerical Adjunction Formulas for Weighted Projective Planes and Lattice Points Counting
• The parametric Frobenius problem and parametric exclusion
• Parametrizing an integer linear program by an integer
• Rational Ehrhart quasi-polynomials
• The unreasonable ubiquitousness of quasi-polynomials
• The Newton polygon of a recurrence sequence of polynomials and its role in TQFT