Related papers: Multiplicative functions in short arithmetic progr…

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…

With the aim of treating the local behaviour of additive functions, we develop analogues of the Matom\"{a}ki-Radziwill theorem that allow us to approximate the average of a general additive function over a typical short interval in terms of…

We provide a uniform bound on the partial sums of multiplicative functions under very general hypotheses. As an application, we give a nearly optimal estimate for the count of $n \le x$ for which the Alladi-Erd\H{o}s function $A(n) =…

We introduce a simple sieve-theoretic approach to studying partial sums of multiplicative functions which are close to their mean value. This enables us to obtain various new results as well as strengthen existing results with new proofs.…

We study the existence of products of primes in arithmetic progressions, building on the work of Ramar\'e and Walker. One of our main results is that if $q$ is a large modulus, then any invertible residue class mod $q$ contains a product of…

Let $d_k(n) = \sum_{n_1 \cdots n_k = n}1$ be the $k$-fold divisor function. We call a function $f:\mathbb{N} \to \mathbb{C}$ a $d_k$-bounded multiplicative function, if $f$ is multiplicative and $|f(n)| \leq d_k(n)$ for every $n \in…

We study the distribution of families of multiplicative functions among the coprime residue classes to moduli varying uniformly in a wide range, obtaining analogues of the Siegel--Walfisz Theorem for large classes of multiplicative…

We present a class of multiplicative functions $f:\mathbb{N}\to\mathbb{C}$ with bounded partial sums. The novelty here is that our functions do not need to have modulus bounded by $1$. The key feature is that they pretend to be the constant…

Hal\'asz's Theorem gives an upper bound for the mean value of a multiplicative function $f$. The bound is sharp for general such $f$, and, in particular, it implies that a multiplicative function with $|f(n)|\le 1$ has either mean value…

We study a multiplicative function analogue of Linnik's problem on the least prime in an arithmetic progression. Let $h\colon \mathbb{N}\to\mathbb{R}\setminus\{0\}$ be a multiplicative function, and let $a \pmod q$ be a reduced residue…

We show that smooth-supported multiplicative functions $f$ are well-distributed in arithmetic progressions $a_1a_2^{-1} \pmod q$ on average over moduli $q\leq x^{3/5-\varepsilon}$ with $(q,a_1a_2)=1$.

We investigate lower bounds for the variance in arithmetic progressions of certain multiplicative functions "close" to $1$. Specifically, we consider $\alpha_N$-fold divisor functions, when $\alpha_N$ is a sequence of positive real numbers…

Let $f : \mathbf{N} \rightarrow \mathbf{C}$ be a bounded multiplicative function. Let $a$ be a fixed integer (say $a = 1$). Then $f$ is well-distributed on the progression $n \equiv a \pmod{q} \subset \{1,\dots, X\}$, for almost all primes…

We provide uniform bounds on mean values of multiplicative functions under very general hypotheses, detecting certain power savings missed in known results in the literature. As an application, we study the distribution of the…

We determine the behavior of multiplicative functions vanishing at a positive proportion of prime numbers in almost all short intervals. Furthermore we quantify "almost all" with uniform power-saving upper bounds, that is, we save a power…

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…

We prove some distribution results for the $k$-fold divisor function in arithmetic progressions to moduli that exceed the square-root of length $X$ of the sum, with appropriate constrains and averaging on the moduli, saving a power of $X$…

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.…

We develop an approach to study character sums, weighted by a multiplicative function $f:\mathbb{F}_q[t]\to S^1$, of the form \begin{equation} \sum_{G\in \mathcal{M}_N}f(G)\chi(G)\xi(G), \end{equation} where $\chi$ is a Dirichlet character…

We develop a general method for lower bounding the variance of sequences in arithmetic progressions mod $q$, summed over all $q \leq Q$, building on previous work of Liu, Perelli, Hooley, and others. The proofs lower bound the variance by…