A computational study of a family of nilpotent Lie algebras
This paper describes an algorithm to compute the law of the Lie algebra g(n) associated with the Lie group G(n), formed of all the n x n upper-unitriangular matrices. The goal of this paper is to show the algorithm that computes the law of g(n) and its implementation using the symbolic computation package MAPLE. In addition, the complexity of the algorithm is described.
nilpotent lie algebra algorithm maple complexity