Best possible lower bounds on the coefficients of Ehrhart polynomials
Akiyoshi Tsuchiya

TL;DR
This paper establishes optimal lower bounds for the coefficients of Ehrhart polynomials of integral convex polytopes, extending known results to new coefficients and providing a comprehensive understanding of their minimal values.
Contribution
The authors prove that previously known bounds are also optimal for certain coefficients and introduce new bounds for others, advancing the theory of Ehrhart polynomial coefficients.
Findings
Bounds are optimal for coefficients r=3 and d-r even.
New best possible bounds are established for r=d-3.
Extends the range of coefficients with known optimal bounds.
Abstract
For an integral convex polytope , we recall the Ehrhart polynomial of . Let be the th coefficients of for . Martin Henk and Makoto Tagami gave lower bounds on the coefficients in terms of the volume of . They proved that these bounds are best possible for . We show that these bounds are also optimal for and even and we give a new best possible bound for .
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.
