## IMA Postdoc Seminar (October 2, 2007)

**Speaker:** Benjamin Nill (Freie Universität Berlin)

**Title:** Fast food, square magic, and polyhedra

**Abstract:** When considering the possible ways of ordering 200 Chicken McNuggets or dealing with the more classical challenge of finding the number of magic squares with given
magic number we are inevitably led to the problem of counting lattice points in lattice polytopes. We are going to describe two modern gems of lattice point enumeration, namely Brion's
theorem and Barvinok's algorithm, from an easily accessible viewpoint.

**Slides:** PDF