Computing the order of a solvable permutation group

DOI10.1016/S0747-7171(08)80083-1MaRDI QIDQ913945zbMATH OpenOpenAlexFDO

Authors Charles C. Sims

Publication date 1990

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0747-7171(08)80083-1

zbMATH Keywords

permutationsconjugacy classesgeneratorssoluble groupspolycyclic generating sequenceSchreier-Sims methodstrong generating system

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) General theory for finite permutation groups (20B05) Generators, relations, and presentations of groups (20F05) Solvable groups, supersolvable groups (20F16) Software, source code, etc. for problems pertaining to group theory (20-04)

Recommendations

• 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

Cites work

• scientific article; zbMATH DE number 4057754 (Why is no real title available?)
• A compact representation for permutation groups
• 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

Cited in

(16)

• Computing conjugacy classes of elements in matrix groups.
• Computing subgroups by exhibition in finite solvable groups
• CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPS
• Some remarks on the computation of complements and normalizers in soluble groups
• An Inductive Schema for Computing Conjugacy Classes in Permutation Groups
• Orbit-stabilizer problems and computing normalizers for polycyclic groups.
• scientific article; zbMATH DE number 4019302 (Why is no real title available?)
• The Solvable Primitive Permutation Groups of Degree at Most 6560
• An algorithm for solving the factorization problem in permutation groups
• Computing the soluble radical of a permutation group.
• Normalizers of \(p\)-subgroups in finite groups.
• Conjugacy classes in finite permutation groups via homomorphic images
• Constructing transitive permutation groups.
• Computing polycyclic presentations for polycyclic rational matrix groups.
• Computing Sylow subgroups of permutation groups using homomorphic images of centralizers
• 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)