The complete classification of empty lattice 4-simplices (Q5916272)

Lattice polytopes have been widely studied for their relations to algebraic geometry and integer optimization. Classification in dimension three of empty lattice simplices is sometimes dubbed the terminal lemma. \textit{S. Mori} et al. conjectured [Math. Comput. 51, No. 184, 769--786 (1988; Zbl 0712.14026)] a classification of empty 4-dimensional simplices of prime volume into a three-parameter family, one two-parameter family, 29 one-parameter families, and a finite list of exceptions, of volumes up to 419. This classification was later proved by \textit{J. W. Bober} [J. Lond. Math. Soc., II. Ser. 79, No. 2, 422--444 (2009; Zbl 1195.11025)]. For the non-prime case, \textit{M. Barile} et al. [Proc. Am. Math. Soc. 139, No. 12, 4247--4253 (2011; Zbl 1238.14003)] claimed that the classification of Mori et al. can be extended with few changes but it turns out that this statement is false as proved by \textit{M. Blanco} et al. [``The finiteness threshold width of lattice polytopes'', Preprint, \url{arXiv:1607.00798}]. In a previous work, the authors classified empty 4-simplices of width three or more, proving that the maximum volume among them is 179, as it was conjectured by \textit{C. Haase} and \textit{G. M. Ziegler} [Eur. J. Comb. 21, No. 1, 111--119 (2000; Zbl 0966.52013)]. Knowing that empty 4-simplices of width one are easy to classify in arbitrary dimension the authors classify in this article all 4-simplices of width two. They proved that there are 2 two-parameter families that project to the second dilatation of a unimodular triangle, 52 one-parameter families of them that project to hollow 3-polytopes, and 2282 individual ones that do not. For the entire collection see [Zbl 1392.05001].