Lattice polytopes with the minimal volume
Ginji Hamano, Ichiro Sainose, Takayuki Hibi

TL;DR
This paper investigates lattice polytopes with minimal volume, characterizing classes where the lower bound on volume, derived from Ehrhart polynomial bounds, is exactly attained, especially in relation to boundary and interior lattice points.
Contribution
The paper identifies and describes classes of lattice polytopes that achieve the minimal volume bound given by Ehrhart polynomial inequalities, extending known results in specific dimensions.
Findings
Characterization of lattice polytopes with minimal volume
Identification of classes where the Ehrhart bound is tight
Extension of Pick's formula to higher dimensions
Abstract
Let be a lattice polytope of dimension . Let denote the number of lattice points belonging to the boundary of and that to the interior of . It follows from the lower bound theorem of Ehrhart polynomials that, when , \[ {\rm vol}(\mathcal{P}) \geq (d \cdot c(\mathcal{P}) + (d-1) \cdot b(\mathcal{P}) - d^2 + 2)/d!, \] where is the (Lebesgue) volume of . Pick's formula guarantees that, when , the above inequality is an equality. In the present paper several classes of lattice polytopes for which the equality here holds will be presented.
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
TopicsComputational Geometry and Mesh Generation · Point processes and geometric inequalities · Advanced Polymer Synthesis and Characterization
