Effective computation with group homomorphisms

DOI10.1016/S0747-7171(85)80011-0zbMath0572.20001OpenAlexW2148380731MaRDI QIDQ1062134

Gregory Butler

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/s0747-7171(85)80011-0

zbMATH Keywords

performancepermutation groupshomomorphismsimplementationCAYLEYimprimitive permutation groupright cosetsblock permutations

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to group theory (20-04) General theory for finite permutation groups (20B05)

Related Items (4)

Computing Sylow subgroups of permutation groups using homomorphic images of centralizers ⋮ GROUP-THEORETIC APPROACH FOR SYMBOLIC TENSOR MANIPULATION ⋮ An Inductive Schema for Computing Conjugacy Classes in Permutation Groups ⋮ The Canon package: a fast kernel for tensor manipulators

Uses Software

• Cayley

Cites Work

• Construction of defining relators for finite groups
• Computing in Permutation and Matrix Groups I: Normal Closure, Commutator Subgroups, Series
• Computing in Permutation and Matrix Groups II: Backtrack Algorithm
• On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
• An Algorithm for Finding the Blocks of a Permutation Group
• Implementation and Analysis of the Todd-Coxeter Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Effective computation with group homomorphisms