An LLT-type algorithm for computing higher-level canonical bases

Matthew Fayers

doi:10.1016/j.jpaa.2010.02.021

paper

An LLT-type algorithm for computing higher-level canonical bases

arXiv:0908.1749 · doi:10.1016/j.jpaa.2010.02.021

Abstract

We give a fast algorithm for computing the canonical basis of an irreducible highest-weight module for $U_{q} (sl^_{e})$ , generalising the LLT algorithm.

References in corpus (3)

Graded decomposition numbers for cyclotomic Hecke algebras
Canonical bases of q-deformed Fock spaces
General runner removal and the Mullineux map

Cited by in corpus (5)

On graded decomposition numbers of Cherednik algebras
Factorization of the canonical bases for higher level Fock spaces
Specht modules labelled by hook bipartitions I
Fayers' conjecture and the socles of cyclotomic Weyl modules
Empty runner removal theorem for Ariki-Koike algebras