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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.