On the structure of distance sets over prime fields
Combinatorics
2019-01-01 v1 Number Theory
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 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 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