Correlations of multiplicative functions and applications

From MaRDI portal
Correlations of multiplicative functions and applications



Abstract: We give an asymptotic formula for correlations [ sum_{nle x}f_1(P_1(n))f_2(P_2(n))cdot dots cdot f_m(P_m(n))] where fdots,fm are bounded "pretentious" multiplicative functions, under certain natural hypotheses. We then deduce several desirable consequences: First, we characterize all multiplicative functions f:mathbbNo−1,+1 with bounded partial sums. This answers a question of ErdH{o}s from 1957 in the form conjectured by Tao. Second, we show that if the average of the first divided difference of multiplicative function is zero, then either f(n)=ns for operatornameRe(s)<1 or |f(n)| is small on average. This settles an old conjecture of K'atai. Third, we apply our theorem to count the number of representations of n=a+b where a,b belong to some multiplicative subsets of mathbbN. This gives a new "circle method-free" proof of the result of Br"udern.



Cites work


Cited in
(34)








This page was built for publication: Correlations of multiplicative functions and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4978615)