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:
“To find the length of an object, we have to perform certain
physical operations. The concept of length is therefore fixed when the operations by which length is measured are fixed: that is, the concept of length involves as much as and nothing more than the set of operations by which length is determined.”
—Percy W. Bridgman (1882–1961)