BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Swee Hong Chan (UCLA)
DTSTART:20210930T210000Z
DTEND:20210930T220000Z
DTSTAMP:20260417T043821Z
UID:ucla_comb_sem/12
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/ucla_comb_se
 m/12/">Log-concave inequalities for posets</a>\nby Swee Hong Chan (UCLA) a
 s part of UCLA Combinatorics Seminar\n\nLecture held in UCLA Math Sciences
  building\, room MS 3915A.\n\nAbstract\nThe study of log-concave inequalit
 ies 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) that the f-vectors of 
 matroid independence complex is ultra-log-concave. In this talk\, we discu
 ss a new proof of this result through linear algebra and discuss generaliz
 ations to greedoids and posets. This is a joint work with Igor Pak.\n\nThe
  talk is aimed at a general audience.\n
LOCATION:https://researchseminars.org/talk/ucla_comb_sem/12/
END:VEVENT
END:VCALENDAR