Bell polynomials

In combinatorial mathematics, the Bell polynomials, named in honor of Eric Temple Bell, are used in the study of set partitions. They are related to Stirling and Bell numbers. They also occur in many applications, such as in Faà di Bruno's formula and an explicit formula for Lagrange inversion.

The partial or incomplete exponential Bell polynomials are a triangular array of polynomials given by

B n , k ( x 1 , x 2 , … , x n − k + 1 ) = ∑ n ! j 1 ! j 2 ! ⋯ j n − k + 1 ! ( x 1 1 ! ) j 1 ( x 2 2 ! ) j 2 ⋯ ( x n − k + 1 ( n − k + 1 ) ! ) j n − k + 1 = n ! ∑ ∏ i = 1 n − k + 1 x i j i ( i ! ) j i j i ! , {\displaystyle {\begin{aligned}B_{n,k}(x_{1},x_{2},\dots ,x_{n-k+1})&=\sum {n! \over j_{1}!j_{2}!\cdots j_{n-k+1}!}\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}}\\&=n!\sum \prod _{i=1}^{n-k+1}{\frac {x_{i}^{j_{i}}}{(i!)^{j_{i}}j_{i}!}},\end{aligned}}}

where the sum is taken over all sequences j₁, j₂, j₃, ..., j_n−k+1 of non-negative integers such that these two conditions are satisfied:

j 1 + j 2 + ⋯ + j n − k + 1 = k , {\displaystyle j_{1}+j_{2}+\cdots +j_{n-k+1}=k,}

j 1 + 2 j 2 + 3 j 3 + ⋯ + ( n − k + 1 ) j n − k + 1 = n . {\displaystyle j_{1}+2j_{2}+3j_{3}+\cdots +(n-k+1)j_{n-k+1}=n.}

The sum

B n ( x 1 , … , x n ) = ∑ k = 0 n B n , k ( x 1 , x 2 , … , x n − k + 1 ) = n ! ∑ 1 j 1 + … + n j n = n ∏ i = 1 n x i j i ( i ! ) j i j i ! {\displaystyle {\begin{aligned}B_{n}(x_{1},\dots ,x_{n})&=\sum _{k=0}^{n}B_{n,k}(x_{1},x_{2},\dots ,x_{n-k+1})\\&=n!\sum _{1j_{1}+\ldots +nj_{n}=n}\prod _{i=1}^{n}{\frac {x_{i}^{j_{i}}}{(i!)^{j_{i}}j_{i}!}}\end{aligned}}}

is called the nth complete exponential Bell polynomial.

Likewise, the partial ordinary Bell polynomial is defined by

B ^ n , k ( x 1 , x 2 , … , x n − k + 1 ) = ∑ k ! j 1 ! j 2 ! ⋯ j n − k + 1 ! x 1 j 1 x 2 j 2 ⋯ x n − k + 1 j n − k + 1 , {\displaystyle {\hat {B}}_{n,k}(x_{1},x_{2},\ldots ,x_{n-k+1})=\sum {\frac {k!}{j_{1}!j_{2}!\cdots j_{n-k+1}!}}x_{1}^{j_{1}}x_{2}^{j_{2}}\cdots x_{n-k+1}^{j_{n-k+1}},}

where the sum runs over all sequences j₁, j₂, j₃, ..., j_n−k+1 of non-negative integers such that

j 1 + j 2 + ⋯ + j n − k + 1 = k , {\displaystyle j_{1}+j_{2}+\cdots +j_{n-k+1}=k,}

j 1 + 2 j 2 + ⋯ + ( n − k + 1 ) j n − k + 1 = n . {\displaystyle j_{1}+2j_{2}+\cdots +(n-k+1)j_{n-k+1}=n.}

Thanks to the first condition on indices, we can rewrite the formula as

B ^ n , k ( x 1 , x 2 , … , x n − k + 1 ) = ∑ ( k j 1 , j 2 , … , j n − k + 1 ) x 1 j 1 x 2 j 2 ⋯ x n − k + 1 j n − k + 1 , {\displaystyle {\hat {B}}_{n,k}(x_{1},x_{2},\ldots ,x_{n-k+1})=\sum {\binom {k}{j_{1},j_{2},\ldots ,j_{n-k+1}}}x_{1}^{j_{1}}x_{2}^{j_{2}}\cdots x_{n-k+1}^{j_{n-k+1}},}

where we have used the multinomial coefficient.

The ordinary Bell polynomials can be expressed in the terms of exponential Bell polynomials:

B ^ n , k ( x 1 , x 2 , … , x n − k + 1 ) = k ! n ! B n , k ( 1 ! ⋅ x 1 , 2 ! ⋅ x 2 , … , ( n − k + 1 ) ! ⋅ x n − k + 1 ) . {\displaystyle {\hat {B}}_{n,k}(x_{1},x_{2},\ldots ,x_{n-k+1})={\frac {k!}{n!}}B_{n,k}(1!\cdot x_{1},2!\cdot x_{2},\ldots ,(n-k+1)!\cdot x_{n-k+1}).}

In general, Bell polynomial refers to the exponential Bell polynomial, unless otherwise explicitly stated.

The exponential Bell polynomial encodes the information related to the ways a set can be partitioned. For example, if we consider a set {A, B, C}, it can be partitioned into two non-empty, non-overlapping subsets, which are also referred to as parts or blocks, in 3 different ways:

{{A}, {B, C}}

{{B}, {A, C}}

{{C}, {B, A}}

Thus, we can encode the information regarding these partitions as

B 3 , 2 ( x 1 , x 2 ) = 3 x 1 x 2 . {\displaystyle B_{3,2}(x_{1},x_{2})=3x_{1}x_{2}.}

Here, the subscripts of B_3,2 tell us that we are considering the partitioning of a set with 3 elements into 2 blocks. The subscript of each x_i indicates the presence of a block with i elements (or block of size i) in a given partition. So here, x₂ indicates the presence of a block with two elements. Similarly, x₁ indicates the presence of a block with a single element. The exponent of x_i^j indicates that there are j such blocks of size i in a single partition. Here, the fact that both x₁ and x₂ have exponent 1 indicates that there is only one such block in a given partition. The coefficient of the monomial indicates how many such partitions there are. Here, there are 3 partitions of a set with 3 elements into 2 blocks, where in each partition the elements are divided into two blocks of sizes 1 and 2.

Since any set can be divided into a single block in only one way, the above interpretation would mean that B_n,1 = x_n. Similarly, since there is only one way that a set with n elements be divided into n singletons, B_n,n = x₁ⁿ.

As a more complicated example, consider

B 6 , 2 ( x 1 , x 2 , x 3 , x 4 , x 5 ) = 6 x 5 x 1 + 15 x 4 x 2 + 10 x 3 2 . {\displaystyle B_{6,2}(x_{1},x_{2},x_{3},x_{4},x_{5})=6x_{5}x_{1}+15x_{4}x_{2}+10x_{3}^{2}.}

