Macaulay2 » Documentation
Packages » Permutations :: cycleDecomposition
next | previous | forward | backward | up | index | toc

cycleDecomposition -- computes the decomposition of a permutation as a product of disjoint cycles

Synopsis

Description

Every permutation can be decomposed into a product of disjoint cycles. We follow the convention to write the decomposition in its "canonical" or "standard" form. So

1. each cycle is listed with its largest element first, and
2. the cycles are listed in increasing order.

i1 : p = permutation {3,1,2,5,4}

o1 = Permutation{3, 1, 2, 5, 4}

o1 : Permutation
i2 : cycleDecomposition p

o2 = {(3, 2, 1), (5, 4)}

o2 : List

See also

Ways to use cycleDecomposition:

For the programmer

The object cycleDecomposition is a method function.