arXiv · 2508.19360
Search for a basis of the Temperley-Lieb algebra, using rewriting systems
Abstract
We begin by defining Temperley-Lieb algebra, in two different ways: as a presented algebra or as a diagrammatic algebra. Next, we look for a basis algorithmically, using rewriting theory. Finally, we introduce a generalization of the Temperley-Lieb algebra, which is an oriented version of the previous one. This pushes us to employ a more efficient tool, category theory, to use rewriting to easily obtain a basis for the algebra.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Julien Thiebaut. 2025-08-26. Search for a basis of the Temperley-Lieb algebra, using rewriting systems. https://arxiv.org/abs/2508.19360
Cite the original work for its findings. Save a collection to share your selection of sources.