Related papers: Character Sums Over The Prime Numbers

We obtain transformation formulas for quadratic character sums with quartic and cubic polynomial arguments.

We prove that Burgess's bound gives an estimate not just for a single character sum, but for a mean value of many such sums.

We obtain a Burgess-type bound for character sums over unions of intervals. The result follows from the argument of Heath-Brown, with an improvement in one of the steps.

Let $q$ be a prime power and $r$ a positive even integer. Let $\mathbb{F}_{q}$ be the finite field with $q$ elements and $\mathbb{F}_{q^r}$ be its extension field of degree $r$. Let $\chi$ be a nontrivial multiplicative character of…

Let $q\geqslant2$ be an integer, $\chi$ be any non-principal character mod $q$, and $H=H(q)\leqslant q.$ In this paper the authors prove some estimates for character sums of the form…

In this paper, we study the sum of additive characters over finite fields, with a focus on those of specified \(\mathbb{F}_q\)-Order. We establish a general formula for these character sums, providing an additive analogue to classical…

We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.

This work proves a Burgess bound for short mixed character sums in $n$ dimensions. The non-principal multiplicative character of prime conductor $q$ may be evaluated at any "admissible" form, and the additive character may be evaluated at…

We prove new bounds for sums of multiplicative characters over sums of set with small doubling and applying this result we break the square--root barrier in a problem of Balog concerning products of differences in a field of prime order.

We estimate weighted character sums with determinants $ad-bc $ of $2\times 2$ matrices modulo a prime $p$ with entries $a,b,c,d $ varying over the interval $ [1,N]$. Our goal is to obtain nontrivial bounds for values of $N$ as small as…

We obtain explicit estimates for the mixed character sum $S= S(\chi,g,f,p^m) = \sum_{x=1}^{p^m} \chi (g(x)) e_{p^m}(f(x))$, where $p^m$ is a prime power, $\chi$ is a multiplicative character mod $p^m$ and $f,g$ are rational functions over…

In this paper, we investigate the distribution of the maximum of character sums over the family of primitive quadratic characters attached to fundamental discriminants $|d|\leq x$. In particular, our work improves results of Montgomery and…

We continue investigations on the average number of representations of a large positive integer as a sum of given powers of prime numbers. The average is taken over a short interval, whose admissible length depends on whether or not we…

The main results extend to sums over primes in a short interval earlier estimates by the author for "long" Weyl sums over primes.

For a nonprincipal character $\chi$ modulo $D$, when $x\ge D^{\frac56+\varepsilon}$, $(l,D) = 1$, we prove a nontrivial estimate of the form $\sum_{n\le x}\Lambda (n)\chi (n-l)\ll x\exp\left(-0.6\sqrt{\ln D}\right)$ for the sum of values of…

Assuming the Riemann Hypothesis we obtain asymptotic estimates for the mean value of the number of representations of an integer as a sum of two primes. By proving a corresponding Omega-term, we prove that our result is essentially the best…

We provide estimates for sums of the form \[\left|\sum_{a\in A}\sum_{b\in B}\sum_{c\in C}\chi(a+b+c)\right|\] and \[\left|\sum_{a\in A}\sum_{b\in B}\sum_{c\in C}\sum_{d\in D}\chi(a+b+cd)\right|\] when $A,B,C,D\subset \mathbb F_p$, the field…

We study sums of Dirichlet characters over polynomials in $\mathbb{F}_q[t]$ with a prescribed number of irreducible factors. Our main results are explicit formulae for these sums in terms of zeros of Dirichlet L-functions. We also exhibit…

In this paper, we evaluate a smoothed character sum involving $\sum_{m}\sum_{n}\leg {m}{n}$, with quadratic, cubic or quartic Hecke characters $\leg {m}{n}$, and the two sums over $m$ and $n$ are of comparable lengths.

We evaluate the character sum sigma_m sigma_n (m/n) where the two sums are of approximately the same length. The answer is surprising.