ID: 2202.08767

On the random Chowla conjecture

February 17, 2022

View on ArXiv
Oleksiy Klurman, Ilya D. Shkredov, Max Wenqiang Xu
Mathematics
Number Theory
Probability

We show that for a Steinhaus random multiplicative function $f:\mathbb{N}\to\mathbb{D}$ and any polynomial $P(x)\in\mathbb{Z}[x]$ of $\text{deg}\ P\ge 2$ which is not of the form $w(x+c)^{d}$ for some $w\in \mathbb{Z}$, $c\in \mathbb{Q}$, we have \[\frac{1}{\sqrt{x}}\sum_{n\le x} f(P(n)) \xrightarrow{d} \mathcal{CN}(0,1),\] where $\mathcal{CN}(0,1)$ is the standard complex Gaussian distribution with mean $0$ and variance $1.$ This confirms a conjecture of Najnudel in a strong form. We further show that there almost surely exist arbitrary large values of $x\ge 1,$ such that $$|\sum_{n\le x} f(P(n))| \gg_{\text{deg}\ P} \sqrt{x} (\log \log x)^{1/2},$$ for any polynomial $P(x)\in\mathbb{Z}[x]$ with $\text{deg}\ P\ge 2,$ which is not a product of linear factors (over $\mathbb{Q}$). This matches the bound predicted by the law of the iterated logarithm. Both of these results are in contrast with the well-known case of linear phase $P(n)=n,$ where the partial sums are known to behave in a non-Gaussian fashion and the corresponding sharp fluctuations are speculated to be $O(\sqrt{x}(\log \log x)^{\frac{1}{4}+\varepsilon})$ for any $\varepsilon>0$.

Similar papers 1

Jake Chinis, Besfort Shala
Number Theory
Probability

We study the distribution of partial sums of Rademacher random multiplicative functions $(f(n))_n$ evaluated at polynomial arguments. We show that for a polynomial $P\in \mathbb Z[x]$ that is a product of distinct linear factors or an irreducible quadratic satisfying a natural condition, there exists a constant $\kappa_P>0$ such that \[ \frac{1}{\sqrt{\kappa_P N}}\sum_{n\leq N}f(P(n))\xrightarrow{d}\mathcal{N}(0,1), \] as $N\rightarrow\infty$, where convergence is in ...

Adam J. Harper
Number Theory
Probability

We prove that if $f(n)$ is a Steinhaus or Rademacher random multiplicative function, there almost surely exist arbitrarily large values of $x$ for which $|\sum_{n \leq x} f(n)| \geq \sqrt{x} (\log\log x)^{1/4+o(1)}$. This is the first such bound that grows faster than $\sqrt{x}$, answering a question of Hal\'asz and proving a conjecture of Erd\H{o}s. It is plausible that the exponent $1/4$ is sharp in this problem. The proofs work by establishing a multivariate Gaussian app...

Daniele Mastrostefano
Number Theory

Let $f$ be a Rademacher or a Steinhaus random multiplicative function. Let $\varepsilon>0$ small. We prove that, as $x\rightarrow +\infty$, we almost surely have $$\bigg|\sum_{\substack{n\leq x\\ P(n)>\sqrt{x}}}f(n)\bigg|\leq\sqrt{x}(\log\log x)^{1/4+\varepsilon},$$ where $P(n)$ stands for the largest prime factor of $n$. This gives an indication of the almost sure size of the largest fluctuations of $f$.

Adam J. Harper
Number Theory
Complex Variables
Functional Analysis
Probability

We determine the order of magnitude of $\mathbb{E}|\sum_{n \leq x} f(n)|^{2q}$, where $f(n)$ is a Steinhaus or Rademacher random multiplicative function, and $0 \leq q \leq 1$. In the Steinhaus case, this is equivalent to determining the order of $\lim_{T \rightarrow \infty} \frac{1}{T} \int_{0}^{T} |\sum_{n \leq x} n^{-it}|^{2q} dt$. In particular, we find that $\mathbb{E}|\sum_{n \leq x} f(n)| \asymp \sqrt{x}/(\log\log x)^{1/4}$. This proves a conjecture of Helson that on...

