sym-0.12.1: Permutations, patterns, and statistics

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

Sym.Permgram

Contents

Description

Permutation diagrams, or permutations as monads.

Synopsis

Data types

type Label a = Vector a Source

The purpose of this data type is to assign labels to the indices of a given permutation.

data Permgram a Source

A permgram consists of a permutation together with a label for each index of the permutation.

Accessors

perm :: Permgram a -> Perm Source

The underlying permutation.

label :: Permgram a -> Label a Source

The assignment of labels to indices.

size :: Permgram a -> Int Source

The size of a permgram is the size of the underlying permutation.

Construct permgrams

permgram :: Perm -> [a] -> Permgram a Source

Construct a permgram from an underlying permutation and a list of labels.

inverse :: Permgram a -> Permgram a Source

The inverse permgram. It's obtained by mirroring the permgram in the x=y diagonal.