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
vee :: Perm a => Int -> [a]Source
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 :: Perm a => Int -> [a]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.
gt :: Perm a => Int -> [a]Source
The >-class is Av(132, 312). It is so named because the diagram of a typical permutation in this class is shaped like a >.
lt :: Perm a => Int -> [a]Source
The <-class is Av(213, 231). It is so named because the diagram of a typical permutation in this class is shaped like a <.
separables :: Perm a => Int -> [a]Source
The class of separable permutations; it is identical to Av(2413,3142).