Eigenvalues of the Derangement Graph

Details Eigenvalues of the Derangement Graph Eigenvalues of the Derangement Graph

2008-03-19

arxiv.org/abs/0803.2901v1

Mathematics

Combinatorics

26 pages

Scientific paper

We 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.

Affiliated with

Also associated with

No associations

Rating

Eigenvalues of the Derangement Graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Eigenvalues of the Derangement Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Eigenvalues of the Derangement Graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-577303