Distribution of distances in five dimensions and related problems
Francois Clement, Thang Pham

TL;DR
This paper investigates the Erdős-Falconer distance problem in five dimensions over finite fields, establishing new bounds and conditions for the distance set to cover the entire field, especially for Cartesian product sets.
Contribution
It provides new bounds for the size of sets needed to ensure the distance set covers the entire field in five dimensions, with improved results for sets with small difference sets.
Findings
For sets A with size greater than p^{13/22}, the distance set covers all of _p.
Stronger results are obtained when |A-A|\u223c|A|, including explicit sumset conditions.
New bounds on the size of A^2+A^2 in relation to |A|, K, and p are established.
Abstract
In this paper, we study the Erd\H{o}s-Falconer distance problem in five dimensions for sets of Cartesian product structures. More precisely, we show that for with , then . When , we obtain stronger statements as follows: If , then If , then We also prove that if , then \[|A^2+A^2|\gg \min \left\lbrace \frac{p}{K^4}, \frac{|A|^{8/3}}{K^{7/3}p^{2/3}}\right\rbrace.\] As a consequence, when and , where .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory
