BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Jakub Konieczny (Hebrew University of Jerusalem)
DTSTART:20200525T111500Z
DTEND:20200525T121500Z
DTSTAMP:20260423T041508Z
UID:WarsawNT/1
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/WarsawNT/1/"
 >Automatic multiplicative sequences</a>\nby Jakub Konieczny (Hebrew Univer
 sity of Jerusalem) as part of Warsaw Number Theory Seminar\n\nLecture held
  in room 403 at IMPAN.\n\nAbstract\nAutomatic sequences - that is\, sequen
 ces computable by finite automata - give rise to one of the most basic mod
 els of computation. As such\, for any class of sequences it is natural to 
 ask which sequences in it are automatic. In particular\, the question of c
 lassifying automatic multiplicative sequences has attracted considerable a
 ttention in the recent years. In the completely multiplicative case\, such
  classification was obtained independently by S. Li and O. Klurman and P. 
 Kurlberg. The main topic of my talk will be the resolution of the general 
 case\, obtained in a recent preprint with M. Lemańczyk and C. Müllner.\n
LOCATION:https://researchseminars.org/talk/WarsawNT/1/
END:VEVENT
END:VCALENDAR