Dot-product graphs in finite fields
Chengfei Xie, Gennian Ge

TL;DR
This paper investigates the properties of dot-product graphs over finite fields, demonstrating that large enough product sets lead to graphs with positive density using Fourier analysis techniques.
Contribution
It introduces finite field Fourier analytic methods to analyze dot-product graphs and establishes conditions for positive density based on product set size.
Findings
Large product sets imply positive density in dot-product graphs.
Fourier analysis effectively studies combinatorial properties in finite fields.
Provides new tools for understanding geometric structures in finite fields.
Abstract
In this paper, we study the dot-product graphs in . We prove that if the size of the product of two adjacent sets is large enough, then the set of dot-product graphs has positive density. Our method is based on finite field Fourier analytic techniques.
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 · Mathematical Dynamics and Fractals · Analytic Number Theory Research
