May 20, 2021
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$.
Similar papers 1
April 3, 2023
Let $\varepsilon >0$. Let $f$ be a Steinhaus or Rademacher random multiplicative function. We prove that we have almost surely, as $x \to +\infty$, $$ \sum_{n \leqslant x} f(n) \ll \sqrt{x} (\log_2 x)^{\frac{1}{4}+ \varepsilon}. $$ Thanks to Harper's Lower bound, this gives a sharp upper bound of the largest fluctuation of the quantity $\sum_{n \leqslant x} f(n)$.
December 31, 2020
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...
January 29, 2024
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) \...
April 11, 2018
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...
March 26, 2023
We study two models of random multiplicative functions: Rademacher random multiplicative functions supported on the squarefree integers $f$, and Rademacher random completely multiplicative functions $f^*$. We prove that the partial sums $\sum_{n\leq x}f^*(n)$ and $\sum_{n\leq x}\frac{f(n)}{\sqrt{n}}$ change sign infinitely often as $x\to\infty$, almost surely. The case $\sum_{n\leq x}\frac{f^*(n)}{\sqrt{n}}$ is left as an open question and we stress the possibility of only a ...
April 4, 2023
We give a proof a comparable result to a recent result of the author concerning almost sure upper bound of random multiplicative functions, in a more simplified setting. Having a simpler quantity allows us to make the proof more accessible.
March 20, 2017
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...
November 27, 2023
Let $f$ be a Rademacher random multiplicative function. Let $$M_f(u):=\sum_{n \leq u} f(n)$$ be the partial sum of $f$. Let $V_f(x)$ denote the number of sign changes of $M_f(u)$ up to $x$. We show that for any constant $c > 2$, $$V_f(x) = \Omega ((\log \log \log x)^{1/c} )$$ almost surely.
April 7, 2022
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}). $$
July 2, 2023
We obtain almost sure bounds for the weighted sum $\sum_{n \leq t} \frac{f(n)}{\sqrt{n}}$, where $f(n)$ is a Steinhaus random multiplicative function. Specifically, we obtain the bounds predicted by exponentiating the law of the iterated logarithm, giving sharp upper and lower bounds.