Computing abelian subalgebras for linear algebras of upper-triangular matrices from an algorithmic perspective
From MaRDI portal
Publication:4589676
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
Cited in
(8)- scientific article; zbMATH DE number 2160765 (Why is no real title available?)
- 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
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)