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:
“If nations always moved from one set of furnished rooms to another—and always into a better set—things might be easier, but the trouble is that there is no one to prepare the new rooms. The future is worse than the ocean—there is nothing there. It will be what men and circumstances make it.”
—Alexander Herzen (1812–1870)