On inversion triples and braid moves
From MaRDI portal
Publication:2210583
DOI10.1007/s00026-020-00501-8zbMath1451.05249MaRDI QIDQ2210583
Publication date: 7 November 2020
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-020-00501-8
Coxeter group; braid move; contractible triple; inversion triple; non-gatherable triple; root sequence
20F55: Reflection and Coxeter groups (group-theoretic aspects)
05E16: Combinatorial aspects of groups and algebras
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the cyclically fully commutative elements of Coxeter groups.
- Fully commutative elements in finite and affine Coxeter groups
- The enumeration of maximally clustered permutations
- On the maximally clustered elements of Coxeter groups.
- Characterization of cyclically fully commutative elements in finite and affine Coxeter groups
- The enumeration of fully commutative affine permutations
- Non-gatherable triples for non-affine root systems
- Affine permutations and inversion multigraphs
- Freely braided elements in Coxeter groups.
- Schubert varieties and free braidedness
- Length enumeration of fully commutative elements in finite and affine Coxeter groups
- On the fully commutative elements of Coxeter groups
- Freely braided elements in Coxeter groups. II.
- Maximally clustered elements and Schubert varieties.
- How many elements of a Coxeter group have a unique reduced expression?
- Non-gatherable triples for classical affine root systems
- Reduced decompositions and permutation patterns
- Combinatorics of fully commutative involutions in classical Coxeter groups
- Kazhdan-Lusztig polynomials for maximally-clustered hexagon-avoiding permutations.
- Long fully commutative elements in affine Coxeter groups
- Five subsets of permutations enumerated as weak sorting permutations
- On the length of fully commutative elements
- Affine Permutations and an Affine Catalan Monoid
