Structural theorems on the distance sets over finite fields
Number Theory
2022-05-03 v2 Combinatorics
Abstract
Let be a finite field of order . Iosevich and Rudnev (2005) proved that for any set , if , then the distance set contains a positive proportion of all distances. Although this result is sharp in odd dimensions, it is conjectured that the right exponent should be in even dimensions. During the last 15 years, only some improvements have been made in two dimensions, and the conjecture is still wide open in higher dimensions. To fill the gap, we need to understand more about the structures of the distance sets, the main purpose of this paper is to provide some structural theorems on the distribution of square and non-square distances.
Cite
@article{arxiv.2111.14076,
title = {Structural theorems on the distance sets over finite fields},
author = {Doowon Koh and Minh Quy Pham and Thang Pham},
journal= {arXiv preprint arXiv:2111.14076},
year = {2022}
}
Comments
V2 includes several fixes and clarifications