arXiv · 1412.1157
Partial sums of biased random multiplicative functions
Abstract
Let $\mathcal{P}$ be the set of the primes. We consider a class of random multiplicative functions $f$ supported on the squarefree integers, such that $\{f(p)\}_{p\in\mathcal{P}}$ form a sequence of $\pm1$ valued independent random variables with $\mathbb{E} f(p)<0$, $\forall p\in \mathcal{P}$. The function $f$ is called strongly biased (towards classical Möbius function), if $\sum_{p\in\mathcal{P}}\frac{f(p)}{p}=-\infty$ a.s., and it is weakly biased if $\sum_{p\in\mathcal{P}}\frac{f(p)}{p} $ converges a.s. Let $M_f(x):=\sum_{n\leq x}f(n)$. We establish a number of necessary and sufficient conditions for $M_f(x)=o(x^{1-α})$ for some $α>0$, a.s., when $f$ is strongly or weakly biased, and prove that the Riemann Hypothesis holds if and only if $M_{f_α}(x)=o(x^{1/2+ε})$ for all $ε>0$ a.s., for each $α>0$, where $\{f_α\}_α$ is a certain family of weakly biased random multiplicative functions.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Marco Aymone, Vladas Sidoravicius. 2015-12-01. Partial sums of biased random multiplicative functions. https://doi.org/10.1016/j.jnt.2016.08.020
Cite the original work for its findings. Save a collection to share your selection of sources.