Interpolation of point configurations in the discrete plane
Esen Aksoy, Alex Iosevich, Brian McDonald

TL;DR
This paper develops a new technique to analyze distance sets in finite fields, focusing on graphs with both rigid and non-rigid components, and establishes new bounds for the size of these sets in specific configurations.
Contribution
It introduces a method for studying complex graph configurations in finite field distance problems, extending previous results to graphs with mixed rigid and non-rigid parts.
Findings
For a specific graph of two triangles joined at a vertex, if |E| ≥ q^{12/7}, then the distance set size is at least cq^6.
The paper generalizes distance set results to graphs with both rigid and non-rigid components in finite fields.
Provides improved bounds for certain graph configurations in finite field distance problems.
Abstract
Defining distances over finite fields formally by for , distance problems naturally arise in analogy to those studied by Erd\H{o}s and Falconer in Euclidean space. Given a graph and a set , let be the generalized distance set corresponding to . In the case when is the complete graph on vertices, Bennett, Hart, Iosevich, Pakianathan, and Rudnev showed that when , it follows that . In the case when , the threshold can be improved to . Moreover, Jardine, Iosevich, and McDonald showed that in the case when is a tree with vertices, then whenever , satisfies , it follows that…
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
TopicsAdvanced Theoretical and Applied Studies in Material Sciences and Geometry · Mathematics and Applications · Advanced Numerical Analysis Techniques
