Permutation Lists

A possible way of working with permutations is by relating them to the reorderings of the elements of a list. This is the standard point of view in the combinatorial approach to permutations, which shifts the emphasis to the permuted expressions, rather than the permutations themselves. This has always been an implicit interpretation of permutation lists in the Wolfram Language, reorderings of Range[n] for some non-negative integer n. Several standard functions in the Wolfram Language allow basic manipulation of permutation lists, and now other functions have been added to work with permutation lists and convert them into their disjoint cyclic form.
validate a list of integers as reordering of {1,,n}
points moved by a permutation
Basic functionality for permutation lists.
This is a list of 10 integers:
Check that it is indeed a reordering of consecutive integers starting at 1:
The support of the permutation list is the list of points not at their natural positions:
If the list of integers is sorted, its support is empty:
Permutation lists can be converted into disjoint cyclic form and vice versa. This is similar to the functions ToCycles and FromCycles in the Combinatorica package in improved form.
convert permutation into disjoint cyclic form
convert permutation into a permutation list
Conversion to and from cyclic form.
Take a permutation list:
Construct the cyclic form of the permutation list. By default, singletons are removed:
Choosing any other head keeps singletons:
Compare with the following:
Vice versa, you can convert a cyclic object into a permutation list of any length:
By default, the length is taken to be the largest integer present in the cycles:
The same function allows changing the length of a permutation list without changing its support:
Permutation lists can be used to permute the parts of an expression with the functions Part and Permute. There are two differences: First, depending on the length of the permutation list, Part may change the number of arguments of the expression, but Permute never changes it. Second, Part and Permute interpret the permutation in different ways.
return a subexpression, possibly reordering its elements
permute elements of an expression as given by a permutation
compute the permutation that takes the first list to the second
Permuting expressions.
Take an expression and a permutation list:
Permute reorders the elements, changing their positions: the first element goes to fourth place etc. The number of elements does not change:
Part extracts a subexpression, possibly changing the length of the result. In order to obtain an equivalent result the permutation list needs to be inverted:
Permute also accepts cyclic notation in its second argument:
It is also possible to use a permutation group, interpreted as a set of permutations:
The action of Permute can be reverted with FindPermutation, which returns cyclic notation:
If you reverse the arguments, you obtain the inverse permutation:
It is possible to perform permutation operations with permutation lists, using standard commands of the Wolfram Language.
permutation list product
permutation list inverse
identity permutation list
pseudorandom generation of permutation lists
Standard commands reinterpreted for permutation lists.
Take two permutation lists of the same length:
This is their product, left to right:
The same result can be obtained with Part reversing the order of arguments:
The inverse of a permutation list can be computed with InversePermutation, and also with Ordering:
The product of the two permutation lists gives the identity permutation list:
The identity permutation list of any length can be expressed with Range:
Random reorderings of the identity list are valid permutation lists:
Another important use of permutation lists is the transposition of arrays with Transpose, which results in a generally different array of permuted dimensions.
Take a rectangular array of nonequal dimensions:
The transposed array has permuted dimensions: