Академический Документы
Профессиональный Документы
Культура Документы
rmilson
2013-03-21 13:55:54
Introduction.
x = x(x 1)(x 2) . . . (x n + 1) =
n
X
s(n, k)xk .
k=1
1
1
-1
2
-6
24
1
-3
11
-50
1
-6
35
1
-10
Recurrence Relation.
1 k < n,
s(1, 1) = 1.
hStirlingNumbersOfTheFirstKindi
X
n
X
s(n, k)xk
n=0 k=1
tn
.
n!
This is because the derivative of the left side of the generating funcion equation
with respect to x is
(1 + t)x ln(1 + t) = (1 + t)x
(1)k1
k=1
tk
.
k
The relation
(1 + t)x1 (1 + t)x2 = (1 + t)x1 +x2
yields the following family of summation identities. For any given k1 , k2 , d 1
we have
X d + k1 + k2
k1 + k2
s(d+k1 +k2 , k1 +k2 ) =
s(d1 +k1 , k1 )s(d2 +k2 , k2 ).
k1
k1 + d1
d1 +d2 =d
(see the entry on cycle notation for the meaning of the above expressions.)
Let us prove this. First, we can remark that the unsigned Stirling numbers
of the first are characterized by the following recurrence relation:
|s(n + 1, k)| = |s(n, k 1)| + n|s(n, k)|,
1 k < n.
To see why the above recurrence relation matches the count of permutations
with k cycles, consider forming a permutation of n + 1 objects from a permutation of n objects by adding a distinguished object. There are exactly two ways
2