On the computation of Kazhdan-Lusztig polynomials and representations of Hecke algebras (Q1924604): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GAP / rank | |||
Normal rank | |||
Revision as of 12:30, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computation of Kazhdan-Lusztig polynomials and representations of Hecke algebras |
scientific article |
Statements
On the computation of Kazhdan-Lusztig polynomials and representations of Hecke algebras (English)
0 references
20 October 1996
0 references
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.
0 references
algorithm
0 references
Kazhdan-Lusztig polynomials
0 references
finite Coxeter groups
0 references
left cell representations
0 references
computations
0 references
