Partition of A Set

Partition Of A Set

In mathematics, a partition of a set X is a division of X into non-overlapping and non-empty "parts" or "blocks" or "cells" that cover all of X. More formally, these "cells" are both collectively exhaustive and mutually exclusive with respect to the set being partitioned.

Read more about Partition Of A Set:  Definition, Examples, Partitions and Equivalence Relations, Refinement of Partitions, Noncrossing Partitions, Counting Partitions

Famous quotes containing the word set:

    “I can add colors to the chameleon,
    Change shapes with Proteus for advantages,
    And set the murderous Machiavel to school.”
    —William Shakespeare (1564–1616)