Mordell’s exponential sum estimate revisited
HTML articles powered by AMS MathViewer
 by J. Bourgain PDF
 J. Amer. Math. Soc. 18 (2005), 477499 Request permission
Abstract:
The aim of this paper is to extend recent work of S. Konyagin and the author on Gauss sum estimates for large degree to the case of ‘sparse’ polynomials. In this context we do obtain a nearly optimal result, improving on the works of Mordell and of Cochrane and Pinner. The result is optimal in terms of providing some power gain under conditions on the exponents in the polynomial that are best possible if we allow arbitrary coefficients. As in earlier work referred to above, our main combinatorial tool is a sumproduct theorem. Here we need a version for product spaces $\mathbb {F}_{p}\times \mathbb {F}_{p}$ for which the formulation is obviously not as simple as in the $\mathbb {F}_{p}$case. Again, the method applies more generally to provide nontrivial bounds on (possibly incomplete) exponential sums involving exponential functions. At the end of the paper, some applications of these are given to issues of uniform distribution for power generators in cryptography.References

[B]B J. Bourgain, Estimates on exponential sums related to the Diffie–Hellman distributions, to appear in GAFA.
[BC]BC J. Bourgain, M.C. Chang, Exponential sum estimates over subgroups and almost subgroups of ${\mathbb Z}_q^*$ where $q$ is composite with few prime factors, submitted to Geom. Funct. Anal.
[BGK]BGK J. Bourgain, A. Glibichuk, S. Konyagin, Estimate for the number of sums and products and for exponential sums in fields of prime order, submitted to J. London Math. Soc.
 Jean Bourgain and S. V. Konyagin, Estimates for the number of sums and products and for exponential sums over subgroups in fields of prime order, C. R. Math. Acad. Sci. Paris 337 (2003), no. 2, 75–80 (English, with English and French summaries). MR 1998834, DOI 10.1016/S1631073X(03)002814
 J. Bourgain, N. Katz, and T. Tao, A sumproduct estimate in finite fields, and applications, Geom. Funct. Anal. 14 (2004), no. 1, 27–57. MR 2053599, DOI 10.1007/s0003900404511
 Todd Cochrane and Christopher Pinner, An improved Mordell type bound for exponential sums, Proc. Amer. Math. Soc. 133 (2005), no. 2, 313–320. MR 2093050, DOI 10.1090/S0002993904077263
 Todd Cochrane and Christopher Pinner, Stepanov’s method applied to binomial exponential sums, Q. J. Math. 54 (2003), no. 3, 243–255. MR 2013138, DOI 10.1093/qjmath/54.3.243
 John B. Friedlander, Carl Pomerance, and Igor E. Shparlinski, Period of the power generator and small values of Carmichael’s function, Math. Comp. 70 (2001), no. 236, 1591–1605. MR 1836921, DOI 10.1090/S0025571800012825
 John B. Friedlander and Igor E. Shparlinski, On the distribution of the power generator, Math. Comp. 70 (2001), no. 236, 1575–1589. MR 1836920, DOI 10.1090/S0025571800012837
 W. T. Gowers, A new proof of Szemerédi’s theorem for arithmetic progressions of length four, Geom. Funct. Anal. 8 (1998), no. 3, 529–551. MR 1631259, DOI 10.1007/s000390050065
 Sergei V. Konyagin and Igor E. Shparlinski, Character sums with exponential functions and their applications, Cambridge Tracts in Mathematics, vol. 136, Cambridge University Press, Cambridge, 1999. MR 1725241, DOI 10.1017/CBO9780511542930 [Mor]Mor L.J. Mordell, On a sum analogous to a Gauss sum, Quart. J. Math. 3 (1932), 161–162.
 Melvyn B. Nathanson, Additive number theory, Graduate Texts in Mathematics, vol. 164, SpringerVerlag, New York, 1996. The classical bases. MR 1395371, DOI 10.1007/9781475738452
Additional Information
 J. Bourgain
 Affiliation: School of Mathematics, Institute for Advanced Study, Princeton, New Jersey 08540
 MR Author ID: 40280
 Received by editor(s): July 16, 2004
 Published electronically: January 18, 2005
 © Copyright 2005 American Mathematical Society
 Journal: J. Amer. Math. Soc. 18 (2005), 477499
 MSC (2000): Primary 11L07; Secondary 11T23
 DOI: https://doi.org/10.1090/S0894034705004765
 MathSciNet review: 2137982