BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Ľubomíra Dvořáková
DTSTART:20260609T130000Z
DTEND:20260609T140000Z
DTSTAMP:20260604T191814Z
UID:CombinatoricsOnWords/138
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/Combinatoric
 sOnWords/138/">Attractors of sequences coding beta-integers</a>\nby Ľubom
 íra Dvořáková as part of One World Combinatorics on Words Seminar\n\n\
 nAbstract\nString attractor is an intensively studied object in Combinator
 ics on Words.\nIn our talk\, we will recall known results and also some pr
 eviously used techniques.\nWe will then describe minimal string attractors
  of prefixes of simple Parry sequences.\nThese sequences form a coding of 
 distances between consecutive beta-integers in numeration systems with a r
 eal base beta.\nSimple Parry sequences have been recently studied from thi
 s point of view and (not necessarily minimal) attractors of their prefixes
  have been described and a conjecture that attractors of alphabet size sho
 uld be sufficient was stated. We prove this conjecture. Moreover\, we prov
 ide attractors of prefixes of some particular form of binary non-simple Pa
 rry sequences.\n
LOCATION:https://researchseminars.org/talk/CombinatoricsOnWords/138/
END:VEVENT
END:VCALENDAR