Math 2.0

definition

Bell numbers

Definition

Let nn be a natural number. The Bell number BnB_n is the number of partitions of an nn-element set into nonempty blocks. Equivalently, it is the sum of Stirling numbers of the second kind: Bn=∑k=0nS(n,k).B_n = \sum_{k=0}^{n} S(n, k).

Remarks

The first values, for n=0,1,…,6n = 0, 1, \dots, 6, are 1,1,2,5,15,52,2031, 1, 2, 5, 15, 52, 203. B0=1B_0 = 1, 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 BnB_n counts all ways to split nn labelled objects into groups, with any number of groups. For {1,2,3}\{1, 2, 3\} there are 55 ways: 123123, 1∣231|23, 2∣132|13, 3∣123|12 and 1∣2∣31|2|3.

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.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Stirling numbers of the second kind definition
  2. Bell numbers definition

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Bell_number, Set partitions