DOIAbstract
AbstractWe give a polynomial time algorithm that finds a split Cartan subalgebra of a finite Chevalley Lie algebra
AbstractWe give a polynomial time algorithm that finds a split Cartan subalgebra of a finite Chevalley Lie algebra
We consider the problem of decomposing a semisimple Lie algebra dened over a eld of characteristic z...
In this thesis we present several new algorithms for dealing with simple algebraic groups and their ...
email wdgwintuenl We consider the problem of decomposing a semisimple Lie algebra dened over a eld o...
We consider the algorithmic problem of computing Cartan subalgebras in Lie algebras over finite fiel...
We consider the algorithmic problem of computing Cartan subalgebras in Lie algebras over finite fiel...
We consider the algorithmic problem of computing Cartan subalgebras in Lie algebras over finite fiel...
We consider the algorithmic problem of computing Cartan subalgebras in Lie algebras over finite fiel...
AbstractCertain algorithms concerned with Cartan subalgebras and maximal soluble subalgebras in fini...
Abstract. Let L be the Lie algebra of a simple algebraic group defined over F and let H be a split C...
AbstractThe task of actually constructing a Cartan subalgebra H of a finite dimensional Lie algebra ...
The set of all abelian subalgebras is computationally obtained for any given finite-dimensional Lie ...
AbstractFirst we briefly describe two previously published algorithms: one that constructs a Cartan ...
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...
We consider the problem of decomposing a semisimple Lie algebra dened over a eld of characteristic z...
In this thesis we present several new algorithms for dealing with simple algebraic groups and their ...
email wdgwintuenl We consider the problem of decomposing a semisimple Lie algebra dened over a eld o...
We consider the algorithmic problem of computing Cartan subalgebras in Lie algebras over finite fiel...
We consider the algorithmic problem of computing Cartan subalgebras in Lie algebras over finite fiel...
We consider the algorithmic problem of computing Cartan subalgebras in Lie algebras over finite fiel...
We consider the algorithmic problem of computing Cartan subalgebras in Lie algebras over finite fiel...
AbstractCertain algorithms concerned with Cartan subalgebras and maximal soluble subalgebras in fini...
Abstract. Let L be the Lie algebra of a simple algebraic group defined over F and let H be a split C...
AbstractThe task of actually constructing a Cartan subalgebra H of a finite dimensional Lie algebra ...
The set of all abelian subalgebras is computationally obtained for any given finite-dimensional Lie ...
AbstractFirst we briefly describe two previously published algorithms: one that constructs a Cartan ...
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...
We consider the problem of decomposing a semisimple Lie algebra dened over a eld of characteristic z...
In this thesis we present several new algorithms for dealing with simple algebraic groups and their ...
email wdgwintuenl We consider the problem of decomposing a semisimple Lie algebra dened over a eld o...
Add to ORKG