Macaulay2 » Documentation
Packages » Permutations :: cycleType

next | previous | forward | backward | up | index | toc

cycleType -- computes the cycle type of a permutation

Usage:

cycleType w
Inputs:
- w, a permutation,
Outputs:
- a sequence,

Description

A permutation's cycle type is the sequence consisting of the lengths of the cycles in its cycle decomposition, listed in weakly decreasing order.

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

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

o1 : Permutation

i2 : cycleType p

o2 = (3, 2)

o2 : Sequence

See also

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

Ways to use cycleType:

cycleType(Permutation)

For the programmer

The object cycleType is a method function.

The source of this document is in Permutations/Documentation/mainDocs.m2:130:0.