Computing with group homomorphisms

DOI10.1016/S0747-7171(08)80102-2zbMath0789.20001OpenAlexW2091969516WikidataQ56988370 ScholiaQ56988370MaRDI QIDQ1192232

Leonard H. Soicher, Cheryl E. Praeger, Charles R. Leedham-Green

Publication date: 27 September 1992

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

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

zbMATH Keywords

permutation groupshomomorphismpolycyclic groupsbase changegenerating setSchreier-Sims methodefficient algorithmic methodspolycyclicly presented groups

Mathematics Subject Classification ID

Related Items (4)

\(e\)-varieties of regular semigroups, relatively bifree objects and fully invariant congruences ⋮ CONSTRUCTING THE GROUP PRESERVING A SYSTEM OF FORMS ⋮ Representing Subgroups of Finitely Presented Groups by Quotient Subgroups ⋮ Computing the soluble radical of a permutation group.

Uses Software

• Cayley

Cites Work

• Collection from the left and other strategies
• On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing with group homomorphisms