|
|
Summer Graduate Workshop
Computing the Continuous Discretely: Integer Point Enumeration in Polyhedra (Summer Graduate Workshop)
Aug 6, 2005
to
Aug 20, 2005
Organizer(s)Mathias Beck and Sinai Robins
ContactThe objective of the summer school is to introduce students to a vital area of mathematics which exemplifies the interaction between different mathematical subjects, as well as the interaction between theoretical and computational aspects of mathematics. The participants will experience a deeper understanding of the wide range of mathematical fields and how they connect, and they will get first-hand experience of the excitement and challenges that are lurking behind computational experiments. While the roots for counting problems in polytopes reach far back (Pick's Theorem, e.g., is more than a hundred years old), the last decade has seen major breakthroughs in this area of discrete geometry, when researchers have concentrated on finding theoretical and computational methods to count integer points in polytopes. Only very recently have mathematicians started to apply these results to certain special classes of polytopes, often motivated by problems outside discrete geometry, e.g. representation theory, combinatorics, number theory, topology, and commutative algebra.
We plan to cover roughly the following:
Lecture notes for the workshops will be available at http://math.sfsu.edu/beck/papers/ccd.html. ![]()
Questions about this workshop should be sent either by email to
or by regular mail to:
The Institute is committed to the principles of Equal Opportunity and Affirmative Action. |