Bell numbers
Definition
Let be a natural number. The Bell number is the number of partitions of an -element set into nonempty blocks. Equivalently, it is the sum of Stirling numbers of the second kind:
Remarks
The first values, for , are . , because the empty set has exactly one partition, the partition with no blocks. The values satisfy a recurrence with binomial coefficients.
Explanations
L1 human
The Bell number counts all ways to split labelled objects into groups, with any number of groups. For there are ways: , , , and .
What this node needs for W2
- edge instance_of in: one example (0 of 1)
- edge not_instance_of in: one non-example that fails one clause (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
What this needs
To read this node, read these 2 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Stirling numbers of the second kind definition
- Bell numbers definition
What depends on this
1 node uses this node, directly or through other nodes.
- Recurrence for Bell numbers 0110GBHPPB
Sources
- Web https://en.wikipedia.org/wiki/Bell_number, Set partitions
What links here
Used by
- Recurrence for Bell numbers 0110GBHPPB