sym-0.12.1: Permutations, patterns, and statistics

CopyrightAnders Claesson 2013
MaintainerAnders Claesson <anders.claesson@gmail.com>
Safe HaskellNone
LanguageHaskell98

Sym.Perm.Class

Description

 

Synopsis

Documentation

inc :: Int -> [Perm] Source

The class of increasing permutations.

dec :: Int -> [Perm] Source

The class of decreasing permutations.

av1 :: Int -> [Perm] Source

Av(1)

av12 :: Int -> [Perm] Source

Av(12)

av21 :: Int -> [Perm] Source

Av(21)

av123 :: Int -> [Perm] Source

Av(123)

av132 :: Int -> [Perm] Source

Av(132)

av213 :: Int -> [Perm] Source

Av(213)

av231 :: Int -> [Perm] Source

Av(231); also know as the stack sortable permutations.

av312 :: Int -> [Perm] Source

Av(312)

av321 :: Int -> [Perm] Source

Av(321)

av1243 :: Int -> [Perm] Source

Av(1243)

av1324 :: Int -> [Perm] Source

Av(1324)

av2134 :: Int -> [Perm] Source

Av(2134)

av :: String -> Int -> [Perm] Source

Av(s) where s is a string of one or more patterns, using space as a seperator.

vee :: Int -> [Perm] 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.

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 ∧.

gt :: Int -> [Perm] 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 :: Int -> [Perm] 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 <.

wedges :: Int -> [Perm] Source

The union of vee, caret, gt and lt.

separables :: Int -> [Perm] Source

The class of separable permutations; it is identical to Av(2413,3142).

kLayered :: Int -> Int -> [Perm] Source

The class of layered permutations with k layers.

layered :: Int -> [Perm] Source

The class of layered permutations.

kFibonacci :: Int -> Int -> [Perm] Source

The class of Fibonacci permutations with k layers. A Fibonacci permutation is a layered permutation whose layers are all of size 1 or 2.

fibonacci :: Int -> [Perm] Source

The class of Fibonacci permutations. A Fibonacci permutation is a layered permutation whose layers are all of size 1 or 2.