Mordell's exponential sum estimate revisited

114 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Modular hyperbolas (2011, background): “We recall that several more bounds of exponential sums with sparse polynomials of large degree are also given in [30, 33, 59].”
Open problems in additive combinatorics (2007, unknown): “We tried to include primarily those problems we came across in our research, or at least lying close to the area of our research interests.”
Growth in SL_3(Z/pZ) (2008, methodology): “t theorem in (Z/pZ)n. We will prove a sum-product theorem of (Z/pZ)n. As a matter of fact, we shall use only the case n= 2; a theorem close to the one we need was already proven for n= 2 by Bourgain ([B]). However, [B] requires the assumption that |A| >pǫ. We cannot assume |A| >pǫin our applic”
Affine linear sieve, expanders, and sum-product (2010, background): “Sum-product estimate in Zp for prime p [9] implies that for A ⊂ Zp satisfying |A| > p we have rA = Zp for r = r(τ ) (see Lemma 1 in [4]).”
Pinned distance sets, k-simplices, Wolff’s exponent in finite fields and sum-product estimates (2009, background): “7 [4] J. Bourgain, A. Glibichuk, and S. Konyagin Estimates for the number of sums and products for exponentials sums in fields of prime order, Jour. of London Math.”