Freely braided elements in Coxeter groups.

DOI10.1007/s000260200008zbMath1052.20028arXivmath/0301104MaRDI QIDQ1400787

Losonczy, Jozsef, Richard M. Green

Publication date: 14 August 2003

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0301104

zbMATH Keywords

root systems; simply laced Coxeter groups; braid relations; commutation graphs; commutation classes; root sequences

Mathematics Subject Classification ID

20F05: Generators, relations, and presentations of groups

20M05: Free semigroups, generators and relations, word problems

20F55: Reflection and Coxeter groups (group-theoretic aspects)

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

Related Items

Enumeration Schemes for Restricted Permutations, Bruhat inversions in Weyl groups and torsion-free classes over preprojective algebras, The enumeration of maximally clustered permutations, On the maximally clustered elements of Coxeter groups., The enumeration of permutations whose posets have a maximum element, The enumeration of fully commutative affine permutations, Enumerations relating braid and commutation classes, Freely braided elements in Coxeter groups. II., On inversion triples and braid moves, A refinement of weak order intervals into distributive lattices, Reduced decompositions and permutation patterns, Kazhdan-Lusztig polynomials for maximally-clustered hexagon-avoiding permutations.