Sign changes of the partial sums of a random multiplicative function III: Average
Abstract
Let V(x) be the number of sign changes of the partial sums up to x, say Mf(x), of a Rademacher random multiplicative function f. We prove that the averaged value of V(x) is at least ( x)( x)-1/2-ε. Our new method applies for the counting of sign changes of the partial sums of a system of orthogonal random variables having variance 1 under additional hypothesis on the moments of these partial sums. In particular, we extend to larger classes of dependencies an old result of Erdos and Hunt on sign changes of partial sums of i.i.d. random variables. In the arithmetic case, the main input in our method is the ``linearity'' phase in 1≤ q≤ 1.9 of the quantity E |Mf(x)|q, provided by the Harper's better than squareroot cancellation phenomenon for small moments of Mf(x).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.