English
Related papers

Related papers: Burgess bounds for short character sums evaluated …

200 papers

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$…

Number Theory · Mathematics 2019-08-15 Brandon Hanson

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…

Number Theory · Mathematics 2014-05-09 Mei-Chu Chang

We use bounds of mixed character sum to study the distribution of solutions to certain polynomial systems of congruences modulo a prime $p$. In particular, we obtain nontrivial results about the number of solution in boxes with the side…

Number Theory · Mathematics 2019-02-20 Igor E. Shparlinski

Let $\chi$ be a Dirichlet character modulo $p$, a prime. In applications, one often needs estimates for short sums involving $\chi$. One such estimate is the family of bounds known as \emph{Burgess' bound}. In this paper, we explore several…

Number Theory · Mathematics 2019-12-03 Forrest J. Francis

Let $\chi=\chi_q$ be a primitive character mod $q$ and fix $\Delta>0$. In 1989 Graham and Ringrose gave strong bounds on character sums $\sum_{M<n\leq M+N} \chi(n)$ in intervals of length $N=q^\Delta$ whenever $q$ is squarefree and is…

Number Theory · Mathematics 2026-01-19 Todd Cochrane , Andrew Granville , Junren Zheng

A few elementary estimates of a basic character sum over the prime numbers are derived here. These estimates are nontrivial for character sums modulo large q. In addition, an omega result for character sums over the primes is also included.

General Mathematics · Mathematics 2012-05-25 N. A. Carella

We obtain a new bound on certain double sums of multiplicative characters improving the range of several previous results. This improvement comes from new bounds on the number of collinear triples in finite fields, which is a classical…

Number Theory · Mathematics 2018-03-26 Ilya D. Shkredov , Igor E. Shparlinski

We study additive double character sums over two subsets of a finite field. We show that if there is a suitable rational self-map of small degree of a set $D$, then this set contains a large subset $U$ for which the standard bound on the…

Number Theory · Mathematics 2020-11-30 Cathy Swaenepoel , Arne Winterhof

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…

Number Theory · Mathematics 2019-04-10 Bryce Kerr

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…

Number Theory · Mathematics 2015-03-13 Enrique Treviño

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…

Number Theory · Mathematics 2020-07-13 Régis de la Bretèche , Marc Munsch , Gérald Tenenbaum

We prove a stratification result for certain families of $n$-dimensional (complete algebraic) multiplicative character sums. The character sums we consider are sums of products of $r$ multiplicative characters evaluated at rational…

Number Theory · Mathematics 2017-09-07 Junyan Xu

We improve a recent result of B. Hanson (2015) on multiplicative character sums with expressions of the type $a + b +cd$ and variables $a,b,c,d$ from four distinct sets of a finite field. We also consider similar sums with $a + b(c+d)$.…

Number Theory · Mathematics 2017-04-12 Ilya D. Shkredov , Igor E. Shparlinski

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.

Number Theory · Mathematics 2020-04-07 Tomasz Schoen , Ilya D. Shkredov

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…

Number Theory · Mathematics 2020-07-17 Matteo Bordignon , Forrest Francis

Chillag has showed that there is a single generalization showing that the sums of ordinary character tables, Brauer character, and projective indecomposable characters are positive integers. We show that Chillag's construction also applies…

Group Theory · Mathematics 2017-02-10 Xiaoyou Chen , Mark L. Lewis , Hung P. Tong-Viet

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…

Number Theory · Mathematics 2010-02-04 Ke Gong

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…

Number Theory · Mathematics 2015-04-08 Jonathan Bober , Leo Goldmakher

In this paper we consider a variety of mixed character sums. In particular we extend a bound of Heath-Brown and Pierce to the case of squarefree modulus, improve on a result of Chang for mixed sums in finite fields, we show in certain…

Number Theory · Mathematics 2014-10-15 Bryce Kerr

Let $g$ be a fixed Hecke cusp form for $\mathrm{SL}(2,\mathbb{Z})$ and $\chi$ be a primitive Dirichlet character of conductor $M$. The best known subconvex bound for $L(1/2,g\otimes \chi)$ is of Burgess strength. The bound was proved by a…

Number Theory · Mathematics 2020-02-10 Keshav Aggarwal , Roman Holowinsky , Yongxiao Lin , Qingfeng Sun