Heaps reduction, decorated diagrams, and the affine Temperley-Lieb algebra of type CC

preprint2022arXivOpen access

Abstract

In this paper we propose a combinatorial framework to study a diagrammatic representation of the affine Temperley-Lieb algebra of type C introduced by Ernst. In doing this, we define two procedures, a decoration algorithm on diagrams and a reduction algorithm on heaps of independent interest. Using this approach, an explicit algorithmic description of Ernst representation map is provided from which its faithfulness can be deduced. We also give a construction of the inverse map.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.