The CayleyTableGroup command creates a Cayley table group data structure. Cayley table group implementations are reasonably efficient for small group sizes, but they require listing all elements of a group. When you want to study a group $G$, and if it is possible to find a permutation representation of $G$ of degree substantially smaller than the order of $G$, then that permutation representation will typically be more efficient to work with.

The first calling sequence above creates a group given by a pre-computed Cayley table. The single required argument is the Cayley table (or multiplication table): an $n$ by $n$ Matrix or Array, $m$, describing the group with $n$ elements, where the $\left[i\,j\right]$ entry contains the positive integer $k$ such that the product of the $i$th and $j$th group elements is the $k$th group element.

You can supply a supergroup option to mark this group as a subgroup of another Cayley table group. Typically you will want to supply the embedding that maps elements of this group into its supergroup. This is given using the embedding option. Its value is a table mapping the elements of the current group (positive integers from $1$ to $n$) to elements of the supergroup (positive integers from $1$ to the size of the supergroup).  If no supergroup is specified or the user specifies $\mathrm{supergroup}=\mathrm{undefined}$, then Maple does not mark the resulting group as a subgroup of any particular group.

The $\mathrm{labels}$ option can be used to give names for the elements. These can be retrieved using the command GroupTheory[Labels]. (For other types of groups, labels are only defined for their generators. This is consistent, because the list of generators of a Cayley table group is by default all its elements.)

If the option $\mathrm{check}=\mathrm{true}$ is given, then this calling sequence uses the command Magma[IsGroup] to test whether the given table describes a group. Supplying just the name $\mathrm{check}$ is equivalent to $\mathrm{check}=\mathrm{true}$. If the option $\mathrm{check}=\mathrm{false}$ is given, the test is not performed. In this case, if m does in fact not describe the Cayley table of a group, further results will be unpredictable. The default is $\mathrm{check}=\mathrm{true}$.

The second calling sequence takes a group data structure constructed by the GroupTheory package and converts it to a Cayley table group. The labels for the elements of the Cayley table group are the corresponding elements of the argument $\mathrm{gp}$ to CayleyTableGroup.

$\mathrm{with}\left(\mathrm{GroupTheory}\right)\:$

$M≔⟨⟨1\left|2\right|3|4⟩\,⟨2\left|1\right|4|3⟩\,⟨3\left|4\right|1|2⟩\,⟨4\left|3\right|2|1⟩⟩$

$M≔\left[\begin{array}{cccc}1& 2& 3& 4\\ 2& 1& 4& 3\\ 3& 4& 1& 2\\ 4& 3& 2& 1\end{array}\right]$

$\mathrm{g1}≔\mathrm{CayleyTableGroup}\left(M\,\mathrm{labels}=\left[a\,b\,c\,d\right]\right)$

$\mathrm{g1}≔\mathrm{<\; a\; Cayley\; table\; group\; with\; 4\; elements\; >}$

$\mathrm{g2}≔\mathrm{CayleyTableGroup}\left(M\&comma;\mathrm{labels}=\left[a\&comma;b\&comma;c\&comma;d\right]\&comma;\mathrm{check}=\mathrm{false}\right)$

$\mathrm{g2}≔\mathrm{<\; a\; Cayley\; table\; group\; with\; 4\; elements\; >}$

$\mathrm{g3}≔\mathrm{AlternatingGroup}\left(4\right)$

$\mathrm{g3}≔{\mathbf{A}}_4$

$\mathrm{g4}≔\mathrm{CayleyTableGroup}\left(\mathrm{g3}\right)$

$\mathrm{g4}≔\mathrm{<\; a\; Cayley\; table\; group\; with\; 12\; elements\; >}$

The GroupTheory[CayleyTableGroup] command was introduced in Maple 17.

For more information on Maple 17 changes, see Updates in Maple 17.