| Copyright | Anders Claesson 2013-2016 |
|---|---|
| Maintainer | Anders Claesson <anders.claesson@gmail.com> |
| Safe Haskell | None |
| Language | Haskell98 |
Sym.Perm.SSYT
Description
Data types for Semistandard Young Tableaux (SSYT) and functions for converting between (generalized) permutataions and SSYT. In other words, this module implements the Robinson-Schensted-Knuth (RSK) correspondence.
- type GeneralizedPerm = [(Int, Int)]
- type Entry = Int
- type SSYT = [[Entry]]
- data SSYTPair = SSYTPair {}
- class Shape a where
- empty :: SSYTPair
- null :: SSYTPair -> Bool
- display :: SSYTPair -> String
- fromPerm :: Perm -> SSYTPair
- fromGeneralizedPerm :: GeneralizedPerm -> SSYTPair
- toPerm :: SSYTPair -> Perm
- toGeneralizedPerm :: SSYTPair -> GeneralizedPerm
Documentation
type GeneralizedPerm = [(Int, Int)] Source #
A Generalized Permutation is a lexicographically sorted list of pairs of non-negative integers.
type SSYT = [[Entry]] Source #
A Semistandard Young Tableau (SSYT): the entries weakly increase along each row and strictly increase down each column.
A pair of Semistandard Young Tableaux.
Constructors
| SSYTPair | |
Fields | |
Minimal complete definition
fromGeneralizedPerm :: GeneralizedPerm -> SSYTPair Source #
The Robinson-Schensted-Knuth (RSK) algorithm.
toGeneralizedPerm :: SSYTPair -> GeneralizedPerm Source #
The inverse of the Robinson-Schensted-Knuth algorithm.