Papers
Topics
Authors
Recent
2000 character limit reached

Lattice polytopes with the minimal volume (2409.12212v1)

Published 18 Sep 2024 in math.CO

Abstract: Let $\mathcal{P} \subset \mathbb{R}d$ be a lattice polytope of dimension $d$. Let $b(\mathcal{P})$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c(\mathcal{P})$ that to the interior of $\mathcal{P}$. It follows from the lower bound theorem of Ehrhart polynomials that, when $c > 0$, [ {\rm vol}(\mathcal{P}) \geq (d \cdot c(\mathcal{P}) + (d-1) \cdot b(\mathcal{P}) - d2 + 2)/d!, ] where ${\rm vol}(\mathcal{P})$ is the (Lebesgue) volume of $\mathcal{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.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Paper to Video (Beta)

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.