pith. sign in

arxiv: 1602.03042 · v3 · pith:WF6QX2LCnew · submitted 2016-02-09 · 🧮 math.NT · math.DS

Automatic sequences fulfill the Sarnak conjecture

classification 🧮 math.NT math.DS
keywords sequencesautomaticconjecturemethodsarnakallowsautomataclass
0
0 comments X
read the original abstract

We present in this paper a new method to deal with automatic sequences. This method allows us to prove a M\"obius-randomness-principle for automatic sequences from which we deduce the Sarnak conjecture for this class of sequences. Furthermore, we can show a Prime Number Theorem for automatic sequences that are generated by strongly connected automata where the initial state is fixed by the transition corresponding to $0$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.