Cubefree

GAP package Cubefree

Constructing the Groups of a Given Cubefree Order

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.

[WWW homepage]       [Source code repository]       [Issue tracker]

Author

Heiko Dietrich

Maintainer

Heiko Dietrich

Version with GAP 4.12.2

1.19    (Released 21/02/2022)

License

GPL-2.0-or-later

Status

accepted    (communicated by David Joyner (Annapolis), accepted 01/10/2007)

Dependencies

GAP version: >=4.8
Needed other packages: GrpConst (2.5), Polycyclic (2.11)

Documentation

Cubefree [HTML]     [PDF]

Download

cubefree-1.19   [.tar.gz]