An algorithm for computing root multiplicities in Kac-Moody algebras
Rings and Algebras
2019-12-11 v1 Combinatorics
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.
Keywords
Cite
@article{arxiv.1912.04540,
title = {An algorithm for computing root multiplicities in Kac-Moody algebras},
author = {Aidan Backus and Peter Connick and Joshua Lin},
journal= {arXiv preprint arXiv:1912.04540},
year = {2019}
}
Comments
13 pages, 2 tables