Stirling number

From Wikipedia, the free encyclopedia

In mathematics, Stirling numbers arise in a variety of combinatorics problems. They are named after James Stirling, who introduced them in the 18th century. Two different sets of numbers bear this name: the Stirling numbers of the first kind and the Stirling numbers of the second kind.

Contents

[edit] Notation

Several different notations for the Stirling numbers are in use. Stirling numbers of the first kind are written with a small s, and those of the second kind with a large S (Abramowitz and Stegun use an uppercase S and a blackletter S respectively).

s(n,k) (signed);
c(n,k)=\left[{n \atop k}\right]=|s(n,k)| (unsigned).
S(n,k)= S_n^{(k)} = \left\{\begin{matrix} n \\ k \end{matrix}\right\}.

The notation of using brackets and braces, in analogy to the binomial coefficients, was introduced in 1935 by Jovan Karamata and promoted later by Donald Knuth; it is referred to as Karamata notation. The mathematical motivation for this type of notation, as well as additional Stirling number formulae, may be found on the page for Stirling numbers and exponential generating functions.

[edit] Stirling numbers of the first kind

Unsigned Stirling numbers of the first kind

c(n,k)=\left[{n \atop k}\right]=|s(n,k)|=(-1)^{n-k} s(n,k)

(with a lower-case "s") count the number of permutations of n elements with k disjoint cycles.

Stirling numbers of the first kind (without the qualifying adjective unsigned) are the coefficients in the expansion

(x)_{(n)} = \sum_{k=1}^n s(n,k) x^k.

where (x)(n) is the falling factorial

(x)_{(n)}=x(x-1)(x-2)\cdots(x-n+1).
See the main article Stirling numbers of the first kind for additional information.

[edit] Stirling numbers of the second kind

Stirling numbers of the second kind S(n, k) (with a capital "S") count the number of ways to partition a set of n elements into k nonempty subsets. The sum

B_n=\sum_{k=1}^n S(n,k)

is the nth Bell number. If we let

(x)_n=x(x-1)(x-2)\cdots(x-n+1)

(in particular, (x)0 = 1 because it is an empty product) be the falling factorial, we can characterize the Stirling numbers of the second kind by

\sum_{k=0}^n S(n,k)(x)_k=x^n.

(Confusingly, the notation that combinatorialists use for falling factorials coincides with the notation used in special functions for rising factorials; see Pochhammer symbol.)

See the main article Stirling numbers of the second kind for additional information.

[edit] Inversion relationships

The Stirling numbers of the first and second kind can be considered to be inverses of one another:

\sum_{n=0}^{\max\{j,k\}} (-1)^{n-k} \left[{n\atop j}\right] \left\{{k\atop n}\right\} = \delta_{jk}

and

\sum_{n=0}^{\max\{j,k\}} (-1)^{n-k} \left\{{n\atop j}\right\} \left[{k\atop n}\right] = \delta_{jk}

where δjk is the Kronecker delta. These two relationships may be understood to be matrix inverses. That is, let s be the lower triangular matrix of Stirling numbers of first kind, so that it has matrix elements

[s]_{nk}=s(n,k)=(-1)^{n-k} \left[{n\atop k}\right]

Then, the inverse of this matrix is S, the lower triangular matrix of Stirling numbers of second kind. Symbolically, one writes

s − 1 = S

where the matrix elements of S are

[S]_{nk}=S(n,k)=\left\{{n\atop k}\right\}.

Note that although s and S are infinite, this works for finite matrices by only considering Stirling numbers up to some number N.

[edit] Symmetric formulae

Abramowitz and Stegun give the following symmetric formulae that relate the Stirling numbers of the first and second kind.

\left[{n\atop k}\right] = (-1)^{n-k} \sum_{j=0}^{n-k} (-1)^j {n-1+j \choose n-k+j} {2n-k \choose n-k-j} \left\{{n-k+j\atop j}\right\}

and

\left\{{n\atop k}\right\} = \sum_{j=0}^{n-k} (-1)^{n-k+j} {n-1+j \choose n-k+j} {2n-k \choose n-k-j} \left[{n-k+j\atop j}\right].

[edit] See also

[edit] References