Mathematical logic and foundations Concept
Partition of a set
Summary
A partition of a set divides it into nonempty pieces that do not overlap and that together cover the set.
Where this leads
16 pages build on this one.
- Jung's theorem
- Association scheme
- Radon's theorem
- Lattice of partitions
- Centerpoint theorem
- Szemerédi regularity lemma
- Helly's theorem
- Stratified sampling
- Shannon–McMillan–Breiman theorem
- Fractional Helly theorem
- Cluster analysis
- k-means clustering
- Contingency table
- Tverberg's theorem
- Kolmogorov–Sinai entropy
- Kirchberger's theorem
Further reading
- Web https://en.wikipedia.org/wiki/Partition_of_a_set, lead section
About this page
| Tag | 08QMKTWF9T |
|---|---|
| URI | m2://08QMKTWF9T |
| Aliases | set-partition |
| Kind | concept |
| Writing | W1 stated |
| MSC | 03E20 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.