The nature of the spectrum of generalized Paley graphs and weak Waring numbers over finite fields
Ricardo A. Podest\'a, Denis E. Videla

TL;DR
This paper investigates the spectral properties of generalized Paley graphs over finite fields, characterizes when they are real or integral, and applies these findings to compute weak Waring numbers.
Contribution
It provides a complete characterization of real spectrum in GP-graphs, constructs infinite families of integral GP-graphs, and links spectral properties to weak Waring numbers over finite fields.
Findings
GP-graphs are real if and only if they are undirected.
Constructed infinite families of integral GP-graphs using cyclotomic polynomials.
Reduced weak Waring number computations to classic Waring numbers over finite fields.
Abstract
We consider the family of generalized Paley graphs (GP-graphs for short) , with and prime. We characterize all GP-graphs having real spectrum; namely, if and only if is undirected. We then study conditions for integrality in the spectrum and give a general method to produce integral GP-graphs through cyclotomic polynomials. Using this, we construct several infinite families of integral GP-graphs. Next, we focus on directed GP-graphs (GP-digraphs). We show that GP-digraphs always have three or more eigenvalues, and then we prove that there is only one kind of GP-digraphs having three different eigenvalues: the oriented Paley graphs or disjoint unions of copies of them, . Then, we show that…
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.
