isWellDefined(Permutation) -- checks if a list is a valid permutation

Function: isWellDefined
Usage:

isWellDefined w

isWellDefined(w)
Inputs:
- w, a permutation,
Outputs:
- a Boolean value,

Description

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

i1 : isWellDefined permutation {1, 2, 3}

o1 = true

i2 : isWellDefined permutation {0, 1, 2}

o2 = false

i3 : isWellDefined permutation {1, 1, 2}

o3 = false

Ways to use this method:

isWellDefined(Permutation) -- checks if a list is a valid permutation

The source of this document is in /build/macaulay2-88fgJW/macaulay2-1.25.11+ds/M2/Macaulay2/packages/Permutations/Documentation/mainDocs.m2:471:0.