Safe Haskell | Safe-Infered |
---|

- 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 t -> [(t, t)]
- interval :: Poset t -> (t, t) -> [t]
- chainN :: Int -> Poset Int
- antichainN :: Int -> Poset Int
- divides :: Integral a => a -> a -> Bool
- divisors :: Integral t => t -> [t]
- posetD :: Int -> Poset Int
- powerset :: [a] -> [[a]]
- posetB :: Int -> Poset [Int]
- partitions :: Eq t => [t] -> [[[t]]]
- 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 :: (Eq a, Num a) => [a] -> [[[a]]]
- subspaces :: (Eq a, Num a) => [a] -> Int -> [[[a]]]
- isSubspace :: (Eq a, Num a) => [[a]] -> [[a]] -> Bool
- posetL :: (Eq fq, FiniteField 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 :: Eq a1 => Poset a -> Poset a1 -> [[(a, a1)]]
- isOrderIso :: (Eq a, Eq b) => Poset a -> Poset b -> Bool
- orderIsos :: (Ord a, Ord a1) => Poset a -> Poset a1 -> [[(a, a1)]]
- orderAuts1 :: Ord a => Poset a -> [[(a, a)]]
- pairs :: [a] -> [(a, a)]
- isLinext :: Poset t -> [t] -> Bool
- linexts :: Poset a -> [[a]]

# 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) -> BoolSource

isAntisymmetric :: Eq a => ([a], a -> a -> Bool) -> BoolSource

isTransitive :: ([t], t -> t -> Bool) -> BoolSource

chainN :: Int -> Poset IntSource

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 IntSource

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.

partitions :: Eq t => [t] -> [[[t]]]Source

isRefinement :: Ord a => [[a]] -> [[a]] -> BoolSource

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

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

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

isInterval :: (Eq a, Num a) => [a] -> BoolSource

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

isSubspace :: (Eq a, Num a) => [[a]] -> [[a]] -> BoolSource

posetL :: (Eq fq, FiniteField 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.

hasseDigraph :: Eq a => Poset a -> Digraph aSource

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 aSource

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.

isOrderPreserving :: (a -> b) -> Poset a -> Poset b -> BoolSource

orderIsos01 :: Eq a1 => Poset a -> Poset a1 -> [[(a, a1)]]Source

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