## dedicated to john cossey on the occasion of his 60th birthday An extension of the well-known Frobenius criterion of p-nilpotence in groups with modular Sylow p-subgroups is proved in the paper. This result is useful to get information about the classes of groups in which every subnormal subgrou
Computing Sylow Subgroups in Permutation Groups
โ Scribed by JOHN CANNON; BRUCE COX; DEREK HOLT
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 371 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
โฆ Synopsis
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.
๐ SIMILAR VOLUMES
A new method for computing the conjugacy classes of subgroups of a finite group is described.
Sylow subgroups are fundamental in the design of asymptotically efficient group-theoretic algorithms, just as they have been in the study of the structure of ลฝ . finite groups. We present efficient parallel NC algorithms for finding and conjugating Sylow subgroups of permutation groups, as well as f
to helmut wielandt on the occasion of his 90th birthday We investigate the finite primitive permutation groups G which have a transitive subgroup containing no nontrivial subnormal subgroup of G. The conclusion is that such primitive groups are rather rare, and that their existence is intimately co