2003/02/27 by R. M. Green, Green, R. M.
Computer Science · Mathematics · #06A07 #Advanced Combinatorial Mathematics #Algebraic structures and combinatorial models #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:06A07 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.math/0302347
18 pages AMSTeX, 3 figures
arxiv created 2003/02/27 · openalex publication_date 2003/02/27 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.