Classification of empty lattice -simplices of width larger than two
arXiv:1704.07299 · doi:10.1090/tran/7531
Abstract
A lattice -simplex is the convex hull of affinely independent integer points in . It is called empty if it contains no lattice point apart of its vertices. The classification of empty -simplices is known since 1964 (White), based on the fact that they all have width one. But for dimension no complete classification is known. Haase and Ziegler (2000) enumerated all empty -simplices up to determinant 1000 and based on their results conjectured that after determinant all empty -simplices have width one or two. We prove this conjecture as follows: - We show that no empty -simplex of width three or more can have determinant greater than 5058, by combining the recent classification of hollow 3-polytopes (Averkov, Krümpelmann and Weltge, 2017) with general methods from the geometry of numbers. - We continue the computations of Haase and Ziegler up to determinant 7600, and find that no new -simplices of width larger than two arise. In particular, we give the whole list of empty -simplices of width larger than two, which is as computed by Haase and Ziegler: There is a single empty -simplex of width four (of determinant 101), and 178 empty -simplices of width three, with determinants ranging from 41 to 179.
21 pages, 5 figures; The appendix from v3 has been incorporated into the main text. This version has been accepted for publication in Trans. Ame. Math. Soc
Cited by in corpus (9)
- Classification of triples of lattice polytopes with a given mixed volume
- Hollow polytopes of large width
- A local maximizer for lattice width of -dimensional hollow bodies
- Elementary moves on lattice polytopes
- The covering radius and a discrete surface area for non-hollow simplices
- The Finiteness Threshold Width of Lattice Polytopes
- Computing the covering radius of a polytope with an application to lonely runners
- Linearly-exponential checking is enough for the Lonely Runner Conjecture and some of its variants
- Empty simplices of large width