GAP package Cubefree

Constructing the Groups of a Given Cubefree Order

[WWW homepage]

Author

Heiko Dietrich

Short Description

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.

Version

Current version number 1.13   (Released 10/12/2012)

Status

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

Dependencies

GAP version: >=4.3
Needed other packages: GrpConst(1.0), Polycyclic(1.0),

Online documentation

Cubefree: [ HTML] version   [ PDF] version  

Download

[README]    cubefree1.13[.tar.gz  (316K)]   [.tar.bz2  (304K)]   [-win.zip  (340K)]   [.zip  (340K)]  

Contact

Heiko Dietrich
Address:
School of Mathematical SciencesMonash University
VIC 3800
Melbourne, Australia
WWW: http://users.monash.edu.au/~heikod/
E-mail: heiko.dietrich@monash.edu