Acyclic heaps of pieces, I
R. M. Green
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 ∂.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.