Skip to content
Preprint

Almost sure upper bound for sums of random multiplicative functions and critical chaos

Aug 2026 · 2 citations · ⚡ 2 influential · 40 references
Mathematics

Abstract

Let $f$ be a Steinhaus or Rademacher random multiplicative function. We use methods from the theory of critical chaos to improve on the best known upper bound for partial sums of random multiplicative functions. In particular, our results imply that for any $\varepsilon>0$, almost surely $$ \Big|\sum_{n\le x}f(n)\Big| \ll_{\varepsilon}\sqrt{x}(\log_2x)^{1/4}(\log_3x)^{1+\varepsilon}. $$ This proves in a strong form a conjecture of Harper on large fluctuations of partial sums of random multiplicative functions, and determines the exact corresponding logarithmic exponent.

View source

Similar papers

Preprint Sep 2026

Large fluctuations of extended Rademacher random multiplicative functions

Let $f$ be an extended Rademacher random multiplicative function (RMF). We show that, for every fixed deterministic function $V(x)$ tending to infinity, almost surely there are arbitrarily large $x$ for which \[ \sum_{n\leq x}f(n) \geq \frac{\sqrt{x}(\log\log x)^{1/4}}{V(x)}. \] The corresponding negative fluctuation h...

H. Gou, Max Wenqiang Xu · 1 citation · ⚡1
Preprint Aug 2026

An Exponential Lower Bound for the Permanent of Random Bernoulli Matrix

Let $M_n$ be an $n\times n$ matrix with independent uniform sign entries. We prove that there exist absolute constants $C,c>0$ such that, for all sufficiently large $n$, \[ \mathbb{P}\!\left( \left|\operatorname{Per}(M_n)\right| \ge e^{-Cn}\sqrt{n!} \right) \ge 1-n^{-c}. \] This establishes the exponential scale lower...

Yiming Chen · 0 citations
Preprint Sep 2026

Explicit bounds for the prime number theorem

We study the problem of finding tight explicit bounds on sums over zeros of $L$-functions near the $1$-line with a variety of zero-free regions and zero-density estimates. As an application to demonstrate the techniques, we apply them to the case of the Riemann zeta function and the prime number theorem to obtain new b...

A. Fiori, Mikko Jaskari · 0 citations
Preprint Sep 2026

Primes are Complete for a Class of $N$-Bernoulli Convolutions Spectral Pair

We study the complete number problem for a class of self-similar spectral measures on the real line. For a spectral pair $(\mu,\Lambda)$, a real number $t$ is called complete if $t\Lambda$ is also a spectrum of $\mu$. In this paper we consider the $N$-Bernoulli convolution $\mu_{N^r,\mathcal D},\mathcal D=\{0,1,\ldots,...

Zi-Chao Chi, Jian-Feng Lu, He-Xiang Wang · 0 citations
Preprint Aug 2026

A conditional arithmetic obstruction to the prime numbers as a spectrum of a probability measure

Let $\Pp=\{2,3,5,7,\ldots\}$ denote the set of prime numbers. We prove that if every sufficiently large positive even integer can be represented as a difference of two primes, then there is no Borel probability measure $\mu$ on $\R$ for which \(\left\{e^{2\pi i p x}:p\in\Pp\right\}\) is an orthonormal basis of $L^2(\mu...

Zhi-Ying Wu, Qian Zhao · 0 citations
Preprint Sep 2026

Moments of random multiplicative functions with polynomial coefficients

Let $f$ be a Steinhaus random multiplicative function and let $g$ be a polynomial of degree $d$. Write $S_N=N^{-1/2}\sum_{n\le N}f(n)\,e(g(n))$. We prove a quantitative dichotomy for the moments of $S_N$: for each integer $s\ge 2$, either $\mathbb{E}|S_N|^{2s}$ is close to the Gaussian moment $s!$, or the coefficients...

Xin-Yu Wang · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.