Algebraic Cayley Graphs over Finite Fields
Mei Lu, Daqing Wan, Li-Ping Wang, Xiao-Dong Zhang
TL;DR
This paper introduces a new class of algebraic Cayley graphs over finite fields, analyzing their connectivity and diameter, and demonstrating their potential as a source of expander graphs based on Weil's estimate.
Contribution
It constructs a novel algebraic Cayley graph over finite fields and studies its properties, extending classical results on expanders.
Findings
Graphs are connected with bounded diameter
They serve as a new source of expander graphs
Analysis uses Weil's estimate for character sums
Abstract
A new algebraic Cayley graph is constructed using finite fields. Its connectedness and diameter bound are studied via Weil's estimate for character sums. These graphs provide a new source of expander graphs, extending classical results of Chung.
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
TopicsFinite Group Theory Research · Graph theory and applications · Coding theory and cryptography