English

Lattice polytopes with the minimal volume

Combinatorics 2024-11-12 v1

Abstract

Let PRd\mathcal{P} \subset \mathbb{R}^d be a lattice polytope of dimension dd. Let b(P)b(\mathcal{P}) denote the number of lattice points belonging to the boundary of P\mathcal{P} and c(P)c(\mathcal{P}) that to the interior of P\mathcal{P}. It follows from the lower bound theorem of Ehrhart polynomials that, when c>0c > 0, vol(P)(dc(P)+(d1)b(P)d2+2)/d!, {\rm vol}(\mathcal{P}) \geq (d \cdot c(\mathcal{P}) + (d-1) \cdot b(\mathcal{P}) - d^2 + 2)/d!, where vol(P){\rm vol}(\mathcal{P}) is the (Lebesgue) volume of P\mathcal{P}. Pick's formula guarantees that, when d=2d = 2, the above inequality is an equality. In the present paper several classes of lattice polytopes for which the equality here holds will be presented.

Keywords

Cite

@article{arxiv.2409.12212,
  title  = {Lattice polytopes with the minimal volume},
  author = {Ginji Hamano and Ichiro Sainose and Takayuki Hibi},
  journal= {arXiv preprint arXiv:2409.12212},
  year   = {2024}
}
R2 v1 2026-06-28T18:49:24.215Z