English

A finite calculus approach to Ehrhart polynomials

Combinatorics 2010-05-04 v2

Abstract

A rational polytope is the convex hull of a finite set of points in Rd\R^d with rational coordinates. Given a rational polytope PRdP \subseteq \R^d, Ehrhart proved that, for tZ0t\in\Z_{\ge 0}, the function #(tP \cap \Z^d) agrees with a quasi-polynomial LP(t)L_P(t), called the Ehrhart quasi-polynomial. The Ehrhart quasi-polynomial can be regarded as a discrete version of the volume of a polytope. We use that analogy to derive a new proof of Ehrhart's theorem. This proof also allows us to quickly prove two other facts about Ehrhart quasi-polynomials: McMullen's theorem about the periodicity of the individual coefficients of the quasi-polynomial and the Ehrhart-Macdonald theorem on reciprocity.

Keywords

Cite

@article{arxiv.0904.0679,
  title  = {A finite calculus approach to Ehrhart polynomials},
  author = {Steven V Sam and Kevin M. Woods},
  journal= {arXiv preprint arXiv:0904.0679},
  year   = {2010}
}

Comments

13 pages, 1 figure; v2: added examples and Section 4, final version

R2 v1 2026-06-21T12:48:07.050Z