Abstract. We present algorithms to compute with relative root subgroups of twisted reductive groups. Given a Galois cocycle specifying a twisted form, we can find the relative root datum and Tits index, and carry out operations involving root elements. We can also find a presentation of the unipotent subgroup. Given a Tits index and the anisotropic subgroup, we can determine a cocycle with that index, if one exists. 1
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN021053 / BLDSC - British Library D...
The unipotent groups are an important class of algebraic groups. We show that techniques used to com...
We study (connected) reductive subgroups G of a reductive algebraic group H, where G contains a regu...
We investigate the structure of root data by considering their decomposition as a product of a semis...
Let G be a connected reductive group over a field F. A twisted Levi subgroup G ′ of G is a reductive...
The purpose of this note is to construct a splitting field of a twisted group algebra of a finite gr...
We design and implement algorithms for computation with groups of Lie type. Algorithms for element ...
We introduce a combinatorial language which will be used to classify split semisimple linear algebra...
Abstract. The unipotent groups are an important class of algebraic groups. We show that techniques u...
This thesis contains a collection of algorithms for working with the twisted groups of Lie type know...
Around 1990, Arthur proved a local (ordinary) trace formula for real or p-adic connected reductive g...
The unipotent groups are an important class of algebraic groups. We show that techniques used to com...
Abstract: Problem Statement: Let K is the splitting field of a polynomial f(x) over a field F and αn...
.This article is subsequent to our previous one, entitled Involutory decomposition of groups into tw...
AbstractWe will give an algorithm for computing generators of the invariant ring for a given represe...
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN021053 / BLDSC - British Library D...
The unipotent groups are an important class of algebraic groups. We show that techniques used to com...
We study (connected) reductive subgroups G of a reductive algebraic group H, where G contains a regu...
We investigate the structure of root data by considering their decomposition as a product of a semis...
Let G be a connected reductive group over a field F. A twisted Levi subgroup G ′ of G is a reductive...
The purpose of this note is to construct a splitting field of a twisted group algebra of a finite gr...
We design and implement algorithms for computation with groups of Lie type. Algorithms for element ...
We introduce a combinatorial language which will be used to classify split semisimple linear algebra...
Abstract. The unipotent groups are an important class of algebraic groups. We show that techniques u...
This thesis contains a collection of algorithms for working with the twisted groups of Lie type know...
Around 1990, Arthur proved a local (ordinary) trace formula for real or p-adic connected reductive g...
The unipotent groups are an important class of algebraic groups. We show that techniques used to com...
Abstract: Problem Statement: Let K is the splitting field of a polynomial f(x) over a field F and αn...
.This article is subsequent to our previous one, entitled Involutory decomposition of groups into tw...
AbstractWe will give an algorithm for computing generators of the invariant ring for a given represe...
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN021053 / BLDSC - British Library D...
The unipotent groups are an important class of algebraic groups. We show that techniques used to com...
We study (connected) reductive subgroups G of a reductive algebraic group H, where G contains a regu...