Effective computation with group homomorphisms

DOI10.1016/S0747-7171(85)80011-0MaRDI QIDQ1062134zbMATH OpenOpenAlexFDO

Authors 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

block permutationsCAYLEYhomomorphismsimplementationimprimitive permutation groupperformancepermutation groupsright cosets

Mathematics Subject Classification ID

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

Review text

The paper mainly discusses the handling of three homomorphisms arising very naturally for permutation groups: 1. The homomorphism of an intransitive permutation group to a transitive constituent; 2. The homomorphism of an imprimitive permutation group to a group of block permutations; 3. The homomorphism of a permutation group G to the group of permutations induced by right multiplication on the right cosets of a subgroup \(U<G.\) As to be expected, Sims' techniques for computing with permutation groups (base, strong generating set, base change) are used; task 3 obviously amounts to the construction of a coset table of U in G and again uses proposals of Sims. The author has implemented these methods within the CAYLEY system of J. Cannon and it is thus the main virtue of the paper that it reports about practically working algorithms, not just about in principle possibilities of algorithmic solutions. In fact, it would have been to the benefit of the paper if more exact information about implementation and performance would have been given, while trivial retolds of most elementary group theory (e.g. permutation representation on cosets) and repetitions of well-known algorithms (e.g. base change) could have been omitted.

Recommendations

• Computing with group homomorphisms
• Computing normalizers in permutation groups
• Computing in permutation and matrix groups. III: Sylow subgroups
• scientific article; zbMATH DE number 3989617
• scientific article; zbMATH DE number 96388

Cites work

• An Algorithm for Finding the Blocks of a Permutation Group
• Computing in Permutation and Matrix Groups I: Normal Closure, Commutator Subgroups, Series
• Computing in Permutation and Matrix Groups II: Backtrack Algorithm
• Construction of defining relators for finite groups
• scientific article; zbMATH DE number 3865540 (Why is no real title available?)
• scientific article; zbMATH DE number 3702903 (Why is no real title available?)
• scientific article; zbMATH DE number 3769860 (Why is no real title available?)
• scientific article; zbMATH DE number 3223737 (Why is no real title available?)
• scientific article; zbMATH DE number 3287776 (Why is no real title available?)
• scientific article; zbMATH DE number 3399470 (Why is no real title available?)
• Implementation and Analysis of the Todd-Coxeter Algorithm
• On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations

Cited in

(6)

• Computing Sylow subgroups of permutation groups using homomorphic images of centralizers
• Computing with group homomorphisms
• An Inductive Schema for Computing Conjugacy Classes in Permutation Groups
• A note on short cosets
• GROUP-THEORETIC APPROACH FOR SYMBOLIC TENSOR MANIPULATION
• The Canon package: a fast kernel for tensor manipulators

Describes a project that uses

Uses Software

• Cayley

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1062134)