On the computation of Kazhdan-Lusztig polynomials and representations of Hecke algebras
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.
scientific article; zbMATH DE number 937067