2009/06/25 by Victor Reiner, Reiner, Victor, Yuval Roichman +1
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Algebraic structures and combinatorial models #math.CO #math.GT #msc:20F05 #msc:20F55 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.0906.4768
Version 4 points out a gap in the proof of Theorem 4.9, filled in work of T. McConville (arXiv:1411.1305)
arxiv created 2020/06/01 · arxiv updated 2020/06/03
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.