Papers
Topics
Authors
Recent
Search
2000 character limit reached

Exponential sums with sparse polynomials over finite fields

Published 29 Jul 2020 in math.NT | (2007.14551v1)

Abstract: We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x{n_0} + \cdots + a_{\nu}x{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In particular, two new bounds for binomials are obtained, improving previous results in broad ranges of parameters.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.