LiE

LiE
Original uploader was Rm w a vu at en.wikipedia · CC BY-SA 2.0 · source
Name	LiE
Developer	Dennis P. Dobbs and Eric M. Opdam and John Stembridge
Initial release	1992
Latest release	1999
Programming language	C, Pascal
Operating system	Unix, Linux, DOS, Windows (via ports)
License	Academic / research-use
Website	(historical)

LiE LiE is a computer algebra system specialized for computations in representation theory, root systems, and Lie algebras. It was created to compute characters, weight multiplicities, tensor product decompositions, branching rules, and related structural data for semisimple Lie algebras and algebraic groups. LiE has been widely used by researchers working with Harish-Chandra-style theory, Weyl group combinatorics, and explicit applications in mathematical physics such as conformal field theory and string theory.

Overview

LiE focuses on algorithmic manipulation of objects from the theory of Cartan matrices, Dynkin diagrams, Weyl group actions, highest-weight theory, and classical series like A_n, B_n, C_n, and D_n. It implements routines for computing irreducible characters via the Weyl character formula, multiplicities using Kostant's multiplicity formula, and decomposition rules akin to the Littlewood–Richardson rule for tensor products and branching. LiE’s dataset includes tables of root systems, fundamental weights, and finite-dimensional representation data for exceptional Lie types such as E6, E7, E8, F4, and G2.

Features and Functionality

LiE provides commands to compute weight multiplicities, character expansions, and tensor product coefficients; typical functions mirror tasks performed in research on Verma module structures, Kazhdan–Lusztig polynomial computations, and the study of affine Lie algebra representations. The system supports computation of decomposition multiplicities for restrictions to subalgebras defined by sub-Dynkin diagrams related to embeddings like A_n ⊂ B_{n+1} or exceptional embeddings encountered in E8 branching. LiE includes facilities for Weyl group enumeration, root lattice arithmetic, and manipulations of highest-weight coordinates relative to fundamental weights used in work by Weyl and Cartan.

LiE’s command set allows users to compute tensor product multiplicities, perform plethysm-like operations for symmetric powers relevant to Schur functor calculations, and generate character tables used in studies involving Monster group representations or conformal field theory modular invariants. The package supports built-in libraries covering classical series, exceptional types, and standard embeddings used in literature by authors such as James E. Humphreys and William Fulton.

Mathematical Foundations and Algorithms

Under the hood, LiE relies on the algebraic structure of semisimple Lie algebras, root systems, and highest-weight theory to reduce representation-theoretic problems to combinatorial and arithmetic tasks. Computation of characters uses versions of the Weyl character formula combined with multiplicity extraction routines; multiplicities can be computed using algorithms derived from Bertram Kostant’s partition function and recursive evaluation techniques. Weyl group orbit enumeration and Bruhat order traversals draw on algorithms used in research on Coxeter group combinatorics and implementations similar to those applied to Hecke algebra computations.

For tensor products and branching rules, LiE implements adaptations of multiplicity formulas that avoid full character expansion when possible, using highest-weight truncation and symmetry exploitation seen in algorithms described by Littlewood and Richardson. For computations tied to affine and extended algebras, LiE uses data from extended Dynkin diagrams and procedures paralleling methods in studies of Kac–Moody algebra representation theory by Victor Kac.

Development History and Versions

LiE was developed in the early 1990s by a collaboration including Dennis P. Dobbs, Eric M. Opdam, and John Stembridge, among others, and evolved through versions that expanded root-system data, optimized core routines, and improved platform portability. Early releases targeted Unix and DOS environments; later ports and community-maintained builds extended usability on Linux and Microsoft Windows via compatibility layers. Development paralleled contemporary symbolic systems like GAP and SageMath in providing specialized algebraic computations not present in general-purpose systems such as Mathematica or Maple.

Academic users disseminated additional scripts and wrappers to link LiE output to research tools used in publications appearing in venues associated with institutions such as American Mathematical Society journals and conferences organized by societies like the London Mathematical Society. Although official maintenance slowed in the late 1990s, LiE’s algorithms influenced later packages and libraries in computational representation theory.

Usage and Applications

Researchers apply LiE to compute branching rules for symmetry-breaking scenarios in particle physics contexts related to groups like SU(n), SO(n), and Sp(n), and in mathematical investigations involving moduli spaces, invariant theory, and cohomology computations for homogeneous spaces such as flag varietys and Grassmannians. In mathematical physics, LiE has been used to analyze modular invariants in conformal field theory, fusion rules in Wess–Zumino–Witten models, and spectra in string compactification studies involving exceptional groups like E8.

In pure mathematics, LiE supports explicit experimentation in papers on decomposition numbers, plethysm conjectures, and computational verification of identities appearing in work by researchers including George Lusztig and I. G. Macdonald. Educators and students use LiE to generate examples for courses covering representation theory found in curricula at institutions like Massachusetts Institute of Technology and University of Cambridge.

Interface and Extensibility

LiE exposes a command-line interface with scripting facilities for batch computations and can be driven by wrapper code from systems such as Perl, Python, and C programs. Community contributions have produced front ends and converters to export data to formats readable by computer algebra systems like GAP and SageMath, enabling interoperability with combinatorial libraries used in studies by groups at Institut des Hautes Études Scientifiques and Max Planck Institute for Mathematics. Extensibility is achieved by augmenting root-system tables, embedding definitions, and user-defined routines to perform specialized tasks in research-level projects.

Category:Computer algebra systemsCategory:Representation theory