Stirling numbers and exponential generating functions in symbolic combinatorics explained

The use of exponential generating functions (EGFs) to study the properties of Stirling numbers is a classical exercise in combinatorial mathematics and possibly the canonical example of how symbolic combinatorics is used. It also illustrates the parallels in the construction of these two types of numbers, lending support to the binomial-style notation that is used for them.

This article uses the coefficient extraction operator

[z ^{n]} for formal power series, as well as the (labelled) operators ak{C} (for cycles) and ak{P} (for sets) on combinatorial classes, which are explained on the page for symbolic combinatorics. Given a combinatorial class, the cycle operator creates the class obtained by placing objects from the source class along a cycle of some length, where cyclical symmetries are taken into account, and the set operator creates the class obtained by placing objects from the source class in a set (symmetries from the symmetric group, i.e. an "unstructured bag".) The two combinatorial classes (shown without additional markers) are

• permutations (for unsigned Stirling numbers of the first kind):

l{P} = \operatorname{SET}(\operatorname{CYC}( l{Z})),

and

• set partitions into non-empty subsets (for Stirling numbers of the second kind):

l{B} = \operatorname{SET}(\operatorname{SET} _{\ge} ( l{Z})), where l{Z} is the singleton class.

Warning: The notation used here for the Stirling numbers is not that of the Wikipedia articles on Stirling numbers; square brackets denote the signed Stirling numbers here.

Stirling numbers of the first kind

The unsigned Stirling numbers of the first kind count the number of permutations of [''n''] with k cycles. A permutation is a set of cycles, and hence the set

l{P} of permutations is given byl{P} = \operatorname{SET}( l{U} x \operatorname{CYC}( l{Z})),

where the singleton

l{U} marks cycles. This decomposition is examined in some detail on the page on the statistics of random permutations.

Translating to generating functions we obtain the mixed generating function of the unsigned Stirling numbers of the first kind:

G(z, u) = \exp \left( u log (1)/(1- z) \right) = \left( (1)/(1- z) \right) ^{u} = \sum ^{inf ty} _{n =0} \sum ^{n} _{k =0} \left[\begin{matrix} n \ k \end{matrix}\right] u ^{k} (z ^{n})/(n!) .

Now the signed Stirling numbers of the first kind are obtained from the unsigned ones through the relation

( -1 ) ^{n-k} \left[\begin{matrix} n \ k \end{matrix}\right]. Hence the generating function H(z, u) of these numbers isH(z, u) = G( - z, - u) = \left( (1)/(1+ z) \right) ^{-u} = ( 1+ z) ^{u} = \sum ^{inf ty} _{n =0} \sum ^{n} _{k =0} ( -1 ) ^{n-k} \left[\begin{matrix} n \ k \end{matrix}\right] u ^{k} (z ^{n})/(n!) .

A variety of identities may be derived by manipulating this generating function:

( 1+ z) ^{u} = \sum ^{inf ty} _{n =0} {u \choose n} z ^{n} = \sum ^{inf ty} _{n =0} (z ^{n})/(n!) \sum ^{n} _{k =0} ( -1 ) ^{n-k} \left[\begin{matrix} n \ k \end{matrix}\right] u ^{k} = \sum ^{inf ty} _{k =0} u ^{inf ty} _{n = k} (z ^{n})/(n!) ( -1 ) ^{n-k} \left[\begin{matrix} n \ k \end{matrix}\right] = e ^{ulog(1+z)} .

In particular, the order of summation may be exchanged, and derivatives taken, and then z or u may be fixed.

Finite sums

A simple sum is

\sum ^{n} _{k =0} ( -1 ) ^{k} \left[\begin{matrix} n \ k \end{matrix}\right] = ( -1 ) ^{n} n!.

This formula holds because the exponential generating function of the sum is

H(z, -1 ) = (1)/(1+ z) andhence n! [z ^{n]} H(z, -1 ) = ( -1 ) ^{n} n!.

Infinite sums

Some infinite sums include

\sum ^{inf ty} _{n = k} \left[\begin{matrix} n \ k \end{matrix}\right] (z ^{n})/(n!) = (\left( -log ( 1- z)\right) ^{k})/(k!)

where

|z|< 1 (the singularity nearest to z =0 of log ( 1+ z) is at z =-1 . )

This relation holds because

[u ^{k]} H(z, u) = [u ^{k]} \exp \left( u log ( 1+ z) \right) = (\left( log ( 1+ z)\right) ^{k})/(k!) .

Stirling numbers of the second kind

These numbers count the number of partitions of [''n''] into k nonempty subsets. First consider the total number of partitions, i.e. B_n where

B _{n} = \sum ^{n} _{k =1} \left\{\begin{matrix} n \ k \end{matrix}\right\} and B _{0} = 1 ,

i.e. the Bell numbers. The Flajolet–Sedgewick fundamental theorem applies (labelled case).The set

l{B} of partitions into non-empty subsets is given by ("set of non-empty sets of singletons")l{B} = \operatorname{SET}(\operatorname{SET} _{\ge} ( l{Z})).

This decomposition is entirely analogous to the construction of the set

l{P} of permutations from cycles, which is given byl{P} = \operatorname{SET}(\operatorname{CYC}( l{Z})).

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

B(z) = \exp \left(\exp z - 1 \right).

Differentiate to obtain

(d)/(dz) B(z) = \exp \left(\exp z - 1 \right) \exp z = B(z) \exp z,

which implies that

B _{n+1} = \sum ^{n} _{k =0} {n \choose k} B _{k,}

by convolution of exponential generating functions and because differentiating an EGF drops the first coefficient and shifts B_n+1 to z ⁿ/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

l{U} , givingl{B} = \operatorname{SET}( l{U} x \operatorname{SET} _{\ge} ( l{Z})).

Translating to generating functions, we obtain

B(z, u) = \exp \left(u \left(\exp z - 1 \right)\right).

This EGF yields the formula for the Stirling numbers of the second kind:

\left\{\begin{matrix} n \ k \end{matrix}\right\} = n! [u ^{k]} [z ^{n]} B(z, u) = n! [z ^{n]} ((\exp z -1 ) ^{k})/(k!)

or

n! [z ^{n]} (1)/(k!) \sum ^{k} _{j =0} {k \choose j} \exp(jz) ( -1 ) ^{k-j}

which simplifies to

(n!)/(k!) \sum ^{k} _{j =0} {k \choose j} ( -1 ) ^{k-j} (j ^{n})/(= n!) (1)/(k!) \sum ^{k} _{j =0} {k \choose j} ( -1 ) ^{k-j} j ^{n.}

References

• Ronald Graham, Donald Knuth, Oren Patashnik (1989): Concrete Mathematics, Addison–Wesley,
• D. S. Mitrinovic, Sur une classe de nombre relies aux nombres de Stirling, C. R. Acad. Sci. Paris 252 (1961), 2354–2356.
• A. C. R. Belton, The monotone Poisson process, in: Quantum Probability (M. Bozejko, W. Mlotkowski and J. Wysoczanski, eds.), Banach Center Publications 73, Polish Academy of Sciences, Warsaw, 2006
• Milton Abramowitz and Irene A. Stegun, Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, USGPO, 1964, Washington DC,