Small lattice polytopes have few vertices

Travis Dillon

Small lattice polytopes have few vertices

Metric Geometry 2026-06-29 v1 Combinatorics

Authors: Travis Dillon

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.

Cite

@article{arxiv.2606.30856,
  title  = {Small lattice polytopes have few vertices},
  author = {Travis Dillon},
  journal= {arXiv preprint arXiv:2606.30856},
  year   = {2026}
}

Comments

6 pages