[Cubefree] 1 Introduction

[Up] [Next] [Index]

# 1 Introduction

### Sections

1. Overview and Background

## 1.1 Overview and Background

This manual describes the Cubefree package, a GAP package for constructing groups of cubefree order; that is, groups whose order is not divisible by any third power of a prime.

The groups of squarefree order are known for a long time, since Hoelder Hol93 investigated them at the end of the 19th century. Taunt Tau55 has considered solvable groups of cubefree order, since he examined solvable groups with abelian Sylow subgroups. Cubefree groups in general are investigated firstly in Di05 and DiEi05, and this package contains the implementation of the algorithms described there.

Some general approaches to construct groups of an arbitrarily given order are described in BeEia, BeEib, and BeEiO.

The main function of this package is a method to construct up to isomorphism all groups of a given cubefree order. The algorithm behind this function is described completely in Di05 and DiEi05. It is a refinement of the methods of the GrpConst package which are described in GrpConst.

This main function needs a method to construct up to conjugacy the solvable cubefree subgroups of GL(2,p) coprime to p. These subgroups are constructed using the irreducible subgroups of GL(2,p). To determine these irreducible subgroups we use the method described in FlOB05 for which this package also contains an implementation. Alternatively, the Irredsol package Irredsol could be used for p <= 251.

The algorithm of FlOB05 requires a method to rewrite a representation. We use and implement the method of GlHo97 for this purpose.

For the construction of groups of squarefree order it is more practical to use the efficient function AllSmallGroups of the GrpConst package.

A more detailed describtion of the implemented methods can be found in Chapter 2.

Chapter Installing and Loading the Cubefree Package explains how to install and load the Cubefree package.

[Up] [Next] [Index]