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

2014/12/02 by Daniel Whalen, Whalen, Daniel · 1 citation
Business, Management and Accounting · Computer Science · #Advanced Algebra and Logic #Business Process Modeling and Analysis #FOS: Mathematics #FOS: Physical sciences #High Energy Physics - Theory (hep-th) #Logic, programming, and type systems #Quantum Algebra (math.QA)

paper · pdf · doi:10.48550/arxiv.1412.0759

openalex publication_date 2014/12/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

• On the elliptic genera of manifolds of Spin(7) holonomy

Related

• Programming Realization of Symbolic Computations for Non-linear Commutator Superalgebras over the Heisenberg--Weyl Superalgebra: Data Structures and Processing Methods
• Singular vectors, characters, and composition series for the N=1 BMS superalgebra
• Smooth modules over the N=1 Bondi-Metzner-Sachs superalgebra
• Linearization of W algebras and W superalgebras
• Gram determinants and semisimplity criteria for Birman-Wenzl algebras