Add to ORKGIn the first part of the thesis I produce and implement an algorithm for obtaining generators of the unit group of the integral group ring ZG of finite abelian group G. We use our implementation in MAGMA of this algorithm to compute the unit group of ZG for G of order up to 110. In the second part of the thesis I show how to construct multiplication tables of the semisimple real Lie algebras. Next I give an algorithm, based on the work of Sugiura, to find all Cartan subalgebra of such a Lie algebra. Finally I show algorithms for finding semisimple subalgebras of a given semisimple real Lie algebra
We consider the algorithmic problem of computing Cartan subalgebras in Lie algebras over finite fiel...
In this note we present an algorithm for the construction of the unit group of the Burnside ring Ω(...
We consider the algorithmic problem of computing Cartan subalgebras in Lie algebras over finite fiel...
AbstractWe describe an algorithm for obtaining generators of the unit group of the integral group ri...
AbstractFirst we briefly describe two previously published algorithms: one that constructs a Cartan ...
In this thesis we present several new algorithms for dealing with simple algebraic groups and their ...
First we briefly describe two previously published algorithms: one that constructs a Cartan subalgeb...
First we briefly describe two previously published algorithms: one that constructs a Cartan subalgeb...
First we briefly describe two previously published algorithms: one that constructs a Cartan subalgeb...
AbstractWe describe an algorithm for obtaining generators of the unit group of the integral group ri...
The set of all abelian subalgebras is computationally obtained for any given finite-dimensional Lie ...
AbstractAlgorithms are described that help with obtaining a classification of the semisimple subalge...
peer reviewedWe give an algorithm to determine finitely many generators for a subgroup of finite ind...
In this thesis we present several new algorithms for dealing with simple algebraic groups and their ...
In this thesis we present several new algorithms for dealing with simple algebraic groups and their ...
We consider the algorithmic problem of computing Cartan subalgebras in Lie algebras over finite fiel...
In this note we present an algorithm for the construction of the unit group of the Burnside ring Ω(...
We consider the algorithmic problem of computing Cartan subalgebras in Lie algebras over finite fiel...
AbstractWe describe an algorithm for obtaining generators of the unit group of the integral group ri...
AbstractFirst we briefly describe two previously published algorithms: one that constructs a Cartan ...
In this thesis we present several new algorithms for dealing with simple algebraic groups and their ...
First we briefly describe two previously published algorithms: one that constructs a Cartan subalgeb...
First we briefly describe two previously published algorithms: one that constructs a Cartan subalgeb...
First we briefly describe two previously published algorithms: one that constructs a Cartan subalgeb...
AbstractWe describe an algorithm for obtaining generators of the unit group of the integral group ri...
The set of all abelian subalgebras is computationally obtained for any given finite-dimensional Lie ...
AbstractAlgorithms are described that help with obtaining a classification of the semisimple subalge...
peer reviewedWe give an algorithm to determine finitely many generators for a subgroup of finite ind...
In this thesis we present several new algorithms for dealing with simple algebraic groups and their ...
In this thesis we present several new algorithms for dealing with simple algebraic groups and their ...
We consider the algorithmic problem of computing Cartan subalgebras in Lie algebras over finite fiel...
In this note we present an algorithm for the construction of the unit group of the Burnside ring Ω(...
We consider the algorithmic problem of computing Cartan subalgebras in Lie algebras over finite fiel...