A finite calculus approach to Ehrhart polynomials
The electronic journal of combinatorics, Tome 17 (2010)
A rational polytope is the convex hull of a finite set of points in ${\Bbb R}^d$ with rational coordinates. Given a rational polytope ${\cal P} \subseteq {\Bbb R}^d$, Ehrhart proved that, for $t\in{\Bbb Z}_{\ge 0}$, the function $\#(t{\cal P} \cap {\Bbb Z}^d)$ agrees with a quasi-polynomial $L_{\cal 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.
DOI :
10.37236/340
Classification :
52C07
Mots-clés : rational polytope, lattice points, Ehrhart quasipolynomial, Ehrhart-Macdonald reciprocity theorem
Mots-clés : rational polytope, lattice points, Ehrhart quasipolynomial, Ehrhart-Macdonald reciprocity theorem
@article{10_37236_340,
author = {Steven V. Sam and Kevin M. Woods},
title = {A finite calculus approach to {Ehrhart} polynomials},
journal = {The electronic journal of combinatorics},
year = {2010},
volume = {17},
doi = {10.37236/340},
zbl = {1197.52004},
url = {http://geodesic.mathdoc.fr/articles/10.37236/340/}
}
Steven V. Sam; Kevin M. Woods. A finite calculus approach to Ehrhart polynomials. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/340
Cité par Sources :