represents the group generated by multiplication of the permutations perm1,…,permn.
- The generating permutations permi must be given in disjoint cyclic form, with head Cycles.
- Properties of a permutation group are typically computed by constructing a strong generating set representation of the group using the Schreier–Sims algorithm.
Examplesopen allclose all
Introduced in 2010