BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:5878@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20221121T150000
DTEND;TZID=Europe/Paris:20221121T160000
DTSTAMP:20241120T200645Z
URL:https://www.i2m.univ-amu.fr/evenements/indistinguishable-asymptotic-pa
 irs/
SUMMARY:Sebastián Barbieri (Universidad de Santiago de Chile): Indistingui
 shable asymptotic pairs
DESCRIPTION:Sebastián Barbieri: We say two bi-infinite words are asymptoti
 c if they differ in finitely many coordinates. We say they are indistingui
 shable if for any finite word w\, the number of occurrences of w that inte
 rsect the set of differences in each of them is the same. In this talk we 
 will study these objects and show that they are very closely related to St
 urmian configurations. We will also show that a higher-dimensional analogu
 e of the theorem holds\, and as an application of this result we will prov
 ide a formula for computing the complexity of a multidimensional Sturmian 
 configuration on any finite connected support. This is joint work with S. 
 Labbé.\n\n\n\n\nThe address of the Zoom meeting is https://zoom.us/j/9224
 5493528 . The password is distributed in announcements. If you want to rec
 eive them\, or receive them and want to unsubscribe\, please write to Anna
  Frid.\nMore info: https://www.i2m.univ-amu.fr/wiki/Combinatorics-on-Words
 -seminar/
ATTACH;FMTTYPE=image/jpeg:https://www.i2m.univ-amu.fr/wp-content/uploads/2
 020/01/Sebastian_Barbieri_Lemp.jpg
CATEGORIES:Combinatorics on Words Seminar
LOCATION:Virtual event\, visioconférence\, virtual\, France
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=visioconférence\, virtual\
 , France;X-APPLE-RADIUS=100;X-TITLE=Virtual event:geo:0,0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20221030T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR