A strong generating test and short presentations for permutation groups

DOI10.1016/S0747-7171(08)80099-5zbMath0790.20006MaRDI QIDQ1192229

Larry Finkelstein, Gene Cooperman

Publication date: 27 September 1992

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

zbMATH Keywords

algorithmspermutation groupscomputational group theoryset of generatorsstrong generating setgroup membership problem

Mathematics Subject Classification ID

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

Related Items (2)

New methods for using Cayley graphs in interconnection networks ⋮ Distance in cayley graphs on permutation groups generated by $k$ $m$-Cycles

Uses Software

• GAP
• Cayley

Cites Work

• Construction of defining relators for finite groups
• Computing in Permutation and Matrix Groups I: Normal Closure, Commutator Subgroups, Series
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A strong generating test and short presentations for permutation groups