2000 character limit reached
A note on multiplicative automatic sequences, II (1905.10897v1)
Published 26 May 2019 in math.NT and math.CO
Abstract: We prove that any $q$-automatic multiplicative function $f:\mathbb{N}\to\mathbb{C}$ either essentially coincides with a Dirichlet character, or vanishes on all sufficiently large primes. This confirms a strong form of a conjecture of J. Bell, N. Bruin, and M. Coons.