AbstractWe present an algorithm for the computation of representations of a Lie algebra acting on its universal enveloping algebra. This is a new algorithm which permits the effective computation of these representations and of the matrix elements of the corresponding Lie group. The approach is based on a mathematical formulation originated by the authors. An interesting feature is the efficient computation of the adjoint representation of the corresponding Lie group. The methods are implemented using a symbolic computation program such as MAPLE
We describe two methods for computing with the elements of untwisted groups of Lie type: using the S...
We describe two methods for computing with the elements of untwisted groups of Lie type: using the S...
We describe two methods for computing with the elements of untwisted groups of Lie type: using the S...
AbstractWe present an algorithm for the computation of representations of a Lie algebra acting on it...
The computer algebra system Maple contains a basic set of commands for working with Lie algebras. Th...
Contains fulltext : 128992.pdf (preprint version ) (Open Access
We describe an algorithm for constructing irreducible representations of split semisimple Lie algebr...
We describe an algorithm for constructing irreducible representations of split semisimple Lie algebr...
We present the Mathematica application “LieART ” (Lie Algebras and Representation Theory) for comput...
In this thesis we present several new algorithms for dealing with simple algebraic groups and their ...
The set of all abelian subalgebras is computationally obtained for any given finite-dimensional Lie ...
This paper describes progress made in context with the construction of a general library of Lie al...
We describe two methods for computing with the elements of untwisted groups of Lie type: using the S...
We describe two methods for computing with the elements of untwisted groups of Lie type: using the S...
This paper describes progress made in context with the construction of a general library of Lie alge...
We describe two methods for computing with the elements of untwisted groups of Lie type: using the S...
We describe two methods for computing with the elements of untwisted groups of Lie type: using the S...
We describe two methods for computing with the elements of untwisted groups of Lie type: using the S...
AbstractWe present an algorithm for the computation of representations of a Lie algebra acting on it...
The computer algebra system Maple contains a basic set of commands for working with Lie algebras. Th...
Contains fulltext : 128992.pdf (preprint version ) (Open Access
We describe an algorithm for constructing irreducible representations of split semisimple Lie algebr...
We describe an algorithm for constructing irreducible representations of split semisimple Lie algebr...
We present the Mathematica application “LieART ” (Lie Algebras and Representation Theory) for comput...
In this thesis we present several new algorithms for dealing with simple algebraic groups and their ...
The set of all abelian subalgebras is computationally obtained for any given finite-dimensional Lie ...
This paper describes progress made in context with the construction of a general library of Lie al...
We describe two methods for computing with the elements of untwisted groups of Lie type: using the S...
We describe two methods for computing with the elements of untwisted groups of Lie type: using the S...
This paper describes progress made in context with the construction of a general library of Lie alge...
We describe two methods for computing with the elements of untwisted groups of Lie type: using the S...
We describe two methods for computing with the elements of untwisted groups of Lie type: using the S...
We describe two methods for computing with the elements of untwisted groups of Lie type: using the S...