Computing the maximal subgroups of a permutation group. I. (English) Zbl 1003.20003
Kantor, William M. (ed.) et al., Groups and computation III. Proceedings of the international conference at the Ohio State University, Columbus, OH, USA, June 15-19, 1999. Berlin: Walter de Gruyter. Ohio State Univ. Math. Res. Inst. Publ. 8, 155-168 (2001).
Authors’ abstract: We introduce a new algorithm to compute up to conjugacy the maximal subgroups of a finite permutation group. Our method uses a “hybrid group” approach; that is, we first compute a large solvable normal subgroup of the given permutation group and then use this to split the computation in various parts.
For the entire collection see [Zbl 0959.00030].
For the entire collection see [Zbl 0959.00030].
Reviewer: Alexander Hulpke (Fort Collins)
MSC:
| 20B40 | Computational methods (permutation groups) (MSC2010) |
| 20-04 | Software, source code, etc. for problems pertaining to group theory |
| 20E28 | Maximal subgroups |
| 68W30 | Symbolic computation and algebraic computation |
