English

On the structure of distance sets over prime fields

Combinatorics 2019-01-01 v1 Number Theory

Abstract

Let Fq\mathbb{F}_q be a finite field of order qq and E\mathcal{E} be a set in Fqd\mathbb{F}_q^d. The distance set of E\mathcal{E}, denoted by Δ(E)\Delta(\mathcal{E}), is the set of distinct distances determined by the pairs of points in E\mathcal{E}. Very recently, Iosevich, Koh, and Parshall (2018) proved that if Eqd/2|\mathcal{E}|\gg q^{d/2}, then the quotient set of Δ(E)\Delta(\mathcal{E}) satisfies Δ(E)Δ(E)={ab ⁣:a,bΔ(E),b0}q.\left\vert\frac{\Delta(\mathcal{E})}{\Delta(\mathcal{E})}\right\vert=\left\vert \left\lbrace\frac{a}{b}\colon a, b\in \Delta(\mathcal{E}), b\ne 0\right\rbrace\right\vert\gg q. In this paper, we break the exponent d/2d/2 when E\mathcal{E} is a Cartesian product of sets over a prime field. More precisely, let pp be a prime and AFpA\subset \mathbb{F}_p. If E=AdFpd\mathcal{E}=A^d\subset \mathbb{F}_p^d and Epd2ε|\mathcal{E}|\gg p^{\frac{d}{2}-\varepsilon} for some ε>0\varepsilon>0, then we have Δ(E)Δ(E), Δ(E)Δ(E)p.\left\vert\frac{\Delta(\mathcal{E})}{\Delta(\mathcal{E})}\right\vert, ~\left\vert \Delta(\mathcal{E})\cdot \Delta(\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\H{o}s-Falconer distance conjecture over finite fields.

Keywords

Cite

@article{arxiv.1812.11556,
  title  = {On the structure of distance sets over prime fields},
  author = {Thang Pham and Andrew Suk},
  journal= {arXiv preprint arXiv:1812.11556},
  year   = {2019}
}

Comments

8 pages. Submitted for publication