Computing Sylow Subgroups in Permutation Groups

We describe the theory and implementation of a practical algorithm for computing a Sylow subgroup of a permutation group and for finding an element that conjugates one Sylow subgroup to another. The performance of the current implementations in the Magma system represents a significant improvement on previous implementations for many important classes of examples and generally extends the range of realistic applicability to groups of much larger degrees than before.