May 20, 2021
Similar papers 2
February 17, 2022
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...
March 9, 2021
We provide a simple proof that the partial sums $\sum_{n\leq x}f(n)$ of a Rademacher random multiplicative function $f$ change sign infinitely often as $x\to\infty$, almost surely.
December 1, 2010
We study sums of a random multiplicative function; this is an example, of number-theoretic interest, of sums of products of independent random variables (chaoses). Using martingale methods, we establish a normal approximation for the sum over those n \leq x with k distinct prime factors, provided that k = o(log log x) as x \rightarrow \infty. We estimate the fourth moments of these sums, and use a conditioning argument to show that if k is of the order of magnitude of log log...
March 12, 2023
We investigate when the better than square-root cancellation phenomenon exists for $\sum_{n\le N}a(n)f(n)$, where $a(n)\in \mathbb{C}$ and $f(n)$ is a random multiplicative function. We focus on the case where $a(n)$ is the indicator function of $R$ rough numbers. We prove that $\log \log R \asymp (\log \log x)^{\frac{1}{2}}$ is the threshold for the better than square-root cancellation phenomenon to disappear.
December 6, 2017
We consider a sequence $\{f(p)\}_{p\ {\rm prime}}$ of independent random variables taking values $\pm 1$ with probability $1/2$, and extend $f$ to a multiplicative arithmetic function defined on the squarefree integers. We investigate upper bounds for $\Psi_f(x,y)$, the summatory function of $f$ on $y$-friable integers $\leq x$. We obtain estimations of the type $\Psi_f(x,y) \ll \Psi(x,y)^{1/2+\epsilon}$, more precise formulas being given in suitable regions for $x,y$. In the...
May 30, 2024
Let $\alpha$ be a Steinhaus or a Rademacher random multiplicative function. For a wide class of multiplicative functions $f$ we show that the sum $\sum_{n \le x}\alpha(n) f(n)$, normalised to have mean square $1$, has a non-Gaussian limiting distribution. More precisely, we establish a generalised central limit theorem with random variance determined by the total mass of a random measure associated with $\alpha f$. Our result applies to $d_z$, the $z$-th divisor function, a...
November 24, 2014
We consider the random functions $S_N(z):=\sum_{n=1}^N z(n) $, where $z(n)$ is the completely multiplicative random function generated by independent Steinhaus variables $z(p)$. It is shown that ${\Bbb E} |S_N|\gg \sqrt{N}(\log N)^{-0.05616}$ and that $({\Bbb E} |S_N|^q)^{1/q}\gg_{q} \sqrt{N}(\log N)^{-0.07672}$ for all $q>0$.
December 3, 2014
Let $\mathcal{P}$ be the set of the primes. We consider a class of random multiplicative functions $f$ supported on the squarefree integers, such that $\{f(p)\}_{p\in\mathcal{P}}$ form a sequence of $\pm1$ valued independent random variables with $\mathbb{E} f(p)<0$, $\forall p\in \mathcal{P}$. The function $f$ is called strongly biased (towards classical M\"obius function), if $\sum_{p\in\mathcal{P}}\frac{f(p)}{p}=-\infty$ a.s., and it is weakly biased if $\sum_{p\in\mathcal...
June 4, 2020
We consider partial sums of a weighted Steinhaus random multiplicative function and view this as a model for the Riemann zeta function. We give a description of the tails and high moments of this object. Using these we determine the likely maximum of $T \log T$ independently sampled copies of our sum and find that this is in agreement with a conjecture of Farmer--Gonek--Hughes on the maximum of the Riemann zeta function. We also consider the question of almost sure bounds. We...
December 12, 2022
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 ${...