Let χ0, χ1, χ2, … be the sequence of all Dirichlet characters (in which the principal character χ0 occurs only once), ordered with increasig moduli. Define, for a sequence (αk)kεN of real numbers (αk→0 for j→∞, sufficiently quickly) the multiplicative function f by∑nf(n)ns=ζ−1(s)∏k=1∞(L(s,χk))akIt is the aim of the paper to construct sequences (αk) such that the following statements are equivalento(i)∑n⩽xf(n)=O(x1/2+ɛ)for every ɛ > 0,(ii)the Riemann hypothesis is true for all function L(s, χ)
AbstractBy means of the large sieve it is proved that ∑n⩽ϰ hα(−n) = ϑ(α) ϰ(α+2)2 + O(ϰ(α+2)2 − (14+ϵ...
AbstractLet k be a positive integer and f a multiplicative function with 0 < f(p) ≤1/k for all prime...
The study of the distribution of general multiplicative functions on arithmetic progressions is, lar...
Let χ0, χ1, χ2, … be the sequence of all Dirichlet characters (in which the principal character χ0 o...
We prove that any $q$-automatic multiplicative function $f:\mathbb{N}\to\mathbb{C}$ either essential...
We introduce a simple sieve-theoretic approach to studying partial sums of multiplicative functions ...
AbstractThis paper is a response to a reverse problem on arithmetic functions of Kátai. The main res...
summary:We find, via the Selberg-Delange method, an asymptotic formula for the mean of arithmetic fu...
AbstractA necessary and sufficient condition is obtained for (Cω, Cω) multipliers in the case of a s...
We show that smooth-supported multiplicative functions ƒ are well distributed in arithmetic progress...
Let f(n) be a totally multiplicative function such that | ƒ (n)|⪯ 1 for all n, and let F(s)...
AbstractLet χ denote a primitive, Dirichlet character to the modulus q > 1, such that χ(−1) = 1. The...
AbstractFor every positive integer n, let Xn′ be the set of primitive Dirichlet characters modulo n....
AbstractIt is shown that certain commonly occurring conditions may be factored out of sums of multip...
AbstractCoding-theoretical methods are used to obtain improved lower bounds for character sums induc...
AbstractBy means of the large sieve it is proved that ∑n⩽ϰ hα(−n) = ϑ(α) ϰ(α+2)2 + O(ϰ(α+2)2 − (14+ϵ...
AbstractLet k be a positive integer and f a multiplicative function with 0 < f(p) ≤1/k for all prime...
The study of the distribution of general multiplicative functions on arithmetic progressions is, lar...
Let χ0, χ1, χ2, … be the sequence of all Dirichlet characters (in which the principal character χ0 o...
We prove that any $q$-automatic multiplicative function $f:\mathbb{N}\to\mathbb{C}$ either essential...
We introduce a simple sieve-theoretic approach to studying partial sums of multiplicative functions ...
AbstractThis paper is a response to a reverse problem on arithmetic functions of Kátai. The main res...
summary:We find, via the Selberg-Delange method, an asymptotic formula for the mean of arithmetic fu...
AbstractA necessary and sufficient condition is obtained for (Cω, Cω) multipliers in the case of a s...
We show that smooth-supported multiplicative functions ƒ are well distributed in arithmetic progress...
Let f(n) be a totally multiplicative function such that | ƒ (n)|⪯ 1 for all n, and let F(s)...
AbstractLet χ denote a primitive, Dirichlet character to the modulus q > 1, such that χ(−1) = 1. The...
AbstractFor every positive integer n, let Xn′ be the set of primitive Dirichlet characters modulo n....
AbstractIt is shown that certain commonly occurring conditions may be factored out of sums of multip...
AbstractCoding-theoretical methods are used to obtain improved lower bounds for character sums induc...
AbstractBy means of the large sieve it is proved that ∑n⩽ϰ hα(−n) = ϑ(α) ϰ(α+2)2 + O(ϰ(α+2)2 − (14+ϵ...
AbstractLet k be a positive integer and f a multiplicative function with 0 < f(p) ≤1/k for all prime...
The study of the distribution of general multiplicative functions on arithmetic progressions is, lar...