Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On completely multiplicative automatic sequences (1903.04385v3)

Published 11 Mar 2019 in math.CO and math.NT

Abstract: In this article we prove that all completely multiplicative automatic sequences $(a_n){n \in \mathbf{N}}$ defined on $\mathbf{C}$, vanishing or not, can be written in the form $a_n=b_n\chi_n$ where $(b_n){n \in \mathbf{N}}$ is an almost constant sequence, and $(\chi_n)_{n \in \mathbf{N}}$ is a Dirichlet character.

Summary

We haven't generated a summary for this paper yet.