On graded decomposition numbers of Cherednik algebras
C. Bowman, A. G. Cox, L. Speyer
TL;DR
This paper introduces an algorithmic approach to compute graded decomposition numbers for rational Cherednik algebras, advancing understanding of their representation theory.
Contribution
It offers a novel algorithmic method to determine graded decomposition numbers, filling a gap in the computational aspects of Cherednik algebra representations.
Findings
Algorithm successfully computes graded decomposition numbers.
Enhances computational tools for Cherednik algebra representations.
Provides new insights into the structure of rational Cherednik algebras.
Abstract
We provide an algorithmic description of a family of graded decomposition numbers for rational Cherednik algebras.
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.