Cayley Graph on Symmetric Group Generated by Elements Fixing $k$ Points
Kok Bin Wong, Terry Lau, Cheng Yeaw Ku

TL;DR
This paper studies the spectral properties of a Cayley graph on the symmetric group generated by elements fixing exactly k points, deriving a recurrence for eigenvalues and analyzing their signs for the case k=1.
Contribution
It introduces a recurrence formula for the eigenvalues of the k-point fixing graph on the symmetric group and analyzes their signs for specific cases.
Findings
Derived a recurrence formula for eigenvalues of the graph
Determined the sign of eigenvalues for the case k=1
Enhanced understanding of spectral properties of symmetric group Cayley graphs
Abstract
Let be the symmetric group on . The -point fixing graph is defined to be the graph with vertex set and two vertices , of are joined if and only if fixes exactly points. In this paper, we derive a recurrence formula for the eigenvalues of . Then we apply our result to determine the sign of the eigenvalues of .
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
TopicsGraph theory and applications · Finite Group Theory Research · graph theory and CDMA systems
