Safe Haskell | None |
---|---|

Language | Haskell98 |

## Synopsis

- newtype Poset t = Poset ([t], t -> t -> Bool)
- implies :: Bool -> Bool -> Bool
- isReflexive :: ([t], t -> t -> Bool) -> Bool
- isAntisymmetric :: Eq a => ([a], a -> a -> Bool) -> Bool
- isTransitive :: ([t], t -> t -> Bool) -> Bool
- isPoset :: Eq t => ([t], t -> t -> Bool) -> Bool
- poset :: Eq t => ([t], t -> t -> Bool) -> Poset t
- intervals :: Poset b -> [(b, b)]
- interval :: Poset a -> (a, a) -> [a]
- chainN :: Int -> Poset Int
- antichainN :: Int -> Poset Int
- divides :: Integral a => a -> a -> Bool
- divisors :: Integral a => a -> [a]
- posetD :: Int -> Poset Int
- powerset :: [a] -> [[a]]
- posetB :: Int -> Poset [Int]
- partitions :: [a] -> [[[a]]]
- isRefinement :: Ord a => [[a]] -> [[a]] -> Bool
- posetP :: Int -> Poset [[Int]]
- intervalPartitions :: (Eq a, Num a) => [a] -> [[[a]]]
- isInterval :: (Eq a, Num a) => [a] -> Bool
- intervalPartitions2 :: [a] -> [[[a]]]
- integerPartitions :: (Ord a, Num a) => a -> [[a]]
- isIPRefinement :: (Ord a, Num a) => [a] -> [a] -> Bool
- posetIP :: Int -> Poset [Int]
- subspaces :: (Eq a, Num a) => [a] -> Int -> [[[a]]]
- isSubspace :: (Foldable t, Eq a, Num a) => t [a] -> [[a]] -> Bool
- posetL :: (Eq fq, Num fq) => Int -> [fq] -> Poset [[fq]]
- subposet :: Poset a -> (a -> Bool) -> Poset a
- dsum :: Poset a -> Poset b -> Poset (Either a b)
- dprod :: Poset a -> Poset b -> Poset (a, b)
- dual :: Poset a -> Poset a
- hasseDigraph :: Eq a => Poset a -> Digraph a
- reachabilityPoset :: Ord a => Digraph a -> Poset a
- isOrderPreserving :: (a -> b) -> Poset a -> Poset b -> Bool
- orderIsos01 :: Poset a1 -> Poset a2 -> [[(a1, a2)]]
- isOrderIso :: (Ord a, Ord b) => Poset a -> Poset b -> Bool
- orderIsos :: (Ord a, Ord b) => Poset a -> Poset b -> [[(a, b)]]
- orderAuts1 :: Ord b => Poset b -> [[(b, b)]]
- isLinext :: Poset t -> [t] -> Bool
- linexts :: Poset t -> [[t]]

# Documentation

A poset is represented as a pair (set,po), where set is the underlying set of the poset, and po is the partial order relation

isReflexive :: ([t], t -> t -> Bool) -> Bool Source #

isTransitive :: ([t], t -> t -> Bool) -> Bool Source #

chainN :: Int -> Poset Int Source #

A chain is a poset in which every pair of elements is comparable (ie either x <= y or y <= x). It is therefore a linear or total order. chainN n is the poset consisting of the numbers [1..n] ordered by (<=)

antichainN :: Int -> Poset Int Source #

An antichain is a poset in which distinct elements are incomparable. antichainN n is the poset consisting of [1..n], with x <= y only when x == y.

posetB :: Int -> Poset [Int] Source #

posetB n is the lattice of subsets of [1..n] ordered by inclusion

partitions :: [a] -> [[[a]]] Source #

isRefinement :: Ord a => [[a]] -> [[a]] -> Bool Source #

posetP :: Int -> Poset [[Int]] Source #

posetP n is the lattice of set partitions of [1..n], ordered by refinement

intervalPartitions :: (Eq a, Num a) => [a] -> [[[a]]] Source #

intervalPartitions2 :: [a] -> [[[a]]] Source #

integerPartitions :: (Ord a, Num a) => a -> [[a]] Source #

posetIP :: Int -> Poset [Int] Source #

posetIP n is the poset of integer partitions of n, ordered by refinement

posetL :: (Eq fq, Num fq) => Int -> [fq] -> Poset [[fq]] Source #

posetL n fq is the lattice of subspaces of the vector space Fq^n, ordered by inclusion. Subspaces are represented by their reduced row echelon form. Example usage: posetL 2 f3

subposet :: Poset a -> (a -> Bool) -> Poset a Source #

The subposet of a poset satisfying a predicate

hasseDigraph :: Eq a => Poset a -> Digraph a Source #

Given a poset (X,<=), we say that y covers x, written x -< y, if x < y and there is no z in X with x < z < y. The Hasse digraph of a poset is the digraph whose vertices are the elements of the poset, with an edge between every pair (x,y) with x -< y. The Hasse digraph can be represented diagrammatically as a Hasse diagram, by drawing x below y whenever x -< y.

reachabilityPoset :: Ord a => Digraph a -> Poset a Source #

Given a DAG (directed acyclic graph), return the poset consisting of the vertices of the DAG, ordered by reachability. This can be used to recover a poset from its Hasse digraph.

orderIsos01 :: Poset a1 -> Poset a2 -> [[(a1, a2)]] Source #

isOrderIso :: (Ord a, Ord b) => Poset a -> Poset b -> Bool Source #

Are the two posets order-isomorphic?

orderIsos :: (Ord a, Ord b) => Poset a -> Poset b -> [[(a, b)]] Source #

Find all order isomorphisms between two posets

orderAuts1 :: Ord b => Poset b -> [[(b, b)]] Source #