Math 2.0

definition

Stirling numbers of the second kind

Definition

Let nn and kk be natural numbers. The Stirling number of the second kind S(n,k)S(n, k) is the number of partitions of an nn-element set into kk nonempty blocks. A partition into blocks is a set of pairwise disjoint nonempty subsets whose union is the whole set.

Remarks

Other notations are {nk}\left\{ {n \atop k} \right\} and Sn(k)S_n^{(k)}. Boundary values: S(0,0)=1S(0, 0) = 1, S(n,0)=0S(n, 0) = 0 for n≥1n \ge 1, and S(n,k)=0S(n, k) = 0 for k>nk > n. Example: S(4,2)=7S(4, 2) = 7. The partitions of {1,2,3,4}\{1, 2, 3, 4\} into two blocks are 1∣2341|234, 2∣1342|134, 3∣1243|124, 4∣1234|123, 12∣3412|34, 13∣2413|24 and 14∣2314|23. The values satisfy a recurrence, and the sum ∑kS(n,k)\sum_k S(n, k) is the Bell number BnB_n.

Explanations

L1 human

S(n,k)S(n, k) counts the ways to split nn labelled objects into kk groups, when the groups have no labels and none is empty. For example, there are S(3,2)=3S(3, 2) = 3 ways to split three people into two teams.

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 depends on this

3 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Stirling_numbers_of_the_second_kind, Definition