A two-parameter finite field Erd\H{o}s-Falconer distance problem
Philipp Birklbauer, Alex Iosevich

TL;DR
This paper investigates a two-parameter finite field Erdős-Falconer distance problem, establishing conditions under which the distance set covers the entire finite field product and providing sharp bounds for specific cases.
Contribution
It introduces a new two-parameter variant of the Erdős-Falconer problem over finite fields and proves sharp bounds for the size of the distance set in this setting.
Findings
If |E||F| ≥ C q^{k+2l+1}, then B_{k,l}(E,F) equals the entire product space.
The result is sharp when k is odd.
For l=k=2 and q ≡ 3 mod 4, a lower bound on |E||F| ensures a large distance set.
Abstract
We study the following two-parameter variant of the Erd\H os-Falconer distance problem. Given , , the -dimensional vector space over the finite field with elements, let be given by We prove that if , then . Furthermore this result is sharp if is odd. For the case of and a prime with we get that for every positive there is such 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
TopicsCoding theory and cryptography · Finite Group Theory Research
