Metraipolis › archive › dc_bc2c737666ec

Low moments of sums of extended Rademacher random multiplicative functions — arXiv:2611.05492

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.05492
License (as archived)
CC0-1.0
Archived
2026-11-05T18:27:50.665Z
SHA-256 of the archived text
5c0fafcdee14aefe84a5c17949f8da088741f257de8ecb30750961445f033de1
Stable URL of this page
https://metraipolis.com/documento/dc_bc2c737666ec

How to cite

Low moments of sums of extended Rademacher random multiplicative functions — arXiv:2611.05492 — arXiv (en), https://arxiv.org/abs/2611.05492 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bc2c737666ec (Metraipolis archive dc_bc2c737666ec, sha256 5c0fafcdee14aefe84a5c17949f8da088741f257de8ecb30750961445f033de1)
BibTeX
@misc{dcbc2c737666ec,
  title = {Low moments of sums of extended Rademacher random multiplicative functions — arXiv:2611.05492},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.05492},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bc2c737666ec; sha256 5c0fafcdee14aefe84a5c17949f8da088741f257de8ecb30750961445f033de1},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05492. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Let $X^e \colon \mathbb{N} \to \{\pm 1\}$ be the random, completely multiplicative function whose values at the primes $(X^e(p))_{p \text{ prime}}$ are independent and uniformly distributed on $\{ \pm 1 \}$. Let $X=X^e\mu^2$. We determine the order of magnitude of \[ \mathbb{E} \Bigg[ \bigg| \frac{1}{\sqrt{x}}\sum_{n \le x} X^e(n) \bigg|^{2 q} \Bigg]\quad \text{ and }\quad \mathbb{E} \Bigg[ \bigg|\sum_{n \le x} \frac{X(n)}{\sqrt{n}} \bigg|^{2 q} \Bigg] \] for $q\in [0,1]$, showing that a transition from better-than-square-root cancellation to growth like a power of $\log x$ occurs when $q$ crosses $1/2$. In particular, the first absolute moments are of order $(\log\log x)^{3/4}$. The proof proceeds by comparing these sums to integrals of random Euler products, which are then studied by analogy with Gaussian multiplicative chaos integrals. The main difficulty lies in proving the lower bound at $q=1/2$, for which we also adapt arguments from the study of random walks.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Number Theory (math.NT) ; Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2611.05492 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-05T18:18:04.072Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).