On rank functions for heaps

Simple item page
dc.creatorGreen, R. M.
dc.date2003-02-27
dc.date.accessioned2026-07-07T04:55:38Z
dc.date.available2026-07-07T04:55:38Z
dc.descriptionMotivated 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.
dc.description18 pages AMSTeX, 3 figures
dc.identifierhttps://arxiv.org/abs/math/0302347
dc.identifierhttp://arxiv.org/abs/math/0302347
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/66650
dc.subjectCombinatorics
dc.subject06A07
dc.titleOn rank functions for heaps
dc.typetext

Files

Collections

arXiv