December 12, 2022
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...
August 16, 2021
Resolving a conjecture of Helson, Harper recently established that partial sums of random multiplicative functions typically exhibit more than square-root cancellation. Harper's work gives an example of a problem in number theory that is closely linked to ideas in probability theory connected with multiplicative chaos; another such closely related problem is the Fyodorov-Hiary-Keating conjecture on the maximum size of the Riemann zeta function in intervals of bounded length o...
December 31, 2020
For $X(n)$ a Rademacher or Steinhaus random multiplicative function, we consider the random polynomials $$ P_N(\theta) = \frac1{\sqrt{N}} \sum_{n\leq N} X(n) e(n\theta), $$ and show that the $2k$-th moments on the unit circle $$ \int_0^1 \big| P_N(\theta) \big|^{2k}\, d\theta $$ tend to Gaussian moments in the sense of mean-square convergence, uniformly for $k \ll (\log N / \log \log N)^{1/3}$, but that in contrast to the case of i.i.d. coefficients, this behavior does not pe...
August 6, 2011
Consider a multiplicative function f(n) taking values on the unit circle. Is it possible that the partial sums of this function are bounded? We show that if we weaken the notion of multiplicativity so that f(pn)=f(p)f(n) for all primes p in some finite set P, then the answer is yes. We also discuss a result of Bronstein that shows that functions modified from characters at a finite number of places.
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...
February 9, 2024
We examine the conditions under which the sum of random multiplicative functions in short intervals, given by $\sum_{x<n \leqslant x+y} f(n)$, exhibits the phenomenon of \textit{better than square-root cancellation}. We establish that the point at which the square-root cancellation diminishes significantly is approximately when the ratio $\log\big(\frac{x}{y}\big)$ is around $\sqrt{\log\log x}$. By modeling characters by random multiplicative functions, we give a sharp bound ...
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...
May 20, 2017
We study properties of arithmetic sets coming from multiplicative number theory and obtain applications in the theory of uniform distribution and ergodic theory. Our main theorem is a generalization of K\'atai's orthogonality criterion. Here is a special case of this theorem: Let $a\colon\mathbb{N}\to\mathbb{C}$ be a bounded sequence satisfying $$ \sum_{n\leq x} a(pn)\overline{a(qn)} = {\rm o}(x),~\text{for all distinct primes $p$ and $q$.} $$ Then for any multiplicative fu...
April 20, 2018
The aim of the paper is to study the limit distributions and the asymptotic behavior of summation arithmetic functions. A probabilistic approach based on the use of the axioms of probability theory is used for these purposes. Sufficient conditions are proved under which these functions have a limiting normal distribution. Arithmetic functions having a limiting normal distribution are found in the paper. The author investigates summation functions of a general form and finds s...
September 3, 2019
We consider very general "random integers" and (attempt to) prove that many multiplicative and additive functions of such integers have limiting distributions. These integers include, for instance, the curvatures of Apollonian circle packings, trace of Frobenius elements for elliptic curves, the Ramanujan tau-function, Mersenne numbers, and many others.