Set partition
https://en.wikipedia.org/wiki/Partition_of_a_set
A partition of a set is a grouping of its elements into non-empty subsets, in such a way that every element is included in exactly one subset.
Every equivalence relation on a set defines a partition of that set.
Every partition of a set defines an equivalence relation on that set.
A setoid is a set equipped with an equivalence relation or a partition.
Definition and Notation
(β¦)
Examples
The empty set,
β
, has exactly one partition,P = β
; this is the partition,P = β
, not a member of the partition,P β {β }
Each singleton set,
{a}
, has exactly one partition,{{a}}
Each non-empty set
X
has a trivial partition,P = {X}
for any non-empty proper subset
A
of a setU
,A β U
, the setA
together with its complementA'
i.e.U = A β A'
, soA' = U β A
form a partition ofU
, viz.{A, U β A}
(βA. A : Set β A β β ).A β U
=>π(U) = {A, U \ A }
The set
{1,2,3}
has these 5 partitions:{ {1}, {2}, {3} }
or1 | 2 | 3
{ {1, 2}, {3} }
or1 2 | 3
{ {1, 3}, {2} }
or1 3 | 2
{ {1}, {2, 3} }
or1 | 2 3
{ {1, 2, 3} }
or123
(when there's no confusion with the number)
Refinement of partitions
(β¦)
Noncrossing partitions
(β¦)
Counting partitions
Bell number, B(n+1)
= Sum [k=0..n] n-choose-k B(k)
Bell numbers satisfy the recursion:
and have the exponential generating function:
The first several Bell numbers are
Bell triangle
The number of partitions of an n
-element set into exactly k
non-empty parts is the Stirling number of the second kind S(n, k)
.
The number of noncrossing partitions of an n
-element set is the Catalan number CΙ΄
, given by
Ref
https://en.wikipedia.org/wiki/Equivalence_relation https://en.wikipedia.org/wiki/Equivalence_class
Last updated
Was this helpful?