𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for the decomposition of semisimple Lie algebras

✍ Scribed by W.A. de Graaf

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
356 KB
Volume
187
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

✦ Synopsis

We consider the problem of decomposing a semisimple Lie algebra defined over a field of characteristic zero as a direct sum of its simple ideals. The method is based on the decomposition of the action of a Car-tan subalgebra. An implementation of the algorithm in the system ELIAS is discussed at the end of the paper.

πŸ“œ SIMILAR VOLUMES

Sheets and Topology of Primitive Spectra
Sheets and Topology of Primitive Spectra for Semisimple Lie Algebras
✍ Walter Borho; Anthony Joseph πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 579 KB

Let α’„ be a semisimple Lie algebra. Consider the set X X of primitive ideals of the Ε½ . enveloping algebra U α’„ , given the Jacobson topology. A basic open problem is to describe X X as a countable union of algebraic varieties V V with strata V V as large as possible. Towards this aim the notion of a

An algorithm for generating the positive
An algorithm for generating the positive roots of simple lie algebras
✍ A.K. Bose πŸ“‚ Article πŸ“… 1976 πŸ› Elsevier Science 🌐 English βš– 165 KB

We present a combinatorial algorithm for computing the positive roots of all nine types of simple Lie algebras over complexes. It was implemented on a programmable desk calculator. Simple Lie algebras play a key role in many bran-6