Add to ORKGWe show how to compute the Levi decomposition of a Lie algebra in Maple using the command LeviDecomposition. A worksheet and corresponding PDF can be found below
We consider the algorithmic problem of computing Levi decompositions in Lie algebras and Wedderburn–...
The computer algebra system Maple contains a basic set of commands for working with Lie algebras. Th...
We show how to create a Lie algebra in Maple using three of the most common approaches: matrices, ve...
AbstractIn this paper we investigate the structure of a non-semisimple Lie algebra of characteristic...
AbstractMethods are given for identifying a Lie algebra L, given by its structure constants. The ide...
AbstractRestrictions are presented on the radical structure of an indecomposable Lie algebra. These ...
This paper describes progress made in context with the construction of a general library of Lie al...
Levi's theorem decomposes any arbitrary Lie algebra over a field of characteristic zero, as a direct...
AbstractMethods are given for identifying a Lie algebra L, given by its structure constants. The ide...
This paper describes progress made in context with the construction of a general library of Lie alge...
We show that a graded Lie algebra admits a Levi decomposition that is compatible with the grading
We consider the algorithmic problem of computing Levi decompositions in Lie algebras and Wedderburn–...
We consider the algorithmic problem of computing Levi decompositions in Lie algebras and Wedderburn–...
We consider the algorithmic problem of computing Levi decompositions in Lie algebras and Wedderburn–...
We consider the algorithmic problem of computing Levi decompositions in Lie algebras and Wedderburn–...
We consider the algorithmic problem of computing Levi decompositions in Lie algebras and Wedderburn–...
The computer algebra system Maple contains a basic set of commands for working with Lie algebras. Th...
We show how to create a Lie algebra in Maple using three of the most common approaches: matrices, ve...
AbstractIn this paper we investigate the structure of a non-semisimple Lie algebra of characteristic...
AbstractMethods are given for identifying a Lie algebra L, given by its structure constants. The ide...
AbstractRestrictions are presented on the radical structure of an indecomposable Lie algebra. These ...
This paper describes progress made in context with the construction of a general library of Lie al...
Levi's theorem decomposes any arbitrary Lie algebra over a field of characteristic zero, as a direct...
AbstractMethods are given for identifying a Lie algebra L, given by its structure constants. The ide...
This paper describes progress made in context with the construction of a general library of Lie alge...
We show that a graded Lie algebra admits a Levi decomposition that is compatible with the grading
We consider the algorithmic problem of computing Levi decompositions in Lie algebras and Wedderburn–...
We consider the algorithmic problem of computing Levi decompositions in Lie algebras and Wedderburn–...
We consider the algorithmic problem of computing Levi decompositions in Lie algebras and Wedderburn–...
We consider the algorithmic problem of computing Levi decompositions in Lie algebras and Wedderburn–...
We consider the algorithmic problem of computing Levi decompositions in Lie algebras and Wedderburn–...
The computer algebra system Maple contains a basic set of commands for working with Lie algebras. Th...
We show how to create a Lie algebra in Maple using three of the most common approaches: matrices, ve...