Given the permutation group G, construct the quotient group Q = G/N, where N is the normal closure of the subgroup of G generated by the elements specified by L. The clause L is a list of one or more items of the following types:Each element or group specified by the list must belong to the same generic permutation group. The function returns
- A sequence of n integers defining a permutation of G;
- A set or sequence of sequences of type (a);
- An element of G;
- A set or sequence of elements of G;
- A subgroup of G;
- A set or sequence of subgroups of G.
Currently, the quotient group is constructed in its regular representation, so that the application of this operator is restricted to the case where the index of N in G is a few thousand. The generators of the quotient are images of the generators of G.
- the quotient group Q, and
- the natural homomorphism f: G -> Q.
Given a normal subgroup N of the permutation group G, construct the quotient of G by N. Currently, the quotient group is constructed in its regular representation, so that the application of this operator is restricted to the case where the index of N in G is a few thousand.
> Q, f := quo< Sym(4) | (1,2)(3,4), (1,3)(2,4) >;
> Q;
Permutation group Q acting on a set of cardinality 6
Order = 6 = 2 * 3
(1, 2)(3, 5)(4, 6)
(1, 3)(2, 4)(5, 6)
A number of standard quotients may be constructed. The method first constructs a presentation for the permutation group and then applies the appropriate fp-group algorithm.
The maximal abelian quotient G/G^prime of the group G as GrpAb (cf. Chapter ABELIAN GROUPS). The natural epimorphism pi:G -> G/G^prime is returned as second value.
The maximal p-elementary abelian quotient Q of the group G as GrpAb (cf. Chapter ABELIAN GROUPS). The natural epimorphism pi:G -> Q is returned as second value.
Given a permutation group G, a prime p and a positive integer c, construct a pc-presentation for the largest p-quotient P of G having lower exponent-p class at most c. If c is given as 0, then the limit 127 is placed on the class.The function also returns the natural homomorphism pi from G to P, a sequence S describing the definitions of the pc-generators of P and a flag indicating whether P is the maximal p-quotient of G.
The k-th element of S is a sequence of two integers, describing the definition of the k-th pc-generator P.k of P as follows.
- If S[k] = [0, r], then P.k is defined via the image of G.r under pi.
- If S[k] = [r, 0], then P.k is defined via the power relation for P.r.
- If S[k] = [r, s], then P.k is defined via the conjugate relation involving P.r^(P.s).
This function returns the class c nilpotent quotient of G, together with the epimorphism pi from G onto this quotient.
The function returns the largest soluble quotient S of the permutation group G together with the epimorphism pi:G -> S.
> G := WreathProduct( Sym(6), DihedralGroup(6));
> #G;
1671768834048000000
> SQ, phi := SolubleQuotient(G);
SQ;
GrpPC : SQ of order 768 = 2^8 * 3
PC-Relations:
SQ.1^2 = SQ.5,
SQ.2^2 = Id(SQ),
SQ.3^2 = Id(SQ),
SQ.4^2 = Id(SQ),
SQ.5^3 = Id(SQ),
SQ.6^2 = Id(SQ),
SQ.7^2 = Id(SQ),
SQ.8^2 = Id(SQ),
SQ.9^2 = Id(SQ),
SQ.2^SQ.1 = SQ.2 * SQ.5,
SQ.3^SQ.1 = SQ.3 * SQ.4 * SQ.6 * SQ.8,
SQ.4^SQ.1 = SQ.4 * SQ.9,
SQ.4^SQ.2 = SQ.4 * SQ.6 * SQ.7 * SQ.8,
SQ.5^SQ.2 = SQ.5^2,
SQ.5^SQ.3 = SQ.5 * SQ.7,
SQ.5^SQ.4 = SQ.5 * SQ.6 * SQ.8,
SQ.6^SQ.1 = SQ.6 * SQ.8,
SQ.6^SQ.2 = SQ.7 * SQ.8,
SQ.6^SQ.5 = SQ.6 * SQ.7 * SQ.8 * SQ.9,
SQ.7^SQ.1 = SQ.8,
SQ.7^SQ.2 = SQ.9,
SQ.7^SQ.5 = SQ.7 * SQ.9,
SQ.8^SQ.1 = SQ.7 * SQ.9,
SQ.8^SQ.2 = SQ.6 * SQ.9,
SQ.8^SQ.5 = SQ.6 * SQ.9,
SQ.9^SQ.1 = SQ.6 * SQ.8 * SQ.9,
SQ.9^SQ.2 = SQ.7,
SQ.9^SQ.5 = SQ.7