Generalized Temperley–Lieb Trick

• Generalized Temperley–Lieb trick is a framework that extends recursive polynomial methods from Hecke algebras to quotients defined by fully commutative elements in Coxeter groups.
• It provides explicit constructions of t–basis algebras and introduces polynomial families (R, a, D, and L) with well-defined recurrence relations and closed-form expressions.
• The approach reveals pattern-avoidance, positivity, and combinatorial properties, underpinning advanced applications in representation theory and algebraic combinatorics.

The generalized Temperley–Lieb trick constitutes a comprehensive framework for transferring foundational polynomial constructs and recursive techniques of Kazhdan–Lusztig and R-polynomials from Hecke algebras to generalized Temperley–Lieb algebras of Coxeter groups. This paradigm enables the explicit construction, manipulation, and combinatorial analysis of polynomial families central to the representation theory of Coxeter groups and their related algebras, with particular emphasis on fully commutative elements and non-branching Coxeter graphs (Pesiri, 2014).

1. Construction of Generalized Temperley–Lieb Algebras

Given a fixed Coxeter system $(W,S)$ with associated length function $\ell$ and Bruhat order $\leq$, the Hecke algebra $\mathsf{H}(W)$ over $\mathbb{A} = \mathbb{Z}[q,q^{-1}]$ is equipped with generators $\{T_w : w \in W\}$ and an involution $\iota$ defined by $\iota(q) = q^{-1}$, $\iota(T_w) = (T_{w^{-1}})^{-1}$. The generalized Temperley–Lieb algebra $\mathrm{TL}(W)$ is constructed as the quotient of $\ell$0 by the two-sided ideal $\ell$1 generated by all $\ell$2, where $\ell$3 belongs to any rank–2 parabolic subgroup $\ell$4 having $\ell$5 and $\ell$6:

$\ell$7

Fully commutative elements, whose reduced expressions differ only by commutation, form the subset $\ell$8. Graham's theorem establishes $\ell$9 as an $\leq$0–basis for $\leq$1, termed the t–basis. For non-branching Coxeter graphs (excluding type $\leq$2), the projection property asserts that the quotient homomorphism $\leq$3 satisfies $\leq$4 for $\leq$5 and $\leq$6 for $\leq$7, where $\leq$8 is the Kazhdan–Lusztig basis and $\leq$9 is the analogous IC–basis for $\mathsf{H}(W)$0.

2. Polynomial Families: R, D, a, and L

Two polynomial families fulfill analogous roles in $\mathsf{H}(W)$1 to the R- and Kazhdan–Lusztig polynomials in $\mathsf{H}(W)$2:

• R–polynomials ($\mathsf{H}(W)$3) in $\mathsf{H}(W)$4: Defined by the inversion formula

$\mathsf{H}(W)$5

with $\mathsf{H}(W)$6, $\mathsf{H}(W)$7, $\mathsf{H}(W)$8 for $\mathsf{H}(W)$9.

• a–polynomials ($\mathbb{A} = \mathbb{Z}[q,q^{-1}]$0) in $\mathbb{A} = \mathbb{Z}[q,q^{-1}]$1: Provide an analogous expansion

$\mathbb{A} = \mathbb{Z}[q,q^{-1}]$2

where $\mathbb{A} = \mathbb{Z}[q,q^{-1}]$3.

• D–polynomials ($\mathbb{A} = \mathbb{Z}[q,q^{-1}]$4): Serve as change–of–basis coefficients from arbitrary $\mathbb{A} = \mathbb{Z}[q,q^{-1}]$5 to fully commutative $\mathbb{A} = \mathbb{Z}[q,q^{-1}]$6

$\mathbb{A} = \mathbb{Z}[q,q^{-1}]$7

with $\mathbb{A} = \mathbb{Z}[q,q^{-1}]$8.

• L–polynomials ($\mathbb{A} = \mathbb{Z}[q,q^{-1}]$9): When $\{T_w : w \in W\}$0 admits an IC–basis, one writes

$\{T_w : w \in W\}$1

Equivalently, with $\{T_w : w \in W\}$2,

$\{T_w : w \in W\}$3

with $\{T_w : w \in W\}$4 and $\{T_w : w \in W\}$5 unless $\{T_w : w \in W\}$6.

3. Recursion Relations

The families admit recursive formulations that extend classical relations:

• R–Polynomial Recursion (in $\{T_w : w \in W\}$7): For $\{T_w : w \in W\}$8, $\{T_w : w \in W\}$9,

