Tutte Colloquium - Jonathan Leake

Friday, October 14, 2022 3:30 pm - 3:30 pm EDT (GMT -04:00)

Title: Approximate Counting via Lorentzian Polynomials and Entropy Optimization

Speaker: Jonathan Leake
Affiliation: University of Waterloo
Location: MC 5501 or contact Melissa Cambridge for Zoom link

Abstract: Over the past 20 years, Lorentzian and real stable polynomials have been used to derive a number of combinatorial theorems, from log-concavity statements to counting and volume bounds. One significant thread of this research lies in the utilization of entropy optimization methods to approximately count certain combinatorial objects, such as the matchings of a bipartite graph, the intersection of the sets of bases of two matroids, and the integer points of various polytopes in general. In this talk, we will discuss various results one can achieve using such methods.