GAP

Main BranchesDownloads Installation Overview Data Libraries Packages Documentation Contacts FAQ GAP 3 

Find us on GitHubNavigation Tree

GAP package GrpConstConstructing the Groups of a Given OrderAuthorsHans Ulrich Besche, Bettina Eick MaintainersShort DescriptionThe GrpConst package contains methods to construct up to isomorphism the groups of a given order. The FrattiniExtensionMethod constructs all soluble groups of a given order. On request it gives only those that are (or are not) nilpotent or supersolvable or that do (or do not) have normal Sylow subgroups for some given set of primes. The CyclicSplitExtensionMethod constructs all groups having a normal Sylow subgroup for orders of the type p^n *q. The method relies on the availability of a list of all groups of order p^n. The UpwardsExtensions algorithm takes as input a permutation group G and a positive integer s and returns a list of permutation groups, one for each extension of G by a soluble group of order a divisor of s. This method can used to construct the nonsolvable groups of a given order by taking the perfect groups of certain orders as input for G. The programs in this package have been used to construct a large part of the Small Groups library. VersionCurrent version shipped with GAP: 2.6.2 (Released 28/01/2020) LicenseGPL2.0orlater Statusaccepted (communicated by Charles Wright (Eugene), accepted 01/07/1999) Dependencies GAP version: >=4.7 Online documentationGrpConst: [ HTML] version [ PDF] version Download[README] grpconst2.6.2 [.tar.gz ] [.tar.bz2 ] [win.zip ] [.zip ] Source code repositorygit : https://github.com/gappackages/grpconst Issue tracker 

The GAP Group 