Back to Search
Start Over
A computational study of a family of nilpotent Lie algebras
- Source :
- The Journal of Supercomputing. 59:147-155
- Publication Year :
- 2010
- Publisher :
- Springer Science and Business Media LLC, 2010.
-
Abstract
- This paper describes an algorithm to compute the law of the Lie algebra \(\mathfrak{g}_{n}\) associated with the Lie group Gn, 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.
- Subjects :
- Computer science
Computation
Simple Lie group
Adjoint representation
Lie group
Theoretical Computer Science
Lie conformal algebra
Graded Lie algebra
Combinatorics
Nilpotent Lie algebra
Nilpotent
Matrix (mathematics)
Adjoint representation of a Lie algebra
Hardware and Architecture
ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION
Lie algebra
Weight
Mathematics::Representation Theory
Software
Information Systems
Subjects
Details
- ISSN :
- 15730484 and 09208542
- Volume :
- 59
- Database :
- OpenAIRE
- Journal :
- The Journal of Supercomputing
- Accession number :
- edsair.doi...........18a4860ac8651b28ea4ba388898a2597
- Full Text :
- https://doi.org/10.1007/s11227-010-0430-2