• Corpus ID: 119686109

On the Structure of nil-Temperley-Lieb Algebras of type A

@article{Gowravaram2015OnTS,
  title={On the Structure of nil-Temperley-Lieb Algebras of type A},
  author={Niket Gowravaram and Tanya Khovanova},
  journal={arXiv: Combinatorics},
  year={2015}
}
We investigate nil-Temperley-Lieb algebras of type A. We give a general description of the structure of monomials formed by the generators. We also show that the dimensions of these algebras are the famous Catalan numbers by providing a bijection between the monomials and Dyck paths. We show that the distribution of these monomials by degree is the same as the distribution of Dyck paths by the sum of the heights of the peaks minus the number of peaks. 

Figures from this paper

A Variation of the nil-Temperley-Lieb algebras of type A
We investigate a variation on the nil-Temperley-Lieb algebras of type A. This variation is formed by removing one of the relations and, in some sense, can be considered as a type B of the algebras.

References

SHOWING 1-8 OF 8 REFERENCES
Combinatorial properties of the Temperley–Lieb algebra of a Coxeter group
We study two families of polynomials that play the same role in the Temperley–Lieb algebra of a Coxeter group as the Kazhdan–Lusztig and R-polynomials play in the Hecke algebra of the group. Our
On the Fully Commutative Elements of Coxeter Groups
Let W be a Coxeter group. We define an element w ∈ W to be fully commutative if any reduced expression for w can be obtained from any other by means of braid relations that only involve commuting
Noncommutative schur functions and their applications
On the Affine Temperley–Lieb Algebras
  • C. Fan, R. Green
  • Mathematics
    Journal of the London Mathematical Society
  • 1999
The paper describes the cell structure of the affine Temperley–Lieb algebra with respect to a monomial basis. A diagram calculus is constructed for this algebra.
Inversion polynomials for 321-avoiding permutations
Catalan Numbers
Sequences and arrays whose terms enumerate combinatorial structures have many applications in computer science. Knowledge (or estimation) of such integer-valued functions is, for example, needed in
Some Combinatorial Properties of Schubert Polynomials
AbstractSchubert polynomials were introduced by Bernstein et al. and Demazure, and were extensively developed by Lascoux, Schützenberger, Macdonald, and others. We give an explicit combinatorial
Temperley-Lieb Immanants
Abstract.We use the Temperley-Lieb algebra to define a family of totally nonnegative polynomials of the form $$ \Sigma _{{\upsigma \in S_{n} }} f(\upsigma )x_{{1,\upsigma (1)}} \cdots x_{{n,\upsigma