Character sums with exponential functions

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

New sum-product type estimates over finite fields (2014, background): “ one can derive Proposition 12 from Theorem 5. Using Theorem 5, we obtain a new bound for double exponential sum over powers of a primitive root. Another results in the direction can be found in [3], [11]. Theorem 13. Let p be a prime number, g be a primitive root, and H be an integer, H < p2/3. ”
On asymptotic formulae in some sum–product questions (2018, unknown): “, [5], [8], [12], [30], [50] and others.”
Higher moments of convolutions (2011, background): “sible up to a constant factor. In particular, it gives asymptotic formulas for the sizes of the sets Γk±∆(Γ), k>3. To apply the inequality (59) of Proposition 44 we need a lemma (see, e.g. [35] or [17, 18]). 28 Higher moments of convolutions Lemma 46 Let pbe a prime number, Γ ⊆ F∗ p be a multipli”
Certain Exponential Sums and Random Walks on Elliptic Curves (2005, methodology): “Shparlinski 3 Main Result The following bound is an analogue of Lemma 4 of [6].”