Lattice polytopes with the minimal volume

Abstract

Let P ⊂ Rd be a lattice polytope of dimension d. Let b(P) denote the number of lattice points belonging to the boundary of P and c(P) that to the interior of P. It follows from the lower bound theorem of Ehrhart polynomials that, when c > 0, \[ vol(P) ≥ (d · c(P) + (d-1) · b(P) - d2 + 2)/d!, \] where vol(P) is the (Lebesgue) volume of P. Pick's formula guarantees that, when d = 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…