2001
DOI: 10.5802/jtnb.342
|View full text |Cite
|
Sign up to set email alerts
|

Multiplicative functions and $k$-automatic sequences

Abstract: L'accès aux archives de la revue « Journal de Théorie des Nombres de Bordeaux » (http://jtnb.cedram.org/) implique l'accord avec les conditions générales d'utilisation (http://www.numdam.org/conditions). Toute utilisation commerciale ou impression systématique est constitutive d'une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright. Article numérisé dans le cadre du programme Numérisation de documents anciens mathématiques http://www.numdam.org/

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
25
0

Year Published

2008
2008
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 18 publications
(25 citation statements)
references
References 5 publications
0
25
0
Order By: Relevance
“…In light of Christol's theorem, it is natural to ask if one can characterize automatic multiplicative functions. Partial progress has been made by Yazdani [26] and Coons [13]. All examples of automatic multiplicative functions found thus far have the property that they are well behaved on the set of prime powers.…”
Section: Discussionmentioning
confidence: 99%
“…In light of Christol's theorem, it is natural to ask if one can characterize automatic multiplicative functions. Partial progress has been made by Yazdani [26] and Coons [13]. All examples of automatic multiplicative functions found thus far have the property that they are well behaved on the set of prime powers.…”
Section: Discussionmentioning
confidence: 99%
“…The transcendence of the series ∞ n=1 f (z)z n over Z(z) for f equal to each of the multiplicative functions τ k , σ k , and ϕ was shown by Yazdani [12]; the case f = µ was previously treated by Allouche [1] using a deep result of Cobham [7]. While transcendence results on power series are readily available, there are many open questions concerning their special values.…”
Section: Corollary 2 If µ Is the Möbius Function Then The Seriesmentioning
confidence: 99%
“…In particular, the question of classifying automatic multiplicative sequences has been investigated by a number of authors, including [1,2,7,8,12,14]. The interplay between multiplicative and automatic sequences is studied also in [3,5,11,13,15], among others.…”
Section: Introductionmentioning
confidence: 99%