  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.
