On the structure of distance sets over prime fields

Abstract

Let Fq be a finite field of order q and E be a set in Fqd. The distance set of E, denoted by (E), is the set of distinct distances determined by the pairs of points in E. Very recently, Iosevich, Koh, and Parshall (2018) proved that if |E| qd/2, then the quotient set of (E) satisfies \[(E)(E)= ab a, b∈ (E), b 0 q.\] In this paper, we break the exponent d/2 when E is a Cartesian product of sets over a prime field. More precisely, let p be a prime and A⊂ Fp. If E=Ad⊂ Fpd and |E| pd2- for some >0, then we have \[(E)(E), ~ (E)· (E) 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 Erdos-Falconer distance conjecture over finite fields.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…