Jacques Benatar, Alon Nishry
Number Theory
Probability

For $X(n)$ a Steinhaus random multiplicative function, we study the maximal size of the random Dirichlet polynomial $$ D_N(t) = \frac1{\sqrt{N}} \sum_{n \leq N} X(n) n^{it}, $$ with $t$ in various ranges. In particular, for fixed $C>0$ and any small $\varepsilon>0$ we show that, with high probability, $$ \exp( (\log N)^{1/2-\varepsilon} ) \ll \sup_{|t| \leq N^C} |D_N(t)| \ll \exp( (\log N)^{1/2+\varepsilon}). $$

Kannan Soundararajan, Max Wenqiang Xu
Number Theory

A Steinhaus random multiplicative function $f$ is a completely multiplicative function obtained by setting its values on primes $f(p)$ to be independent random variables distributed uniformly on the unit circle. Recent work of Harper shows that $\sum_{n\le N} f(n)$ exhibits ``more than square-root cancellation," and in particular $\frac 1{\sqrt{N}} \sum_{n\le N} f(n)$ does not have a (complex) Gaussian distribution. This paper studies $\sum_{n\in {\mathcal A}} f(n)$, where ${...

Seth Hardy
Number Theory

For $f$ a Rademacher or Steinhaus random multiplicative function, we prove that $$ \max_{\theta \in [0,1]} \frac{1}{\sqrt{N}} \Bigl| \sum_{n \leq N} f(n) \mathrm{e} (n \theta) \Bigr| \gg \sqrt{\log N} ,$$ asymptotically almost surely as $N \rightarrow \infty$. Furthermore, for $f$ a Steinhaus random multiplicative function, and any $\varepsilon > 0$, we prove the partial upper bound result $$ \max_{\theta \in [0,1]} \frac{1}{\sqrt{N}} \Bigl| \sum_{\substack{n \leq N \\ P(n) \...

Christopher Atherfold
Number Theory
Probability

We prove that when $f$ is a Rademacher random multiplicative function for any $\epsilon>0$, then $\sum_{n \leqslant x}\frac{f(n)}{\sqrt{n}} \ll (\log\log(x))^{3/4+\epsilon}$ for almost all $f$. We also show that there exist arbitrarily large values of $x$ such that $\sum_{n \leqslant x}\frac{f(n)}{\sqrt{n}} \gg (\log\log(x))^{-1/2}$. This is different to what is found in the Steinhaus case, this time with the size of the Rademacher Euler product making the multiplicative chao...

Daksh Aggarwal, Unique Subedi, William Verreault, ... , Zheng Chenghui
Number Theory
Probability

We investigate a special sequence of random variables $A(N)$ defined by an exponential power series with independent standard complex Gaussians $(X(k))_{k \geq 1}$. Introduced by Hughes, Keating, and O'Connell in the study of random matrix theory, this sequence relates to Gaussian multiplicative chaos (in particular "holomorphic multiplicative chaos'' per Najnudel, Paquette, and Simm) and random multiplicative functions. Soundararajan and Zaman recently determined the order o...

Adam J. Harper
Number Theory
Probability

We determine the order of magnitude of $\mathbb{E}|\sum_{n \leq x} f(n)|^{2q}$ up to factors of size $e^{O(q^2)}$, where $f(n)$ is a Steinhaus or Rademacher random multiplicative function, for all real $1 \leq q \leq \frac{c\log x}{\log\log x}$. In the Steinhaus case, we show that $\mathbb{E}|\sum_{n \leq x} f(n)|^{2q} = e^{O(q^2)} x^q (\frac{\log x}{q\log(2q)})^{(q-1)^2}$ on this whole range. In the Rademacher case, we find a transition in the behaviour of the moments when...