Lattice 3-polytopes with few lattice points
M\'onica Blanco, Francisco Santos

TL;DR
This paper classifies all lattice 3-polytopes with five points, revealing a finite set of classes for width greater than one and extending White's earlier work on empty tetrahedra.
Contribution
It provides a complete classification of lattice 3-polytopes with five points and proves finiteness results for larger sizes and widths.
Findings
Exactly nine classes of 3-polytopes with five points and width two.
Infinite classes of width one polytopes.
Finiteness of classes for any fixed number of points and width > 1.
Abstract
We extend White's classification of empty tetrahedra to the complete classification of lattice -polytopes with five lattice points, showing that, apart from infinitely many of width one, there are exactly nine equivalence classes of them with width two and none of larger width. We also prove that, for each , there is only a finite number of (classes of) lattice -polytopes with lattice points and of width larger than one. This implies that extending the present classification to larger sizes makes sense, which is the topic of subsequent papers of ours.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
