An algorithm for evaluating Gram matrices in Verma modules of W-algebras
Daniel Whalen

TL;DR
This paper introduces a dynamic programming algorithm for evaluating operators and Gram matrices in superconformal algebras, accompanied by a Mathematica package implementation.
Contribution
The paper presents a novel, efficient algorithm for computing Gram matrices in Verma modules of W-algebras, with an accompanying software tool.
Findings
Algorithm efficiently computes Gram matrices
Implementation available as Weaver.m package
Applicable to a wide range of superconformal algebras
Abstract
I present a simple dynamic programming algorithm for the evaluation of operators in a wide range of superconformal algebras. Special care is taken to describe the computation of the Gram matrix. A Mathematica package, Weaver.m, is provided that implements the algorithm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Advanced Algebra and Logic · Business Process Modeling and Analysis
