Constructing the Groups of a Given Cubefree Order

Version 1.18
Released 2019-09-30

This project is maintained by Heiko Dietrich

GAP Package Cubefree

The Cubefree package contains methods to construct up to isomorphism the groups of a given (reasonable) cubefree order. The main function ConstructAllCFGroups(n) constructs all groups of a given cubefree order n. The function NumberCFGroups(n) counts all groups of a cubefree order n. Furthermore, IrreducibleSubgroupsOfGL(2,q) constructs the irreducible subgroups of GL(2,q), q=p^r, p>=5 prime, up to conjugacy and RewriteAbsolutelyIrreducibleMatrixGroup(G) rewrites the absolutely irreducible matrix group G (over a finite field) over a minimal subfield.

The current version of this package is version 1.18, released on 2019-09-30. For more information, please refer to the package manual. There is also a README file.


This package requires GAP version >=4.8

The following other GAP packages are needed:


Heiko Dietrich.


Please, cite this package as

[Die19] Dietrich, H., Cubefree, Constructing the Groups of a Given Cubefree Order, Version 1.18 (2019)
(Refereed GAP package),

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


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