Seminar Details
Combinatorial Atlas for Log-concave Inequalities
- Start Date: November 29, 2021
- Event Start Time: 1:30 PM
- Event End Time: 2:30 PM
- Seminar Series: Rutgers Discrete Mathematics Seminar
- Presenter(s): Swee Hong Chan - University of California, Los Angeles
- Event Location: Online Event
- Event Additional Info: <p>Special Note: <strong>This seminar will be held online only via Zoom</strong>:</p> <p><a href="https://rutgers.zoom.us/j/97862162169?pwd=d09tOFllYTY0UDBMbGFqbzlKUlp2Zz09">https://rutgers.zoom.us/j/97862162169?pwd=d09tOFllYTY0UDBMbGFqbzlKUlp2Zz09</a> </p> <p><br /> See: <a href="https://sites.google.com/view/rutgersdmseminar">https://sites.google.com/view/rutgersdmseminar</a></p>
- Presentation Type: Stand Alone Presentation
- Abstract:
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.