Computing the order of a solvable permutation group
If a group G of permutations is given by a set of generators usually the first step for its investigation is the determination of a base and a strong generating system by one of the versions of the Schreier-Sims method [cf. \textit{J. S. Leon}; Math. Comput. 35, 941-974 (1980; Zbl 0444.20001)]. In this article the author describes a new method, which works if G is soluble (it runs into an endless cycle if G is not soluble). The method is not only considerably faster in many cases tested, but it also constructs at the same time a ``polycyclic generating sequence, i.e. a sequence of generators \(y_ 1,...,y_ t\) of G such that with \(H_ i=<y_ i,...,y_ t>\) one has \(H_ i\triangleleft H_{i-1}\) for \(1<i\leq t\) and \(H_ 1=G\). There are a number of computational problems, e.g. the determination of the conjugacy classes, for which rather efficient solutions are known for soluble groups using such a polycyclic generating sequence, while they are notoriously difficult using only base and strong generating set. Like other computational methods for soluble groups this one exploits the fact that an orbit of a normal subgroup of a group G is a block for G.
- scientific article; zbMATH DE number 3989617
- Fast Management of Permutation Groups I
- scientific article; zbMATH DE number 4057754
- scientific article; zbMATH DE number 77937
- Computing normalizers in permutation groups
- Efficient representation of perm groups
- Conjugacy classes in finite permutation groups via homomorphic images
- scientific article; zbMATH DE number 4108985
- Minimum bases for permutation groups: The greedy approximation
- Fast Monte Carlo algorithms for permutation groups
- A compact representation for permutation groups
- scientific article; zbMATH DE number 4057754 (Why is no real title available?)
- On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
- On the length of subgroup chains in the symmetric group
- The solvable length of a solvable linear group
- Normalizers of \(p\)-subgroups in finite groups.
- Computing Sylow subgroups of permutation groups using homomorphic images of centralizers
- An algorithm for solving the factorization problem in permutation groups
- Computing a set of generators of minimal cardinality in a solvable group
- Computing subgroups by exhibition in finite solvable groups
- Orbit-stabilizer problems and computing normalizers for polycyclic groups.
- Computing conjugacy classes of elements in matrix groups.
- Constructing transitive permutation groups.
- Computing polycyclic presentations for polycyclic rational matrix groups.
- Computing the soluble radical of a permutation group.
- Some remarks on the computation of complements and normalizers in soluble groups
- scientific article; zbMATH DE number 4019302 (Why is no real title available?)
- An Inductive Schema for Computing Conjugacy Classes in Permutation Groups
- Conjugacy classes in finite permutation groups via homomorphic images
- CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPS
- The Solvable Primitive Permutation Groups of Degree at Most 6560
- Computing the subgroups of a permutation group
This page was built for publication: Computing the order of a solvable permutation group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q913945)
