On the spectral gap of some Cayley graphs on the Weyl group
arXiv:1807.11833
Abstract
The Laplacian of a (weighted) Cayley graph on the Weyl group is a matrix with equal to the order of the group. We show that for a class of (weighted) generating sets, its spectral gap (lowest nontrivial eigenvalue), is actually equal to the spectral gap of a matrix associated to a -dimensional permutation representation of . This result can be viewed as an extension to of an analogous result valid for the symmetric group, known as `Aldous' spectral gap conjecture', proven in 2010 by Caputo, Liggett and Richthammer.
arXiv commentVersion 1 (v1) contains a mistake. The main result is proved here under a less general hypothesis than in v1. Main result of v1 is left as a conjecture
References in corpus (4)
- On the eigenvalues of Cayley graphs on the symmetric group generated by a complete multipartite set of transpositions
- Interlacings for random walks on weighted graphs and the interchange process
- Asymptotics of the Spectral Gap for the Interchange Process on Large Hypercubes
- The second largest eigenvalues of some Cayley graphs on alternating groups