Pinned distance sets, k-simplices, Wolff's exponent in finite fields and sum-product estimates
Jeremy Chapman, M. Burak Erdogan, Derrick Hart, Alex Iosevich and, Doowon Koh

TL;DR
This paper advances the understanding of distance and dot product sets in finite fields, improving threshold exponents for various geometric configurations and establishing analogs of Euclidean results.
Contribution
It provides new bounds for pinned distance sets, dot product sets, and simplices in finite fields, extending Euclidean geometric measure theory to finite field settings.
Findings
Improved exponent for distance sets in 2D to 4/3.
Finite field analog of Peres-Schlag result for pinned distance and dot product sets.
Enhanced bounds for simplices in finite fields using Fourier analysis.
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 . In two dimensions we improve the known exponent to , consistent with the corresponding exponent in Euclidean space obtained by Wolff. The pinned distance set for a pin has been studied in the Euclidean setting. Peres and Schlag showed that if the Hausdorff dimension of a set is greater than then the Lebesgue measure of is positive for almost every pin . In this paper we obtain the analogous result in…
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 · Finite Group Theory Research · Coding theory and cryptography
