Kazhdan–Lusztig Basis in Hecke Algebras

• Kazhdan–Lusztig basis is a distinguished set of elements in Hecke algebras defined via bar involution invariance and triangular expansions with positive combinatorial interpretations.
• The combinatorial mask model encodes defect statistics through binary sequences attached to fixed reduced words, linking subexpression selection to geometric resolutions.
• LS tree constructions and geometric approaches, such as Bott–Samelson and Zelevinsky resolutions, translate mask sets into explicit expansions in the Bruhat order.

The Kazhdan–Lusztig basis is a distinguished basis in the (Iwahori-)Hecke algebra associated to a Coxeter group, introduced in the context of representation theory, geometry of Schubert varieties, and algebraic combinatorics. For cograssmannian permutations—permutations with at most one right ascent—the combinatorics and geometry underlying this basis become particularly rich. Notably, positive combinatorial formulas exist for evaluating the Kazhdan–Lusztig polynomials and basis elements in terms of "masks": binary sequences attached to a fixed reduced word that encode subexpressions and "defect" statistics. There are deep connections between this combinatorial model and geometric constructions such as the Bott–Samelson resolution of Schubert varieties, culminating in parallel mask–set models with combinatorially and geometrically meaningful interpretations (Jones et al., 2010).

1. Definition and Structural Origins

The Kazhdan–Lusztig basis $\{C_w\}$ of the Hecke algebra over a Coxeter group $(W, S)$ is characterized by two properties:

• Bar involution invariance $\overline{C_w} = C_w$, where the bar involution is the ring and Hecke algebra automorphism $q \mapsto q^{-1}$ and $T_w \mapsto T_{w^{-1}}^{-1}$.
• A triangular expansion in terms of the standard basis: $C_w = T_w + \sum_{y<w} p_{y,w}(q) T_y$, where $p_{y,w}$ are the Kazhdan–Lusztig polynomials supported at $q$-degrees $>0$ and the sum is over $y$ less than $(W, S)$0 in the (strong) Bruhat order.

For cograssmannian permutations (those with at most one right ascent), these basis elements admit explicit combinatorial models interpretable both in terms of subword masks and as indexing geometric structures in certain resolutions of Schubert varieties.

2. Deodhar’s Mask Model and Defect Statistic

Deodhar introduced an approach to Kazhdan–Lusztig polynomials and basis elements using the notion of "masks" on a fixed reduced expression $(W, S)$1:

• A mask is a binary string $(W, S)$2, determining which generators in the reduced word are "active".
• Each mask gives rise to a subexpression $(W, S)$3, and carries a defect statistic $(W, S)$4 (interpreted variously as the number of additive "defects" or "+" symbols in certain encodings).
• The Kazhdan–Lusztig basis element can be written as

$(W, S)$5

where $(W, S)$6 is an admissible set of masks, determined by boundedness conditions inherent to the definition.

This mask model provides a positive combinatorial formula for the Kazhdan–Lusztig basis elements, in contrast to the original recursive approach.

3. Lascoux–Schützenberger Tree Construction

The Lascoux–Schützenberger (LS) formula gives a combinatorial model, especially effective for cograssmannian permutations, utilizing edge-labeled rooted trees derived from the heap or string diagram of a reduced word:

• The heap for $(W, S)$7 is decomposed into "segments" and "regions," with the "ridgeline" encoding a sequence of matched parentheses.
• Parentheses correspond to the formation of an explicit rooted tree $(W, S)$8; each leaf (valley) receives a capacity determined by the heap of a grassmannian prefix $(W, S)$9 in the expression $\overline{C_w} = C_w$0.
• Edge labelings of $\overline{C_w} = C_w$1 correspond to families of masks (constant on non-valley regions) with specific defect positions.
• Each tree $\overline{C_w} = C_w$2 yields a lower Bruhat ideal, and the set of masks $\overline{C_w} = C_w$3 assembled over all $\overline{C_w} = C_w$4 encodes the full Kazhdan–Lusztig basis element as a sum over masks with explicitly calculable defects.

The algorithm translates the problem of finding admissible sets of masks to the purely combinatorial matching and labeling of trees, reflecting principal lower order ideals in the Bruhat order.

