We can check if a permutation avoids a pattern. For example, a permutation $p$ is $2143$-avoiding if there do not exist indices $i < j < k < l$ such that $w_j < w_i < w_l < w_k$.
|
|
Some patterns are common enough that those pattern-avoiding permutations are given a name, such as vexillary for those that are $2143$-avoiding.
|
|
We can also check if a permutation simultaneously avoids a list of patterns.
|
|
Just as before, some lists of patterns are common enough to be given names. See the documentation for isCartwrightSturmfels, isCDG, and isSeparable for such lists of patterns.
|
|
|
The source of this document is in /build/reproducible-path/macaulay2-1.25.05+ds/M2/Macaulay2/packages/Permutations/Documentation/packageDocs.m2:282:0.