Computing abelian subalgebras for linear algebras of upper-triangular matrices from an algorithmic perspective
DOI10.1515/AUOM-2016-0032zbMATH Open1389.17001OpenAlexW2589040399MaRDI QIDQ4589676FDOQ4589676
Authors: Manuel Ceballos, Juan Núñez Valdés, Angel Francisco Tenorio Villalon 
Publication date: 10 November 2017
Published in: Analele Universitatii "Ovidius" Constanta - Seria Matematica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/auom-2016-0032
Recommendations
- The computation of abelian subalgebras in the Lie algebra of upper-triangular matrices
- The maximal abelian dimension of linear algebras formed by strictly upper triangular matrices
- Algorithm to compute the maximal Abelian dimension of Lie algebras
- Algorithmic method to obtain abelian subalgebras and ideals in Lie algebras
- Schur's bound in the Lie algebra of upper-triangular matrices
Symbolic computation and algebraic computation (68W30) Solvable, nilpotent (super)algebras (17B30) Computational methods for problems pertaining to nonassociative rings and algebras (17-08)
Cited In (8)
- Title not available (Why is that?)
- Schur's bound in the Lie algebra of upper-triangular matrices
- Algorithmic method to obtain abelian subalgebras and ideals in Lie algebras
- The maximal abelian dimension of linear algebras formed by strictly upper triangular matrices
- Algorithm to compute abelian subalgebras and ideals in Malcev algebras
- 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
Uses Software
This page was built for publication: Computing abelian subalgebras for linear algebras of upper-triangular matrices from an algorithmic perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589676)
