Multiplicative Functions and a Taxonomy of Dirichlet Characters

We study the conjecture that $\sum_{n\leq x} \chi(n)=o(x)$ for any primitive Dirichlet character $\chi \pmod q$ with $x\geq q^\epsilon$, which is known to be true if the Riemann Hypothesis holds for $L(s,\chi)$. We show that it holds under the weaker assumption that `$100\%$' of the zeros of $L(s,\chi)$ up to height $\tfrac 14$ lie on the critical line; and establish various other consequences of having large character sums.

Let $f(n)$ be a multiplicative function satisfying $|f(n)|\leq 1$, $q$ $(\leq N^2)$ be a prime number and $a$ be an integer with $(a,\,q)=1$, $\chi$ be a non-principal Dirichlet character modulo $q$. In this paper, we shall prove that $$ \sum_{n\leq N}f(n)\chi(n+a)\ll {N\over q^{1\over 4}}\log\log(6N)+q^{1\over 4}N^{1\over 2}\log(6N)+{N\over \sqrt{\log\log(6N)}}. $$ We shall also prove that \begin{align*} &\sum_{n\leq N}f(n)\chi(n+a_1)\cdots\chi(n+a_t)\ll {N\over q^{1\over ...

In this paper, we use the Weyl-bound for Dirichlet $L$-functions to derive zero-density estimates for $L$-functions associated to families of fixed-order Dirichlet characters. The results improve on previous bounds given by the author when $\sigma$ is sufficiently distanced from the critical line.

Given a non-principal Dirichlet character chi mod q, an important problem in number theory is to obtain good estimates for the size of L(1,chi). In this paper we focus on sharpening the upper bounds known for |L(1,chi)|; in particular, we wish to determine constants c (as small as possible) for which the bound |L(1,chi)| <= (c+o(1)) log q holds.

In this paper, we study the mean value distributions of Dirichlet $L$-functions at positive integers. We give some explicit formulas for the mean values of products of two and three Dirichlet $L$-functions at positive integers weighted by Dirichlet characters that involve the Bernoulli functions. The results presented here are the generalizations of various known formulas.

Assuming the Generalized Riemann Hypothesis, the authors study when a character sum over all n <= x is o(x); they show that this holds if log x / log log q -> infinity and q -> infinity (q is the size of the finite field).

This is the second of two coupled papers estimating the mean values of multiplicative functions, of unknown support, on arithmetic progressions with large differences. Applications are made to the study of primes in arithmetic progression and to the Fourier coefficients of automorphic cusp forms.

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. In particular, for any nontrivial multiplicative character $\chi$ modulo a prime $q$ and any integer $r\ge 2$, we show that $$ \sum_{M<n\le M+N}\chi(n) = O\left( N^{1-1/r}q^{(r+1)/4r^2}(\log q)^{1/4r}\right), $$ which sharpens previous resu...

We give an explicit upper bound for non-principal Dirichlet $L$-functions on the line $s=1+it$. This result can be applied to improve the error in the zero-counting formulae for these functions.

Let $\chi$ range over the $(p-1)/2$ even Dirichlet characters modulo a prime $p$ and denote by $\theta (x,\chi)$ the associated theta series. The asymptotic behaviour of the second and fourth moments proved by Louboutin and the author implies that there exists at least $ \gg p/ \log p$ characters such that the associated theta function does not vanish at a fixed point. Constructing a suitable mollifier, we improve this result and show that there exists at least $ \gg p/ \sqrt...