Computing in permutation and matrix groups. III: Sylow subgroups
algorithmsbacktrack searchCAYLEYcentralizerscomputing Sylow p-subgroupscyclic extensionspermutation groups
Software, source code, etc. for problems pertaining to group theory (20-04) General theory for finite permutation groups (20B05) Subgroups of symmetric groups (20B35) Sylow subgroups, Sylow properties, (pi)-groups, (pi)-structure (20D20) Series and lattices of subgroups (20D30) Generators, relations, and presentations of groups (20F05) Symbolic computation and algebraic computation (68W30)
The contents of the paper is best described by a quotation from its conclusion: The paper describes ``an algorithm for computing Sylow p- subgroups which performs successive cyclic extensions in a sequence of centralizers. In the case of a group of permutations or matrices over a finite field, the next extending element is found using a backtrack search of the current centralizer. The algorithm is efficient enough to construct Sylow p-subgroups of order up to \(p^{10}\), for small primes p. In the case of permutation groups, the algorithm can often handle groups of degree up to 500. Possible competitive procedures for the computation of Sylow subgroups of permutation groups will be described in a forthcoming paper of the authors in which they use natural homomorphisms (such as constituent- and block-homomorphisms) and in a forthcoming paper of D. Holt, who uses normalizers instead of centralizers, having designed improved methods for the computation of normalizers. The present paper is the third in a series [Part II, cf. Math. Comput. 39, 671-680 (1983; Zbl 0552.20003)] in which the authors report on algorithms for the investigation of permutation groups drawing from their long experience with this topic gained in the construction of the CAYLEY system. The paper gives detailed algorithm descriptions and informative timings; moreover it has the special merit of discussing not only those thoughts in the design of the algorithms that led to success, but also some of those that looked promising but had to be discarded.
- A computer program for the calculation of a covering group of a finite group
- An interpretation of the cohomology groups \(H^ n(G,M)\)
- Computing in Permutation and Matrix Groups I: Normal Closure, Commutator Subgroups, Series
- Computing in Permutation and Matrix Groups II: Backtrack Algorithm
- Computing normalizers in permutation groups
- scientific article; zbMATH DE number 3137403 (Why is no real title available?)
- scientific article; zbMATH DE number 3865540 (Why is no real title available?)
- scientific article; zbMATH DE number 3871623 (Why is no real title available?)
- scientific article; zbMATH DE number 3922932 (Why is no real title available?)
- scientific article; zbMATH DE number 3702903 (Why is no real title available?)
- scientific article; zbMATH DE number 3204712 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- scientific article; zbMATH DE number 3399470 (Why is no real title available?)
- scientific article; zbMATH DE number 3399496 (Why is no real title available?)
- Implementation and Analysis of the Todd-Coxeter Algorithm
- Intersecting subgroups of finite soluble groups
- On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
- Polynomial-time algorithms for finding elements of prime order and sylow subgroups
- Polynomial-time versions of Sylow's theorem
- The computation of normalizers in permutation groups
- The mechanical computation of first and second cohomology groups
- Effective computation with group homomorphisms
- Computing Sylow subgroups of permutation groups using homomorphic images of centralizers
- The computation of normalizers in permutation groups
- On Holt's algorithm
- Computing Sylow subgroups in permutation groups
- Generation of finite groups with cyclic Sylow subgroups
- An algorithm for the Thompson subgroup of a p-group.
- scientific article; zbMATH DE number 4134288 (Why is no real title available?)
- scientific article; zbMATH DE number 3863443 (Why is no real title available?)
- scientific article; zbMATH DE number 3871627 (Why is no real title available?)
- Computing normalizers in permutation groups
- scientific article; zbMATH DE number 4136201 (Why is no real title available?)
- scientific article; zbMATH DE number 3991751 (Why is no real title available?)
- scientific article; zbMATH DE number 1263367 (Why is no real title available?)
- scientific article; zbMATH DE number 975405 (Why is no real title available?)
- Algorithm for calculation in Sylow 2-subgroups of alternating groups using the computer algebra system GAP
- Search algorithm of the number of unfixed points of permutations from Sylow 2-subgroups \(Syl_2(S_{2^n})\) of symmetric groups \(S_{2^n}\).
- A proof of Holt's algorithm
This page was built for publication: Computing in permutation and matrix groups. III: Sylow subgroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123257)
