Diameter of reduced words
Victor Reiner and Yuval Roichman
Arxiv ID: 0906.4768•Last updated: 6/3/2020
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.
PaperStudio AI Chat
I'm your research assistant! Ask me anything about this paper.