加载中…
Let be an arbitrary finite field, and be a set of points in . Let be the set of distances determined by pairs of points in . By using the Kloosterman sums, Iosevich and Rudnev proved that if $||\ge 4q^{\frac{d+1}{2}}\Delta()=_q$. In general, this result is sharp in odd-dimensional spaces over arbitrary finite fields. In this paper, we use the recent 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.

生成讲解博客的中文版本

生成AI智能校验的中文版本