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:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6827f74899d48
DTSTART;TZID=America/Toronto:20200310T084200
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200310T084200
URL:/combinatorics-and-optimization/events/tutte-colloq
 uium-francois-bergeron
SUMMARY:Tutte Colloquium - François Bergeron
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Rectangular Catalan Algebraic Combinatorics
 \n\nSpeaker\n François Bergeron\n\nAffiliation\n LACIM - Université du 
 Québec à Montréal\n\nRoom\n MC 5501\n\nABSTRACT:\n\nThe enumeration of 
 Dyck-like lattice paths in a m x n rectangle has a\nlong and fruitful hist
 ory culminating in Bizley-Grossman’s formula\n(1954). We will discuss ho
 w it is natural to extend this formula to\nweighted enumeration\, with par
 ameters accounting for such statistics\nas area\; and to consider parking-
 function analogs.\n 
DTSTAMP:20250517T024112Z
END:VEVENT
END:VCALENDAR