The rook monoid is lexicographically shellable
From MaRDI portal
Publication:2323101
DOI10.1016/j.ejc.2019.05.009OpenAlexW1560742821WikidataQ127621256 ScholiaQ127621256MaRDI QIDQ2323101
Publication date: 30 August 2019
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1001.5104
Related Items (5)
Stirling posets ⋮ On the Borel submonoid of a symplectic monoid ⋮ The Bruhat-Chevalley-Renner order on the set partitions ⋮ Incidence monoids: automorphisms and complexity ⋮ Lexicographic shellability of the Bruhat-Chevalley order on fixed-point-free involutions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A short derivation of the Möbius function for the Bruhat order.
- An explicit derivation of the Möbius function for Bruhat order
- Analogue of the Bruhat decomposition for algebraic monoids
- Bruhat order of Coxeter groups and shellability
- Classical Bruhat orders and lexicographic shellability
- Analogue of the Bruhat-Chevalley order for reductive monoids
- Linear algebraic monoids.
- Shellings of spheres and polytopes
- Shellability in reductive monoids
- R-POLYNOMIALS OF FINITE MONOIDS OF LIE TYPE
- Shellable and Cohen-Macaulay Partially Ordered Sets
- The Bruhat Order of the Symmetric Group is Lexicographically Shellable
- Bruhat-Chevalley order on the rook monoid
- Möbius inversion for the Bruhat ordering on a Weyl group
This page was built for publication: The rook monoid is lexicographically shellable
