Year: 2012
Type: article
Abstract: For finite reflection groups of types $A$ and $B$, we determine the diameter of the graph whose vertices are reduced words for the longest element and whose edges are braid relations. This is deduced from a more general theorem that applies to supersolvable hyperplane arrangements.
Authors: Victor Reiner, Yuval Roichman
Institutions: University of Minnesota, Bar-Ilan University
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W2029428693
