Extremal Problems for Convex Lattice Polytopes
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.
Date
Speakers
Imre Barany
Affiliation
Alfred Renyi Mathematical Institute, Hungarian Academy of Sciences