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:69cfeaee27fc1
DTSTART;TZID=America/Toronto:20200310T084200
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200310T084200
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-francois-bergeron
LOCATION:MC - Mathematics &amp; Computer Building 200 University Avenue West 55
 01 Waterloo ON N2L 3G1 Canada
SUMMARY:Tutte Colloquium - François Bergeron
CLASS:PUBLIC
DESCRIPTION:TITLE: Rectangular Catalan Algebraic Combinatorics\n\nSpeaker\
 n François Bergeron\n\nAffiliation\n LACIM - Université du Québec à M
 ontréal\n\nRoom\n MC 5501\n\nABSTRACT:\n\nThe enumeration of Dyck-like la
 ttice paths in a m x n rectangle has a\nlong and fruitful history culminat
 ing in Bizley-Grossman’s formula\n(1954). We will discuss how it is natu
 ral to extend this formula to\nweighted enumeration\, with parameters acco
 unting for such statistics\nas area\; and to consider parking-function ana
 logs.
DTSTAMP:20260403T162934Z
END:VEVENT
END:VCALENDAR