On rank functions for heaps

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Combinatorics, 06A07

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/66650

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0302347
 http://arxiv.org/abs/math/0302347

Collections

arXiv