Related papers: Improving the Burgess bound via Polya-Vinogradov

In this paper we consider the problem of estimating character sums to composite modulus and obtain some progress towards removing the cubefree restriction in the Burgess bound. Our approach is to estimate high order moments of character…

We obtain a new bound for incomplete Gauss sums modulo primes. Our argument falls under the framework of Vinogradov's method which we use to reduce the problem under consideration to bounding the number of solutions to two distinct systems…

We prove an explicit version of Burgess' bound on character sums for composite moduli.

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.

We provide an index bound for character sums of polynomials over finite fields. This improves the Weil bound for high degree polynomials with small indices, as well as polynomials with large indices that are generated by cyclotomic mappings…

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

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…

The Burgess inequality is the best upper bound we have for the character sum $S_{\chi}(M,N) = \sum_{M<n\le M+N} \chi(n).$ Until recently, no explicit estimates had been given for the inequality. In 2006, Booker gave an explicit estimate for…

In recent years, maximizing G\'al sums regained interest due to a firm link with large values of $L$-functions. In the present paper, we initiate an investigation of small sums of G\'al type, with respect to the $L^1$-norm. We also consider…

We establish Burgess-type bounds for short multiplicative character sums over finite fields $\mathbb{F}_{p^n}$ under a purely volumetric condition. We show that for a box $B \subset \mathbb{F}_{p^n}$, nontrivial cancellation occurs whenever…

We establish a Polya-Vinogradov-type bound for finite periodic multipicative characters on the Gaussian integers.

We show in a quantitative way that any odd character $\chi$ modulo $q$ of fixed order $g \geq 2$ satisfies the property that if the P\'{o}lya-Vinogradov inequality for $\chi$ can be improved to $$\max_{1 \leq t \leq q} \left|\sum_{n \leq t}…

For integer $q$, let $\chi$ be a primitive multiplicative character$\pmod q.$ For integer $a$ coprime to $q$, we obtain a new bound for the sums $$\sum_{n\le N}\Lambda(n)\chi(n+a),$$ where $\Lambda(n)$ is the von Mangoldt function. This…

We generalize Burgess' results on partial Gaussian sums to arbitrary finite fields. The main ingredients are the classical method of amplification, two deep results on multiplicative energy for subsets in finite fields which are obtained…

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…

In their recent work, the authors (2016) have combined classical ideas of A. G. Postnikov (1956) and N. M. Korobov (1974) to derive improved bounds on short character sums for certain nonprincipal characters with powerful moduli. In the…

We extend some methods of bounding exponential sums of the type $\displaystyle\sum_{n\le N}e^{2\pi iag^n/p}$ to deal with the case when $g$ is not necessarily a primitive root. We also show some recent results of Shkredov concerning…

For a primitive Dirichlet character $\chi$ modulo $q$, we define $M(\chi)=\max_{t } |\sum_{n \leq t} \chi(n)|$. In this paper, we study this quantity for characters of a fixed odd order $g\geq 3$. Our main result provides a further…

Let $\chi$ be a primitive character modulo $q$, and let $\delta > 0$. Assuming that $\chi$ has large order $d$, for any $d$th root of unity $\alpha$ we obtain non-trivial upper bounds for the number of $n \leq x$ such that $\chi(n) =…

We obtain a new bound of certain double multiplicative character sums. We use this bound together with some other previously obtained results to obtain new algorithms for finding roots of polynomials modulo a prime $p$.