Small lattice polytopes have few vertices
arXiv:2606.30856
Abstract
This is a geometric retelling of Konyagin and Sevast'yanov's proof of Andrew's theorem, which is a tight upper bound on the number of vertices of a d-dimensional lattice polytope in terms of its volume.
6 pages