$\iota$0

• D–Polynomial Recursion (Theorem 2.1): For $\iota$1, $\iota$2 with $\iota$3, $\iota$4, and $\iota$5,

$\iota$6

• a–Polynomial Recursion (Proposition 2.5): Under identical conditions,

$\iota$7

Notably, if $\iota$8, $\iota$9 (Corollary 2.6).

• L–Polynomial Recursion:
  • “Mixed–inversion” closed-form (Theorem 3.5) for non-branching graphs:

  $\iota(q) = q^{-1}$0

  where $\iota(q) = q^{-1}$1 denotes the usual Kazhdan–Lusztig polynomial. - “Simple vanishing” and descent rules (Lemmas 3.6, Theorem 3.7): - If $\iota(q) = q^{-1}$2, $\iota(q) = q^{-1}$3, - $\iota(q) = q^{-1}$4, - $\iota(q) = q^{-1}$5, with $\iota(q) = q^{-1}$6 if $\iota(q) = q^{-1}$7 and $\iota(q) = q^{-1}$8 otherwise.

4. Closed–form Expressions

• Type $\iota(q) = q^{-1}$9 closed-form for a–polynomials (Proposition 2.8): For

$\iota(T_w) = (T_{w^{-1}})^{-1}$0

$\iota(T_w) = (T_{w^{-1}})^{-1}$1

• The mixed-inversion formula for $\iota(T_w) = (T_{w^{-1}})^{-1}$2 provides a closed-form in terms of $\iota(T_w) = (T_{w^{-1}})^{-1}$3-, $\iota(T_w) = (T_{w^{-1}})^{-1}$4-, and Kazhdan–Lusztig polynomials.

5. Combinatorial and Structural Properties

All $\iota(T_w) = (T_{w^{-1}})^{-1}$5, $\iota(T_w) = (T_{w^{-1}})^{-1}$6, and $\iota(T_w) = (T_{w^{-1}})^{-1}$7 lie in $\iota(T_w) = (T_{w^{-1}})^{-1}$8 or $\iota(T_w) = (T_{w^{-1}})^{-1}$9. For non-branching Coxeter graphs, positivity results for $\mathrm{TL}(W)$0-coefficients parallel those in classical Kazhdan–Lusztig theory. For type $\mathrm{TL}(W)$1, the cardinality $\mathrm{TL}(W)$2 equals the $\mathrm{TL}(W)$3-th Catalan number, and numerous pattern-avoidance characterizations for $\mathrm{TL}(W)$4 are documented.

The leading coefficient $\mathrm{TL}(W)$5 of $\mathrm{TL}(W)$6 coincides with the leading coefficient $\mathrm{TL}(W)$7 of $\mathrm{TL}(W)$8, implying that “head” and “tail” phenomena of Kazhdan–Lusztig polynomials extend to their generalized counterparts.

An orthogonality-type identity (Proposition 3.8) holds for the sum

$\mathrm{TL}(W)$9

yielding $\ell$00, analogous to the relation $\ell$01 for $\ell$02 in $\ell$03.

6. Canonical Example: Coxeter Graph $\ell$04

In the Coxeter system $\ell$05 with generators $\ell$06, $\ell$07, fully commutative elements are $\ell$08; thus $\ell$09 has t–basis $\ell$10.

• R–polynomials: $\ell$11, $\ell$12, $\ell$13, $\ell$14.
• a–polynomials: $\ell$15, $\ell$16, $\ell$17, $\ell$18.
• L–polynomials: $\ell$19, $\ell$20; for $\ell$21, $\ell$22, $\ell$23, following $\ell$24.
• t–basis multiplication: $\ell$25, $\ell$26, $\ell$27.

This explicit computation verifies recurrence relations, recovers classical Temperley–Lieb dimensions, and demonstrates appropriate t–basis multiplications.

7. Significance and Implications

The generalized Temperley–Lieb trick affords a parallelism between classical and generalized polynomial structures, enabling the transfer of recursive, combinatorial, and closed-form techniques from the Hecke algebra setting to a larger class of quotients influenced by Coxeter combinatorics. This framework underpins extensions of positivity, orthogonality, and pattern-avoidance phenomena, and enables explicit calculations in both classical and generalized contexts. A plausible implication is the broad applicability of these recursions and combinatorial insights beyond type $\ell$28, subject to Coxeter graph conditions such as non-branchingness, thus illuminating new avenues in algebraic combinatorics and representation theory (Pesiri, 2014).