Diameter of reduced words
Preprint
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.Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Note on the expected number of Yang–Baxter moves applicable to reduced decompositionsEuropean Journal of Combinatorics, 2005
- A Theorem on Higher Bruhat OrdersDiscrete & Computational Geometry, 2000
- A Suspension Lemma for Bounded PosetsJournal of Combinatorial Theory, Series A, 1997
- Oriented matroids with few mutationsDiscrete & Computational Geometry, 1993
- Higher bruhat orders and cyclic hyperplane arrangementsTopology, 1993
- A homotopy theorem on oriented matroidsDiscrete Mathematics, 1993
- Hyperplane arrangements with a lattice of regionsDiscrete & Computational Geometry, 1990
- Topology of the complement of real hyperplanes in ? NInventiones Mathematicae, 1987
- Supersolvable latticesAlgebra universalis, 1972
- Les immeubles des groupes de tresses g n ralis sInventiones Mathematicae, 1972