Estimates for the number of sums and products and for exponential sums over subgroups in fields of prime order

105 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.

On the average value of divisor sums in arithmetic progressions (2005, background): “If m is also prime, then stronger bounds on Ψ are available; see [1, 5, 15, 16].”
An uncertainty principle for cyclic groups of prime order (2003, result): “The idea that the prime cyclic group Z/pZ has this “maximally skew” structure (in some sense, it is as far as possible from containing subgroups) is consistent with some other recent work on the arithmetic structure of prime cyclic groups, see for instance [2], [3].”
Estimates for the Number of Sums and Products and for Exponential Sums in Fields of Prime Order (2006, result): “The main results of this paper extend those announced in [6].”
Sum–product estimates for rational functions (2010, background): “The restriction was subsequently removed by Bourgain and Konyagin [5].”
On a variant of sum-product estimates and explicit exponential sum bounds in prime fields (2009, background): “From [7, 9] it is known that sum-product results imply new exponential sum estimates in Fp.”