Acyclic heaps of pieces, I
Combinatorics
2007-05-23 v1 Rings and Algebras
Abstract
Heaps of pieces were introduced by Viennot and have applications to algebraic combinatorics, theoretical computer science and statistical physics. In this paper, we how certain combinatorial properties of heaps studied by Fan and by Stembridge are closely related to the properties of a certain linear map associated to a heap . We examine the relationship between and when is a subheap of . This approach allows neat statements and proofs of results on certain associative algebras (generalized Temperley--Lieb algebras) that are otherwise tricky to prove. The key to the proof is to interpret the structure constants of the aforementioned algebras in terms of the maps .
Cite
@article{arxiv.math/0304483,
title = {Acyclic heaps of pieces, I},
author = {R. M. Green},
journal= {arXiv preprint arXiv:math/0304483},
year = {2007}
}
Comments
32 pages, AMSTeX, 2 figures