{"title":"Construction of nilpotent Lie algebras over arbitrary fields","authors":"R. Beck, B. Kolman","doi":"10.1145/800206.806390","DOIUrl":null,"url":null,"abstract":"In this paper we present a general description of a computationally efficient algorithm for constructing every n-dimensional nilpotent Lie algebra as a central extension of a nilpotent Lie algebra of dimension less than n.\n As an application of the algorithm, we present a complete list of all real nilpotent six-dimensional Lie algebras. Since 1958, four such lists have been developed: namely, those of Morozov [2], Shedler [3], Vergne [5] and Skjelbred and Sund [4]. No two of these lists agree exactly. Our list resolves all the discrepancies in the other four lists. Moreover, it contains each earlier list as a subset.","PeriodicalId":314618,"journal":{"name":"Symposium on Symbolic and Algebraic Manipulation","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1981-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symposium on Symbolic and Algebraic Manipulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800206.806390","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21
Abstract
In this paper we present a general description of a computationally efficient algorithm for constructing every n-dimensional nilpotent Lie algebra as a central extension of a nilpotent Lie algebra of dimension less than n.
As an application of the algorithm, we present a complete list of all real nilpotent six-dimensional Lie algebras. Since 1958, four such lists have been developed: namely, those of Morozov [2], Shedler [3], Vergne [5] and Skjelbred and Sund [4]. No two of these lists agree exactly. Our list resolves all the discrepancies in the other four lists. Moreover, it contains each earlier list as a subset.
本文给出了构造一个n维幂零李代数作为维数小于n的幂零李代数的中心扩展的计算效率算法的一般描述。作为该算法的一个应用,我们给出了所有实数幂零六维李代数的完整列表。自1958年以来,Morozov[2]、Shedler[3]、Vergne[5]、Skjelbred and Sund[4]等四种名单相继问世。没有哪两个列表完全一致。我们的清单解决了其他四个清单中的所有差异。此外,它将每个早期列表作为子集包含。