Double Character Sums with Intervals and Arbitrary Sets in Finite Fields
classification
🧮 math.NT
math.CO
keywords
doublefieldsfinitesumsadditivearbitraryboundbounds
read the original abstract
We obtain a new bound on certain double sums of multiplicative characters improving the range of several previous results. This improvement comes from new bounds on the number of collinear triples in finite fields, which is a classical object of study of additive combinatorics.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.