Pinned algebraic distances determined by Cartesian products in $\mathbb{F}_p^2$
Giorgis Petridis

TL;DR
This paper proves that for subsets of finite fields, the number of distinct pinned algebraic distances determined by Cartesian products is at least proportional to the minimum of the field size and the subset size raised to the 3/2 power.
Contribution
It establishes a new lower bound on the number of pinned algebraic distances in finite fields for Cartesian product sets.
Findings
At least a constant multiple of min{p, |A|^{3/2}} distances are determined.
The result applies to subsets of finite fields with prime order.
Provides a quantitative measure of distance diversity in finite field Cartesian products.
Abstract
Let be an odd prime and be a subset of the finite field with elements. We show that determines at least a constant multiple of distinct pinned algebraic distances.
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 · Coding theory and cryptography · Computational Geometry and Mesh Generation
