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:69ce84fbb78e9
DTSTART;TZID=America/Toronto:20200806T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200806T143000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-co
 mbinatorics-seminar-jordan-long
SUMMARY:Algebraic Combinatorics Seminar - Jordan Long
CLASS:PUBLIC
DESCRIPTION:TITLE: Subdivergence-free gluings of trees\n\nSpeaker:\n Jorda
 n Long\n\nAffiliation:\n University of Waterloo\n\nZoom:\n Contact Karen Y
 eats\n\nABSTRACT:\n\nMotivated by questions in quantum field theory\, we i
 ntroduce a purely\ncombinatorial problem of counting subdivergence-free gl
 uings of trees.\nWe present closed-form expressions counting subdivergence
 -free gluings\nfor four different families of trees\, as well as an algori
 thm to count\nsubdivergence-free gluings of arbitrary pairs of trees. This
  is joint\nwork with Clair Dai and Karen Yeats.
DTSTAMP:20260402T150219Z
END:VEVENT
END:VCALENDAR