paper

Sign changes of the partial sums of a random multiplicative function III: Average

arXiv:2409.19845

Abstract

Let be the number of sign changes of the partial sums up to , say , of a Rademacher random multiplicative function . We prove that the averaged value of is at least . Our new method applies for the counting of sign changes of the partial sums of a system of orthogonal random variables having variance under additional hypothesis on the moments of these partial sums. In particular, we extend to larger classes of dependencies an old result of Erdős 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 ``\textit{linearity}'' phase in of the quantity , provided by the Harper's \textit{better than squareroot cancellation} phenomenon for small moments of .

9 pages, v4: new examples and references added. Comments from the referee

Sign changes of the partial sums of a random multiplicative function III: Average · wovepaper