Abstract
We obtain a new bound on certain double sums of multiplicative characters which improves 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 in additive combinatorics.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have