On inversion triples and braid moves

DOI10.1007/S00026-020-00501-8zbMATH Open1451.05249OpenAlexW3040143430MaRDI QIDQ2210583FDOQ2210583

Authors: Jozsef Losonczy 

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

Recommendations

• Freely braided elements in Coxeter groups. II.
• Freely braided elements in Coxeter groups.
• Involution words. II: Braid relations and atomic structures
• Inversion tables and minimal left coset representatives for Weyl groups of classical type
• Inversion arrangements and Bruhat intervals

zbMATH Keywords

Coxeter groupbraid movecontractible tripleinversion triplenon-gatherable tripleroot sequence

Mathematics Subject Classification ID

Reflection and Coxeter groups (group-theoretic aspects) (20F55) Combinatorial aspects of groups and algebras (05E16)

Cites Work

• Combinatorics of fully commutative involutions in classical Coxeter groups
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the fully commutative elements of Coxeter groups
• The enumeration of fully commutative affine permutations
• Fully commutative elements in finite and affine Coxeter groups
• On the cyclically fully commutative elements of Coxeter groups.
• Title not available (Why is that?)
• Reduced decompositions and permutation patterns
• Long fully commutative elements in affine Coxeter groups.
• Freely braided elements in Coxeter groups.
• Freely braided elements in Coxeter groups. II.
• Maximally clustered elements and Schubert varieties.
• Kazhdan-Lusztig polynomials for maximally-clustered hexagon-avoiding permutations.
• Title not available (Why is that?)
• 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
• Non-gatherable triples for non-affine root systems
• Affine Permutations and an Affine Catalan Monoid
• On the length of fully commutative elements
• Affine permutations and inversion multigraphs
• Length enumeration of fully commutative elements in finite and affine Coxeter groups
• Fully commutative elements and lattice walks
• Schubert varieties and free braidedness
• How many elements of a Coxeter group have a unique reduced expression?
• Non-gatherable triples for classical affine root systems
• Twelve subsets of permutations enumerated as maximally clustered permutations

Cited In (1)

• Low elements and small inversion sets are in bijection in rank 3 Coxeter graphs

This page was built for publication: On inversion triples and braid moves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2210583)