On rank functions for heaps

DOI10.1016/S0097-3165(03)00055-4zbMath1027.06004arXivmath/0302347MaRDI QIDQ1395827

Richard M. Green

Publication date: 1 July 2003

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0302347

zbMATH Keywords

Coxeter groupsconcurrencylabeled posetsranked posetsheaps of pieceslabeled heaps

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (6)

Kazhdan-Lusztig polynomials for maximally-clustered hexagon-avoiding permutations. ⋮ Mask formulas for cograssmannian Kazhdan-Lusztig polynomials. ⋮ The enumeration of maximally clustered permutations ⋮ Classification of Coxeter groups with finitely many elements of \(\mathfrak{a}\)-value 2 ⋮ The nil Temperley-Lieb algebra of type affine \(C\) ⋮ Leading coefficients of Kazhdan-Lusztig polynomials for Deodhar elements.

Cites Work

• Minuscule elements of Weyl groups, the numbers game, and \(d\)-complete posets
• On the fully commutative elements of Coxeter groups
• Minuscule elements of Weyl groups
• Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations
• Unnamed Item
• Unnamed Item

This page was built for publication: On rank functions for heaps