An algorithm for computing root multiplicities in Kac-Moody algebras

An algorithm for computing root multiplicities in Kac-Moody algebras

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 eff...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Backus, Aidan, Connick, Peter, Lin, Joshua
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics - Combinatorics
Mathematics - Rings and Algebras
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
DOI:10.48550/arxiv.1912.04540