Table of Contents
Fetching ...

Large fluctuations of sums of a random multiplicative function

Besfort Shala

Abstract

Let $f$ be a Rademacher or Steinhaus random multiplicative function. For various arithmetically interesting subsets $\mathcal A\subseteq [1, N]\cap\mathbb N$ such that the distribution of $\sum_{n\in \mathcal A} f(n)$ is approximately Gaussian, we develop a general framework to understand the large fluctuations of the sum. This extends the general central limit theorem framework of Soundararajan and Xu. In the case when $\mathcal A = (N-H, N]$ is a short interval with admissible $H=H(N)$, we show that almost surely \begin{equation*} \limsup_{N\to\infty} \frac{\big\lvert\sum_{N-H<n\leq N} f(n)\big\rvert}{\sqrt{H\log \frac{N}H{}}}>0. \end{equation*} When $\mathcal A$ is the set of values of an admissible polynomial $P\in\mathbb Z[x]$, we extend work of Klurman, Shkredov, and Xu, as well as Chinis and the author, showing that almost surely \begin{equation*} \limsup_{N\to\infty} \frac{\big\lvert\sum_{n\leq N} f(P(n))\big\rvert}{\sqrt{N \log\log N}}>0, \end{equation*} even when $P$ is a product of linear factors over $\mathbb Q$. In this case, we also establish the corresponding almost sure upper bound, matching the law of iterated logarithm. An important ingredient in our work is bounding the Kantorovich--Wasserstein distance by means of a quantitative martingale central limit theorem.

Large fluctuations of sums of a random multiplicative function

Abstract

Let be a Rademacher or Steinhaus random multiplicative function. For various arithmetically interesting subsets such that the distribution of is approximately Gaussian, we develop a general framework to understand the large fluctuations of the sum. This extends the general central limit theorem framework of Soundararajan and Xu. In the case when is a short interval with admissible , we show that almost surely \begin{equation*} \limsup_{N\to\infty} \frac{\big\lvert\sum_{N-H<n\leq N} f(n)\big\rvert}{\sqrt{H\log \frac{N}H{}}}>0. \end{equation*} When is the set of values of an admissible polynomial , we extend work of Klurman, Shkredov, and Xu, as well as Chinis and the author, showing that almost surely \begin{equation*} \limsup_{N\to\infty} \frac{\big\lvert\sum_{n\leq N} f(P(n))\big\rvert}{\sqrt{N \log\log N}}>0, \end{equation*} even when is a product of linear factors over . In this case, we also establish the corresponding almost sure upper bound, matching the law of iterated logarithm. An important ingredient in our work is bounding the Kantorovich--Wasserstein distance by means of a quantitative martingale central limit theorem.
Paper Structure (25 sections, 26 theorems, 128 equations)

This paper contains 25 sections, 26 theorems, 128 equations.

Key Result

Theorem A

Let $f$ be a Rademacher or Steinhaus random multiplicative function. In the Rademacher case, assume $P\in\mathbb Z[x]$ is a product of at least two distinct linear factors over $\mathbb Q$, or irreducible of degree $2$, taking infinitely many square-free values. In the Steinhaus case, assume $P(x)$ Moreover, almost surely there exists a sequence $N_k\to\infty$ such that

Theorems & Definitions (47)

  • Definition 1.1
  • Theorem A
  • Theorem B
  • Remark 1.2
  • Remark 1.3
  • Proposition 2.1: HallHeyde1980, Theorem 3.9
  • Proposition 2.2: BobkovGoetze2024, Theorem 1.1
  • Remark 2.3
  • Remark 2.4
  • Proposition 3.1
  • ...and 37 more