This online help node and the nodes below it present the functions designed for computing with finitely-presented groups (fp-groups for short). The functions considered here are designed for doing what is sometimes referred to as combinatorial group theory.

Subsections

• Overview of Facilities
• The Construction of Finitely Presented Groups

The facilities provided for fp-groups fall into a number of natural groupings:

• Combinatorial operations on words;
• Calculations with subgroups having finite index in a group, where the subgroups are represented by coset tables;
• Index determination and subgroup building based on the Todd-Coxeter procedure;
• The construction of all subgroups having index less than some (small) specified bound;
• The construction of various types of quotient of an fp-group: abelian quotient, p-quotient, nilpotent quotient and soluble quotient (yet to be installed);
• The use of rewriting processes for constructing presentations of subgroups;
• The simplification of words with respect to a given set of relations.

The construction of fp-groups utilizes the fact that every group is a quotient of some free group. Thus, two general fp-group constructors are provided: FreeGroup(n) which constructs a free group of rank n, and quo< F | R > which constructs the quotient of group F by the normal subgroup defined by the relations R.

The naming of generators presents special difficulties since they are not always used in a consistent manner in the mathematical literature. A generator name is used in two distinct ways. Firstly, it plays the role of a variable having as its value a designated generator of G. Secondly, it appears as the symbol designating the specified generator whenever elements of the group are output. These two uses are separated in the Magma semantics.

In Magma, a standard indexing notation is provided for referencing the generators of any fp-group G. Thus, G.i denotes the i-th generator of G. However, users may give individual names to the generators by means of the generator-assignment. Suppose that the group G is defined on r generators. Then if the right hand side of the following statement creates a group, the special assignment

> G< v_1, ..., v_r> := construction;

> G := construction;
>    v_1 := G.1;
>    ...
>    v_r := G.r;