Generalized Kazhdan–Lusztig Polynomials

• Generalized Kazhdan–Lusztig polynomials are extensions of classical KL theory that encode intersection cohomology and capture complex combinatorial, algebraic, and geometric invariants.
• They are constructed via recursive frameworks in settings such as posets, matroid lattices, Hecke algebras, and Lie superalgebras, with applications to parabolic and Temperley–Lieb structures.
• Their algorithmic computation, characterized by symmetry, palindromicity, and degree bounds, provides practical insights into representation theory and combinatorial geometry.

A generalized Kazhdan–Lusztig polynomial is any extension of the classical Kazhdan–Lusztig polynomial formalism beyond its prototypical setting of (W,S) Coxeter group intervals, typically by broadening the combinatorial, algebraic, or geometric framework to which the construction applies. Generalized KL polynomials appear in Coxeter–Hecke settings, matroid theory, incidence algebras of posets, Lie superalgebras, generalized Temperley–Lieb quotients, and orbit-geometry in symmetric spaces. Foundational motivations include decoding intersection cohomology, capturing deep combinatorics of reflection groups, and quantifying the structure of categories of singular (possibly super) representations.

1. Generalized Kazhdan–Lusztig Frameworks

The classical Kazhdan–Lusztig polynomial $P_{x,y}(q)$ is defined for $x \leq y$ in a Coxeter group $(W,S)$, encoding intersection cohomology Poincaré polynomials of corresponding Schubert varieties. Generalizations admit several distinct but interlinked formal approaches:

• Kazhdan–Lusztig–Stanley (KLS) Polynomials: For any locally finite poset $(P,\leq,r)$, Stanley–Brenti–Dyer showed that a suitable $P$-kernel in the incidence algebra $I(P)$ defines unique right and left KLS functions, $f_{xy}(t)$, $g_{xy}(t)$, generalizing the Coxeter/KL and Stanley's $g$-polynomials. This framework reproduces classical KL polynomials, matroid KL polynomials, and polytope $g$-polynomials as specializations (Proudfoot, 2017).
• Matroid Kazhdan–Lusztig Polynomials: Kazhdan–Lusztig analogues $P_M(t)$ for a matroid $M$, defined by axioms—initial value for rank zero, degree bound, and palindromicity of an associated $Z_M(t)$ polynomial—mirror Hecke-theoretic recursion and cohomological invariants of matroid reciprocal planes (Braden et al., 2019, Ferroni et al., 2023).
• Parabolic and Quasi-Parabolic KL Polynomials: For $(W,S)$ and $J \subset S$, parabolic or quasi-parabolic KL polynomials $P^J_{u,v}(q)$ are defined via change of basis in induced Hecke modules, or via canonical bases in the setting of reflection subgroups, including both parabolic and non-parabolic types (Lübeck, 2016, Shen et al., 2021).
• Generalized KL Polynomials in Lie Superalgebras: For $\mathfrak{gl}(m|n)$, generalized KL polynomials $K_{\lambda,\mu}(q)$ are indexed by weights, determined via Brundan's diagrammatic and combinatorial recipe involving cup diagrams and “atypicality," and admit a SageMath implementation for explicit computation (Pal, 15 Dec 2025).
• Analogues in Generalized Temperley–Lieb Algebras: In non-branching Coxeter graphs, the Temperley–Lieb quotient admits KL-type polynomials $L_{x,w}(q^{-2})$ satisfying explicit recurrences, with close ties to the classical theory for fully commutative elements (Pesiri, 2014).

2. Key Definitions and Algebraic Principles

2.1 Incidence-Algebra and $P$-Kernel Mechanism

Let $(P,\leq)$ be a poset with weak rank function $r$, incidence algebra $I(P)$, and convolution product. A $P$-kernel $\kappa \in I(P)$ satisfies:

$$\kappa_{xx}(t)=1,~\kappa^{-1} = \bar{\kappa},~\bar{f}_{xy}(t):= t^{r_{xy}} f_{xy}(t^{-1})$$

