On rank functions for heaps

Autor:	R. M. Green
Rok vydání:	2003
Předmět:	Discrete mathematics Mathematics::Combinatorics Coxeter group Theoretical Computer Science Combinatorics Computational Theory and Mathematics Simple (abstract algebra) 06A07 TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Ranked posets FOS: Mathematics Mathematics - Combinatorics Computer Science::Programming Languages Discrete Mathematics and Combinatorics Rank (graph theory) Combinatorics (math.CO) Software_PROGRAMMINGLANGUAGES Heaps of pieces Mathematics::Representation Theory Ranked poset Commutative property Mathematics Heap (data structure)
Zdroj:	Journal of Combinatorial Theory, Series A. 102:411-424
ISSN:	0097-3165
DOI:	10.1016/s0097-3165(03)00055-4
Popis:	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. Comment: 18 pages AMSTeX, 3 figures
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::024686f86e6aa01e00fb9bb7f0d25e61 https://doi.org/10.1016/s0097-3165(03)00055-4 Zobrazit plný text záznamu Full Text from ScienceDirect