Extremal Problems for Convex Lattice Polytopes

Extremal Problems for Convex Lattice Polytopes - Imre Barany

Imre Barany
Alfred Renyi Mathematical Institute, Hungarian Academy of Sciences
March 15, 2010

In this survey I will present several extremal problems, and some solutions, concerning convex lattice polytopes.
A typical example is to determine the smallest area that a convex lattice polygon can have if it has exactly n vertices.