|
|
|
|
|
Bell PolynomialsIn combinatorial mathematics, the Bell polynomials, named in honor of Eric Temple Bell, are given by -
-
\left({x_1\over 1!}\right)^{j_1}\left({x_2\over 2!}\right)^{j_2}\cdots\left({x_{n-k+1} \over (n-k+1)!}\right)^{j_{n-k+1}}, the sum extending over all sequences j1, j2, j3, ..., jn−k+1 of positive integers such that -
Combinatorial meaning If the integer n is partitioned into a sum in which "1" appears j1 times, "2" appears j2 times, and so on, then the number of partitions of a set of size n that collapse to that partition of the integer n when the members of the set become indistinguisbable is the corresponding coefficient in the polynomial. Examples For example, we have -
because there are - 6 ways to partition of set of 6 as 5+1,
- 15 ways to partition of set of 6 as 4+2, and
- 10 ways to partition a set of 6 as 3+3.
Similarly, -
because there are - 15 ways to partition a set of 6 as 4+1+1,
- 60 ways to partition a set of 6 as 3+2+1, and
- 15 ways to partition a set of 6 as 2+2+2.
Bell numbers The sum -
is the nth Bell number, which is the number of partitions of a set of size n. Relation to Faà di Bruno's formula The coefficients in these polynomials are the Faà di Bruno coefficients, occurring in Faà di Bruno's formula for the nth derivative of a composition of two functions. Moments and cumulants The sum -
is the nth moment of a probability distribution whose first n cumulants are κ1, ..., κn. References * Eric Temple Bell, Partition Polynomials, Annals of Mathematics, volume 29, 1927, pages 38 - 46.
|
 |
|
| Copyright 2005-2009 OnPedia.com. All Rights Reserved |
|
|