AbstractWe describe a practical algorithm for computing representatives of the conjugacy classes of maximal subgroups in a finite group, together with details of its implementation for permutation groups in the MAGMA system. We also describe methods for computing complements of normal subgroups and minimal supplements of normal soluble subgroups of finite groups
We determine the minimal degree permutation representations of all finite groups with trivial solubl...
AbstractThis article describes an algorithm for computing up to conjugacy all subgroups of a finite ...
AbstractFor a maximal subgroup M of a finite group G, the normal index of M is the order of a chief ...
We describe a practical algorithm for computing representatives of the conjugacy classes of maximal ...
AbstractA new method for computing the conjugacy classes of subgroups of a finite group is described
AbstractWe describe a practical algorithm for computing representatives of the conjugacy classes of ...
This paper surveys what is currently known about the maximal subgroups of the finite simple groups. ...
We describe a practical algorithm for computing representatives of the conjugacy classes of subgroup...
AbstractWe present practical algorithms to compute subgroups such as Hall systems, system normalizer...
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...
AbstractWe describe the theory and implementation of a practical algorithm for computing a Sylow sub...
AbstractWe present practical algorithms to compute subgroups such as Hall systems, system normalizer...
We apply Voronoi's algorithm to compute representatives of the conjugacy classes of maximal finite s...
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...
AbstractThis article describes an algorithm for computing up to conjugacy all subgroups of a finite ...
AbstractFor a maximal subgroup M of a finite group G, the normal index of M is the order of a chief ...
We describe a practical algorithm for computing representatives of the conjugacy classes of maximal ...
AbstractA new method for computing the conjugacy classes of subgroups of a finite group is described
AbstractWe describe a practical algorithm for computing representatives of the conjugacy classes of ...
This paper surveys what is currently known about the maximal subgroups of the finite simple groups. ...
We describe a practical algorithm for computing representatives of the conjugacy classes of subgroup...
AbstractWe present practical algorithms to compute subgroups such as Hall systems, system normalizer...
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...
AbstractWe describe the theory and implementation of a practical algorithm for computing a Sylow sub...
AbstractWe present practical algorithms to compute subgroups such as Hall systems, system normalizer...
We apply Voronoi's algorithm to compute representatives of the conjugacy classes of maximal finite s...
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...
AbstractThis article describes an algorithm for computing up to conjugacy all subgroups of a finite ...
AbstractFor a maximal subgroup M of a finite group G, the normal index of M is the order of a chief ...