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:69f93b340d9e0
DTSTART;TZID=America/Toronto:20240509T163000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240509T173000
URL:https://uwaterloo.ca/pure-mathematics/events/dynamical-self-similar-cov
 ering-sets
SUMMARY:Dynamical Self-similar Covering Sets
CLASS:PUBLIC
DESCRIPTION:Sascha Troscheit\, University of Oulu\n\nA classical problem in
  dynamical systems is known as the shrinking\ntarget problem: given a sequ
 ence of 'target' subsets A_n \\subset X and\na dynamic T: X \\to X we ask 
 how 'large' the set of all points R\n\\subset X is whose n-th iterate hits
  the target\, T^n (x) \\in A_n\,\ninfinitely often. Much progress has been
  made on understanding this\ntype of 'recurrent' set and I will highlight 
 some recent results on\nthis and the related 'dynamical covering problem' 
 which is a dynamical\ngeneralisation of the Dvoretzky covering problem. Th
 e talk is based on\njoint results with Balázs Bárány\, and Henna Koivus
 alo and Balázs\nBárány.\n\nMC5417
DTSTAMP:20260505T003500Z
END:VEVENT
END:VCALENDAR