On completely multiplicative automatic sequences

DOI10.1016/j.jnt.2019.12.015zbMath1460.11035arXiv1903.04385OpenAlexW3002877276WikidataQ126314373 ScholiaQ126314373MaRDI QIDQ2182171

Shuo Li

Publication date: 21 May 2020

Published in: Journal of Number Theory (Search for Journal in Brave)

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

zbMATH Keywords

completely multiplicative functionautomatic sequence

Mathematics Subject Classification ID

Automata sequences (11B85)

Related Items (3)

How to prove that a sequence is not automatic ⋮ Multiplicative automatic sequences ⋮ A note on multiplicative automatic sequences

Cites Work

• Subword complexity and non-automaticity of certain completely multiplicative functions
• Rigidity theorems for multiplicative functions
• Mock characters and the Kronecker symbol
• Automatic Dirichlet series
• Completely Multiplicative Automatic Functions
• General multiplicative functions
• An Averaged Chowla and Elliott Conjecture Along Independent Polynomials
• Uniform tag sequences

This page was built for publication: On completely multiplicative automatic sequences