Home /  Workshop /  Schedules /  Complexity of counting integer points

Complexity of counting integer points

Geometric and topological combinatorics: Modern techniques and methods October 09, 2017 - October 13, 2017

October 13, 2017 (09:30 AM PDT - 10:30 AM PDT)
Speaker(s): Igor Pak (University of California, Los Angeles)
Location: SLMath: Eisenbud Auditorium
Tags/Keywords

  • Integer points

  • convex polytopes

Primary Mathematics Subject Classification
Secondary Mathematics Subject Classification No Secondary AMS MSC
Video

15-Pak
Abstract

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.
Supplements
29719?type=thumb Pak Notes 2.48 MB application/pdf Download
Video/Audio Files

15-Pak

H.264 Video 15-Pak.mp4 456 MB video/mp4 rtsp://videos.msri.org/data/000/029/609/original/15-Pak.mp4 Download
Troubles with video?

Please report video problems to itsupport@slmath.org.

See more of our Streaming videos on our main VMath Videos page.