BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Swee Hong Chan (Rutgers University)
DTSTART:20221101T190000Z
DTEND:20221101T200000Z
DTSTAMP:20260423T040115Z
UID:Matroids/9
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/Matroids/9/"
 >Combinatorial atlas for log-concave inequalities</a>\nby Swee Hong Chan (
 Rutgers University) as part of Matroids - Combinatorics\, Algebra and Geom
 etry Seminar\n\nLecture held in Room 210 The Fields Institute.\n\nAbstract
 \nThe study of log-concave inequalities for combinatorial objects have see
 n 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 of the graph with $k$ edges\, form an ultra log-
 concave sequence. In this talk\, we discuss an improved version of all the
 se results\, proved by using a new tool called the combinatorial atlas met
 hod. This is a joint work with Igor Pak. This talk is aimed at a general a
 udience.\n
LOCATION:https://researchseminars.org/talk/Matroids/9/
END:VEVENT
END:VCALENDAR