We describe an algorithm for computing a chief series, the soluble radical, and two other characteristic subgroups of a matrix group over a finite field, which is intended for matrix groups that are too large for the use of base and strong generating set methods. The algorithm has been implemented in Magma by the second author
AbstractWe present a new algorithm to decide finiteness of matrix groups defined over a field of pos...
We describe a practical algorithm for computing representatives of the conjugacy classes of subgroup...
We describe a practical algorithm for computing representatives of the conjugacy classes of subgroup...
Existing algorithms have only limited ability to answer structural questions about subgroups G of GL...
AbstractAlgorithms for computing the soluble radical and p-cores of a permutation group are describe...
AbstractAlgorithms for computing the soluble radical and p-cores of a permutation group are describe...
AbstractWe describe the theory and implementation of practical algorithms for computing chief and co...
We describe a practical algorithm for computing representatives of the conjugacy classes of maximal ...
We describe the theory and implementation of practical algorithms for computing chief and compositio...
We determine the minimal degree permutation representations of all finite groups with trivial solubl...
Let G be a finite soluble group and r a rational prime or zero. Let Z be a central cyclicsubgroup of...
AbstractWe describe a significantly improved algorithm for computing the conjugacy classes of a fini...
By a group we will mean a finite soluble group. It is an interesting fact, (Pardoe [1]), that the su...
By a group we will mean a finite soluble group. It is an interesting fact, (Pardoe [1]), that the su...
We describe a significantly improved algorithm for computing the conjugacy classes of a finite permu...
AbstractWe present a new algorithm to decide finiteness of matrix groups defined over a field of pos...
We describe a practical algorithm for computing representatives of the conjugacy classes of subgroup...
We describe a practical algorithm for computing representatives of the conjugacy classes of subgroup...
Existing algorithms have only limited ability to answer structural questions about subgroups G of GL...
AbstractAlgorithms for computing the soluble radical and p-cores of a permutation group are describe...
AbstractAlgorithms for computing the soluble radical and p-cores of a permutation group are describe...
AbstractWe describe the theory and implementation of practical algorithms for computing chief and co...
We describe a practical algorithm for computing representatives of the conjugacy classes of maximal ...
We describe the theory and implementation of practical algorithms for computing chief and compositio...
We determine the minimal degree permutation representations of all finite groups with trivial solubl...
Let G be a finite soluble group and r a rational prime or zero. Let Z be a central cyclicsubgroup of...
AbstractWe describe a significantly improved algorithm for computing the conjugacy classes of a fini...
By a group we will mean a finite soluble group. It is an interesting fact, (Pardoe [1]), that the su...
By a group we will mean a finite soluble group. It is an interesting fact, (Pardoe [1]), that the su...
We describe a significantly improved algorithm for computing the conjugacy classes of a finite permu...
AbstractWe present a new algorithm to decide finiteness of matrix groups defined over a field of pos...
We describe a practical algorithm for computing representatives of the conjugacy classes of subgroup...
We describe a practical algorithm for computing representatives of the conjugacy classes of subgroup...