On the spectral gap of some Cayley graphs on the Weyl group W(Bn)

Abstract

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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…