On rank functions for heaps

https://doi.org/10.1016/S0097-3165(03)00055-4Get rights and content
Under an Elsevier user license
open archive

Abstract

Motivated by work of Stembridge, we study rank functions for Viennot's heaps of pieces. We produce a simple and sufficient criterion for a heap to be a ranked poset and apply the results to the heaps arising from fully commutative words in Coxeter groups.

Keywords

Heaps of pieces
Ranked posets

Cited by (0)