← Back to catalogue
Research draft

partition of a set

vr.tr.partition-of-a-set · ACT.ACT

Let an agent explain set partitions, relay definitions, counting, equivalence relations and applications from mathematics sources, describe the named related partitions, and distinguish set partitions from integer partitions, covers that may overlap, subsets and partitions in computing such as disk partitions.

Thing Registry Activities and processes

Research draft, second pass

A second pass drafted this model: the structure a model of this thing needs, and what is known about it in the world. The line under this one says how the second half was obtained - researched against sources, or recalled without web access, in which case nothing here was read anywhere and every claim is a lead to verify. Unreviewed either way.

written by Claude from model knowledge without web access - no source was read, every claim is a lead to verify

Researched by: Claude

Purpose and description

Let an agent explain set partitions, relay definitions, counting, equivalence relations and applications from mathematics sources, describe the named related partitions, and distinguish set partitions from integer partitions, covers that may overlap, subsets and partitions in computing such as disk partitions.

In mathematics, a grouping of the elements of a set into non-empty subsets called blocks such that every element belongs to exactly one block, corresponding one-to-one with equivalence relations, counted by Bell numbers for all partitions and by Stirling numbers of the second kind for a fixed number of blocks; related constructions the registry aliases name include a cut, a partition of graph vertices into two sets, a Dedekind cut, which partitions the rationals to define real numbers, trichotomy, the division of numbers into less than, equal and greater, arrangements of lines and pseudolines, which partition the plane into regions, and Voronoi diagrams, which partition space by nearest site.

What it is for: Dividing sets into disjoint parts.

It can be explain definition and equivalence relations; relay counting with Bell and Stirling numbers; describe named related partitions; distinguish related concepts.

Distinguishing features

Disjoint blocks

Complete coverage

Equivalence relation link

Combinatorial counts

What it looks like

Not a physical object; drawn as disjoint groups of elements.

Physical character

Bell numbers: 1, 1, 2, 5, 15, 52 sequence - partitions of sets of size 0-5

Dedekind cuts: 1872 year

Voronoi diagram: Voronoi 1908 note - earlier uses by Descartes and Dirichlet

How it is recognised

Division of a set into disjoint non-empty blocks

Trichotomy, arrangement of pseudolines, cut, arrangement of lines, Voronoi diagram, Dedekind cut

Integer partitions split numbers; covers may overlap; subsets are single parts; disk partitions divide storage

Related models

is a kind of - in registry terms

set system

corresponds to -

equivalence relation

is counted by -

Bell number

is contrasted with -

integer partition

In practice

Families and kinds

set partitions

graph cuts

Dedekind cuts

geometric partitions such as line arrangements and Voronoi diagrams

noncrossing partitions

Standards and regulation

No regulation

Failure modes and hazards

Confusing set and integer partitions

Allowing empty blocks

Treating related geometric partitions as synonyms

Also called

trichotomyArrangement of pseudolinescutarrangement of linesVoronoi diagramDedekind cutminimum cutmaximum cutDiscrete Voronoi diagramWeighted Voronoi diagram

Where this came from

wikidata · CC0 1.0

Source repository Registry entry point

Drafted structure

Bundle to layer to finding to question, as the second pass will find it: 4 bundles · 8 layers · 8 findings · 16 questions.

Understand What a set partition is.

Definition.

Definition

Definition.

Definition

Definition.

  1. What is a partition of a set, and how does it differ from integer partitions, covers, subsets and disk partitions? definition
  2. Is the question about combinatorics, geometry, analysis or computing? boundary

Related

Named related partitions.

Related

Related.

  1. What are cuts, Dedekind cuts, trichotomy, line and pseudoline arrangements and Voronoi diagrams? definition
  2. Which entry fits the specific concept? action
Theory Theory.

Science.

Equivalence

Equivalence relations.

Equivalence

Equivalence.

  1. Why do partitions correspond to equivalence relations? provenance
  2. Which references are standard? provenance

Counting

Bell and Stirling numbers.

Counting

Counting.

  1. How do Bell numbers and Stirling numbers count partitions? measurement
  2. Which sources are cited? provenance
Applications Applications.

Science.

Geometry

Geometric partitions.

Geometry

Geometry.

  1. How are Voronoi diagrams used in geography, biology and computing? provenance
  2. Which entry fits Voronoi diagram? action

Graphs

Graph cuts.

Graphs

Graphs.

  1. What are cuts in graphs, and how does the max-flow min-cut theorem use them? provenance
  2. Which entry fits max-flow min-cut theorem? action
Context Foundations.

Context.

Dedekind

Dedekind cuts.

Dedekind

Dedekind.

  1. How did Dedekind use cuts to construct the real numbers? provenance
  2. Which entry fits Richard Dedekind? action

Lattice

Partition lattice.

Lattice

Lattice.

  1. What is the lattice of partitions ordered by refinement? provenance
  2. Which entry fits partition lattice? action

What the second pass must settle

  • Should Voronoi diagram and Dedekind cut be moved to their own entries?
  • How should combinatorics references be linked?
  • Should trichotomy be moved to order theory?
Draft as JSON