2018/07/31 by Cesi, Filippo · 1 citation
#05C25 #05C50 #20C15 #20C30 #60K35 #Combinatorics (math.CO) #FOS: Mathematics #Group Theory (math.GR) #Probability (math.PR)
paper · doi:10.48550/arxiv.1807.11833
The Laplacian of a (weighted) Cayley graph on the Weyl group W(Bn) is a N× N matrix with N = 2n n! 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 2n × 2n matrix associated to a 2n-dimensional permutation representation of Wn. This result can be viewed as an extension to W(Bn) of an analogous result valid for the symmetric group, known as `Aldous' spectral gap conjecture', proven in 2010 by Caputo, Liggett and Richthammer.