Math.Combinat.Sets.VennDiagrams

Venn diagrams. See https://en.wikipedia.org/wiki/Venn_diagram

TODO: write a more efficient implementation (for example an array of size 2^n)

Documentation

newtype VennDiagram a

Venn diagrams of n sets. Each possible zone is annotated with a value of type a. A typical use case is to annotate with the cardinality of the given zone.

Internally this is representated by a map from [Bool], where True means element of the set, False means not.

TODO: write a more efficient implementation (for example an array of size 2^n)

Constructors

VennDiagram

Fields

• vennTable :: Map [Bool] a

Instances

Show a => Show (VennDiagram a)

Defined in Math.Combinat.Sets.VennDiagrams

Methods

showsPrec :: Int -> VennDiagram a -> ShowS

show :: VennDiagram a -> String

showList :: [VennDiagram a] -> ShowS

Show a => DrawASCII (VennDiagram a)

Defined in Math.Combinat.Sets.VennDiagrams

Methods

ascii :: VennDiagram a -> ASCII

Eq a => Eq (VennDiagram a)

Defined in Math.Combinat.Sets.VennDiagrams

Methods

(==) :: VennDiagram a -> VennDiagram a -> Bool

(/=) :: VennDiagram a -> VennDiagram a -> Bool

Ord a => Ord (VennDiagram a)

Defined in Math.Combinat.Sets.VennDiagrams

Methods

compare :: VennDiagram a -> VennDiagram a -> Ordering

(<) :: VennDiagram a -> VennDiagram a -> Bool

(<=) :: VennDiagram a -> VennDiagram a -> Bool

(>) :: VennDiagram a -> VennDiagram a -> Bool

(>=) :: VennDiagram a -> VennDiagram a -> Bool

max :: VennDiagram a -> VennDiagram a -> VennDiagram a

min :: VennDiagram a -> VennDiagram a -> VennDiagram a

vennDiagramNumberOfSets :: VennDiagram a -> Int

How many sets are in the Venn diagram

vennDiagramNumberOfZones :: VennDiagram a -> Int

How many zones are in the Venn diagram

vennDiagramNumberOfZones v == 2 ^ (vennDiagramNumberOfSets v)

vennDiagramNumberOfNonemptyZones :: VennDiagram Int -> Int

How many nonempty zones are in the Venn diagram

unsafeMakeVennDiagram :: [([Bool], a)] -> VennDiagram a

isTrivialVennDiagram :: VennDiagram Int -> Bool

We call venn diagram trivial if all the intersection zones has zero cardinality (that is, the original sets are all disjoint)

printVennDiagram :: Show a => VennDiagram a -> IO ()

prettyVennDiagram :: Show a => VennDiagram a -> String

asciiVennDiagram :: Show a => VennDiagram a -> ASCII

vennDiagramSetCardinalities :: VennDiagram Int -> [Int]

Given a Venn diagram of cardinalities, we compute the cardinalities of the original sets (note: this is slow!)

enumerateVennDiagrams :: [Int] -> [VennDiagram Int]

Given the cardinalities of some finite sets, we list all possible Venn diagrams.

Note: we don't include the empty zone in the tables, because it's always empty.

Remark: if each sets is a singleton set, we get back set partitions:

> [ length $ enumerateVennDiagrams $ replicate k 1 | k<-[1..8] ]
[1,2,5,15,52,203,877,4140]

> [ countSetPartitions k | k<-[1..8] ]
[1,2,5,15,52,203,877,4140]

Maybe this could be called multiset-partitions?

Example:

autoTabulate RowMajor (Right 6) $ map ascii $ enumerateVennDiagrams [2,3,3]