On rank functions for heaps
Combinatorics
2007-05-23 v1
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
Cite
@article{arxiv.math/0302347,
title = {On rank functions for heaps},
author = {R. M. Green},
journal= {arXiv preprint arXiv:math/0302347},
year = {2007}
}
Comments
18 pages AMSTeX, 3 figures