Counting sign changes of partial sums of random multiplicative functions
Nick GeisGhaith Hiary
所有作者
Nick GeisGhaith Hiary
文献摘要
Let f be a Rademacher random multiplicative function. Let Mf(u):=n≤u∑f(n) be the partial sum of f. Let Vf(x) denote the number of sign changes of Mf(u) up to x. We show that for any constant c>2, Vf(x)=Ω((logloglogx)1/c) almost surely.