Log-Concave Polynomials, Lattice Point Counting, and Traveling Salesperson Problem

Explore a comprehensive lecture on log-concave polynomials and their applications in mathematics and computer science. Delve into the polynomial capacity method, its use in proving the van der Waerden bound on the permanent, and the role of Lorentzian polynomials in proving Mason's conjectures. Discover how strongly Rayleigh probability bounds have improved the metric TSP approximation factor. Examine new applications of the polynomial capacity method, including bounds and approximations for counting lattice points of transportation and flow polytopes. Learn about recent probability lower bounds for strongly Rayleigh distributions and their impact on further improving the TSP approximation factor. Gain insights into collaborative research efforts involving Petter Brändén, Leonid Gurvits, Nathan Klein, Alejandro Morales, and Igor Pak.