This tells us that if a set with 6 elements is divided into 2 blocks, then we can have 6 partitions with blocks of size 1 and 5, 15 partitions with blocks of size 4 and 2, and 10 partitions with 2 blocks of size 3.

The sum of the subscripts in a monomial is equal to the total number of elements. Thus, the number of monomials that appear in the partial Bell polynomial is equal to the number of ways the integer n can be expressed as a summation of k positive integers. This is the same as the integer partition of n into k parts. For instance, in the above examples, the integer 3 can be partitioned into two parts as 2+1 only. Thus, there is only one monomial in B_3,2. However, the integer 6 can be partitioned into two parts as 5+1, 4+2, and 3+3. Thus, there are three monomials in B_6,2. Indeed, the subscripts of the variables in a monomial are the same as those given by the integer partition, indicating the sizes of the different blocks. The total number of monomials appearing in a complete Bell polynomial B_n is thus equal to the total number of integer partitions of n.

Also the degree of each monomial, which is the sum of the exponents of each variable in the monomial, is equal to the number of blocks the set is divided into. That is, j₁ + j₂ + ... = k . Thus, given a complete Bell polynomial B_n, we can separate the partial Bell polynomial B_n,k by collecting all those monomials with degree k.

Finally, if we disregard the sizes of the blocks and put all x_i = x, then the summation of the coefficients of the partial Bell polynomial B_n,k will give the total number of ways that a set with n elements can be partitioned into k blocks, which is the same as the Stirling numbers of the second kind. Also, the summation of all the coefficients of the complete Bell polynomial B_n will give us the total number of ways a set with n elements can be partitioned into non-overlapping subsets, which is the same as the Bell number.

In general, if the integer n is partitioned into a sum in which "1" appears j₁ times, "2" appears j₂ 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 indistinguishable is the corresponding coefficient in the polynomial.

For example, we have

B 6 , 2 ( x 1 , x 2 , x 3 , x 4 , x 5 ) = 6 x 5 x 1 + 15 x 4 x 2 + 10 x 3 2 {\displaystyle B_{6,2}(x_{1},x_{2},x_{3},x_{4},x_{5})=6x_{5}x_{1}+15x_{4}x_{2}+10x_{3}^{2}}

because the ways to partition a set of 6 elements as 2 blocks are

6 ways to partition a set of 6 as 5 + 1,

15 ways to partition a set of 6 as 4 + 2, and

10 ways to partition a set of 6 as 3 + 3.

Similarly,

B 6 , 3 ( x 1 , x 2 , x 3 , x 4 ) = 15 x 4 x 1 2 + 60 x 3 x 2 x 1 + 15 x 2 3 {\displaystyle B_{6,3}(x_{1},x_{2},x_{3},x_{4})=15x_{4}x_{1}^{2}+60x_{3}x_{2}x_{1}+15x_{2}^{3}}

because the ways to partition a set of 6 elements as 3 blocks 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.

Below is a triangular array of the incomplete Bell polynomials B n , k ( x 1 , x 2 , … , x n − k + 1 ) {\displaystyle B_{n,k}(x_{1},x_{2},\dots ,x_{n-k+1})} :

k n	0	1	2	3	4	5	6
0	1 {\displaystyle 1}
1	0 {\displaystyle 0}	x 1 {\displaystyle x_{1}}
2	0 {\displaystyle 0}	x 2 {\displaystyle x_{2}}	x 1 2 {\displaystyle x_{1}^{2}}
3	0 {\displaystyle 0}	x 3 {\displaystyle x_{3}}	3 x 1 x 2 {\displaystyle 3x_{1}x_{2}}	x 1 3 {\displaystyle x_{1}^{3}}
4	0 {\displaystyle 0}	x 4 {\displaystyle x_{4}}	3 x 2 2 + 4 x 1 x 3 {\displaystyle 3x_{2}^{2}+4x_{1}x_{3}}	6 x 1 2 x 2 {\displaystyle 6x_{1}^{2}x_{2}}	x 1 4 {\displaystyle x_{1}^{4}}
5	0 {\displaystyle 0}	x 5 {\displaystyle x_{5}}	10 x 2 x 3 + 5 x 1 x 4 {\displaystyle 10x_{2}x_{3}+5x_{1}x_{4}}	15 x 1 x 2 2 + 10 x 1 2 x 3 {\displaystyle 15x_{1}x_{2}^{2}+10x_{1}^{2}x_{3}}	10 x 1 3 x 2 {\displaystyle 10x_{1}^{3}x_{2}}	x 1 5 {\displaystyle x_{1}^{5}}
6	0 {\displaystyle 0}	x 6 {\displaystyle x_{6}}	10 x 3 2 + 15 x 2 x 4 + 6 x 1 x 5 {\displaystyle 10x_{3}^{2}+15x_{2}x_{4}+6x_{1}x_{5}}	15 x 2 3 + 60 x 1 x 2 x 3 + 15 x 1 2 x 4 {\displaystyle 15x_{2}^{3}+60x_{1}x_{2}x_{3}+15x_{1}^{2}x_{4}}	45 x 1 2 x 2 2 + 20 x 1 3 x 3 {\displaystyle 45x_{1}^{2}x_{2}^{2}+20x_{1}^{3}x_{3}}	15 x 1 4 x 2 {\displaystyle 15x_{1}^{4}x_{2}}	x 1 6 {\displaystyle x_{1}^{6}}

The exponential partial Bell polynomials have the following bivariate generating function:

Φ ( t , u ) = exp ⁡ ( u ∑ j = 1 ∞ x j t j j ! ) = ∑ n ≥ k ≥ 0 B n , k ( x 1 , … , x n − k + 1 ) t n n ! u k = ∑ n = 0 ∞ t n n ! ∑ k = 0 n u k B n , k ( x 1 , … , x n − k + 1 ) . {\displaystyle {\begin{aligned}\Phi (t,u)&=\exp \left(u\sum _{j=1}^{\infty }x_{j}{\frac {t^{j}}{j!}}\right)=\sum _{n\geq k\geq 0}B_{n,k}(x_{1},\ldots ,x_{n-k+1}){\frac {t^{n}}{n!}}u^{k}\\&=\sum _{n=0}^{\infty }{\frac {t^{n}}{n!}}\sum _{k=0}^{n}u^{k}B_{n,k}(x_{1},\ldots ,x_{n-k+1}).\end{aligned}}}

In other words, by what amounts to the same, by the series expansion of the k-th power:

