On rank functions for heaps
arXiv:math/0302347
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.
18 pages AMSTeX, 3 figures