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

preprint2010arXivOpen access

We give a fast algorithm for computing the canonical basis of an irreducible highest-weight module for $U_q(\hat{\mathfrak{sl}}_e)$ , generalising the LLT algorithm.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0