Counting sign changes of partial sums of random multiplicative functions
Abstract
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) = (( x)1/c ) almost surely.
0
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.