Papers
Topics
Authors
Recent
Search
2000 character limit reached

Partial sums of biased random multiplicative functions

Published 3 Dec 2014 in math.NT and math.PR | (1412.1157v2)

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\"obius 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-\alpha})$ for some $\alpha>0$, a.s., when $f$ is strongly or weakly biased, and prove that the Riemann Hypothesis holds if and only if $M_{f_\alpha}(x)=o(x{1/2+\epsilon})$ for all $\epsilon>0$ a.s., for each $\alpha>0$, where ${f_\alpha }_\alpha$ is a certain family of weakly biased random multiplicative functions.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.