| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8900549 | Advances in Applied Mathematics | 2017 | 9 Pages |
Abstract
In this article, we prove that for a completely multiplicative function f from Nâ to a field K such that the set{p|f(p)â 1Kand p is prime} is finite, the asymptotic subword complexity of f is Î(nt), where t is the number of primes p that f(p)â 0K,1K. This proves in particular that sequences like ((â1)v2(n)+v3(n))n are not k-automatic for kâ¥2.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Yining Hu,