An algorithm for computing root multiplicities in Kac-Moody algebras
From MaRDI portal
Abstract: Root multiplicities encode information about the structure of Kac-Moody algebras, and appear in applications as far-reaching as string theory and the theory of modular functions. We provide an algorithm based on the Peterson recurrence formula to compute multiplicities, and argue that it is more efficient than the naive algorithm.
This page was built for publication: An algorithm for computing root multiplicities in Kac-Moody algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6330820)
