A classification of smooth convex 3-polytopes with at most 16 lattice points (Q1938790)

A \(d\)-dimensional lattice polytope \(P\) is called smooth, if every vertex is contained in exactly \(d\) edges and the edge-directions for every vertex form a lattice basis. By a work of Bogart et al., it was shown that for given \(d,k>0\) there are only finitely many smooth convex \(d\)-polytopes that contain less then \(k\) lattice points (up to isomorphism). The author gives a complete classification of all those polytopes for \(d=3\) and \(k=16\), i.e., for all smooth convex \(3\)-polytopes with at most \(16\) lattice points. Additionally, the work contains an enumeration of all \(103\) those \(3\) polytopes with at most \(16\) lattice points. The list contains 99 strict Cayley polytopes, whereas the remaining \(4\) are inverse stellar subdivisions of strict Cayley polytopes. The result can be transformed into a statement about smooth embeddings of toric threefolds in \(\mathbb{P}^n\). Again for \(n\leq 15\) there are up to isomorphism exactly 103 such embeddings.