English

On eigenfunctions and maximal cliques of generalised Paley graphs of square order

Combinatorics 2023-08-30 v3 Number Theory

Abstract

Let GP(q2,m)(q^2,m) be the mm-Paley graph defined on the finite field with order q2q^2. We study eigenfunctions and maximal cliques in generalised Paley graphs GP(q2,m)(q^2,m), where m(q+1)m \mid (q+1). In particular, we explicitly construct maximal cliques of size q+1m\frac{q+1}{m} or q+1m+1\frac{q+1}{m}+1 in GP(q2,m)(q^2,m), and show the weight-distribution bound on the cardinality of the support of an eigenfunction is tight for the smallest eigenvalue q+1m-\frac{q+1}{m} of GP(q2,m)(q^2,m). These new results extend the work of Baker et. al and Goryainov et al. on Paley graphs of square order. We also study the stability of the Erd\H{o}s-Ko-Rado theorem for GP(q2,m)(q^2,m) (first proved by Sziklai).

Keywords

Cite

@article{arxiv.2203.16081,
  title  = {On eigenfunctions and maximal cliques of generalised Paley graphs of square order},
  author = {Sergey Goryainov and Leonid Shalaginov and Chi Hoi Yip},
  journal= {arXiv preprint arXiv:2203.16081},
  year   = {2023}
}