Pith. sign in

REVIEW

An algorithm for computing root multiplicities in Kac-Moody algebras

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1912.04540 v1 pith:CKCPR2W7 submitted 2019-12-10 math.RA math.CO

Aidan Backus , Peter Connick , Joshua Lin This is my paper · ORCID
classification math.RAmath.CO
keywords algorithmmultiplicitiesalgebraskac-moodyroottheoryappearapplications
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Pith tools