On eigenfunctions and maximal cliques of Paley graphs of square order
Sergey Goryainov, Vladislav V. Kabanov, Leonid Shalaginov, Alexandr, Valyuzhenich

TL;DR
This paper identifies new maximal cliques in Paley graphs of square order and constructs eigenfunctions with minimal support, advancing understanding of their combinatorial and spectral properties.
Contribution
It introduces new maximal cliques in Paley graphs of order q^2 and constructs eigenfunctions with minimal support, linking clique structure to spectral properties.
Findings
New maximal cliques of size (q+1)/2 or (q+3)/2 identified.
Eigenfunctions with support size q+1 constructed.
Results depend on the congruence class of q modulo 4.
Abstract
In this paper we find new maximal cliques of size or , accordingly as or , in Paley graphs of order , where is an odd prime power. After that we use new cliques to define a family of eigenfunctions corresponding to both non-principal eigenvalues and having the cardinality of support , which is the minimum by the weight-distribution bound.
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.
