Abstract
We obtain new bounds of exponential sums modulo a prime with sparse polynomials . The bounds depend on various greatest common divisors of exponents and their differences. In particular, two new bounds for binomials are obtained, improving previous results in broad ranges of parameters.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.