Personal tools
You are here: Home / Events / Integer-point Enumeration in Polyhedra

Integer-point Enumeration in Polyhedra

Filed under:
Prof. Matthias Beck (San Francisco State University, USA), 26 March 2012, 1:30 p.m., RISC seminar room
When Mar 26, 2012
from 01:30 PM to 03:30 PM
Where RISC seminar room
Add event to calendar vCal
iCal

Integer-point Enumeration in Polyhedra

We use generating functions and complex-analytic methods to count integer lattice points in polytopes with rational vertices. More precisely, we study the number of lattice points as the polytope gets dilated by an integer factor. This expression is known as the Ehrhart quasipolynomial. Because polytopes can be described by a system of linear equalities and inequalities, they appear in a wealth of areas. We will show applications of Ehrhart quasipolynomials to number theory, combinatorics, and computational geometry, illustrating (or so we hope) that pure mathematics and computationally efficient algorithms are not mutually exclusive.