Every permutation can be decomposed as a product of disjoint cycles. This can be computed with cycleDecomposition.
|
|
We follow the convention to write the decomposition in its "canonical" or "standard" form. So
1. each cycle is listed with its largest element first, and
2. the cycles are listed in increasing order.
A permutation's cycle type is the sequence consisting of the lengths of the cycles in its cycle decomposition, listed in weakly decreasing order.
|
Foata's fundamental bijection is a bijection between a permutation's standard cycle decomposition and another permutation read the same (in one-line notation) as the decomposition with its parentheses removed. For example, if $p = (3 \, 2 \, 1)(5 \, 4)$ (written in cycle notation), then its corresponding permutation (written in one-line notation) is $\hat{p} = (3 \, 2 \, 1 \, 5 \, 4)$.
|
|
A permutation can also be decomposed as a product of transpositions. When this is done minimally (with respect to the number of transpositions used), such decompositions are called reduced words. We can compute these with reducedWords.
|
|
We can verify that these reduced words multiply to the original permutation.
|
The source of this document is in /build/reproducible-path/macaulay2-1.25.06+ds/M2/Macaulay2/packages/Permutations/Documentation/packageDocs.m2:204:0.