Lattice 3-polytopes with six lattice points
arXiv:1501.01055 · doi:10.1137/15M1014462
Abstract
We classify lattice -polytopes of width larger than one and with exactly lattice points. We show that there are polytopes of width , two polytopes of width , and none of larger width. We give explicit coordinates for representatives of each class, together with other invariants such as their oriented matroid (or order type) and volume vector. For example, according to the number of interior points these polytopes divide into tetrahedra with two interior points (clean tetrahedra), polytopes with one interior point (the canonical three-polytopes with five boundary points previously classified by Kasprzyk) and only hollow polytopes. We also give a complete classification of three-polytopes of width one with lattice points. In terms of the oriented matroid of these six points, they lie in eight infinite classes and twelve individual polytopes. Our motivation comes partly from the concept of distinct pair sum (or dps) polytopes, which, in dimension , can have at most lattice points. Among the classes mentioned above, exactly are dps.
31 pages, 18 figures, 9 tables, submitted to SoCG 2015
References in corpus (4)
Cited by in corpus (9)
- Lattice 3-polytopes with six lattice points
- The complete classification of empty lattice -simplices
- Enumeration of lattice 3-polytopes by their number of lattice points
- Classification of triples of lattice polytopes with a given mixed volume
- Three-dimensional lattice polytopes with two interior lattice points
- Non-spanning lattice 3-polytopes
- Gorenstein polytopes with trinomial -polynomials
- The Finiteness Threshold Width of Lattice Polytopes
- Classifying toric 3-fold codes of dimensions 4 and 5