The seminar “computing the continuous discretely“ is intended for Bachelor students who would like to know the basics of Integer-Points enumeration theory in Polyhedra. It will follow closely the homonymous book by Matthias Beck and Sinai Robins. The program presented by the students will mainly cover Part I of the book, possibly the first three or four chapters. 

 

Termin: 28.04.2017 im Souterrain, Weyertal 80 

​

Literatur

Computing the continuous discretely, von Matthias Beck und Sinai Robins.

​

Zeitplan:

​

9:30-10:00 Thomas Rot/Silvia Sabatini, The Coin-exchange problem, Seiten 3-11 (Abschnitte 1.1-1.3)

10:00-11:15 Karl Janicki, Sylvesters result and the language of polytopes, Seiten 11-15 und 25-29 (Abschnitte 1.4, 1.5 & 2.1, 2.2)

11:30-12:45 Gregor Linden, Lattice point enumerators, Seiten 29-38 (Abschnitte 2.3-2.5)

13:15-14:30 Christian Harder, Pick's theorem, Seiten 38-45 (Abschnitte 2.6-2.7)

14:45-16:00 Sabrina Bonzelet, Euler’s generating function and cones , Seiten 45-48 und 57-63 (Abschnitte 2.8, 3.1 und 3.2)

16:15-17:45 Sebastian Degen, Ehrhart approach, Seiten 64-71 (Abschnitte 3.3 und 3.4)

​