Acyclic heaps of pieces, I

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 ∂E associated to a heap E. We examine the relationship between ∂E and ∂F when F is a subheap of E. 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 ∂.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…