2018
Dec
13

# Erdos Lectures: Igor Pak (UCLA) - Counting integer points in polytopes

## Lecturer:

Igor Pak (UCLA)

2:30pm to 3:30pm

## Location:

Manchester Building (Hall 2), Hebrew University Jerusalem

Given a convex polytope P, what is the number of integer points in P? This problem is of great interest in combinatorics and discrete geometry, with many important applications ranging from integer programming to statistics. From a computational point of view it is hopeless in any dimensions, as the knapsack problem is a special case. Perhaps surprisingly, in bounded dimension the problem becomes tractable. How far can one go? Can one count points in projections of P, finite intersections of such projections, etc?