Distinct distances on regular varieties over finite fields
Pham Van Thang, Do Duy Hieu

TL;DR
This paper extends results on distance sets in finite fields, showing that large subsets of regular varieties determine almost all distances for certain polynomial families.
Contribution
It generalizes previous work by establishing conditions under which subsets of regular varieties cover all nonzero values of specific polynomial distance functions.
Findings
Large subsets in regular varieties determine all nonzero polynomial distances.
Conditions on subset size ensure full coverage of distance values.
Results extend known theorems to broader polynomial families.
Abstract
In this paper we study some generalized versions of a recent result due to Covert, Koh, and Pi (2015). More precisely, we prove that if a subset in a regular variety satisfies , then for some certain families of polynomials .
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 · Analytic Number Theory Research · Limits and Structures in Graph Theory
