arXiv:0906.4768 Abstract | arXiv Analytics

arXiv:0906.4768 [math.CO]Abstract References Reviews Resources

Diameter of reduced words

Published 2009-06-25, updated 2020-06-01Version 4

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.

Comments: Version 4 points out a gap in the proof of Theorem 4.9, filled in work of T. McConville (arXiv:1411.1305)

Categories: math.CO, math.GT

Subjects: 20F55, 20F05

Keywords: reduced words, finite reflection groups, longest element, supersolvable hyperplane arrangements, general theorem

Related articles: Most relevant | Search more

arXiv:1112.3255 [math.CO] (Published 2011-12-14)

Permutahedra and Associahedra: Generalized associahedra from the geometry of finite reflection groups

Christophe Hohlweg

arXiv:2408.09009 [math.CO] (Published 2024-08-16)

Reduced words for reflections in Weyl groups

Elizabeth Milićević

arXiv:2404.06379 [math.CO] (Published 2024-04-09)