THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.

DOCUMENTATION CENTER SEARCH

New to Mathematica? Find your learning path »

Mathematica > Mathematics and Algorithms > Discrete Mathematics > Permutations > PermutationListQ >

BUILT-IN MATHEMATICA SYMBOL

Tutorials »|See Also »|More About »

PermutationListQ

PermutationListQ[expr]
returns True if expr is a valid permutation list and False otherwise.

MORE INFORMATION

A valid permutation list is a rearrangement of the integers .

EXAMPLES

CLOSE ALL

Basic Examples (1)

A valid permutation list:

Invalid permutation lists:

A valid permutation list:

In[1]:=

Out[1]=

Invalid permutation lists:

In[2]:=

Out[2]=

In[3]:=

Out[3]=

In[4]:=

Out[4]=

Scope (2)

PermutationListQ works efficiently with large permutation lists:

The empty list is considered a permutation list of length and degree 0:

Properties & Relations (4)

RandomSample[Range[n]] always gives a valid permutation list:

A possible, but less efficient, Mathematica implementation:

Validity of permutations in cyclic form is checked with PermutationCyclesQ. A permutation list can always be obtained as a permutation of the elements in canonical order using Permute:

Ordering always returns a permutation list, even if the elements of the expression are repeated:

Neat Examples (1)

There are 409113 integer numbers up to

whose decimal digits form permutation lists. This is how the first 153 (the largest being 54321) are distributed: