Abstract
We present a fast algorithm for computing the global crystal basis of the basic $$U_q (\widehat{\mathfrak{s}\mathfrak{l}}_n )$$ -module. This algorithm is based on combinatorial techniques which have been developed for dealing with modular representations of symmetric groups, and more generally with representations of Hecke algebras of typeA at roots of unity. We conjecture that, upon specializationq→1, our algorithm computes the decomposition matrices of all Hecke algebras at an th root of 1.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.