As already mentioned in the introduction of the chapter, groups are
domains. Thus all set theoretic functions, for example Intersection
and Size can be applied to groups. This and the following sections
give further comments on the definition and implementations of those
functions for groups. All set theoretic functions not mentioned here not
treated specially for groups. The last section describes the format of
the records that describe groups (see Group Records).
Elements( G )
The elements of a group G are constructed using a Dimino algorithm. See Elements for Groups.
IsSubset( G, H )
If G and H are groups then IsSubset tests whether the generators of
H are elements of G. Otherwise DomainOps.IsSubset is used.
Intersection( G, H )
The intersection of groups G and H is computed using an orbit algorithm. See Intersection for Groups.
GAP 3.4.4