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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf7ddd9f2b9
DTSTART;TZID=America/Toronto:20241010T140000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20241010T150000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-an
 d-enumerative-combinatorics-seminar-joshua
SUMMARY:Algebraic and enumerative combinatorics seminar-Joshua Swanson
CLASS:PUBLIC
DESCRIPTION:TITLE: Cyclotomic generating functions\n\nSPEAKER: \n Joshua Sw
 anson\n\nAFFILIATION:\n University of Southern California \n\nLOCATION: \n
  MC 5479\n\nABSTRACT: It is a remarkable fact that for many statistics on 
 finite\nsets of combinatorial objects\, the roots of the corresponding\nge
 nerating function are each either a complex root of unity or zero.\nThese 
 and related polynomials have been studied for many years by a\nvariety of 
 authors from the fields of combinatorics\, representation\ntheory\, probab
 ility\, number theory\, and commutative algebra. We call\nsuch polynomials
  *cyclotomic generating functions* (CGFs). We will\nreview some of the man
 y known examples and give results to classify\nthe asymptotic behavior of 
 their coefficient sequences in certain\nregimes. \n\nJoint work with Sara 
 Billey.\n\nTHERE WILL BE A PRE-SEMINAR PRESENTING RELEVANT BACKGROUND AT T
 HE\nBEGINNING GRADUATE LEVEL STARTING AT 1PM.
DTSTAMP:20260403T084413Z
END:VEVENT
END:VCALENDAR