On the computation of Kazhdan-Lusztig polynomials and representations of Hecke algebras

DOI10.1007/BF01323981MaRDI QIDQ1924604zbMATH OpenOpenAlexFDO

Authors Jens Rosenboom

Publication date 20 October 1996

Published in Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01323981

zbMATH Keywords

algorithmcomputationsfinite Coxeter groupsKazhdan-Lusztig polynomialsleft cell representations

Mathematics Subject Classification ID

Representations of finite groups of Lie type (20C33) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Representation theory for linear algebraic groups (20G05)

Review text

We describe a new algorithm for the computation of Kazhdan-Lusztig polynomials for finite Coxeter groups which is very efficient with respect both to memory usage and speed. As an application we show how to use this algorithm to compute left cell representations. The algorithm has been implemented as a C program and in the appendix we give examples of the computations that are possible.

Recommendations

• The state of the art in the computation of Kazhdan-Lusztig polynomials
• Computing individual Kazhdan-Lusztig basis elements.
• Computing Kazhdan-Lusztig Polynomials for Arbitrary Coxeter Groups
• Computation of Kazhdan-Lusztig polynomials and some applications to finite groups
• Lattice paths, lexicographic correspondence and Kazhdan-Lusztig polynomials.

Cites work

• A Frobenius formula for the characters of the Hecke algebras
• Cells in affine Weyl groups. II
• scientific article; zbMATH DE number 529983 (Why is no real title available?)
• On Lusztig's isomorphism theorem for Hecke algebras
• On the irreducible characters of Hecke algebras
• Relations between Young's natural and the Kazhdan-Lusztig representations of \(S_ n\)
• Representations of Coxeter groups and Hecke algebras
• The socle filtration of a Verma module

Cited in

(16)

• Combinatorial properties of the Kazhdan-Lusztig \(R\)-polynomials for \(S_ n\)
• On the complexity of multiplication in the Iwahori-Hecke algebra of the symmetric group
• The state of the art in the computation of Kazhdan-Lusztig polynomials
• The development version of the \texttt{CHEVIE} package of \texttt{GAP3}.
• Evaluations of Hecke algebra traces at Kazhdan-Lusztig basis elements
• Computation in Coxeter groups II. Constructing minimal roots
• Computational Construction of W-graphs of Heeke algebras H(q, n) for nup to 15
• scientific article; zbMATH DE number 870532 (Why is no real title available?)
• scientific article; zbMATH DE number 6127030 (Why is no real title available?)
• Computing individual Kazhdan-Lusztig basis elements.
• \(\mathsf{PyCox}\): computing with (finite) Coxeter groups and Iwahori-Hecke algebras.
• Computation of Kazhdan-Lusztig polynomials and some applications to finite groups
• Computing Kazhdan-Lusztig Polynomials for Arbitrary Coxeter Groups
• On the Kazhdan-Lusztig cells in type E₈.
• A path algorithm for affine Kazhdan-Lusztig polynomials
• Calculating the p-canonical basis of Hecke algebras

Describes a project that uses

Uses Software

• GAP
• CHEVIE

This page was built for publication: On the computation of Kazhdan-Lusztig polynomials and representations of Hecke algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924604)