4. Bott–Samelson and Zelevinsky Geometric Constructions

The geometric perspective interprets masks as indexing the $\overline{C_w} = C_w$5-fixed points in the Bott–Samelson resolution $\overline{C_w} = C_w$6 of the Schubert variety:

• A point in $\overline{C_w} = C_w$7 is given by a tuple $\overline{C_w} = C_w$8 of vector subspaces subject to specific incidence relations reflecting the heap structure.
• The Bialynicki–Birula decomposition yields cells $\overline{C_w} = C_w$9 indexed by masks, whose dimension is $q \mapsto q^{-1}$0.
• In this setting,

$q \mapsto q^{-1}$1

links the combinatorics of masks directly to the geometry of the resolution via cell dimensions.

• Zelevinsky's resolution, which is particularly fine in the cograssmannian case, provides further subdivisions corresponding to chains of partitions inside rectangles ("peaks" of the heap), and the mask model lifts accordingly.

The geometric model reveals that the defect statistic of a mask coincides with the dimension of the associated cell, intertwining combinatorics and geometry.

5. Principal Lower Order Ideals and Combinatorial Translations

Principal lower order ideals in the Bruhat order serve as a bridge between mask-based formulas and the ideal basis of the Hecke algebra:

• The ideal basis is $q \mapsto q^{-1}$2.
• For cograssmannian $q \mapsto q^{-1}$3, the Kazhdan–Lusztig basis element $q \mapsto q^{-1}$4 expands as

$q \mapsto q^{-1}$5

with each $q \mapsto q^{-1}$6 corresponding to an edge-labeled tree, $q \mapsto q^{-1}$7 the sum of its labels, and $q \mapsto q^{-1}$8 the associated permutation from the mask.

• The translation of trees to mask sets thereby realizes combinatorially positive expressions for the coefficients in the ideal basis expansion, giving a positive, nonrecursive rule for $q \mapsto q^{-1}$9 in terms of the principal ideals.

This viewpoint underlines the central role played by the Bruhat order and its ideals in structuring both mask combinatorics and the algebraic description of the Kazhdan–Lusztig basis.

6. Non-Uniqueness and Admissibility of Mask Sets

A key outcome is that multiple (distinct) admissible sets of masks produce valid, positive formulas for $T_w \mapsto T_{w^{-1}}^{-1}$0:

• Both the combinatorial (LS) and geometric (Bott–Samelson/Zelevinsky) constructions yield bounded admissible collections of masks whose defect enumerations recover the correct Kazhdan–Lusztig polynomial or basis element.
• These sets are not unique, indicating intrinsic flexibility in Deodhar's framework. This non-uniqueness reflects the existence of multiple natural "expansions" for $T_w \mapsto T_{w^{-1}}^{-1}$1, depending on further combinatorial or geometric choices.
• The question of selecting a canonical mask set remains open and could motivate further axiomatization.

This multiplicity demonstrates the richness of the combinatorics behind the Kazhdan–Lusztig basis for cograssmannian permutations.

7. Connections, Applications, and Theoretical Implications

The interplay between the combinatorial and geometric models for the Kazhdan–Lusztig basis has broad implications:

• The mask set constructions facilitate positive, explicit formulas and computational methods for evaluating Kazhdan–Lusztig polynomials in special cases.
• The geometric correspondence between mask defect statistics and cell dimensions clarifies deeper phenomena in the geometry of Schubert varieties, such as the structure of their resolutions.
• Expansions in the Bruhat lower ideal basis illuminate the underlying order-theoretic features of the Hecke algebra, and the mask description provides a concrete combinatorial realization for basis elements.
• These techniques address questions first raised by Deodhar concerning the existence of explicit positive combinatorial models for the Kazhdan–Lusztig basis, and the resulting methods point toward the potential for new canonical constructions and algorithms.

This comprehensive synthesis exemplifies how combinatorics (heaps, trees, masks), algebra (Hecke algebra, Bruhat order), and geometry (resolutions, cell decompositions) are intertwined in the theory of the Kazhdan–Lusztig basis for cograssmannian permutations (Jones et al., 2010).