Constructing the Groups of a Given Order

Version 2.6.5
Released 2024-01-22

This project is maintained by Bettina Eick, Max Horn

GAP Package GrpConst

The 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 non-solvable 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.

The current version of this package is version 2.6.5, released on 2024-01-22. For more information, please refer to the package manual. There is also a README file.

License: GPL-2.0-or-later


This package requires GAP version >=4.7

The following other GAP packages are needed:


Hans Ulrich Besche, Bettina Eick.


Please, cite this package as

[BEH24] Besche, H. U., Eick, B. and Horn, M., GrpConst, Constructing the Groups of a Given Order, Version 2.6.5 (2024)
(Refereed GAP package),

You can get more info by typing Cite("GrpConst"); in the gap prompt.


For bug reports, feature requests and suggestions, please use the issue tracker.