Computing the soluble radical of a permutation group

Algorithms 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.