arXiv Analytics

Sign in

arXiv:2412.07989 [math.NT]AbstractReferencesReviewsResources

Exponential Sums with Sparse Polynomials and Distribution of the Power Generator

Subham Bhakta, Igor Shparlinski

Published 2024-12-11, updated 2024-12-28Version 2

We obtain new bounds on complete rational exponential sums with sparse polynomials modulo a prime, under some mild conditions on the degrees of the monomials of such polynomials. These bounds, when they apply, give explicit versions of a result of J. Bourgain (2005). In turn, as an application, we also obtain an explicit version of a result of J. Bourgain (2010) on national exponential sums with sparse polynomials modulo an arbitrary composite number. We then use one of these bounds to study the multidimensional distribution of the classical power generator of pseudorandom numbers, which has not been possible within previously known results.

Related articles: Most relevant | Search more
arXiv:math/0406335 [math.NT] (Published 2004-06-16)
The iterated Carmichael λ-function and the number of cycles of the power generator
arXiv:2501.18048 [math.NT] (Published 2025-01-29, updated 2025-06-24)
Almost primes between all squares
arXiv:2412.02068 [math.NT] (Published 2024-12-03)
An explicit version of Carlson's theorem