Freely braided elements in Coxeter groups.

DOI10.1007/s000260200008zbMath1052.20028arXivmath/0301104OpenAlexW2507601813MaRDI 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 systemssimply laced Coxeter groupsbraid relationscommutation graphscommutation classesroot sequences

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Free semigroups, generators and relations, word problems (20M05) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (12)

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

This page was built for publication: Freely braided elements in Coxeter groups.