(Non)Automaticity of number theoretic functions

DOI10.5802/JTNB.718zbMATH Open1223.11115arXiv0810.3709OpenAlexW2963578232MaRDI QIDQ628832FDOQ628832

Authors: Michael Coons 

Publication date: 7 March 2011

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

Abstract: Denote by $lambda(n)$ Liouville's function concerning the parity of the number of prime divisors of $n$. Using a theorem of Allouche, Mend`es France, and Peyri`ere and many classical results from the theory of the distribution of prime numbers, we prove that $lambda(n)$ is not $k$--automatic for any $k>2$. This yields that $su{m}_{n=1}^{i}nftylambda(n)X^{n}inmathbb{F}_p[[X]]$ is transcendental over $mathbb{F}_p(X)$ for any prime $p>2$. Similar results are proven (or reproven) for many common number--theoretic functions, including $phi$, $mu$, $Omega$, $omega$, $ho$, and others.

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

Recommendations

• scientific article; zbMATH DE number 3807734
• Automorphic functions and number theory
• scientific article; zbMATH DE number 3937238
• scientific article; zbMATH DE number 5356308
• scientific article; zbMATH DE number 3840035
• On non-entire arithmetic functions
• On nonatomicity for non-additive functions
• Multiplicative functions and \(k\)-automatic sequences
• scientific article; zbMATH DE number 3438840
• Non-vanishing of periods of automorphic functions

zbMATH Keywords

arithmetic functionsautomaticity

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (11)

• A note on multiplicative automatic sequences. II
• Multiplicative automatic sequences
• How to prove that a sequence is not automatic
• On asymptotically automatic sequences
• Transcendence of generating functions whose coefficients are multiplicative
• Mock characters and the Kronecker symbol
• Infinite products of cyclotomic polynomials
• Walking on real numbers
• Characteristic Sequences of the Sets of Sums of Squares as Columns of Cellular Automata
• Radial asymptotics of generating functions of \(k\)-regular sequences
• On multiplicative automatic sequences

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628832)