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:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6832ab71d0065
DTSTART;TZID=America/Toronto:20210610T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20210610T130000
URL:/combinatorics-and-optimization/events/algebraic-co
 mbinatorics-seminar-lukas-nabergall-0
SUMMARY:Algebraic Combinatorics Seminar - Lukas Nabergall
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Enumerating hereditary classes of chord dia
 grams\n\nSpeaker:\n Lukas Nabergall\n\nAffiliation:\n University of Waterl
 oo\n\nZoom:\n Contact Stephen Melczer\n\nABSTRACT:\n\nA class of combinato
 rial structures is hereditary if membership in the\nclass is closed under 
 taking substructures. Hereditary classes have\nbeen extensively studied fo
 r a variety of objects\, notably graphs and\npermutations. A central probl
 em is to determine the number of objects\nof size n in a given hereditary 
 class. We discuss this problem for\nchord diagrams\, perfect matchings of 
 [2n].\n 
DTSTAMP:20250525T053233Z
END:VEVENT
END:VCALENDAR