Multiples of lattice polytopes without interior lattice points

Details Multiples of lattice polytopes without interior lattice points Multiples of lattice polytopes without interior lattice points

2006-02-15

arxiv.org/abs/math/0602336v3

Moscow Math. J. 7 (2007), 195-207

Mathematics

Combinatorics

AMS-LaTeX, 13 pages; typos corrected, reference added

Scientific paper

Let $\Delta$ be an $n$-dimensional lattice polytope. The smallest non-negative integer $i$ such that $k \Delta$ contains no interior lattice points for $1 \leq k \leq n - i$ we call the degree of $\Delta$. We consider lattice polytopes of fixed degree $d$ and arbitrary dimension $n$. Our main result is a complete classification of $n$-dimensional lattice polytopes of degree $d=1$. This is a generalization of the classification of lattice polygons $(n=2)$ without interior lattice points due to Arkinstall, Khovanskii, Koelman and Schicho. Our classification shows that the secondary polytope of a lattice polytope of degree 1 is always a simple polytope.

Affiliated with

Also associated with

No associations

Rating

Multiples of lattice polytopes without interior lattice points does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multiples of lattice polytopes without interior lattice points, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiples of lattice polytopes without interior lattice points will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-255330