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:6833d33e968fd
DTSTART;TZID=America/Toronto:20200806T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200806T143000
URL:/combinatorics-and-optimization/events/algebraic-co
 mbinatorics-seminar-jordan-long
SUMMARY:Algebraic Combinatorics Seminar - Jordan Long
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Subdivergence-free gluings of trees\n\nSpea
 ker:\n Jordan Long\n\nAffiliation:\n University of À¶Ý®ÊÓƵ\n\nZoom:\n Con
 tact Karen Yeats\n\nABSTRACT:\n\nMotivated by questions in quantum field t
 heory\, we introduce a purely\ncombinatorial problem of counting subdiverg
 ence-free gluings of trees.\nWe present closed-form expressions counting s
 ubdivergence-free gluings\nfor four different families of trees\, as well 
 as an algorithm to count\nsubdivergence-free gluings of arbitrary pairs of
  trees. This is joint\nwork with Clair Dai and Karen Yeats.\n 
DTSTAMP:20250526T023438Z
END:VEVENT
END:VCALENDAR