Special matchings and permutations in Bruhat orders.
From MaRDI portal
Publication:2643867
Recommendations
- Braids and order-preserving partial permutations.
- Enumeration of the permutations under \((1,n)\) in the Bruhat order.
- Permutation graphs and the weak Bruhat order
- Matched pairs, permutation representations, and the Bol property.
- Order-matchings in the partition lattice
- A combinatorial duality between the weak and strong Bruhat orders
- Special matchings and Coxeter groups.
- Perfect orderings on finite rank Bratteli diagrams
- A simple characterization of special matchings in lower Bruhat intervals
Cites work
- An abstract model for Bruhat intervals
- Closed product formulas for certain \(R\)-polynomials
- scientific article; zbMATH DE number 3983158 (Why is no real title available?)
- scientific article; zbMATH DE number 13050 (Why is no real title available?)
- scientific article; zbMATH DE number 47598 (Why is no real title available?)
- scientific article; zbMATH DE number 3327350 (Why is no real title available?)
- Reflection subgroups of Coxeter systems
- Representations of Coxeter groups and Hecke algebras
- Special matchings and Kazhdan-Lusztig polynomials
- The intersection cohomology of Schubert varieties is a combinatorial invariant
Cited in
(7)- An explicit derivation of the Möbius function for Bruhat order
- A simple characterization of special matchings in lower Bruhat intervals
- Special idempotents and projections
- Balanced and Bruhat graphs
- Topology of posets with special partial matchings
- Topology of posets with special partial matchings
- Special matchings in Coxeter groups
This page was built for publication: Special matchings and permutations in Bruhat orders.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643867)