(Non)Automaticity of number theoretic functions (Q628832): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 0810.3709 / rank | |||
Normal rank |
Revision as of 15:25, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | (Non)Automaticity of number theoretic functions |
scientific article |
Statements
(Non)Automaticity of number theoretic functions (English)
0 references
7 March 2011
0 references
The authors prove that Liouville's arithmetic function \(\lambda(n)\) is not \(k\)-automatic for any \(k>2\). This yields that \(\sum _{n=1}^{\infty }\lambda (n)X^{ n }\in \mathbb F_{ p }[[X]]\) is transcendental over \(\mathbb F_{ p }(X)\) for any prime \(p>2\). Similar results are proven (or reproven) for many common arithmetic functions, including \(\phi \) (Euler's function ), \(\mu \) (Möbius), \(\Omega \), \(\omega \), \(\rho \), and others.
0 references
arithmetic functions
0 references
automaticity
0 references