An LLT-type algorithm for computing higher-level canonical bases
Matthew Fayers
TL;DR
This paper introduces a fast algorithm for computing the canonical basis of certain modules in quantum algebra, extending the LLT algorithm to higher levels.
Contribution
It generalizes the LLT algorithm to higher-level canonical bases in quantum affine algebras, providing a more efficient computational method.
Findings
The algorithm significantly speeds up basis computations.
It successfully generalizes LLT to higher levels.
Potential applications in representation theory and quantum algebra.
Abstract
We give a fast algorithm for computing the canonical basis of an irreducible highest-weight module for , generalising the LLT algorithm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.