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:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:683971563ff24
DTSTART;TZID=America/Toronto:20200130T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200130T143000
URL:/combinatorics-and-optimization/events/algebraic-co
 mbinatorics-seminar-neal-madras
SUMMARY:Algebraic Combinatorics Seminar - Neal Madras
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Random Pattern-Avoiding Permutations\n\nSpe
 aker:\n Neal Madras\n\nAffiliation:\n York University\n\nRoom:\n MC 5417\n
 \nABSTRACT:\n\nA \"pattern of length k\" is simply a permutation of {1\,..
 \,k}.  This\npattern is said to be contained in a permutation of {1\,...\
 ,N} (for\nN>k) if there is a subsequence of k elements of the (long) permu
 tation\nthat appears in the same relative order as the pattern.\n 
DTSTAMP:20250530T085030Z
END:VEVENT
END:VCALENDAR