Related papers: Character sums with smooth numbers

We establish a result on the large sieve with square moduli. These bounds impro ve recent results by S. Baier(math.NT/0512228) and L. Zhao(math.NT/0508125).

It follows from the work of Artin and Hooley that, under assumption of the generalized Riemann hypothesis, the density of the set of primes $q$ for which a given non-zero rational number $r$ is a primitive root modulo $q$ can be written as…

In this paper we obtain a new fully explicit constant for the P\'olya-Vinogradov inequality for primitive characters. Given a primitive character $\chi$ modulo $q$, we prove the following upper bound \begin{align*} \left| \sum_{1 \le n\le…

We combine a classical idea of Postnikov (1956) with the method of Korobov (1974) for estimating double Weyl sums, deriving new bounds on short character sums when the modulus $q$ has a small core $\prod_{p\mid q}p$. Using this estimate, we…

We prove that the average size of a mixed character sum $$\sum_{1\le n \le x} \chi(n) e(n\theta) w(n/x)$$ (for a suitable smooth function $w$) is on the order of $\sqrt{x}$ for all irrational real $\theta$ satisfying a weak Diophantine…

We establish a general large sieve inequality with sparse sets $\mathcal{S}$ of moduli in the Gaussian integers which are in a sense well-distributed in arithmetic progressions. This extends earlier work of S. Baier on the large sieve with…

In this paper, we study the distribution of difference of multiplicative and additive characters modulo $p$ at consecutive polynomial values. More precisely, for an interval $I$ over finite field and $0<m<1$, we investigate the following…

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 estimate mixed character sums of polynomial values over elements of a finite field $\mathbb F_{q^r}$ with sparse representations in a fixed ordered basis over the subfield $\mathbb F_q$. First we use a combination of the…

We show that smooth numbers are equidistributed in arithmetic progressions to moduli of size $x^{66/107-o(1)}$. This overcomes a longstanding barrier of $x^{3/5-o(1)}$ present in previous works of Bombieri-Friedlander-Iwaniec,…

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

Burgess proved that for $\chi_q$ a primitive Dirichlet character modulo $q$ with $q$ cubefree, $\Big|\sum_{M< n\le M+N}\chi_q(n)\Big| \ll N^{1-\frac{1}{r}}q^{\frac{r+1}{4r^2}+\epsilon}$ for all integers $r\ge1.$ More recently, explicit…

We use the Burgess bound and Selberg sieve to obtain an upper bound on the second moment of sums over an interval $[u+1,u+h]$ of Legendre symbols modulo primes $p$ in a dyadic interval $[Q,2Q]$. The bound is nontrivial and gives a power…

In this article, we investigate conditional large values of quadratic Dirichlet character sums. We prove some Omega results of quadratic character sums under the assumption of the generalized Riemnn hypothesis, which are as sharp as…

We study large values of quadratic character sums with summation lengths exceeding the square root of the modulus. Assuming the Generalized Riemann Hypothesis, we obtain a new Omega result.

A modified Dirichlet character $f$ is a completely multiplicative function such that for some Dirichlet character $\chi$, $f(p)=\chi(p)$ for all but a finite number of primes $p\in S$, and for those exceptional primes $p\in S$, $|f(p)|\leq…

We investigate the sums $(1/\sqrt{H}) \sum_{X < n \leq X+H} \chi(n)$, where $\chi$ is a fixed non-principal Dirichlet character modulo a prime $q$, and $0 \leq X \leq q-1$ is uniformly random. Davenport and Erd\H{o}s, and more recently…

We prove conjecturally sharp upper bounds for the Dirichlet character moments $\frac{1}{r-1} \sum_{\chi \; \text{mod} \; r} |\sum_{n \leq x} \chi(n)|^{2q}$, where $r$ is a large prime, $1 \leq x \leq r$, and $0 \leq q \leq 1$ is real. In…

For any real $k\geq 2$ and large prime $q$, we prove a lower bound on the $2k$-th moment of the Dirichlet character sum \begin{equation*} \frac{1}{\phi(q)} \sum_{\substack{\chi \text{ mod }q\\ \chi\neq \chi_0}} \Big| \sum_{n\leq x}…

We formulate and prove a large sieve inequality for quadratic characters over a number field. To do this, we introduce the notion of an n-th order Hecke family. We develop the basic theory of these Hecke families, including versions of the…