Stirling Numbers of The Second Kind
These numbers count the number of partitions of into k nonempty subsets. First consider the total number of partitions, i.e. Bn where
i.e. the Bell numbers. The Symbolic combinatorics#The Flajolet–Sedgewick fundamental theorem applies (labelled case). The set of partitions into non-empty subsets is given by ("set of non-empty sets of singletons")
This decomposition is entirely analogous to the construction of the set of permutations from cycles, which is given by
and yields the Stirling numbers of the first kind. Hence the name "Stirling numbers of the second kind."
The decomposition is equivalent to the EGF
Differentiate to obtain
which implies that
by convolution of exponential generating functions and because differentiating an EGF drops the first coefficient and shifts Bn+1 to z n/n!.
The EGF of the Stirling numbers of the second kind is obtained by marking every subset that goes into the partition with the term, giving
Translating to generating functions, we obtain
This EGF yields the formula for the Stirling numbers of the second kind:
or
which simplifies to
Read more about this topic: Stirling Numbers And Exponential Generating Functions
Famous quotes containing the words stirling, numbers and/or kind:
“Oh, if thy pride did not our joys control,
What world of loving wonders shouldst thou see!
For if I saw thee once transformed in me,
Then in thy bosom I would pour my soul;”
—William Alexander, Earl O Stirling (1580?1640)
“I had but three chairs in my house; one for solitude, two for friendship; three for society. When visitors came in larger and unexpected numbers there was but the third chair for them all, but they generally economized the room by standing up.”
—Henry David Thoreau (18171862)
“...I want to see a film, they send the Israeli army reserves to escort me! What kind of life is this?”
—Golda Meir (18981978)