On completely multiplicative automatic sequences
Résumé
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 = bnχn where (bn) n∈N is an almost constant sequence, and (χn) n∈N is a Dirichlet character.
Domaines
Mathématiques [math]
Fichier principal
Li - 2020 - On completely multiplicative automatic sequences.pdf (372.06 Ko)
Télécharger le fichier
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...