We prove that any $q$-automatic multiplicative function $f:\mathbb{N}\to\mathbb{C}$ either essentially coincides with a Dirichlet character, or vanishes on all sufficiently large primes. This confirms a strong form of a conjecture of J. Bell, N. Bruin, and M. Coons
AbstractChristol et al. (1980) proved that, for any prime p, a sequence x=(x1, x2,…,) over the set {...
AbstractIn this paper we study some of the properties of specially multiplicative functions, which a...
This thesis gives some order estimates and asymptotic formulae associated with general classes of no...
We show that a completely multiplicative automatic function, which does not take 0 as a value, is al...
International audienceWe show that any automatic multiplicative sequence either coincides with a Dir...
Let χ0, χ1, χ2, … be the sequence of all Dirichlet characters (in which the principal character χ0 o...
We introduce a simple sieve-theoretic approach to studying partial sums of multiplicative functions ...
CMO functions multiplicative functions f for which ∑n=1∞f(n)=0. Such functions were first defined an...
The study of the distribution of general multiplicative functions on arithmetic progressions is, lar...
We present a class of multiplicative functions $f:\mathbb{N}\to\mathbb{C}$ with bounded partial sums...
We give a criterion for a sequence (a_n)_{n >= 1} to be non-automatic, i.e., for when there does not...
AbstractDirichlet series whose coefficients are generated by finite automata define meromorphic func...
A heuristic in analytic number theory stipulates that sets of positive integers cannot simultaneousl...
Halász’s Theorem gives an upper bound for the mean value of a multiplicative function f. The bound i...
The purpose of this paper is to study subsequences of synchronizing $k$-automatic sequences $a(n)$ a...
AbstractChristol et al. (1980) proved that, for any prime p, a sequence x=(x1, x2,…,) over the set {...
AbstractIn this paper we study some of the properties of specially multiplicative functions, which a...
This thesis gives some order estimates and asymptotic formulae associated with general classes of no...
We show that a completely multiplicative automatic function, which does not take 0 as a value, is al...
International audienceWe show that any automatic multiplicative sequence either coincides with a Dir...
Let χ0, χ1, χ2, … be the sequence of all Dirichlet characters (in which the principal character χ0 o...
We introduce a simple sieve-theoretic approach to studying partial sums of multiplicative functions ...
CMO functions multiplicative functions f for which ∑n=1∞f(n)=0. Such functions were first defined an...
The study of the distribution of general multiplicative functions on arithmetic progressions is, lar...
We present a class of multiplicative functions $f:\mathbb{N}\to\mathbb{C}$ with bounded partial sums...
We give a criterion for a sequence (a_n)_{n >= 1} to be non-automatic, i.e., for when there does not...
AbstractDirichlet series whose coefficients are generated by finite automata define meromorphic func...
A heuristic in analytic number theory stipulates that sets of positive integers cannot simultaneousl...
Halász’s Theorem gives an upper bound for the mean value of a multiplicative function f. The bound i...
The purpose of this paper is to study subsequences of synchronizing $k$-automatic sequences $a(n)$ a...
AbstractChristol et al. (1980) proved that, for any prime p, a sequence x=(x1, x2,…,) over the set {...
AbstractIn this paper we study some of the properties of specially multiplicative functions, which a...
This thesis gives some order estimates and asymptotic formulae associated with general classes of no...
DOI
Add to ORKG