Catalan numbers: from FC elements to classical diagram algebras
Sadek Al Harbat

TL;DR
This paper explores the combinatorial structure of fully commutative elements in Coxeter groups of type A, connecting them to Catalan and Narayana numbers, and establishing a bijection with non-crossing diagrams in Temperley-Lieb algebras.
Contribution
It introduces a new bijection between fully commutative elements and non-crossing diagrams, with algorithms for conversion, linking algebraic and combinatorial structures.
Findings
Recovers Catalan numbers from the enumeration of fully commutative elements.
Identifies Narayana numbers and Catalan triangle through set partitions.
Establishes a bijection respecting diagrammatic multiplication in Temperley-Lieb algebra.
Abstract
Let be the set of fully commutative elements in the -type Coxeter group. Using only the settings of their canonical form, we recount by the recurrence that is taken as a definition of the Catalan number and we find the Narayana numbers as well as the Catalan triangle via suitable set partitions of . We determine the unique bijection between and the set of non-crossing diagrams of strings that respects the diagrammatic multiplication by concatenation in the -type Temperley-Lieb algebra, along with the two algorithms implementing this bijection and its inverse.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Algebraic structures and combinatorial models · Coding theory and cryptography
