100
Views
7
CrossRef citations to date
0
Altmetric
Section B

Algorithmic method to obtain abelian subalgebras and ideals in Lie algebras

, &
Pages 1388-1411 | Received 20 Sep 2011, Accepted 03 Apr 2012, Published online: 16 May 2012
 

Abstract

In this paper, we show an algorithmic procedure to compute abelian subalgebras and ideals of finite-dimensional Lie algebras, starting from the non-zero brackets in its law. In order to implement this method, we use the symbolic computation package MAPLE 12. Moreover, we also give a brief computational study considering both the computing time and the memory used in the two main routines of the implementation. Finally, we determine the maximal dimension of abelian subalgebras and ideals for non-decomposable solvable non-nilpotent Lie algebras of dimension 6 over both the fields ℝ and ℂ, showing the differences between these fields.

2000 AMS Subject Classifications :

Acknowledgements

This work has been partially supported by MTM2010-19336 and FEDER. Additionally, the authors want to thank the referees for their helpful and useful comments and suggestions, which have allowed us to improve the quality of this paper.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 1,129.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.