1 k ! ( ∑ j = 1 ∞ x j t j j ! ) k = ∑ n = k ∞ B n , k ( x 1 , … , x n − k + 1 ) t n n ! , k = 0 , 1 , 2 , … {\displaystyle {\frac {1}{k!}}\left(\sum _{j=1}^{\infty }x_{j}{\frac {t^{j}}{j!}}\right)^{k}=\sum _{n=k}^{\infty }B_{n,k}(x_{1},\ldots ,x_{n-k+1}){\frac {t^{n}}{n!}},\qquad k=0,1,2,\ldots }

The generating function for the exponential Bell polynomial is given Φ ( t , 1 ) {\displaystyle \Phi (t,1)} since

Φ ( t , 1 ) = exp ⁡ ( ∑ j = 1 ∞ x j t j j ! ) = ∑ n = 0 ∞ B n ( x 1 , … , x n ) t n n ! . {\displaystyle \Phi (t,1)=\exp \left(\sum _{j=1}^{\infty }x_{j}{\frac {t^{j}}{j!}}\right)=\sum _{n=0}^{\infty }B_{n}(x_{1},\ldots ,x_{n}){\frac {t^{n}}{n!}}.}

Likewise, the generating function for the ordinary partial Bell polynomial is

Φ ^ ( t , u ) = exp ⁡ ( u ∑ j = 1 ∞ x j t j ) = ∑ n ≥ k ≥ 0 B ^ n , k ( x 1 , … , x n − k + 1 ) t n u k k ! . {\displaystyle {\hat {\Phi }}(t,u)=\exp \left(u\sum _{j=1}^{\infty }x_{j}t^{j}\right)=\sum _{n\geq k\geq 0}{\hat {B}}_{n,k}(x_{1},\ldots ,x_{n-k+1})t^{n}{\frac {u^{k}}{k!}}.}

In particular, by taking the coefficient of u k {\displaystyle u^{k}} , we have:

( ∑ j = 1 ∞ x j t j ) k = ∑ n = k ∞ B ^ n , k ( x 1 , … , x n − k + 1 ) t n . {\displaystyle \left(\sum _{j=1}^{\infty }x_{j}t^{j}\right)^{k}=\sum _{n=k}^{\infty }{\hat {B}}_{n,k}(x_{1},\ldots ,x_{n-k+1})t^{n}.}

See also generating function transformations for Bell polynomial generating function expansions of compositions of sequence generating functions and powers, logarithms, and exponentials of a sequence generating function. Each of these formulas is cited in the respective sections of Comtet.^[1]

The complete Bell polynomials satisfy a recurrence relation:

B n + 1 ( x 1 , … , x n + 1 ) = ∑ i = 0 n ( n i ) B n − i ( x 1 , … , x n − i ) x i + 1 {\displaystyle B_{n+1}(x_{1},\ldots ,x_{n+1})=\sum _{i=0}^{n}{n \choose i}B_{n-i}(x_{1},\ldots ,x_{n-i})x_{i+1}}

with the initial value B 0 = 1 {\displaystyle B_{0}=1} .

The partial Bell polynomials can also be computed efficiently by a recurrence relation:

B n + 1 , k + 1 ( x 1 , … , x n − k + 1 ) = ∑ i = 0 n − k ( n i ) x i + 1 B n − i , k ( x 1 , … , x n − k − i + 1 ) {\displaystyle B_{n+1,k+1}(x_{1},\ldots ,x_{n-k+1})=\sum _{i=0}^{n-k}{\binom {n}{i}}x_{i+1}B_{n-i,k}(x_{1},\ldots ,x_{n-k-i+1})}

where

B 0 , 0 = 1 ; {\displaystyle B_{0,0}=1;}

B n , 0 = 0  for  n ≥ 1 ; {\displaystyle B_{n,0}=0{\text{ for }}n\geq 1;}

B 0 , k = 0  for  k ≥ 1. {\displaystyle B_{0,k}=0{\text{ for }}k\geq 1.}

In addition:^[2]

B n , k 1 + k 2 ( x 1 , … , x n − k 1 − k 2 + 1 ) = k 1 ! k 2 ! ( k 1 + k 2 ) ! ∑ i = 0 n ( n i ) B i , k 1 ( x 1 , … , x i − k 1 + 1 ) B n − i , k 2 ( x 1 , … , x n − i − k 2 + 1 ) . {\displaystyle B_{n,k_{1}+k_{2}}(x_{1},\ldots ,x_{n-k_{1}-k_{2}+1})={\frac {k_{1}!\,k_{2}!}{(k_{1}+k_{2})!}}\sum _{i=0}^{n}{\binom {n}{i}}B_{i,k_{1}}(x_{1},\ldots ,x_{i-k_{1}+1})B_{n-i,k_{2}}(x_{1},\ldots ,x_{n-i-k_{2}+1}).}

When 1 ≤ a < n {\displaystyle 1\leq a<n} ,

B n , n − a ( x 1 , … , x a + 1 ) = ∑ j = a + 1 2 a j ! a ! ( n j ) x 1 n − j B a , j − a ( x 2 2 , x 3 3 , … , x 2 ( a + 1 ) − j 2 ( a + 1 ) − j ) . {\displaystyle B_{n,n-a}(x_{1},\ldots ,x_{a+1})=\sum _{j=a+1}^{2a}{\frac {j!}{a!}}{\binom {n}{j}}x_{1}^{n-j}B_{a,j-a}{\Bigl (}{\frac {x_{2}}{2}},{\frac {x_{3}}{3}},\ldots ,{\frac {x_{2(a+1)-j}}{2(a+1)-j}}{\Bigr )}.}

The complete Bell polynomials also satisfy the following recurrence differential formula:^[3]

B n ( x 1 , … , x n ) = 1 n − 1 [ ∑ i = 2 n ∑ j = 1 i − 1 ( i − 1 ) ( i − 2 j − 1 ) x j x i − j ∂ B n − 1 ( x 1 , … , x n − 1 ) ∂ x i − 1 + ∑ i = 2 n ∑ j = 1 i − 1 x i + 1 ( i j ) ∂ 2 B n − 1 ( x 1 , … , x n − 1 ) ∂ x j ∂ x i − j + ∑ i = 2 n x i ∂ B n − 1 ( x 1 , … , x n − 1 ) ∂ x i − 1 ] . {\displaystyle {\begin{aligned}B_{n}(x_{1},\ldots ,x_{n})={\frac {1}{n-1}}\left[\sum _{i=2}^{n}\right.&\sum _{j=1}^{i-1}(i-1){\binom {i-2}{j-1}}x_{j}x_{i-j}{\frac {\partial B_{n-1}(x_{1},\dots ,x_{n-1})}{\partial x_{i-1}}}\\[5pt]&\left.{}+\sum _{i=2}^{n}\sum _{j=1}^{i-1}{\frac {x_{i+1}}{\binom {i}{j}}}{\frac {\partial ^{2}B_{n-1}(x_{1},\dots ,x_{n-1})}{\partial x_{j}\partial x_{i-j}}}\right.\\[5pt]&\left.{}+\sum _{i=2}^{n}x_{i}{\frac {\partial B_{n-1}(x_{1},\dots ,x_{n-1})}{\partial x_{i-1}}}\right].\end{aligned}}}

