Our website is made possible by displaying online advertisements to our visitors.
Please consider supporting us by disabling your ad blocker.

Responsive image

Partition of a set

This article is about grouping elements of a set. For partitioning an integer, see Integer partition. For the partition calculus of sets, see Infinitary combinatorics. For the problem of partitioning a multiset of integers so that each part has the same sum, see Partition problem.
A set of stamps partitioned into bundles: No stamp is in two bundles, no bundle is empty, and every stamp is in a bundle.
The 52 partitions of a set with 5 elements. A colored region indicates a subset of X that forms a member of the enclosing partition. Uncolored dots indicate single-element subsets. The first shown partition contains five single-element subsets; the last partition contains one subset having five elements.
The traditional Japanese symbols for the 54 chapters of the Tale of Genji are based on the 52 ways of partitioning five elements (the two red symbols represent the same partition, and the green symbol is added for reaching 54).[1]

In mathematics, 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 this set, and every partition defines an equivalence relation. A set equipped with an equivalence relation or a partition is sometimes called a setoid, typically in type theory and proof theory.

  1. ^ Knuth, Donald E. (2013), "Two thousand years of combinatorics", in Wilson, Robin; Watkins, John J. (eds.), Combinatorics: Ancient and Modern, Oxford University Press, pp. 7–37

Previous Page Next Page






تجزئة مجموعة Arabic সেট বিভাজন Bengali/Bangla Partició (matemàtiques) Catalan Йыш пайлавĕ CV Partition Danish Partition (Mengenlehre) German Διαμερισμός συνόλου Greek Partición de un conjunto Spanish Tükeldus ET Partiketa (matematika) EU

Responsive image

Responsive image