Extremal Problems for Convex Lattice Polytopes
Presenter
March 15, 2010
Keywords:
- Computer Science and Discrete Mathematics (CSDM)
Abstract
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.