|Date: Friday, March 09, 2018
Location: B844 East Hall (11:10 AM to 12:00 PM)
Title: Recruitment Symposium: Complex Geometry and Computational Complexity
Abstract: For a variety of reasons, we sometimes want to evaluate (exactly or approximately) multivariate polynomials (physicists call them "partition functions") defined as sums of great many monomials, indexed by some combinatorial structures, such as permutations. A good example is provided by the permanent of a matrix, which looks like the determinant, only simpler: all monomials are counted with the "+" sign. It turns out that such a polynomial can be evaluated efficiently in a complex domain if it does not have zeros in a slightly larger domain. I am going to describe some results and simple-looking questions which we have no idea how to answer.
Speaker: Sasha Barvinok