(Non)Automaticity of number theoretic functions

DOI10.5802/jtnb.718zbMath1223.11115arXiv0810.3709OpenAlexW2963578232MaRDI QIDQ628832

Michael Coons

Publication date: 7 March 2011

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

Full work available at URL: https://arxiv.org/abs/0810.3709

zbMATH Keywords

arithmetic functionsautomaticity

Mathematics Subject Classification ID

Other results on the distribution of values or the characterization of arithmetic functions (11N64)

Related Items (9)

How to prove that a sequence is not automatic ⋮ Walking on real numbers ⋮ 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 ⋮ Mock characters and the Kronecker symbol ⋮ Multiplicative automatic sequences ⋮ Transcendence of generating functions whose coefficients are multiplicative ⋮ INFINITE PRODUCTS OF CYCLOTOMIC POLYNOMIALS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automaticity. IV: Sequences, sets, and diversity
• Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
• Transcendence of formal power series with rational coefficients
• Multiplicative functions and \(k\)-automatic sequences
• Mahler functions and transcendence
• Automatic Dirichlet series
• Irrationality of power series for various number theoretic functions
• On the complexity of algebraic numbers. I: Expansions in integer bases
• Transcendence of power series for some number theoretic functions
• Dirichlet Series and Curious infinite Products
• More than two fifths of the zeros of the Riemann zeta function are on the critical line.
• Automatic Sequences
• On the Recognition of Primes by Automata
• Unrecognizable Sets of Numbers
• Uniform tag sequences
• Finite Automata and the Set of Squares

This page was built for publication: (Non)Automaticity of number theoretic functions