Abstract
This paper describes an algorithm to compute the law of the Lie algebra \(\mathfrak{g}_{n}\) associated with the Lie group G n , formed of all the n×n upper-unitriangular matrices. The goal of this paper is to show the algorithm that computes the law of \(\mathfrak{g}_{n}\) and its implementation using the symbolic computation package MAPLE. In addition, the complexity of the algorithm is described.
Similar content being viewed by others
References
Beck RE, Kolman B (1973) Computers in Lie algebras I. Calculation of inner multiplicities. SIAM J Appl Math 25:300–312
Benjumea JC, Núñez J, Tenorio AF (2007) The maximal Abelian dimension of linear algebras formed by strictly upper triangular matrices. Theor Math Phys 152:1225–1233
Benjumea JC, Núñez J, Tenorio AF (2008) Minimal linear representations of the low-dimensional nilpotent lie algebras. Math Scand 102:17–26
de Graaf WA (2005) Classification of solvable Lie algebras. Exp Math 14:15–25
Draisma J (2003) Constructing Lie algebras of first order differential operators. J Symb Comput 36:685–698
Fulton W, Harris J (1991) Representation theory: a first course. Springer, New York
Postnikov M (1994) Lie groups and Lie algebras. Lectures in geometry, vol V. Nauka, Moscow
van Est WT, Korthagen TJ (1964) Non-enlargeable Lie algebras. Need Akad Wetensch Proc A 26:15–31
Varadarajan VS (1984) Lie groups, Lie algebras and their representations. Springer, New York
Wald RM (1984) General relativity. The University of Chicago Press, Chicago
Wilf HS (1986) Algorithms and complexity. Prentice Hall, Upper Saddle River
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Núñez, J., Tenorio, Á.F. A computational study of a family of nilpotent Lie algebras. J Supercomput 59, 147–155 (2012). https://doi.org/10.1007/s11227-010-0430-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-010-0430-2