Let
be an arbitrary
finite field, and
be a point set in
.
Let
be the set of distances determined by pairs of points in
.
Using Kloosterman sums, Iosevich and Rudnev (2007) proved that if
then
. In
general, this result is sharp in odd-dimensional spaces over arbitrary finite fields.
We use the point-plane incidence bound due to Rudnev to prove that if
has
Cartesian product structure in vector spaces over prime fields, then we can break the
exponent
and still cover all distances. We also show that the number of pairs of points in
of
any given distance is close to its expected value.