On the Number of Dot Products Determined by a Large Set and One of its Translates in Finite Fields
Giorgis Petridis

TL;DR
This paper investigates the dot product structure of large sets in finite fields, proving that sufficiently large sets determine a substantial number of dot products and that their sum and difference sets cover the entire field.
Contribution
It establishes new bounds on the number of dot products determined by large sets in finite fields and shows the sum and difference sets generate the whole field.
Findings
Existence of pairs with large dot product sets
Sum and difference sets cover the entire finite field
Large sets determine many distinct dot products
Abstract
Let be a set in the 2-dimensional vector space over a finite field with elements, which satisfies . There exist such that In particular, .
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 · Advanced Graph Theory Research
