The Lascoux, Leclerc and Thibon algorithm and Soergel's tilting algorithm. (Q2492811)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Lascoux, Leclerc and Thibon algorithm and Soergel's tilting algorithm. |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Lascoux, Leclerc and Thibon algorithm and Soergel's tilting algorithm. |
scientific article |
Statements
The Lascoux, Leclerc and Thibon algorithm and Soergel's tilting algorithm. (English)
0 references
14 June 2006
0 references
The main purpose of this paper is to show that the Lascoux-Leclerc-Thibon algorithm on the connection between canonical bases of Fock modules and decomposition numbers of Hecke algebras of type \(A\) can be deduced from Soergel's tilting algorithm. To this end, the author shows that the LLT algorithm is actually a special case of the so-called singular combinatorics.
0 references
crystal bases
0 references
Fock modules
0 references
Kazhdan-Lusztig polynomials
0 references
Lascoux-Leclerc-Thibon algorithm
0 references
decomposition numbers
0 references
Hecke algebras
0 references
Soergel tilting algorithm
0 references
0.8695296
0 references
0 references
0.8247968
0 references
0.81934446
0 references
0 references
