A permutation on $n$ symbols acts on lists of size $n$ by permuting its contents according to the permutation.
|
|
|
A permutation $p$ on $n$ symbols can also be regarded as a permutation on $N$ symbols for any $N \geq n$ by regarding all of the indices $n+1, n+2, \dots$ as fixed by $p$, i.e., $p(i)=i$ for all $i > n$. This is also reflected in the group action.
|
|
|
In a similar manner, permutations on $n$ symbols also act on the space of $m \times n$ matrices by permuting the rows (or columns). Another way to view this action is via the multiplication on the left by the matrix representation of the permutation (if acting on the rows).
|
|
|
Just as in the case of lists, the size of the matrix can be larger than $n$. Example p = permutation {3,1,2}; M = id_(ZZ^5); p*M
The matrix does not need to be square. As long as the number of rows is greater than or equal largest non-fixed point of the permutation, the action is valid.
|
|
|
|
|
We can also act on the columns of the matrix in a similar way.
|
|
|
|
|
The source of this document is in Permutations/Documentation/packageDocs.m2:153:0.