Work

Diameter of graphs of reduced words and galleries

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.
Language: English
Open Access status: hybrid
OpenAlex ID: W2029428693
FWCI: 3.214
Cites: 39
Cited by: 35
Related to: 9