Partial sums of biased random multiplicative functions

Abstract

Let 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∈P form a sequence of 1 valued independent random variables with E f(p)<0, ∀ p∈ P. The function f is called strongly biased (towards classical M\"obius function), if Σp∈Pf(p)p=-∞ a.s., and it is weakly biased if Σp∈Pf(p)p converges a.s. Let Mf(x):=Σn≤ xf(n). We establish a number of necessary and sufficient conditions for Mf(x)=o(x1-α) for some α>0, a.s., when f is strongly or weakly biased, and prove that the Riemann Hypothesis holds if and only if Mfα(x)=o(x1/2+ε) for all ε>0 a.s., for each α>0, where \fα \α is a certain family of weakly biased random multiplicative functions.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…