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

Permutation -- the Permutation type

Description

Permutations are constructed from lists. To create a permutation, use the permutation method.

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

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

o1 : Permutation

Permutations must be constructed from lists consisting of only the integers $1 \dots n$. If a list contains any other elements or does not consist of the entire range, then an error is thrown.

Functions and methods returning a permutation:

Methods that use a permutation:

For the programmer

The object Permutation is a type, with ancestor classes VisibleList < BasicList < Thing.