English

Cayley Graph on Symmetric Group Generated by Elements Fixing $k$ Points

Combinatorics 2014-05-27 v1

Abstract

Let Sn\mathcal{S}_{n} be the symmetric group on [n]={1,,n}[n]=\{1, \ldots, n\}. The kk-point fixing graph F(n,k)\mathcal{F}(n,k) is defined to be the graph with vertex set Sn\mathcal{S}_{n} and two vertices gg, hh of F(n,k)\mathcal{F}(n,k) are joined if and only if gh1gh^{-1} fixes exactly kk points. In this paper, we derive a recurrence formula for the eigenvalues of F(n,k)\mathcal{F}(n,k). Then we apply our result to determine the sign of the eigenvalues of F(n,1)\mathcal{F}(n,1).

Keywords

Cite

@article{arxiv.1405.6462,
  title  = {Cayley Graph on Symmetric Group Generated by Elements Fixing $k$ Points},
  author = {Kok Bin Wong and Terry Lau and Cheng Yeaw Ku},
  journal= {arXiv preprint arXiv:1405.6462},
  year   = {2014}
}

Comments

22 pages

R2 v1 2026-06-22T04:23:03.816Z