Constructing the Groups of a Given Cubefree Order
Version 1.20
Released 2024-11-01
This project is maintained by Heiko Dietrich
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.20, released on 2024-11-01. 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.8
The following other GAP packages are needed:
Please, cite this package as
[Die24] Dietrich, H.,
Cubefree, Constructing the Groups of a Given Cubefree Order,
Version 1.20
(2024)
(GAP package),
https://gap-packages.github.io/cubefree/.
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.