Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Binomial exponential sums (1811.00765v1)

Published 2 Nov 2018 in math.NT

Abstract: We obtain new bounds of exponential sums modulo a prime $p$ with binomials $axk + bxn$. In particular, for $k=1$, we improve the bound of Karatsuba (1967) from $O(n{1/4} p{3/4})$ to $O\left(p{3/4} + n{1/3}p{2/3}\right)$ for any $n$, and then use it to improve the bound of Akulinichev (1965) from $O(p{5/6})$ to $O(p{4/5})$ for $n | (p-1)$. The result is based on a new bound on the number of solutions and of degrees of irreducible components of certain equations over finite fields.

Summary

We haven't generated a summary for this paper yet.