Year: 2019
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Backus, Aidan, Connick, Peter, Lin, Joshua
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2995839173