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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e58f6c7a68d
DTSTART;TZID=America/Toronto:20221014T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20221014T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-jonathan-leake
SUMMARY:Tutte Colloquium - Jonathan Leake
CLASS:PUBLIC
DESCRIPTION:TITLE: Approximate Counting via Lorentzian Polynomials and Entr
 opy\nOptimization\n\nSpeaker:\n Jonathan Leake\n\nAffiliation:\n Universit
 y of Waterloo\n\nLocation:\n MC 5501 or contact Melissa Cambridge for Zoom
  link\n\nABSTRACT: Over the past 20 years\, Lorentzian and real stable\npo
 lynomials have been used to derive a number of combinatorial\ntheorems\, f
 rom log-concavity statements to counting and volume bounds.\nOne significa
 nt thread of this research lies in the utilization of\nentropy optimizatio
 n methods to approximately count certain\ncombinatorial objects\, such as 
 the matchings of a bipartite graph\, the\nintersection of the sets of base
 s of two matroids\, and the integer\npoints of various polytopes in genera
 l. In this talk\, we will discuss\nvarious results one can achieve using s
 uch methods.
DTSTAMP:20260420T022900Z
END:VEVENT
END:VCALENDAR