The reduced expressions in a Coxeter system with a strictly complete Coxeter graph
From MaRDI portal
(Redirected from Publication:488971)
Recommendations
- Reduced expressions in a Coxeter system with a complete Coxeter graph
- Some combinatorial aspects of reduced words in finite Coxeter groups
- How many elements of a Coxeter group have a unique reduced expression?
- Reduced expressions for the elements in a Bruhat interval
- Proof of a conjecture of Bergeron, Ceballos and Labbé
Cites work
- scientific article; zbMATH DE number 53657 (Why is no real title available?)
- scientific article; zbMATH DE number 3327350 (Why is no real title available?)
- A combinatorial bijection between standard Young tableaux and reduced words of Grassmannian permutations
- Lusztig's \(a\)-function for Coxeter groups with complete graphs.
- On the number of reduced decompositions of elements of Coxeter groups
- Reduced words in affine Coxeter groups
- Schubert functions and the number of reduced words of permutations
Cited in
(7)- Reduced expressions for the elements in a Bruhat interval
- Conjectures P1--P15 for Coxeter groups with complete graph
- Automata, reduced words and Garside shadows in Coxeter groups.
- Reduced expressions in a Coxeter system with a complete Coxeter graph
- The boundedness of the weighted Coxeter group with complete graph
- How many elements of a Coxeter group have a unique reduced expression?
- The lowest two-sided cell of a Coxeter group with complete graph
This page was built for publication: The reduced expressions in a Coxeter system with a strictly complete Coxeter graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q488971)