BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Jakub Konieczny (Hebrew University of Jerusalem\, Israel)
DTSTART:20200603T153000Z
DTEND:20200603T155500Z
DTSTAMP:20260423T011239Z
UID:CANT2020/34
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CANT2020/34/
 ">Automatic multiplicative sequences</a>\nby Jakub Konieczny (Hebrew Unive
 rsity of Jerusalem\, Israel) as part of Combinatorial and additive number 
 theory (CANT 2021)\n\n\nAbstract\nAutomatic sequences $-$ that is\, sequen
 ces computable by finite automata $-$ give rise \nto one of the most basic
  models of computation. As such\, for any class of sequences it is natural
  \nto ask which sequences in it are automatic. In particular\, the questio
 n of classifying automatic \nmultiplicative sequences has attracted consid
 erable attention in the recent years. \nIn the completely multiplicative c
 ase\, such classification was obtained independently \nby S. Li and O. Klu
 rman and P. Kurlberg. The main topic of my talk will be the resolution \no
 f the general case\, obtained in a recent preprint with Lemańczyk and C. 
 Müllner. \nI will also discuss some early results on classification of au
 tomatic semigroups\, \nwhich is the subject of ongoing work with O. Klurma
 n.\n
LOCATION:https://researchseminars.org/talk/CANT2020/34/
END:VEVENT
END:VCALENDAR