My diploma thesis is about the groups of cubefree order and under the supervision of Bettina Eick I have implemented an algorithm to construct all groups of a given cubefree order up to isomorphism. This algorithm is based on the Frattini extension method specialized to the cubefree case. It uses some methods from the GAP Package GrpConst.
Abilities:
The package can construct all groups of a given reasonable cubefree order up to isomorphism. As needed in this construction, this package contains also a routine computing up to conjugacy all irreducible subgroups of GL(2,q), q a prime-power p^r with p>3, and a routine to possibly rewrite an absolutely irreducible matrix subgroup G of GL(2,q) over the subfield of GF(q) generated by all matrix traces of the elements of G. Please see the documentation for more information and a detailed description.
Requirements:
The package is written for GAP version 4.4. It requires the package GrpConst which is loaded automatically when loading Cubefree. Also, some functionality of Polycyclic is used.
Installation:
The installation follows standard GAP rules. So the normal way to install is to unpack the archive in the `pkg' directory, which will create a subdirectory `cubefree'.
Theoretical Background and further information
Please read the package documentation for references and further details. The main functions of the package are also listed in README.
Download package: cubefree1.08.tar.gz
Download package-info: PackageInfo.g
Download README: README