Sign changes of the partial sums of a random multiplicative function III: Average
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908318338908160 |
|---|---|
| author | Aymone, Marco |
| author_facet | Aymone, Marco |
| contents | Let $V(x)$ be the number of sign changes of the partial sums up to $x$, say $M_f(x)$, of a Rademacher random multiplicative function $f$. We prove that the averaged value of $V(x)$ is at least $\gg (\log x)(\log\log 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 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 $1\leq q\leq 1.9$ of the quantity $\log \mathbb{E} |M_f(x)|^q$, provided by the Harper's \textit{better than squareroot cancellation} phenomenon for small moments of $M_f(x)$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_19845 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Sign changes of the partial sums of a random multiplicative function III: Average Aymone, Marco Number Theory Probability Let $V(x)$ be the number of sign changes of the partial sums up to $x$, say $M_f(x)$, of a Rademacher random multiplicative function $f$. We prove that the averaged value of $V(x)$ is at least $\gg (\log x)(\log\log 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 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 $1\leq q\leq 1.9$ of the quantity $\log \mathbb{E} |M_f(x)|^q$, provided by the Harper's \textit{better than squareroot cancellation} phenomenon for small moments of $M_f(x)$. |
| title | Sign changes of the partial sums of a random multiplicative function III: Average |
| topic | Number Theory Probability |
| url | https://arxiv.org/abs/2409.19845 |