« Combinatorial Atlas for Log-concave Inequalities
Combinatorial Atlas for Log-concave Inequalities
November 29, 2021, 1:30 PM - 2:30 PM
Location:
Online Event
Swee Hong Chan, University of California, Los Angeles
The study of log-concave inequalities for combinatorial objects have seen much progress in recent years. One such progress is the solution to the strongest form of Mason's conjecture (independently by Anari et. al. and Brándën-Huh). In the case of graphs, this says that the sequence $f_k$ of the number of forests with $k$ edges, form an ultra log-concave sequence. In this talk, we discuss an improved version of all these results, proved by using a new tool called the combinatorial atlas method. This is a joint work with Igor Pak. This talk is aimed at a general audience.
Special Note: This seminar will be held online only via Zoom:
https://rutgers.zoom.us/j/97862162169?pwd=d09tOFllYTY0UDBMbGFqbzlKUlp2Zz09