pith. sign in

arxiv: 0904.0679 · v2 · submitted 2009-04-04 · 🧮 math.CO

A finite calculus approach to Ehrhart polynomials

classification 🧮 math.CO
keywords ehrhartquasi-polynomialpolytoperationaltheoremfiniteproofagrees
0
0 comments X
read the original abstract

A rational polytope is the convex hull of a finite set of points in $\R^d$ with rational coordinates. Given a rational polytope $P \subseteq \R^d$, Ehrhart proved that, for $t\in\Z_{\ge 0}$, the function $#(tP \cap \Z^d)$ agrees with a quasi-polynomial $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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.