Journal of Natural Sciences Research
CONSTRUCTION OF TRANSITIVE SUPERSOLVABLE PERMUTATION GROUPS
Abstract
In this paper, we used wreath products of two permutation groups in constructing transitive supersolvable permutation groups. We verified these groups using some groups theoretical concepts and also validate our work using a standard program; GAP (Groups Algorithm and Programming).
To list your conference here. Please contact the administrator of this platform.
Paper submission email: JNSR@iiste.org
ISSN (Paper)2224-3186 ISSN (Online)2225-0921
Please add our address "contact@iiste.org" into your email contact list.
This journal follows ISO 9001 management standard and licensed under a Creative Commons Attribution 3.0 License.
Copyright © www.iiste.org