𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Undecidability of certain algorithmic problems for Lie algebras

✍ Scribed by L. A. Bokut’

Publisher
Springer US
Year
1974
Tongue
English
Weight
420 KB
Volume
13
Category
Article
ISSN
0002-5232

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Characterization of Certain Loop Lie A
A Characterization of Certain Loop Lie Algebras
✍ J.Marshall Osborn; Kaiming Zhao 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 113 KB

In this paper, we study Z × Z-graded Lie algebras A = i j∈Z A i j with dim A i j ≤ 1 satisfying (I) dim A ±1 0 = dim A 0 ±1 = 1, and A is generated by A ±1 0 A 0 ±1 ; (II) i∈Z A 0 j sl 2 ; (III) A -1 0 A 1 0 = 0, and adA ±1 0 act faithfully on j∈Z A j 1 . We show that A is necessarily isomorphic

On certain families of naturally graded
On certain families of naturally graded Lie algebras
✍ José Marı́a Ancochea Bermúdez; Rutwig Campoamor Stursberg 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 198 KB

In this work large families of naturally graded nilpotent Lie algebras in arbitrary dimension and characteristic sequence (n; q; 1) with n ≡ 1(mod 2) satisfying the centralizer property are given. This centralizer property constitutes a generalization, for any nilpotent algebra, of the structural pr