Automatic multiplicative sequences
Jakub Konieczny (Hebrew University of Jerusalem)
25-May-2020, 11:15-12:15 (4 years ago)
Abstract: Automatic sequences - that is, sequences computable by finite automata - give rise to one of the most basic models 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 classifying automatic multiplicative sequences has attracted considerable attention 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.
number theory
Audience: researchers in the topic
( slides )
| Organizers: | Jakub Byszewski*, Bartosz Naskręcki, Bidisha Roy, Masha Vlasenko* |
| *contact for this listing |
Export talk to