BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:Enumeration of subwords on sequences and its applications
DTSTART;VALUE=DATE-TIME:20230209T103000Z
DTEND;VALUE=DATE-TIME:20230209T113000Z
DTSTAMP;VALUE=DATE-TIME:20230329T105024Z
UID:indico-event-8800@cern.ch
DESCRIPTION:Abstract: We start with an enumeration problem studied by Guib
as and Odlyzko in 1979 and its applications in seemingly unrelated scenari
os that includes game theory\, pattern matching algorithm\, graph theory a
nd symbolic dynamics. One of the main objects of our study is a subshift o
f finite type\, which is used as a tool to model a large class of dynamica
l systems. It consists of collection of all one-sided sequences over a fin
ite symbol set which contain none of a given finite collection of words. W
e discuss its correspondence with an edge labeled multigraph and hence wit
h its associated adjacency matrix. We see how some (topological as well as
measure theoretic) properties of a subshift of finite type are studied us
ing this correspondence and solve a generalized version of the enumeration
problem.\n\nhttps://indico.tifr.res.in/indico/conferenceDisplay.py?confId
=8800
LOCATION: AG-69
URL:https://indico.tifr.res.in/indico/conferenceDisplay.py?confId=8800
END:VEVENT
END:VCALENDAR