2000 character limit reached
On multiplicative automatic sequences
Published 28 May 2019 in math.NT, cs.FL, and math.CO | (1905.11981v3)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.