The partial derivatives of the complete Bell polynomials are given by^[4]

∂ B n ∂ x i ( x 1 , … , x n ) = ( n i ) B n − i ( x 1 , … , x n − i ) . {\displaystyle {\frac {\partial B_{n}}{\partial x_{i}}}(x_{1},\ldots ,x_{n})={\binom {n}{i}}B_{n-i}(x_{1},\ldots ,x_{n-i}).}

Similarly, the partial derivatives of the partial Bell polynomials are given by

∂ B n , k ∂ x i ( x 1 , … , x n − k + 1 ) = ( n i ) B n − i , k − 1 ( x 1 , … , x n − i − k + 2 ) . {\displaystyle {\frac {\partial B_{n,k}}{\partial x_{i}}}(x_{1},\ldots ,x_{n-k+1})={\binom {n}{i}}B_{n-i,k-1}(x_{1},\ldots ,x_{n-i-k+2}).}

If the arguments of the Bell polynomials are one-dimensional functions, the chain rule can be used to obtain

d d x ( B n , k ( a 1 ( x ) , ⋯ , a n − k + 1 ( x ) ) ) = ∑ i = 1 n − k + 1 ( n i ) a i ′ ( x ) B n − i , k − 1 ( a 1 ( x ) , ⋯ , a n − i − k + 2 ( x ) ) . {\displaystyle {\frac {d}{dx}}\left(B_{n,k}(a_{1}(x),\cdots ,a_{n-k+1}(x))\right)=\sum _{i=1}^{n-k+1}{\binom {n}{i}}a_{i}'(x)B_{n-i,k-1}(a_{1}(x),\cdots ,a_{n-i-k+2}(x)).}

The value of the Bell polynomial B_n,k(x₁,x₂,...) on the sequence of factorials equals an unsigned Stirling number of the first kind:

B n , k ( 0 ! , 1 ! , … , ( n − k ) ! ) = c ( n , k ) = | s ( n , k ) | = [ n k ] . {\displaystyle B_{n,k}(0!,1!,\dots ,(n-k)!)=c(n,k)=|s(n,k)|=\left[{n \atop k}\right].}

The sum of these values gives the value of the complete Bell polynomial on the sequence of factorials:

B n ( 0 ! , 1 ! , … , ( n − 1 ) ! ) = ∑ k = 1 n B n , k ( 0 ! , 1 ! , … , ( n − k ) ! ) = ∑ k = 1 n [ n k ] = n ! . {\displaystyle B_{n}(0!,1!,\dots ,(n-1)!)=\sum _{k=1}^{n}B_{n,k}(0!,1!,\dots ,(n-k)!)=\sum _{k=1}^{n}\left[{n \atop k}\right]=n!.}

The value of the Bell polynomial B_n,k(x₁,x₂,...) on the sequence of ones equals a Stirling number of the second kind:

B n , k ( 1 , 1 , … , 1 ) = S ( n , k ) = { n k } . {\displaystyle B_{n,k}(1,1,\dots ,1)=S(n,k)=\left\{{n \atop k}\right\}.}

The sum of these values gives the value of the complete Bell polynomial on the sequence of ones:

B n ( 1 , 1 , … , 1 ) = ∑ k = 1 n B n , k ( 1 , 1 , … , 1 ) = ∑ k = 1 n { n k } , {\displaystyle B_{n}(1,1,\dots ,1)=\sum _{k=1}^{n}B_{n,k}(1,1,\dots ,1)=\sum _{k=1}^{n}\left\{{n \atop k}\right\},}

which is the nth Bell number.

B n , k ( 1 ! , 2 ! , … , ( n − k + 1 ) ! ) = ( n − 1 k − 1 ) n ! k ! = L ( n , k ) {\displaystyle B_{n,k}(1!,2!,\ldots ,(n-k+1)!)={\binom {n-1}{k-1}}{\frac {n!}{k!}}=L(n,k)}

which gives the Lah number.

Touchard polynomial T n ( x ) = ∑ k = 0 n { n k } ⋅ x k {\displaystyle T_{n}(x)=\sum _{k=0}^{n}\left\{{n \atop k}\right\}\cdot x^{k}} can be expressed as the value of the complete Bell polynomial on all arguments being x:

T n ( x ) = B n ( x , x , … , x ) . {\displaystyle T_{n}(x)=B_{n}(x,x,\dots ,x).}

If we define

y n = ∑ k = 1 n B n , k ( x 1 , … , x n − k + 1 ) , {\displaystyle y_{n}=\sum _{k=1}^{n}B_{n,k}(x_{1},\ldots ,x_{n-k+1}),}

then we have the inverse relationship

x n = ∑ k = 1 n ( − 1 ) k − 1 ( k − 1 ) ! B n , k ( y 1 , … , y n − k + 1 ) . {\displaystyle x_{n}=\sum _{k=1}^{n}(-1)^{k-1}(k-1)!B_{n,k}(y_{1},\ldots ,y_{n-k+1}).}

More generally,^[5][6] given some function f {\displaystyle f} admitting an inverse g = f − 1 {\displaystyle g=f^{-1}} ,

y n = ∑ k = 0 n f ( k ) ( a ) B n , k ( x 1 , … , x n − k + 1 ) ⇔ x n = ∑ k = 0 n g ( k ) ( f ( a ) ) B n , k ( y 1 , … , y n − k + 1 ) . {\displaystyle y_{n}=\sum _{k=0}^{n}f^{(k)}(a)\,B_{n,k}(x_{1},\ldots ,x_{n-k+1})\quad \Leftrightarrow \quad x_{n}=\sum _{k=0}^{n}g^{(k)}{\big (}f(a){\big )}\,B_{n,k}(y_{1},\ldots ,y_{n-k+1}).}

The complete Bell polynomial can be expressed as determinants:

B n ( x 1 , … , x n ) = det [ x 1 ( n − 1 1 ) x 2 ( n − 1 2 ) x 3 ( n − 1 3 ) x 4 ⋯ ⋯ x n − 1 x 1 ( n − 2 1 ) x 2 ( n − 2 2 ) x 3 ⋯ ⋯ x n − 1 0 − 1 x 1 ( n − 3 1 ) x 2 ⋯ ⋯ x n − 2 0 0 − 1 x 1 ⋯ ⋯ x n − 3 0 0 0 − 1 ⋯ ⋯ x n − 4 ⋮ ⋮ ⋮ ⋮ ⋱ ⋱ ⋮ 0 0 0 0 ⋯ − 1 x 1 ] {\displaystyle B_{n}(x_{1},\dots ,x_{n})=\det {\begin{bmatrix}x_{1}&{n-1 \choose 1}x_{2}&{n-1 \choose 2}x_{3}&{n-1 \choose 3}x_{4}&\cdots &\cdots &x_{n}\\\\-1&x_{1}&{n-2 \choose 1}x_{2}&{n-2 \choose 2}x_{3}&\cdots &\cdots &x_{n-1}\\\\0&-1&x_{1}&{n-3 \choose 1}x_{2}&\cdots &\cdots &x_{n-2}\\\\0&0&-1&x_{1}&\cdots &\cdots &x_{n-3}\\\\0&0&0&-1&\cdots &\cdots &x_{n-4}\\\\\vdots &\vdots &\vdots &\vdots &\ddots &\ddots &\vdots \\\\0&0&0&0&\cdots &-1&x_{1}\end{bmatrix}}}

and

B n ( x 1 , … , x n ) = det [ x 1 0 ! x 2 1 ! x 3 2 ! x 4 3 ! ⋯ ⋯ x n ( n − 1 ) ! − 1 x 1 0 ! x 2 1 ! x 3 2 ! ⋯ ⋯ x n − 1 ( n − 2 ) ! 0 − 2 x 1 0 ! x 2 1 ! ⋯ ⋯ x n − 2 ( n − 3 ) ! 0 0 − 3 x 1 0 ! ⋯ ⋯ x n − 3 ( n − 4 ) ! 0 0 0 − 4 ⋯ ⋯ x n − 4 ( n − 5 ) ! ⋮ ⋮ ⋮ ⋮ ⋱ ⋱ ⋮ 0 0 0 0 ⋯ − ( n − 1 ) x 1 0 ! ] . {\displaystyle B_{n}(x_{1},\dots ,x_{n})=\det {\begin{bmatrix}{\frac {x_{1}}{0!}}&{\frac {x_{2}}{1!}}&{\frac {x_{3}}{2!}}&{\frac {x_{4}}{3!}}&\cdots &\cdots &{\frac {x_{n}}{(n-1)!}}\\\\-1&{\frac {x_{1}}{0!}}&{\frac {x_{2}}{1!}}&{\frac {x_{3}}{2!}}&\cdots &\cdots &{\frac {x_{n-1}}{(n-2)!}}\\\\0&-2&{\frac {x_{1}}{0!}}&{\frac {x_{2}}{1!}}&\cdots &\cdots &{\frac {x_{n-2}}{(n-3)!}}\\\\0&0&-3&{\frac {x_{1}}{0!}}&\cdots &\cdots &{\frac {x_{n-3}}{(n-4)!}}\\\\0&0&0&-4&\cdots &\cdots &{\frac {x_{n-4}}{(n-5)!}}\\\\\vdots &\vdots &\vdots &\vdots &\ddots &\ddots &\vdots \\\\0&0&0&0&\cdots &-(n-1)&{\frac {x_{1}}{0!}}\end{bmatrix}}.}

For sequences x_n, y_n, n = 1, 2, ..., define a convolution by:

( x ♢ y ) n = ∑ j = 1 n − 1 ( n j ) x j y n − j . {\displaystyle (x{\mathbin {\diamondsuit }}y)_{n}=\sum _{j=1}^{n-1}{n \choose j}x_{j}y_{n-j}.}

The bounds of summation are 1 and n − 1, not 0 and n .

Let x n k ♢ {\displaystyle x_{n}^{k\diamondsuit }\,} be the nth term of the sequence

x ♢ ⋯ ♢ x ⏟ k  factors . {\displaystyle \displaystyle \underbrace {x{\mathbin {\diamondsuit }}\cdots {\mathbin {\diamondsuit }}x} _{k{\text{ factors}}}.\,}

Then^[2]

B n , k ( x 1 , … , x n − k + 1 ) = x n k ♢ k ! . {\displaystyle B_{n,k}(x_{1},\dots ,x_{n-k+1})={x_{n}^{k\diamondsuit } \over k!}.\,}

For example, let us compute B 4 , 3 ( x 1 , x 2 ) {\displaystyle B_{4,3}(x_{1},x_{2})} . We have

x = ( x 1   ,   x 2   ,   x 3   ,   x 4   , … ) {\displaystyle x=(x_{1}\ ,\ x_{2}\ ,\ x_{3}\ ,\ x_{4}\ ,\dots )}

x ♢ x = ( 0 ,   2 x 1 2   ,   6 x 1 x 2   ,   8 x 1 x 3 + 6 x 2 2   , … ) {\displaystyle x{\mathbin {\diamondsuit }}x=(0,\ 2x_{1}^{2}\ ,\ 6x_{1}x_{2}\ ,\ 8x_{1}x_{3}+6x_{2}^{2}\ ,\dots )}

x ♢ x ♢ x = ( 0   ,   0   ,   6 x 1 3   ,   36 x 1 2 x 2   , … ) {\displaystyle x{\mathbin {\diamondsuit }}x{\mathbin {\diamondsuit }}x=(0\ ,\ 0\ ,\ 6x_{1}^{3}\ ,\ 36x_{1}^{2}x_{2}\ ,\dots )}

and thus,

B 4 , 3 ( x 1 , x 2 ) = ( x ♢ x ♢ x ) 4 3 ! = 6 x 1 2 x 2 . {\displaystyle B_{4,3}(x_{1},x_{2})={\frac {(x{\mathbin {\diamondsuit }}x{\mathbin {\diamondsuit }}x)_{4}}{3!}}=6x_{1}^{2}x_{2}.}

• B n , k ( 1 , 2 , 3 , … , n − k + 1 ) = ( n k ) k n − k {\displaystyle B_{n,k}(1,2,3,\ldots ,n-k+1)={\binom {n}{k}}k^{n-k}} which gives the idempotent number.
• B n , k ( α β x 1 , α β 2 x 2 , … , α β n − k + 1 x n − k + 1 ) = α k β n B n , k ( x 1 , x 2 , … , x n − k + 1 ) {\displaystyle B_{n,k}(\alpha \beta x_{1},\alpha \beta ^{2}x_{2},\ldots ,\alpha \beta ^{n-k+1}x_{n-k+1})=\alpha ^{k}\beta ^{n}B_{n,k}(x_{1},x_{2},\ldots ,x_{n-k+1})} .
• The complete Bell polynomials satisfy the binomial type relation:

  B n ( x 1 + y 1 , … , x n + y n ) = ∑ i = 0 n ( n i ) B n − i ( x 1 , … , x n − i ) B i ( y 1 , … , y i ) , {\displaystyle B_{n}(x_{1}+y_{1},\ldots ,x_{n}+y_{n})=\sum _{i=0}^{n}{n \choose i}B_{n-i}(x_{1},\ldots ,x_{n-i})B_{i}(y_{1},\ldots ,y_{i}),}

  B n , k ( x q + 1 ( q + 1 q ) , x q + 2 ( q + 2 q ) , … ) = n ! ( q ! ) k ( n + q k ) ! B n + q k , k ( … , 0 , 0 , x q + 1 , x q + 2 , … ) . {\displaystyle B_{n,k}{\Bigl (}{\frac {x_{q+1}}{\binom {q+1}{q}}},{\frac {x_{q+2}}{\binom {q+2}{q}}},\ldots {\Bigr )}={\frac {n!(q!)^{k}}{(n+qk)!}}B_{n+qk,k}(\ldots ,0,0,x_{q+1},x_{q+2},\ldots ).}

This corrects the omission of the factor ( q ! ) k {\displaystyle (q!)^{k}} in Comtet's book.^[7]

• Special cases of partial Bell polynomials:

B n , 1 ( x 1 , … , x n ) = x n B n , 2 ( x 1 , … , x n − 1 ) = 1 2 ∑ k = 1 n − 1 ( n k ) x k x n − k B n , n ( x 1 ) = x 1 n B n , n − 1 ( x 1 , x 2 ) = ( n 2 ) x 1 n − 2 x 2 B n , n − 2 ( x 1 , x 2 , x 3 ) = ( n 3 ) x 1 n − 3 x 3 + 3 ( n 4 ) x 1 n − 4 x 2 2 B n , n − 3 ( x 1 , x 2 , x 3 , x 4 ) = ( n 4 ) x 1 n − 4 x 4 + 10 ( n 5 ) x 1 n − 5 x 2 x 3 + 15 ( n 6 ) x 1 n − 6 x 2 3 B n , n − 4 ( x 1 , x 2 , x 3 , x 4 , x 5 ) = ( n 5 ) x 1 n − 5 x 5 + 5 ( n 6 ) x 1 n − 6 ( 3 x 2 x 4 + 2 x 3 2 ) + 105 ( n 7 ) x 1 n − 7 x 2 2 x 3 + 105 ( n 8 ) x 1 n − 8 x 2 4 . {\displaystyle {\begin{aligned}B_{n,1}(x_{1},\ldots ,x_{n})={}&x_{n}\\B_{n,2}(x_{1},\ldots ,x_{n-1})={}&{\frac {1}{2}}\sum _{k=1}^{n-1}{\binom {n}{k}}x_{k}x_{n-k}\\B_{n,n}(x_{1})={}&x_{1}^{n}\\B_{n,n-1}(x_{1},x_{2})={}&{\binom {n}{2}}x_{1}^{n-2}x_{2}\\B_{n,n-2}(x_{1},x_{2},x_{3})={}&{\binom {n}{3}}x_{1}^{n-3}x_{3}+3{\binom {n}{4}}x_{1}^{n-4}x_{2}^{2}\\B_{n,n-3}(x_{1},x_{2},x_{3},x_{4})={}&{\binom {n}{4}}x_{1}^{n-4}x_{4}+10{\binom {n}{5}}x_{1}^{n-5}x_{2}x_{3}+15{\binom {n}{6}}x_{1}^{n-6}x_{2}^{3}\\B_{n,n-4}(x_{1},x_{2},x_{3},x_{4},x_{5})={}&{\binom {n}{5}}x_{1}^{n-5}x_{5}+5{\binom {n}{6}}x_{1}^{n-6}(3x_{2}x_{4}+2x_{3}^{2})+105{\binom {n}{7}}x_{1}^{n-7}x_{2}^{2}x_{3}\\&+105{\binom {n}{8}}x_{1}^{n-8}x_{2}^{4}.\end{aligned}}}

The first few complete Bell polynomials are:

B 0 = 1 , B 1 ( x 1 ) = x 1 , B 2 ( x 1 , x 2 ) = x 1 2 + x 2 , B 3 ( x 1 , x 2 , x 3 ) = x 1 3 + 3 x 1 x 2 + x 3 , B 4 ( x 1 , x 2 , x 3 , x 4 ) = x 1 4 + 6 x 1 2 x 2 + 4 x 1 x 3 + 3 x 2 2 + x 4 , B 5 ( x 1 , x 2 , x 3 , x 4 , x 5 ) = x 1 5 + 10 x 2 x 1 3 + 15 x 2 2 x 1 + 10 x 3 x 1 2 + 10 x 3 x 2 + 5 x 4 x 1 + x 5 B 6 ( x 1 , x 2 , x 3 , x 4 , x 5 , x 6 ) = x 1 6 + 15 x 2 x 1 4 + 20 x 3 x 1 3 + 45 x 2 2 x 1 2 + 15 x 2 3 + 60 x 3 x 2 x 1 + 15 x 4 x 1 2 + 10 x 3 2 + 15 x 4 x 2 + 6 x 5 x 1 + x 6 , B 7 ( x 1 , x 2 , x 3 , x 4 , x 5 , x 6 , x 7 ) = x 1 7 + 21 x 1 5 x 2 + 35 x 1 4 x 3 + 105 x 1 3 x 2 2 + 35 x 1 3 x 4 + 210 x 1 2 x 2 x 3 + 105 x 1 x 2 3 + 21 x 1 2 x 5 + 105 x 1 x 2 x 4 + 70 x 1 x 3 2 + 105 x 2 2 x 3 + 7 x 1 x 6 + 21 x 2 x 5 + 35 x 3 x 4 + x 7 . {\displaystyle {\begin{aligned}B_{0}={}&1,\\[8pt]B_{1}(x_{1})={}&x_{1},\\[8pt]B_{2}(x_{1},x_{2})={}&x_{1}^{2}+x_{2},\\[8pt]B_{3}(x_{1},x_{2},x_{3})={}&x_{1}^{3}+3x_{1}x_{2}+x_{3},\\[8pt]B_{4}(x_{1},x_{2},x_{3},x_{4})={}&x_{1}^{4}+6x_{1}^{2}x_{2}+4x_{1}x_{3}+3x_{2}^{2}+x_{4},\\[8pt]B_{5}(x_{1},x_{2},x_{3},x_{4},x_{5})={}&x_{1}^{5}+10x_{2}x_{1}^{3}+15x_{2}^{2}x_{1}+10x_{3}x_{1}^{2}+10x_{3}x_{2}+5x_{4}x_{1}+x_{5}\\[8pt]B_{6}(x_{1},x_{2},x_{3},x_{4},x_{5},x_{6})={}&x_{1}^{6}+15x_{2}x_{1}^{4}+20x_{3}x_{1}^{3}+45x_{2}^{2}x_{1}^{2}+15x_{2}^{3}+60x_{3}x_{2}x_{1}\\&{}+15x_{4}x_{1}^{2}+10x_{3}^{2}+15x_{4}x_{2}+6x_{5}x_{1}+x_{6},\\[8pt]B_{7}(x_{1},x_{2},x_{3},x_{4},x_{5},x_{6},x_{7})={}&x_{1}^{7}+21x_{1}^{5}x_{2}+35x_{1}^{4}x_{3}+105x_{1}^{3}x_{2}^{2}+35x_{1}^{3}x_{4}\\&{}+210x_{1}^{2}x_{2}x_{3}+105x_{1}x_{2}^{3}+21x_{1}^{2}x_{5}+105x_{1}x_{2}x_{4}\\&{}+70x_{1}x_{3}^{2}+105x_{2}^{2}x_{3}+7x_{1}x_{6}+21x_{2}x_{5}+35x_{3}x_{4}+x_{7}.\end{aligned}}}

Faà di Bruno's formula may be stated in terms of Bell polynomials as follows:

d n d x n f ( g ( x ) ) = ∑ k = 1 n f ( k ) ( g ( x ) ) B n , k ( g ′ ( x ) , g ″ ( x ) , … , g ( n − k + 1 ) ( x ) ) . {\displaystyle {d^{n} \over dx^{n}}f(g(x))=\sum _{k=1}^{n}f^{(k)}(g(x))B_{n,k}\left(g'(x),g''(x),\dots ,g^{(n-k+1)}(x)\right).}

Similarly, a power-series version of Faà di Bruno's formula may be stated using Bell polynomials as follows. Suppose

f ( x ) = ∑ n = 1 ∞ a n n ! x n and g ( x ) = ∑ n = 0 ∞ b n n ! x n . {\displaystyle f(x)=\sum _{n=1}^{\infty }{a_{n} \over n!}x^{n}\qquad {\text{and}}\qquad g(x)=\sum _{n=0}^{\infty }{b_{n} \over n!}x^{n}.}

Then

g ( f ( x ) ) = ∑ n = 0 ∞ ∑ k = 0 n b k B n , k ( a 1 , … , a n − k + 1 ) n ! x n . {\displaystyle g(f(x))=\sum _{n=0}^{\infty }{\frac {\sum _{k=0}^{n}b_{k}B_{n,k}(a_{1},\dots ,a_{n-k+1})}{n!}}x^{n}.}

In particular, the complete Bell polynomials appear in the exponential of a formal power series:

exp ⁡ ( ∑ i = 1 ∞ a i i ! x i ) = ∑ n = 0 ∞ B n ( a 1 , … , a n ) n ! x n , {\displaystyle \exp \left(\sum _{i=1}^{\infty }{a_{i} \over i!}x^{i}\right)=\sum _{n=0}^{\infty }{B_{n}(a_{1},\dots ,a_{n}) \over n!}x^{n},}

which also represents the exponential generating function of the complete Bell polynomials on a fixed sequence of arguments a 1 , a 2 , … {\displaystyle a_{1},a_{2},\dots } .

Let two functions f and g be expressed in formal power series as

f ( w ) = ∑ k = 0 ∞ f k w k k ! , and g ( z ) = ∑ k = 0 ∞ g k z k k ! , {\displaystyle f(w)=\sum _{k=0}^{\infty }f_{k}{\frac {w^{k}}{k!}},\qquad {\text{and}}\qquad g(z)=\sum _{k=0}^{\infty }g_{k}{\frac {z^{k}}{k!}},}

such that g is the compositional inverse of f defined by g(f(w)) = w or f(g(z)) = z. If f₀ = 0 and f₁ ≠ 0, then an explicit form of the coefficients of the inverse can be given in term of Bell polynomials as^[8]

g n = 1 f 1 n ∑ k = 1 n − 1 ( − 1 ) k n k ¯ B n − 1 , k ( f ^ 1 , f ^ 2 , … , f ^ n − k ) , n ≥ 2 , {\displaystyle g_{n}={\frac {1}{f_{1}^{n}}}\sum _{k=1}^{n-1}(-1)^{k}n^{\bar {k}}B_{n-1,k}({\hat {f}}_{1},{\hat {f}}_{2},\ldots ,{\hat {f}}_{n-k}),\qquad n\geq 2,}

with f ^ k = f k + 1 ( k + 1 ) f 1 , {\displaystyle {\hat {f}}_{k}={\frac {f_{k+1}}{(k+1)f_{1}}},} and n k ¯ = n ( n + 1 ) ⋯ ( n + k − 1 ) {\displaystyle n^{\bar {k}}=n(n+1)\cdots (n+k-1)} is the rising factorial, and g 1 = 1 f 1 . {\displaystyle g_{1}={\frac {1}{f_{1}}}.}

Consider the integral of the form

I ( λ ) = ∫ a b e − λ f ( x ) g ( x ) d x , {\displaystyle I(\lambda )=\int _{a}^{b}e^{-\lambda f(x)}g(x)\,\mathrm {d} x,}

where (a,b) is a real (finite or infinite) interval, λ is a large positive parameter and the functions f and g are continuous. Let f have a single minimum in [a,b] which occurs at x = a. Assume that as x → a⁺,

f ( x ) ∼ f ( a ) + ∑ k = 0 ∞ a k ( x − a ) k + α , {\displaystyle f(x)\sim f(a)+\sum _{k=0}^{\infty }a_{k}(x-a)^{k+\alpha },}

g ( x ) ∼ ∑ k = 0 ∞ b k ( x − a ) k + β − 1 , {\displaystyle g(x)\sim \sum _{k=0}^{\infty }b_{k}(x-a)^{k+\beta -1},}

with α > 0, Re(β) > 0; and that the expansion of f can be term wise differentiated. Then, Laplace–Erdelyi theorem states that the asymptotic expansion of the integral I(λ) is given by

I ( λ ) ∼ e − λ f ( a ) ∑ n = 0 ∞ Γ ( n + β α ) c n λ ( n + β ) / α as λ → ∞ , {\displaystyle I(\lambda )\sim e^{-\lambda f(a)}\sum _{n=0}^{\infty }\Gamma {\Big (}{\frac {n+\beta }{\alpha }}{\Big )}{\frac {c_{n}}{\lambda ^{(n+\beta )/\alpha }}}\qquad {\text{as}}\quad \lambda \rightarrow \infty ,}

where the coefficients c_n are expressible in terms of a_n and b_n using partial ordinary Bell polynomials, as given by Campbell–Froman–Walles–Wojdylo formula:

c n = 1 α a 0 ( n + β ) / α ∑ k = 0 n b n − k ∑ j = 0 k ( − n + β α j ) 1 a 0 j B ^ k , j ( a 1 , a 2 , … , a k − j + 1 ) . {\displaystyle c_{n}={\frac {1}{\alpha a_{0}^{(n+\beta )/\alpha }}}\sum _{k=0}^{n}b_{n-k}\sum _{j=0}^{k}{\binom {-{\frac {n+\beta }{\alpha }}}{j}}{\frac {1}{a_{0}^{j}}}{\hat {B}}_{k,j}(a_{1},a_{2},\ldots ,a_{k-j+1}).}

The elementary symmetric polynomial e n {\displaystyle e_{n}} and the power sum symmetric polynomial p n {\displaystyle p_{n}} can be related to each other using Bell polynomials as:

e n = 1 n ! B n ( p 1 , − 1 ! p 2 , 2 ! p 3 , − 3 ! p 4 , … , ( − 1 ) n − 1 ( n − 1 ) ! p n ) = ( − 1 ) n n ! B n ( − p 1 , − 1 ! p 2 , − 2 ! p 3 , − 3 ! p 4 , … , − ( n − 1 ) ! p n ) , {\displaystyle {\begin{aligned}e_{n}&={\frac {1}{n!}}\;B_{n}(p_{1},-1!p_{2},2!p_{3},-3!p_{4},\ldots ,(-1)^{n-1}(n-1)!p_{n})\\&={\frac {(-1)^{n}}{n!}}\;B_{n}(-p_{1},-1!p_{2},-2!p_{3},-3!p_{4},\ldots ,-(n-1)!p_{n}),\end{aligned}}}

p n = ( − 1 ) n − 1 ( n − 1 ) ! ∑ k = 1 n ( − 1 ) k − 1 ( k − 1 ) ! B n , k ( e 1 , 2 ! e 2 , 3 ! e 3 , … , ( n − k + 1 ) ! e n − k + 1 ) = ( − 1 ) n n ∑ k = 1 n 1 k B ^ n , k ( − e 1 , … , − e n − k + 1 ) . {\displaystyle {\begin{aligned}p_{n}&={\frac {(-1)^{n-1}}{(n-1)!}}\sum _{k=1}^{n}(-1)^{k-1}(k-1)!\;B_{n,k}(e_{1},2!e_{2},3!e_{3},\ldots ,(n-k+1)!e_{n-k+1})\\&=(-1)^{n}\;n\;\sum _{k=1}^{n}{\frac {1}{k}}\;{\hat {B}}_{n,k}(-e_{1},\dots ,-e_{n-k+1}).\end{aligned}}}

These formulae allow one to express the coefficients of monic polynomials in terms of the Bell polynomials of its zeroes. For instance, together with Cayley–Hamilton theorem they lead to expression of the determinant of a n × n square matrix A in terms of the traces of its powers:

det ( A ) = ( − 1 ) n n ! B n ( s 1 , s 2 , … , s n ) ,   where  s k = − ( k − 1 ) ! tr ⁡ ( A k ) . {\displaystyle \det(A)={\frac {(-1)^{n}}{n!}}B_{n}(s_{1},s_{2},\ldots ,s_{n}),~\qquad {\text{where }}s_{k}=-(k-1)!\operatorname {tr} (A^{k}).}

The cycle index of the symmetric group S n {\displaystyle S_{n}} can be expressed in terms of complete Bell polynomials as follows:

Z ( S n ) = B n ( 0 ! a 1 , 1 ! a 2 , … , ( n − 1 ) ! a n ) n ! . {\displaystyle Z(S_{n})={\frac {B_{n}(0!\,a_{1},1!\,a_{2},\dots ,(n-1)!\,a_{n})}{n!}}.}

The sum

μ n ′ = B n ( κ 1 , … , κ n ) = ∑ k = 1 n B n , k ( κ 1 , … , κ n − k + 1 ) {\displaystyle \mu _{n}'=B_{n}(\kappa _{1},\dots ,\kappa _{n})=\sum _{k=1}^{n}B_{n,k}(\kappa _{1},\dots ,\kappa _{n-k+1})}

is the nth raw moment of a probability distribution whose first n cumulants are κ₁, ..., κ_n. In other words, the nth moment is the nth complete Bell polynomial evaluated at the first n cumulants. Likewise, the nth cumulant can be given in terms of the moments as

κ n = ∑ k = 1 n ( − 1 ) k − 1 ( k − 1 ) ! B n , k ( μ 1 ′ , … , μ n − k + 1 ′ ) . {\displaystyle \kappa _{n}=\sum _{k=1}^{n}(-1)^{k-1}(k-1)!B_{n,k}(\mu '_{1},\ldots ,\mu '_{n-k+1}).}

Hermite polynomials can be expressed in terms of Bell polynomials as

He n ⁡ ( x ) = B n ( x , − 1 , 0 , … , 0 ) , {\displaystyle \operatorname {He} _{n}(x)=B_{n}(x,-1,0,\ldots ,0),}

where x_i = 0 for all i > 2; thus allowing for a combinatorial interpretation of the coefficients of the Hermite polynomials. This can be seen by comparing the generating function of the Hermite polynomials

exp ⁡ ( x t − t 2 2 ) = ∑ n = 0 ∞ He n ⁡ ( x ) t n n ! {\displaystyle \exp \left(xt-{\frac {t^{2}}{2}}\right)=\sum _{n=0}^{\infty }\operatorname {He} _{n}(x){\frac {t^{n}}{n!}}}

with that of Bell polynomials.

For any sequence a₁, a₂, …, a_n of scalars, let

p n ( x ) = B n ( a 1 x , … , a n x ) = ∑ k = 1 n B n , k ( a 1 , … , a n − k + 1 ) x k . {\displaystyle p_{n}(x)=B_{n}(a_{1}x,\ldots ,a_{n}x)=\sum _{k=1}^{n}B_{n,k}(a_{1},\dots ,a_{n-k+1})x^{k}.}

Then this polynomial sequence is of binomial type, i.e. it satisfies the binomial identity

p n ( x + y ) = ∑ k = 0 n ( n k ) p k ( x ) p n − k ( y ) . {\displaystyle p_{n}(x+y)=\sum _{k=0}^{n}{n \choose k}p_{k}(x)p_{n-k}(y).}

Example: For a₁ = … = a_n = 1, the polynomials p n ( x ) {\displaystyle p_{n}(x)} represent Touchard polynomials.

More generally, we have this result:

Theorem: All polynomial sequences of binomial type are of this form.

If we define a formal power series

h ( x ) = ∑ k = 1 ∞ a k k ! x k , {\displaystyle h(x)=\sum _{k=1}^{\infty }{a_{k} \over k!}x^{k},}

then for all n,

h − 1 ( d d x ) p n ( x ) = n p n − 1 ( x ) . {\displaystyle h^{-1}\left({d \over dx}\right)p_{n}(x)=np_{n-1}(x).}

Bell polynomials are implemented in:

• Mathematica as BellY
• Maple as IncompleteBellB
• SageMath as bell_polynomial

• Bell matrix
• Exponential formula