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:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d1fe9f8bc53
DTSTART;TZID=America/Toronto:20250711T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250711T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-stephen-melczer-0
SUMMARY:Tutte colloquium-Stephen Melczer
CLASS:PUBLIC
DESCRIPTION:TITLE:Automated Sequence Asymptotics\n\nSPEAKER:\n Stephen Melc
 zer\n\nAFFILIATION:\n University of Waterloo\n\nLOCATION:\n MC 5501\n\nABS
 TRACT:Computing with any sort of object requires a way of encoding\nit on 
 a computer\, which poses a problem in enumerative combinatorics\nwhere the
  objects of interest are (infinite) combinatorial sequences.\nThankfully\,
  the generating function of a combinatorial sequence often\nsatisfies natu
 ral algebraic/differential/functional equations\, which\ncan then be viewe
 d as data structures for the sequence. In this talk\nwe survey methods to 
 take a sequence encoded by such data structures\nand automatically determi
 ne asymptotic behaviour using techniques from\nthe field of analytic combi
 natorics. We also discuss methods to\nautomatically characterize the asymp
 totic behaviour of multivariate\nsequences using analytic combinatorics in
  several variables (ACSV).\nThe focus of each topic will be rigorous algor
 ithms that have already\nbeen implemented in computer algebra systems and 
 can be easily used by\nanyone.\n\n 
DTSTAMP:20260405T061807Z
END:VEVENT
END:VCALENDAR