Title of article
On rank functions for heaps
Author/Authors
Green، نويسنده , , R.M.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
14
From page
411
To page
424
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
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2003
Journal title
Journal of Combinatorial Theory Series A
Record number
1530801
Link To Document