Related papers: Improving the Burgess bound via Polya-Vinogradov

Following the work of Hildebrand we improve the Po'lya- Vinogradov inequality in a specific range, we also give a general result that shows its dependency on Burgess bound and at last we improve the range of validity for a special case of…

We make explicit a theorem of Fromm and Goldmakher [arXiv:1706.03002], which states that one can improve Burgess' bound for short character sums simply by improving the leading constant in the P\'{o}lya-Vinogradov inequality. Towards…

This paper proves nontrivial bounds for short mixed character sums by introducing estimates for Vinogradov's mean value theorem into a version of the Burgess method.

This paper proves Burgess bounds for short mixed character sums in multi-dimensional settings. The mixed character sums we consider involve both an exponential evaluated at a real-valued multivariate polynomial, and a product of…

We prove character sum estimates for additive Bohr subsets modulo a prime. These estimates are analogous to classical character sum bounds of Polya-Vinogradov and Burgess. These estimates are applied to obtain results on recurrence mod $p$…

It is well-known that cancellation in short character sums (e.g. Burgess' estimates) yields bounds on the least quadratic nonresidue. Scant progress has been made on short character sums since Burgess' work, so it is desirable to find a new…

We establish that three well-known and rather different looking conjectures about Dirichlet characters and their (weighted) sums, (concerning the P\'{o}lya-Vinogradov theorem for maximal character sums, the maximal admissible range in…

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…

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 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 study upper bounds for sums of Dirichlet characters. We prove a uniform upper bound of the character sum over all proper generalized arithmetic progressions, which generalizes the classical Polya and Vinogradov inequality. Our argument…

We establish new estimates on short character sums for arbitrary composite moduli with small prime factors. Our main result improves on the Graham-Ringrose bound for square free moduli and also on the result due to Gallagher and Iwaniec…

In 1918 Polya and Vinogradov gave an upper bound for the maximal size of character sums which still remains the best known general estimate. One of the main results of this paper provides a substantial improvement of the Polya-Vinogradov…

In this paper we obtain further improvement of index bounds for character sums of polynomials over finite fields. We present some examples, which show that our new bound is an improved bound compared to both the Weil bound and the index…

In this work we establish a Burgess bound for short multiplicative character sums in arbitrary dimensions, in which the character is evaluated at a homogeneous form that belongs to a very general class of "admissible" forms. This…

In this paper we obtain a new constant in the P\'{o}lya-Vinogradov inequality. Our argument follows previously established techniques which use the Fourier expansion of an interval to reduce to Gauss sums. Our improvement comes from…

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…

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 extend the classical Burgess estimates to character sums over proper generalized arithmetic progressions (GAPs) of rank $2$ in prime fields $\mathbb{F}_p$. The core of our proof is a sharp upper bound for the multiplicative energy of…

Recently, Granville and Soundararajan have made fundamental breakthroughs in the study of character sums. Building on their work and using estimates on short character sums developed by Graham-Ringrose and Iwaniec, we improve the…