A finite calculus approach to Ehrhart polynomials
Steven V Sam, Kevin M. Woods

TL;DR
This paper introduces a novel proof of Ehrhart's theorem using finite calculus, providing new insights into the properties of Ehrhart quasi-polynomials and their coefficients.
Contribution
It presents a new finite calculus-based proof of Ehrhart's theorem and related properties like coefficient periodicity and reciprocity.
Findings
New proof of Ehrhart's theorem using finite calculus
Proof of McMullen's periodicity theorem for coefficients
Verification of Ehrhart-Macdonald reciprocity
Abstract
A rational polytope is the convex hull of a finite set of points in with rational coordinates. Given a rational polytope , Ehrhart proved that, for , the function #(tP \cap \Z^d) agrees with a quasi-polynomial , 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Identities · Mathematics and Applications
