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:69d4440b8d718
DTSTART;TZID=America/Toronto:20210521T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20210521T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-steve-melczer
SUMMARY:Tutte Colloquium - Steve Melczer
CLASS:PUBLIC
DESCRIPTION:TITLE: Positivity Problems for Linear Recurrences\n\nSpeaker:\
 n Steve Melczer\n\nAffliliation:\n University of Waterloo\n\nZoom:\n Conta
 ct Emma Watson\n\nABSTRACT:\n\nAlthough sequences satisfying linear recur
 rence relations have been\nstudied for centuries\, and appear as some of t
 he first examples of\ncombinatorial sequences encountered in an introducto
 ry combinatorics\nclass\, there are natural examples of simply stated prob
 lems related to\ntheir basic behaviour whose decidability is unknown. In t
 his talk we\nsurvey some open computability and complexity questions relat
 ed to the\npositivity of linearly recurrent sequences\, before examining a
  new\napproach to proving positivity using rigorous numerical methods for\
 nfunctions satisfying linear differential equations.
DTSTAMP:20260406T233851Z
END:VEVENT
END:VCALENDAR