Copyright | Anders Claesson 2013 |
---|---|
Maintainer | Anders Claesson <anders.claesson@gmail.com> |
Safe Haskell | None |
Language | Haskell98 |
- inc :: Int -> [Perm]
- dec :: Int -> [Perm]
- av1 :: Int -> [Perm]
- av12 :: Int -> [Perm]
- av21 :: Int -> [Perm]
- av123 :: Int -> [Perm]
- av132 :: Int -> [Perm]
- av213 :: Int -> [Perm]
- av231 :: Int -> [Perm]
- av312 :: Int -> [Perm]
- av321 :: Int -> [Perm]
- av1243 :: Int -> [Perm]
- av1324 :: Int -> [Perm]
- av2134 :: Int -> [Perm]
- av :: String -> Int -> [Perm]
- vee :: Int -> [Perm]
- caret :: Int -> [Perm]
- gt :: Int -> [Perm]
- lt :: Int -> [Perm]
- wedges :: Int -> [Perm]
- separables :: Int -> [Perm]
- kLayered :: Int -> Int -> [Perm]
- layered :: Int -> [Perm]
- kFibonacci :: Int -> Int -> [Perm]
- fibonacci :: Int -> [Perm]
Documentation
av :: String -> Int -> [Perm] Source #
Av(s) where s is a string of one or more patterns, using space as a seperator.
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.
caret :: Int -> [Perm] 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 ∧.
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 <.
separables :: Int -> [Perm] Source #
The class of separable permutations; it is identical to Av(2413,3142).