gives a disjoint cycle representation of permutation perm.
- The input permutation perm can be given as a permutation list or in disjoint cyclic form.
- A permutation list is a reordering of the consecutive integers .
- PermutationCycles[perm] returns an expression with head Cycles containing a list of cycles, each of the form , which represents the mapping of the to . The last point is mapped to .
- PermutationCycles[perm, h] returns an expression with head h.
New in 8 | Last modified in 9