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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Proceedings of the Steklov Institute of Mathematics
Paper Title
Journal
Date
