On the structure of distance sets over prime fields
arXiv:1812.11556
Abstract
Let be a finite field of order and be a set in . The distance set of , denoted by , is the set of distinct distances determined by the pairs of points in . Very recently, Iosevich, Koh, and Parshall (2018) proved that if , then the quotient set of satisfies \[\left\vert\frac{Δ(\mathcal{E})}{Δ(\mathcal{E})}\right\vert=\left\vert \left\lbrace\frac{a}{b}\colon a, b\in Δ(\mathcal{E}), b\ne 0\right\rbrace\right\vert\gg q.\] In this paper, we break the exponent when is a Cartesian product of sets over a prime field. More precisely, let be a prime and . If and for some , then we have \[\left\vert\frac{Δ(\mathcal{E})}{Δ(\mathcal{E})}\right\vert, ~\left\vert Δ(\mathcal{E})\cdot Δ(\mathcal{E})\right\vert \gg p.\] Such improvements are not possible over arbitrary finite fields. These results give us a better understanding about the structure of distance sets and the Erdős-Falconer distance conjecture over finite fields.
8 pages. Submitted for publication