Kazhdan–Lusztig–Stanley polynomials (right: $f_{xy}(t)$, left: $g_{xy}(t)$) solve the recursive system:

$$\bar{f} = \kappa \cdot f,\quad \deg f_{xy},g_{xy} < r_{xy}/2~(x < y),\quad f_{xx}=1$$

Their existence is guaranteed for any $P$-kernel, and explicit recursions (including Coxeter Hecke-type, Eulerian posets, and matroid lattices) are recovered as special cases (Proudfoot, 2017).

2.2 Matroid KL Polynomials via Recursion

For a matroid $M$ of rank $r$, the polynomials $P_M(t)$ are uniquely specified by:

• $P_M(t)=1$ if $r=0$
• $\deg P_M(t) < r/2$ for $r>0$
• $Z_M(t) = \sum_{F \in L(M)} t^{r(F)} P_{M_F}(t)$ is palindromic ($Z_M(t) = t^r Z_M(t^{-1})$)

A fundamental deletion–contraction recursion involves the set $S$ of critical flats and computes $P_M(t)$ in terms of $P_{M\setminus e}(t)$, $P_{M/e}(t)$, and contributions from matroids localized at $F$ (Braden et al., 2019).

2.3 Parabolic and Quasi-Parabolic Variants

Let $J$ be a reflection subgroup of a Coxeter group $W$. The quasi-parabolic KL polynomials $P^J_{y,w}(q)$ arise as coefficients in the expansion of the canonical basis of the quasi-permutation or induced modules for the Hecke algebra, dictated by the bar-involution and combinatorics of minimal coset representatives $X_J$ (Shen et al., 2021).

2.4 Superalgebra Case

For $\mathfrak{gl}(m|n)$, the polynomials $K_{\lambda, \mu}(q)$ are defined by explicit combinatorial algorithms, using cup diagrams, “atypical tuples,” and “height vectors.” These polynomials control composition multiplicities of Kac modules in irreducible modules in the Grothendieck group (Pal, 15 Dec 2025).

3. Fundamental Properties and Examples

Symmetry and Palindromicity:

• KL-type polynomials are typically symmetric or palindromic, reflecting duality or Poincaré duality of intersection cohomology.

Degree Bounds:

• Each generalization imposes degree bounds, with $\deg f_{xy}(t) < r_{xy}/2$ or analogues.

Normalization:

• $f_{xx}(t)=1$; typically, $f_{xy}(t)$ vanishes unless $x \leq y$ or a related order holds.

Nonnegativity:

• For realizable geometric cases, all coefficients are nonnegative, explained by hard Lefschetz–type theorems for intersection cohomology (e.g., matroids, Coxeter cases) (Proudfoot, 2017).

Closed-Form Cases:

• The coefficients of matroid KL polynomials for braid matroids coincide with counts of simple series–parallel matroids, and highest coefficients give counts of labeled triangular cacti, settling conjectures of Elias–Proudfoot–Wakefield (Ferroni et al., 2023).
• In the superalgebra case, closed forms exist for typical weights and maximal atypical blocks (Pal, 15 Dec 2025).
• In generalized Temperley–Lieb cases, explicit recurrences and closed formulas are derived for polynomials $L_{x,w}(q^{-2})$ (Pesiri, 2014).

4. Computations, Algorithms, and Combinatorial Models

Algorithmic Approaches:

• For Coxeter and parabolic settings, involutive Gram–Schmidt or recurrence methods efficiently compute polynomials by traversing Bruhat intervals or using Bruhat maps (Lübeck, 2016, Gurevich et al., 2023).
• In matroid theory, recursions follow deletion–contraction and can be implemented combinatorially (see graphic matroids, parallel connections, and series–parallel constructions) (Braden et al., 2019).

Combinatorial Models:

• In type $A$ and superalgebra cases, cup diagrams and “dot-action" permutations encode control of the support and transitions of representations (Pal, 15 Dec 2025).
• The Bruhat graph provides the structure for peak algebra formulas and path-counting models that explicitly give KL polynomials as sums over descent-string patterns and “slalom-path" polynomials, with minimality proven in the sparse-words basis (Brenti et al., 2014).
• For matroids, coefficients directly count network-type or series–parallel matroids in closed form for braid matroids (Ferroni et al., 2023), and generating-function approaches yield global enumeration.

Software:

• The liesuperalg SageMath package implements explicit computation of generalized KL polynomials and decomposition in the Grothendieck group for type $A$ Lie superalgebras (Pal, 15 Dec 2025), supporting combinatorial diagram generation and module-theoretic calculations.

5. Geometric and Representation-Theoretic Interpretations

• For Coxeter groups, KL polynomials encode intersection cohomology Poincaré polynomials of Schubert varieties; KLS formalism unifies this with intersection theory in polytopes and reciprocal planes of matroids (Proudfoot, 2017).
• For matroids, the polynomials $P_M(t)$ record intersection cohomology Betti numbers of reciprocal planes and admit point-count and decay-to-pure-weight interpretations via the Grothendieck–Lefschetz trace formula (Braden et al., 2019).
• In symmetric spaces, geometric representatives and orbit-closure polynomials generalize KL theory beyond Schubert varieties, with analogies between Hilbert–Samuel multiplicities and local KLV polynomials (Wyser et al., 2013).
• In Lie superalgebras, generalized KL polynomials govern character multiplicities, and the sign-specialization yields explicit decompositions in terms of Kac modules (Pal, 15 Dec 2025).

6. Extensions, Variants, and Open Problems

• Extensions to settings with diagrammatic algebras (Temperley–Lieb, fully commutative elements), reflection subgroups (quasi-parabolic theory), and poset-based recursion lead to rich families of generalized KL polynomials (Pesiri, 2014, Shen et al., 2021, Marietti, 2019).
• Positivity and combinatorial invariance remain open areas in the most general frameworks, particularly for new classes of posets, matroids of high branch-width, and non-parabolic reflection subgroups.
• For matroids, explicit efficient combinatorial proofs of nonnegativity (detached from geometry) are still unknown outside limited classes (Braden et al., 2019).
• The connection between series–parallel network expansion in matroid KL polynomials and classical Hecke theory in type $A$ is a subject of current investigation (Ferroni et al., 2023).

7. Connections and Relations Among Generalizations

Setting	Defining Structure	Generalized KL Polynomial
Coxeter/Hecke algebra	(W,S), Bruhat poset	$P_{x,y}(q)$
Matroids	Lattice of flats, contraction	$P_M(t)$
Parabolic/quasi-parabolic	Reflection subgroup $J \subset W$	$P^J_{u,v}(q)$
Lie superalgebras	Dominant weights, cup diagrams	$K_{\lambda,\mu}(q)$
Temperley–Lieb in non-branching	Fully commutative elements	$L_{x,w}(q^{-2})$
Incidence algebra/KLS	Poset $(P,\leq, r)$, P-kernel	$f_{xy}(t),~g_{xy}(t)$
Symmetric pairs (orbit closures)	Clans, $K$-orbit structure	$\Upsilon_\gamma(X;Y)$, $P_{\beta,\gamma}(q)$

These frameworks collectively illustrate the universality and flexibility of the Kazhdan–Lusztig paradigm, which can be adapted to quantify significant algebraic, combinatorial, and geometric invariants far beyond its original domain. The continued development of new models, their algorithmic realizations, structural theorems (e.g., minimality, positivity), and geometric links remains central to ongoing research in this area (Brenti et al., 2014, Proudfoot, 2017, Ferroni et al., 2023, Braden et al., 2019, Pal, 15 Dec 2025, Lübeck, 2016, Pesiri, 2014, Shen et al., 2021, Marietti, 2019, Wyser et al., 2013).