arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1209.3493math.CO
收藏

单纯车图的谱

On the Spectra of Simplicial Rook Graphs

Jeremy L. Martin, Jennifer D. Wagner

摘要:

\emph{simplicial rook graph} SR(d,n)是其顶点是$\mathbb{R}^d$中标准单形的$n$次扩张中的格点的图,如果两个顶点恰好在两个坐标上不同,则它们相邻。证明了SR(3,n)的邻接矩阵和Laplacian矩阵对每个$n$都有整谱.通过计算一个显式特征基来进行证明。我们猜想SR(d,n)对所有的$d$和$n$都是可积的,并给出了支持这一猜想的证据.对于$n<\binom{d}{2}$,证据表明邻接矩阵的最小特征值是$-n$,并且相应的特征空间具有由Mahonian数给出的维数,Mahonian数通过反转数来枚举排列。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