On completely multiplicative automatic sequences
Abstract
In this article we prove that all completely multiplicative automatic sequences (an)n ∈ N defined on C, vanishing or not, can be written in the form an=bnn where (bn)n ∈ N is an almost constant sequence, and (n)n ∈ N is a Dirichlet character.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.