Implementing some algorithms of Kantor

Abstract

Kantor developed several polynomial-time algorithms for soluble permutation groups that he thought could form the basis of implementations for practical use. In this paper, we resolve the implementation difficulties for the basic algorithm which finds a normal subgroup of prime index, and algorithms for computing Sylow subgroups, testing solvability, and constructing a subnormal series.