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:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e682674d8a5
DTSTART;TZID=America/Toronto:20260130T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260130T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-jonathan-leake-log-concavity-sampling-and
SUMMARY:Tutte Colloquium - Jonathan Leake-Log-concavity\, Sampling\, and\nL
 orentzian Polynomials
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Jonathan Leake\n\nAFFILIATION:\n University of Water
 loo\n\nLOCATION:\n MC 5501\n\nABSTRACT:  In this talk\, we demonstrate a
  connection between\nlog-concavity statements and sampling algorithms via 
 high-dimensional\nexpanders and Lorentzian polynomials. To do this\, we fi
 rst discuss two\nconjectures which were resolved about 5-10 years ago: one
  on the\nlog-concavity of independent sets of matroids (due to Brändén-H
 uh\nand Anari-Liu-Oveis Gharan-Vinzant)\, and one on efficiently sampling\
 nbases of matroids (due to Anari-Liu-Oveis Gharan-Vinzant). From there\nwe
  will present some new results on generalized graph colorings which\nexten
 d these and other previous results. In particular\, we will\ndiscuss how t
 his can be used to obtain log-concavity statements and\nsampling algorithm
 s for linear extensions of posets. Joint work with\nKasper Lindberg and S
 hayan Oveis Gharan.
DTSTAMP:20260420T194543Z
END:VEVENT
END:VCALENDAR