{"title":"Computational Algorithm for Obtaining Abelian Subalgebras in Lie Algebras","authors":"Manuel Ceballos, Juan Nunez, Angel F. Tenorio","country":null,"institution":"","volume":34,"journal":"International Journal of Mathematical and Computational Sciences","pagesStart":879,"pagesEnd":884,"ISSN":"1307-6892","URL":"https:\/\/publications.waset.org\/pdf\/11417","abstract":"The set of all abelian subalgebras is computationally\r\nobtained for any given finite-dimensional Lie algebra, starting from the nonzero brackets in its law. More concretely, an algorithm\r\nis described and implemented to compute a basis for each nontrivial abelian subalgebra with the help of the symbolic computation package MAPLE. Finally, it is also shown a brief computational study\r\nfor this implementation, considering both the computing time and the\r\nused memory.","references":null,"publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 34, 2009"}