scientific article; zbMATH DE number 975405
From MaRDI portal
Publication:5284082
zbMATH Open0862.20002MaRDI QIDQ5284082FDOQ5284082
Authors:
Publication date: 27 May 1997
Title of this publication is not available (Why is that?)
Recommendations
algorithmssoluble groupsorbitspermutation groupspermutation actionspoint stabilisersblock systemsSylow subgroup algorithms
Cited In (14)
- Sylow Subgroups in Parallel
- Computing the maximal subgroups of a permutation group. I
- 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}\).
- On Holt's algorithm
- Computing in permutation and matrix groups. III: Sylow subgroups
- Computing S-unit groups of orders
- Algorithm generating a Sylow-\(p\) subgroup of the group \(S_9\).
- Title not available (Why is that?)
- Computing the soluble radical of a permutation group.
- Title not available (Why is that?)
- Computing Sylow subgroups of permutation groups using homomorphic images of centralizers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing the subgroups of a permutation group
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5284082)