arXiv Analytics

Sign in

arXiv:1201.2167 [math.CO]AbstractReferencesReviewsResources

Spectrum of Cayley graphs on the symmetric group generated by transpositions

Roi Krakovski, Bojan Mohar

Published 2012-01-10, updated 2012-04-29Version 2

For an integer $n\geq 2$, let $X_n$ be the Cayley graph on the symmetric group $S_n$ generated by the set of transpositions ${(1 2),(1 3),...,(1 n)}$. It is shown that the spectrum of $X_n$ contains all integers from $-(n-1)$ to $n-1$ (except 0 if $n=2$ or $n=3$).

Comments: We have been informed by Guillaume Chapuy, Valentin F\'eray and Paul Renteln, that the problem in question can be solved by exploiting certain properties of the Jucys-Murphy elements, discovered by Jucys and independently by Flatto, Odlyzko and Wales
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1405.6462 [math.CO] (Published 2014-05-26)
Cayley Graph on Symmetric Group Generated by Elements Fixing $k$ Points
arXiv:2401.14380 [math.CO] (Published 2024-01-25)
Splines on Cayley Graphs of the Symmetric Group
arXiv:1202.4976 [math.CO] (Published 2012-02-22, updated 2012-02-27)
A note on a Cayley graph of S_n