l_p
A permutation $p$ acts on the elements of list by permuting the elements of the list according to the permutation. More precisely, if $L = \{ e_1, \dots, e_k \}$ is a list and $p=(p_1, \dots, p_n)$ is a permutation, then the action is given by $p*L = \{ e_{p(1)}, \dots, e_{p(k)}}$.
The permutation cannot permute more than #l elements.
|
|
|
The permutation can be a permutation on less than #l elements.
|
|
|
The source of this document is in /build/reproducible-path/macaulay2-1.25.06+ds/M2/Macaulay2/packages/Permutations/Documentation/operationsDocs.m2:178:0.