Pinned distance sets, Wolff's exponent in finite fields and improved sum-product estimates
Derrick Hart, Alex Iosevich

TL;DR
This paper improves the threshold for the finite field Falconer distance problem for sets with product structure, establishing a new exponent of 4/3 that aligns with Euclidean space results.
Contribution
The authors improve the distance set threshold in finite fields for product-structured sets, matching Euclidean exponents and advancing understanding of geometric configurations.
Findings
Established a new threshold exponent of 4/3 for product sets in finite fields.
Proved the sharpness of the threshold in even dimensions.
Extended the analogy between finite field and Euclidean distance problems.
Abstract
An analog of the Falconer distance problem in vector spaces over finite fields asks for the threshold such that whenever , where , the -dimensional vector space over a finite field with elements (not necessarily prime). Here . The second listed author and Misha Rudnev established the threshold , and the authors of this paper, Doowon Koh and Misha Rudnev proved that this exponent is sharp in even dimensions. In this paper we improve the threshold to under the additional assumption that has product structure. In particular, we obtain the exponent 4/3, consistent with the corresponding exponent in Euclidean space obtained by Wolff.
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 · Mathematical Approximation and Integration · Finite Group Theory Research
