reducedWords w
A permutation $p$ can be expressed as a product of transpositions. A reduced word is a minimal-length expression of a permutation as a product of transpositions. The reducedWords method computes all of the reduced words of a permutation. A word is represented by a list of integers, where $i$ denotes the transposition $(i,i+1)$.
|
|
We can check that a reduced word multiplies out to the original permutation. Note that we need to multiply from right to left, so we must reverse the list.
|
|
The object reducedWords is a method function.
The source of this document is in /build/reproducible-path/macaulay2-1.25.05+ds/M2/Macaulay2/packages/Permutations/Documentation/mainDocs.m2:624:0.