BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69f8905c2cdef
DTSTART;TZID=America/Toronto:20240423T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240423T160000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-jonathan-leake
SUMMARY:Graphs and Matroids - Jonathan Leake
CLASS:PUBLIC
DESCRIPTION:TITLE: Lorentzian polynomials\n\nSPEAKER:\n Jonathan Leake\n\nA
 FFILIATION:\n University of Waterloo\n\nLOCATION:\n MC 5417\n\nABSTRACT: L
 orentzian (aka completely log-concave) polynomials were\nrecently develope
 d by Brändén-Huh and Anari-Liu-Oveis Gharan-Vinzant\nto settle Mason's c
 onjectures on the log-concavity of the number of\nsize-k independent sets 
 of a matroid. In this talk\, we will define\nthese polynomials and sketch 
 the proof of these conjectures. Along the\nway we will also state other re
 sults which will demonstrate the very\nstrong connection between matroids 
 and Lorentzian polynomials.
DTSTAMP:20260504T122604Z
END:VEVENT
END:VCALENDAR