Multiplicative functions and \(k\)-automatic sequences

DOI10.5802/jtnb.342zbMath1002.11025OpenAlexW2033908821MaRDI QIDQ1606180

Soroosh Yazdani

Publication date: 24 July 2002

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=JTNB_2001__13_2_651_0

zbMATH Keywords

transcendencemultiplicative functionsfinite automata

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Automata sequences (11B85)

Related Items (13)

How to prove that a sequence is not automatic ⋮ Bracket words: A generalisation of Sturmian words arising from generalised polynomials ⋮ Characteristic Sequences of the Sets of Sums of Squares as Columns of Cellular Automata ⋮ On multiplicative automatic sequences ⋮ A note on multiplicative automatic sequences, II ⋮ (Non)Automaticity of number theoretic functions ⋮ Automata methods in transcendence ⋮ Mock characters and the Kronecker symbol ⋮ Automatic sequences are orthogonal to aperiodic multiplicative functions ⋮ Transcendence of power series for some number theoretic functions ⋮ Multiplicative automatic sequences ⋮ Transcendence of generating functions whose coefficients are multiplicative ⋮ A note on multiplicative automatic sequences

Cites Work

• Unnamed Item
• The distribution of powerful integers
• Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
• Sur la transcendance de la série formelle Π
• Suites algébriques, automates et substitutions
• Automata and transcendence of the Tate period in finite characteristic
• Unrecognizable Sets of Numbers
• Uniform tag sequences

This page was built for publication: Multiplicative functions and \(k\)-automatic sequences