Eigenvalues of the Derangement Graph

Simple item page
dc.creatorKu, Cheng Yeaw
dc.creatorWales, David B.
dc.date2008-03-19
dc.date.accessioned2026-07-07T09:27:36Z
dc.date.available2026-07-07T09:27:36Z
dc.descriptionWe consider the Cayley graph on the symmetric group Sn generated by derangements. It is well known that the eigenvalues of this grpah are indexed by partitions of n. We investigate how these eigenvalues are determined by the shape of their corresponding partitions. In particular, we show that the sign of an eigenvalue is the parity of the number of cells below the first row of the corresponding Ferrers diagram. We also provide some lower and upper bounds for the absolute values of these eigenvalues.
dc.description26 pages
dc.identifierhttps://arxiv.org/abs/0803.2901
dc.identifierhttp://arxiv.org/abs/0803.2901
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/157163
dc.subjectCombinatorics
dc.subjectRepresentation Theory
dc.subject05Axx,05Cxx
dc.titleEigenvalues of the Derangement Graph
dc.typetext

Files

Collections

arXiv