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:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a2430021093f
DTSTART;TZID=America/Toronto:20191028T160000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20191028T160000
URL:https://uwaterloo.ca/pure-mathematics/events/colloquium-4
SUMMARY:Colloquium
CLASS:PUBLIC
DESCRIPTION:ALEXANDER YONG\, UNIVERSITY OF ILLINOIS AT URBANA-CHAMPAIGN\n\n
 \"Complexity\, combinatorial positivity\, and Newton polytopes\"\n\nThe No
 nvanishing Problem asks if a coefficient of a polynomial is\nnonzero. Many
  families of polynomials in algebraic combinatorics admit\ncombinatorial c
 ounting rules and simultaneously enjoy having saturated\nNewton polytopes 
 (SNP). Thereby\, in amenable cases\, Nonvanishing is in\nthe complexity cl
 ass of problems with “good characterizations”.\nThis suggests a new al
 gebraic combinatorics viewpoint on complexity\ntheory. 
DTSTAMP:20260606T143442Z
END:VEVENT
END:VCALENDAR