Complexity of counting integer points
Igor Pak (University of California, Los Angeles)
MSRI: Simons Auditorium
I will survey some recent progress on complexity of counting integer points in convex polytopes of fixed dimension. A few our results will have a seductively easy yet counterintuitive statements. The talk will assume no background and will be very accessible. Joint work with Danny Nguyen.