Cayley Graph on Symmetric Group Generated by Elements Fixing k Points
Abstract
Let Sn be the symmetric group on [n]=\1, …, n\. The k-point fixing graph F(n,k) is defined to be the graph with vertex set Sn and two vertices g, h of F(n,k) are joined if and only if gh-1 fixes exactly k points. In this paper, we derive a recurrence formula for the eigenvalues of F(n,k). Then we apply our result to determine the sign of the eigenvalues of F(n,1).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.