Small lattice polytopes have few vertices

Travis Dillon

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 i…