A strong generating test and short presentations for permutation groups
type: Item
instance of: scholarly article
title: A strong generating test and short presentations for permutation groups
zbMATH Open document ID: 0790.20006
DOI: 10.1016/S0747-7171(08)80099-5
author: Gene Cooperman
author: Larry Finkelstein
published in: Journal of Symbolic Computation
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 20B40
Mathematics Subject Classification ID: 20F05
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 20-04
zbMATH DE Number: 60661
zbMATH Keywords: group membership problem
zbMATH Keywords: permutation groups
zbMATH Keywords: computational group theory
zbMATH Keywords: set of generators
zbMATH Keywords: strong generating set
zbMATH Keywords: algorithms
describes a project that uses: GAP
describes a project that uses: Cayley
MaRDI profile type: Publication
cites work: Computing in Permutation and Matrix Groups I: Normal Closure, Commutator Subgroups, Series
cites work: Construction of defining relators for finite groups
cites work: Q3333220
cites work: Q3832741
cites work: A compact representation for permutation groups
cites work: On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
cites work: Q5617749
description: scientific article; zbMATH DE number 60661