Maintainer | Anders Claesson <anders.claesson@gmail.com> |
---|---|

Safe Haskell | None |

A permutation class is a downset in the poset of permutations ordered by containment. This module provides definitions of some common classes.

# Documentation

The V-class is Av(132, 231). It is so named because the diagram of a typical permutation in this class is shaped like a V.

wedge :: Int -> [StPerm]Source

The ∧-class is Av(213, 312). It is so named because the diagram of a typical permutation in this class is shaped like a wedge.

The >-class is Av(132, 312). It is so named because the diagram of a typical permutation in this class is shaped like a >.

The <-class is Av(213, 231). It is so named because the diagram of a typical permutation in this class is shaped like a <.