  
  
                                   [1X Cubefree [101X
  
  
              [1X Constructing the Groups of a Given Cubefree Order [101X
  
  
                                      1.22
  
  
                                 6 August 2026
  
  
                                 Heiko Dietrich
  
  
  
  Heiko Dietrich
      Email:    [7Xmailto:heiko.dietrich@monash.edu[107X
      Homepage: [7Xhttp://users.monash.edu.au/~heikod/[107X
      Address:  [33X[0;14YSchool of Mathematical SciencesMonash University[133X
                [33X[0;14YVIC 3800[133X
                [33X[0;14YMelbourne, Australia[133X
  
  
  
  -------------------------------------------------------
  
  
  [1XContents (Cubefree)[101X
  
  1 [33X[0;0YIntroduction[133X
    1.1 [33X[0;0YOverview[133X
    1.2 [33X[0;0YTheoretical background[133X
  2 [33X[0;0YFunctionality of the Cubefree package[133X
    2.1 [33X[0;0YNew methods[133X
      2.1-1 ConstructAllCFGroups
      2.1-2 ConstructAllCFSolvableGroups
      2.1-3 ConstructAllCFNilpotentGroups
      2.1-4 ConstructAllCFSimpleGroups
      2.1-5 ConstructAllCFFrattiniFreeGroups
      2.1-6 IsomorphismCubefreeGroups
      2.1-7 IsIsomorphicCubefreeGroups
      2.1-8 NumberCFGroups
      2.1-9 NumberCFSolvableGroups
      2.1-10 CountAllCFGroupsUpTo
      2.1-11 CubefreeOrderInfo
      2.1-12 CubefreeTestOrder
      2.1-13 IsCubeFreeInt
      2.1-14 IsSquareFreeInt
      2.1-15 IrreducibleSubgroupsOfGL
      2.1-16 RewriteAbsolutelyIrreducibleMatrixGroup
    2.2 [33X[0;0YComments on the implementation[133X
    2.3 [33X[0;0YComments on the efficiency[133X
    2.4 [33X[0;0YAn example session[133X
    2.5 [33X[0;0YAccuracy check[133X
  3 [33X[0;0YInstalling and loading the Cubefree package[133X
    3.1 [33X[0;0YInstalling the Cubefree package[133X
    3.2 [33X[0;0YLoading the Cubefree package[133X
  
  
  [32X
