2000 character limit reached
On multiplicative automatic sequences (1905.11981v3)
Published 28 May 2019 in math.NT, cs.FL, and math.CO
Abstract: We show that any automatic multiplicative sequence either coincides with a Dirichlet character or is identically zero when restricted to integers not divisible by small primes. This answers a question of Bell, Bruin and Coons. A similar result was obtained independently by Klurman and Kurlberg.