SearcharxivSearch

arXiv subjects

Besfort Shala

Publications and source records attributed to Besfort Shala.

4 recordsLinked to original sources

Large fluctuations of sums of a random multiplicative function

Let $f$ be a Rademacher or Steinhaus random multiplicative function. For various arithmetically interesting subsets $\mathcal A\subseteq [1, N]\cap\mathbb N$ such that the distribution of $\sum_{n\in \mathcal A} f(n)$ is approximately Gaussian, we develop a general framework to understand the large fluctuations of the sum. This extends the general central limit theorem framework of Soundararajan and Xu. In the case when $\mathcal A = (N-H, N]$ is a short interval with admissible $H=H(N)$, we show that almost surely \begin{equation*} \limsup_{N\to\infty} \frac{\big\lvert\sum_{N-H 0. \end{equation*} When $\mathcal A$ is the set of values of an admissible polynomial $P\in\mathbb Z[x]$, we extend work of Klurman, Shkredov, and Xu, as well as Chinis and the author, showing that almost surely \begin{equation*} \limsup_{N\to\infty} \frac{\big\lvert\sum_{n\leq N} f(P(n))\big\rvert}{\sqrt{N \log\log N}}>0, \end{equation*} even when $P$ is a product of linear factors over $\mathbb Q$. In this case, we also establish the corresponding almost sure upper bound, matching the law of iterated logarithm. An important ingredient in our work is bounding the Kantorovich--Wasserstein distance by means of a quantitative martingale central limit theorem.

math.NT

Distribution of mixed character sums and extremal problems for Littlewood polynomials

We prove distributional results for mixed character sums \begin{equation*} \sum_{n\le x }\chi(n)e(n\theta), \end{equation*} for fixed $\theta\in [0,1]$ and random character $\chi \pmod q$, as well as for a fixed character $\chi$ and randomly sampled $\theta\in [0,1].$ We present various applications of our results. For example, we construct Littlewood polynomials with large Mahler measure and $L_1$ norm, thus establishing new records in the Mahler and Newman problems. We also show that $L_{2k}$ norms of well-known Turyn polynomials are asymptotically minimized at the shift $\alpha=1/4,$ proving a conjecture of G\"unther and Schmidt. An important ingredient in our work is a general way of dealing with "log-integrability" problems.

math.NT

Random Chowla's Conjecture for Rademacher Multiplicative Functions

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 at least two 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 distribution to a standard (real) Gaussian. This confirms a conjecture of Najnudel and addresses a question of Klurman-Shkredov-Xu. We also study large fluctuations of $\sum_{n\leq N}f(n^2+1)$ and show that there almost surely exist arbitrarily large values of $N$ such that \[ \Big|\sum_{n\leq N}f(n^2+1)\Big|\gg \sqrt{N \log\log N}. \] This matches the bound one expects from the law of iterated logarithm.

math.NT

The Probabilistic Zeta Function of a Finite Lattice

We study Brown's definition of the probabilistic zeta function of a finite lattice as a generalization of that of a finite group. We propose a natural alternative or extension that may be better suited for non-atomistic lattices. The probabilistic zeta function admits a general Dirichlet series expression, which unlike for groups, need not be ordinary. We compute the function for several examples of finite lattices, establishing a connection with the Stirling numbers of the second kind in the case of the divisibility lattice. Furthermore, in the context of moving from groups to lattices, we are interested in lattices with probabilistic zeta function given by ordinary Dirichlet series. In this regard, we focus on partition lattices and $d$-divisible partition lattices. Using the prime number theorem, we show that the probabilistic zeta functions of the latter typically fail to be ordinary Dirichlet series.

math.CO