The University of Michigan Combinatorics Seminar


Abstract 

I will discuss an efficient algorithm to approximate the number of contingency tables (nonnegative integer matrices with prescribed row and column sums) and integer flows in networks as well as certain BrunnMinkowski type inequalities relating the quantities of interest. The key idea is to approximate the number of integer points in a certain polytope by the integral of a logconcave density. 