AbstractAlgorithms for computing the soluble radical and p-cores of a permutation group are described. The algorithms are based on homomorphic reductions, and avoid the computation of Sylow subgroups and the use of backtrack searches. Their implementation in Magma demonstrates a significant improvement over previous methods
We describe a practical algorithm for computing representatives of the conjugacy classes of maximal ...
The ability of construct the Sylow subgroups of a large finite permutation or matrix group is fundam...
Let H and K be arbitrary subgroups of a finite soluble group G. The purpose of this paper is todescr...
AbstractAlgorithms for computing the soluble radical and p-cores of a permutation group are describe...
We determine the minimal degree permutation representations of all finite groups with trivial solubl...
AbstractWe describe a significantly improved algorithm for computing the conjugacy classes of a fini...
We describe a significantly improved algorithm for computing the conjugacy classes of a finite permu...
In part A we consider three separate problems concerned with the radical of the group algebra of a f...
We describe an algorithm for computing a chief series, the soluble radical, and two other characteri...
AbstractWe describe the theory and implementation of a practical algorithm for computing a Sylow sub...
AbstractWe describe a practical algorithm for computing representatives of the conjugacy classes of ...
There is a large collection of effective algorithms for computing information about finite soluble ...
AbstractLet G=<X> and H be finite groups and let ø : X → H be a map from the generating set X of G i...
AbstractA technique for computing in permutation groups of high degree is developed. The technique u...
AbstractA new method for computing the conjugacy classes of subgroups of a finite group is described
We describe a practical algorithm for computing representatives of the conjugacy classes of maximal ...
The ability of construct the Sylow subgroups of a large finite permutation or matrix group is fundam...
Let H and K be arbitrary subgroups of a finite soluble group G. The purpose of this paper is todescr...
AbstractAlgorithms for computing the soluble radical and p-cores of a permutation group are describe...
We determine the minimal degree permutation representations of all finite groups with trivial solubl...
AbstractWe describe a significantly improved algorithm for computing the conjugacy classes of a fini...
We describe a significantly improved algorithm for computing the conjugacy classes of a finite permu...
In part A we consider three separate problems concerned with the radical of the group algebra of a f...
We describe an algorithm for computing a chief series, the soluble radical, and two other characteri...
AbstractWe describe the theory and implementation of a practical algorithm for computing a Sylow sub...
AbstractWe describe a practical algorithm for computing representatives of the conjugacy classes of ...
There is a large collection of effective algorithms for computing information about finite soluble ...
AbstractLet G=<X> and H be finite groups and let ø : X → H be a map from the generating set X of G i...
AbstractA technique for computing in permutation groups of high degree is developed. The technique u...
AbstractA new method for computing the conjugacy classes of subgroups of a finite group is described
We describe a practical algorithm for computing representatives of the conjugacy classes of maximal ...
The ability of construct the Sylow subgroups of a large finite permutation or matrix group is fundam...
Let H and K be arbitrary subgroups of a finite soluble group G. The purpose of this paper is todescr...
DOI
Add to ORKG