# abstract

COMPUTER SCIENCE/DISCRETE MATH I | |

Topic: | Extremal Problems for Convex Lattice Polytopes |

Speaker: | Imre Barany |

Affiliation: | Alfred Renyi Mathematical Institute, Hungarian Academy of Sciences |

Date: | Monday, March 15 |

Time/Room: | 11:15am - 12:15pm/West Bldg. Lecture Hall |

Video Link: | https://video.ias.edu/csdm/convexlatticepolytopes |

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.