Add to ORKGAbstract. We give an efficient algorithm for Lang’s Theorem in split con-nected reductive groups defined over finite fields of characteristic greater than 3. This algorithm can be used to construct many important structures in finite groups of Lie type. We use an algorithm for computing a Chevalley basis for a split reductive Lie algebra, which is of independent interest. 1
Let L be the Lie algebra of a simple algebraic group defined over a field F and let H be a split max...
The unipotent groups are an important class of algebraic groups. We show that techniques used to com...
We describe an algorithm for constructing irreducible representations of split semisimple Lie algebr...
Abstract. We give an efficient algorithm for Lang’s Theorem in split con-nected reductive groups def...
We give an efficient Las Vegas type algorithm for Lang's Theorem in split connected reductive groups...
AbstractWe give an efficient Las Vegas type algorithm for Lang's Theorem in split connected reductiv...
Abstract. Let L be the Lie algebra of a simple algebraic group defined over F and let H be a split C...
In this thesis we present several new algorithms for dealing with simple algebraic groups and their ...
This thesis contributes to the representation theory of finite Chevalleygroups. First we describe al...
AbstractWe will give an algorithm for computing generators of the invariant ring for a given represe...
Abstract. The unipotent groups are an important class of algebraic groups. We show that techniques u...
AbstractA connected algebraic group in characteristic 0 is uniquely determined by its Lie algebra. I...
The unipotent groups are an important class of algebraic groups. We show that techniques used to com...
AbstractLet L be the Lie algebra of a simple algebraic group defined over a field F and let H be a s...
AbstractWe give a polynomial time algorithm that finds a split Cartan subalgebra of a finite Chevall...
Let L be the Lie algebra of a simple algebraic group defined over a field F and let H be a split max...
The unipotent groups are an important class of algebraic groups. We show that techniques used to com...
We describe an algorithm for constructing irreducible representations of split semisimple Lie algebr...
Abstract. We give an efficient algorithm for Lang’s Theorem in split con-nected reductive groups def...
We give an efficient Las Vegas type algorithm for Lang's Theorem in split connected reductive groups...
AbstractWe give an efficient Las Vegas type algorithm for Lang's Theorem in split connected reductiv...
Abstract. Let L be the Lie algebra of a simple algebraic group defined over F and let H be a split C...
In this thesis we present several new algorithms for dealing with simple algebraic groups and their ...
This thesis contributes to the representation theory of finite Chevalleygroups. First we describe al...
AbstractWe will give an algorithm for computing generators of the invariant ring for a given represe...
Abstract. The unipotent groups are an important class of algebraic groups. We show that techniques u...
AbstractA connected algebraic group in characteristic 0 is uniquely determined by its Lie algebra. I...
The unipotent groups are an important class of algebraic groups. We show that techniques used to com...
AbstractLet L be the Lie algebra of a simple algebraic group defined over a field F and let H be a s...
AbstractWe give a polynomial time algorithm that finds a split Cartan subalgebra of a finite Chevall...
Let L be the Lie algebra of a simple algebraic group defined over a field F and let H be a split max...
The unipotent groups are an important class of algebraic groups. We show that techniques used to com...
We describe an algorithm for constructing irreducible representations of split semisimple Lie algebr...