On the spectra of simplicial rook graphs
View/ Open
Issue Date
2014-05-05Author
Martin, Jeremy L.
Wagner, Jennifer D.
Type
Preprint
Version
http://arxiv.org/abs/1209.3493v2
Metadata
Show full item recordAbstract
The \emph{simplicial rook graph} $\SR(d,n)$ is the graph whose vertices are the lattice points in the $n$th dilate of the standard simplex in $\mathbb{R}^d$, with two vertices adjacent if they differ in exactly two coordinates. We prove that the adjacency and Laplacian matrices of $\SR(3,n)$ have integral spectrum for every~$n$. The proof proceeds by calculating an explicit eigenbasis.
We conjecture that $\SR(d,n)$ is integral for all~$d$ and~$n$, and present evidence in
support of this conjecture. For $n<\binom{d}{2}$, the evidence indicates that the smallest eigenvalue of the adjacency matrix is $-n$,
and that the corresponding eigenspace has dimension given by the Mahonian
numbers, which enumerate permutations by number of inversions.
Collections
Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
We want to hear from you! Please share your stories about how Open Access to this item benefits YOU.