![Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/5943/TOC-Subject-Sample-2021-Mathematics-Statistics.jpg"})
Abstract
In this paper an algorithm is produced, which, given a permutation group G of degree n > 3, outputs a generating set for G with at most n/2 elements.
Key Words:
Acknowledgment
The research was partially supported by G.N.S.A.G.A. (C.N.R.) and M.U.R.S.T. of Italy, research project “Group theory and applications.”
Notes
#Communicated by M. Dixon.