Related papers: Random multiplicative functions and typical size o…

We obtain explicit bounds on the moments of character sums, refining estimates of Montgomery and Vaughan. As an application we obtain results on the distribution of the maximal magnitude of character sums normalized by the square root of…

We give a new $(1+\epsilon)$-approximation for sparsest cut problem on graphs where small sets expand significantly more than the sparsest cut (sets of size $n/r$ expand by a factor $\sqrt{\log n\log r}$ bigger, for some small $r$; this…

Let $\chi$ be a primitive character modulo a prime $q$, and let $\delta > 0$. It has previously been observed that if $\chi$ has large order $d \geq d_0(\delta)$ then $\chi(n) \neq 1$ for some $n \leq q^{\delta}$, in analogy with…

We extend the Matom\"{a}ki-Radziwi\l\l{} theorem to a large collection of unbounded multiplicative functions that are uniformly bounded, but not necessarily bounded by 1, on the primes. Our result allows us to estimate averages of such a…

In this paper we give a refinement of the bound of D. A. Burgess for multiplicative character sums modulo a prime number $q$. This continues a series of previous logarithmic improvements, which are mostly due to H. Iwaniec and E. Kowalski.…

We consider sums of the form $$F_\chi(\alpha,\beta;\theta) := \sum_{\alpha p<n\le\beta p}\chi(n)e(n\theta),$$ where $\chi$ is a non-principal Dirichlet character modulo a prime number $p$. We prove that $$ \sqrt p \log \log p \ll \max_{0…

We design and mathematically analyze sampling-based algorithms for regularized loss minimization problems that are implementable in popular computational models for large data, in which the access to the data is restricted in some way. Our…

We study exponential sums whose coefficients are completely multiplicative and belong to the complex unit disc. Our main result shows that such a sum has substantial cancellation unless the coefficient function is essentially a Dirichlet…

For $f$ a Steinhaus random multiplicative function, we prove convergence in distribution of the appropriately normalised partial sums \[ \frac{{(\log \log x)}^{1/4}}{\sqrt{x}} \sum_{\substack{n \leq x \\ P(n) > \sqrt{x}}} f(n), \] where…

In this paper we establish the function field analogue of Bateman-Horn conjecture in short interval in the limit of a large finite field. Hence we start with counting prime polynomials generated by primitive quadratic functions in short…

We establish several results concerning the expected general phenomenon that, given a multiplicative function $f:\mathbb{N}\to\mathbb{C}$, the values of $f(n)$ and $f(n+a)$ are "generally" independent unless $f$ is of a "special" form.…

For large enough (but fixed) prime powers $q$, and trace functions to squarefree moduli in $\mathbb{F}_q[u]$ with slopes at most $1$ at infinity, and no Artin--Schreier factors in their geometric global monodromy, we come close to…

We obtain (conditional and unconditional) results on large values of $L$-functions $L(s,\chi)$ in the critical strip $1/2 \leq \Re s \leq 1$ when the character $\chi$ runs through a thin subgroup of all characters modulo an integer $q$.…

Let $\chi$ be a non-real Dirichlet character modulo a prime $q$. In this paper we prove that the distribution of the short character sum $S_{\chi,H}(x)=\sum_{x< n\leq x+H} \chi(n)$, as $x$ runs over the positive integers below $q$,…

We give lower bounds for the small moments of the sum of a random multiplicative function, which improve on some results of Bondarenko and Seip and constitute further progress towards (dis)proving a conjecture of Helson. We also prove…

As early as the 1930s, P\'al Erd\H{o}s conjectured that: {\em for any multiplicative function $f:\mathbb{N}\to\{-1,1\}$, the partial sums $\sum_{n\leq x}f(n)$ are unbounded.} Considering this conjecture, in this paper we consider…

The objective of this paper is to obtain asymptotic results for shifted sums of multiplicative functions of the form $g \ast 1$, where the function $g$ satisfies the Ramanujan conjecture and has conjectured upper bounds on square moments of…

We give a level one result for the "symmetry integral", say $I_f(N,h)$, of essentially bounded $f:\N \to \R$; i.e., we get a kind of "square-root cancellation" \thinspace bound for the mean-square (in $N<x\le 2N$) of the "symmetry"…

In this article we study a small random perturbation of a linear recurrence equation. If all the roots of its corresponding characteristic equation have modulus strictly less than one, the random linear recurrence goes exponentially fast to…

We consider the variance of sums of arithmetic functions over random short intervals in the function field setting. Based on the analogy between factorizations of random elements of $\mathbb{F}_q[T]$ into primes and the factorizations of…