On the set of distances between two sets over finite fields (Q2469014)

The author studies the distance problem of two finite sets over a finite field. He uses bounds of exponential sums to derive new lower bounds on the number of distinct distances between all pairs of points \((x,y)\in A\times B\) for two given sets \(A, B\in \mathbb F_q^n\), where \(\mathbb F_q\) is a finite field of \(q\) elements and \(n\geq 1\) is an integer.