Title: Counting Contingency Tables
Speaker: Igor Pak - University of California at Los Angeles
Abstract: Contingency tables are nonnegative integer matrices with fixed row and column sums. They were introduced in statistics and are now used widely throughout combinatorics and applications — from graphical enumeration to Young tableaux and flow polytopes. Both counting and random generation of contingency tables remains difficult, with many open questions. I will give a broad survey of classical and recent results on the subject, emphasising recent theoretical challenges.