# derivation of the generating series for the Stirling numbers of the second kind

The derivation of the generating series is much simpler if one makes use of the composition lemma for exponential generating series. We are looking for the generating series for sets of nonempty sets, so in the notation of Jackson and Goulden, we have the set decomposition:

 $\mathcal{A}\,\tilde{\longrightarrow}\,\mathcal{U}\circledast(\mathcal{U}% \backslash\{\emptyset\})$

where $\mathcal{U}$ is the set of all canonical unordered sets, $\mathcal{A}$ is the set which we are interested in counting, and $\circledast$ is star-composition of sets of labelled combinatorial objects.

The set $\mathcal{U}$ has one object in it of each weight, and so has exponential generating series:

 $[(\mathcal{U},\omega)]_{e}(x)=\sum_{n\geq 0}{x^{n}\over n!}=e^{x}$

The set $\mathcal{U}\backslash\{\emptyset\}$ then has generating series:

 $[(\mathcal{U}\backslash\{\emptyset\},\omega)]_{e}(x)=e^{x}-1$

So, by the star composition lemma and the above decomposition,

 $\displaystyle[(\mathcal{A},\omega)]_{e}(x)$ $\displaystyle=$ $\displaystyle[(\mathcal{U}\circledast(\mathcal{U}\backslash\{\emptyset\}),% \omega)]_{e}(x)$ $\displaystyle=$ $\displaystyle\left([(\mathcal{U},\omega)]_{e}\circ[(\mathcal{U}\backslash\{% \emptyset\},\omega)]_{e}\right)(x)$ $\displaystyle=$ $\displaystyle e^{e^{x}-1}$

By tensoring the weight function $\omega$ with a weight function $\lambda$ counting the number of parts each set partition contains, we get

 $[(\mathcal{A},\omega\otimes\lambda)]_{e,o}(x,t)=e^{t(e^{x}-1)}$

using a derivation similar to the one above.

Title derivation of the generating series for the Stirling numbers of the second kind DerivationOfTheGeneratingSeriesForTheStirlingNumbersOfTheSecondKind 2013-03-22 15:13:35 2013-03-22 15:13:35 cgibbard (959) cgibbard (959) 6 cgibbard (959) Derivation msc 05A15