Algorithmic method to obtain abelian subalgebras and ideals in Lie algebras
DOI10.1080/00207160.2012.688112zbMATH Open1255.17002OpenAlexW2020052594MaRDI QIDQ4903499FDOQ4903499
Authors: Manuel Ceballos, Juan Núñez Valdés, Angel Francisco Tenorio Villalon
Publication date: 22 January 2013
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2012.688112
Recommendations
- Algorithmic procedure to compute abelian subalgebras and ideals of maximal dimension of Leibniz algebras
- Algorithm to compute the maximal Abelian dimension of Lie algebras
- Computing abelian subalgebras for linear algebras of upper-triangular matrices from an algorithmic perspective
- Algorithm to compute abelian subalgebras and ideals in Malcev algebras
- The computation of abelian subalgebras in the Lie algebra of upper-triangular matrices
Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to nonassociative rings and algebras (17-04) Solvable, nilpotent (super)algebras (17B30) Structure theory for Lie algebras and superalgebras (17B05)
Cites Work
- Abelian ideals in a Borel subalgebra of a complex simple Lie algebra
- Classification of orbit closures of 4-dimensional complex Lie algebras
- Title not available (Why is that?)
- Classification and Casimir invariants of Lie-Poisson brackets
- The minimal dimension of maximal commutative subalgebras of full matrix algebras
- On the level of some solvable Lie algebras
- Degenerations of 6-dimensional nilpotent lie algebras over C
- Bounds for the Dimensions of Certain Lie Algebras
- The maximal abelian dimension of linear algebras formed by strictly upper triangular matrices
- Solvable Lie algebras of dimension six
- Title not available (Why is that?)
- On the dimensions of commutative subalgebras and subgroups.
- How abelian is a finite-dimensional Lie algebra?
Cited In (9)
- Algorithms for soluble subalgebras of finite dimensional Lie algebras
- Abelian ideals of maximal dimension for solvable Lie algebras
- Algorithm to compute abelian subalgebras and ideals in Malcev algebras
- On the algorithmic linearizability of nonlinear ordinary differential equations
- The maximal abelian dimension of a Lie algebra, Rentschler's property and Milovanov's conjecture
- The computation of abelian subalgebras in the Lie algebra of upper-triangular matrices
- Algorithmic procedure to compute abelian subalgebras and ideals of maximal dimension of Leibniz algebras
- Algorithm to compute the maximal Abelian dimension of Lie algebras
- Computing abelian subalgebras for linear algebras of upper-triangular matrices from an algorithmic perspective
Uses Software
This page was built for publication: Algorithmic method to obtain abelian subalgebras and ideals in Lie algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903499)