BellB
the Bell polynomials
IncompleteBellB
the incomplete Bell polynomials
CompleteBellB
the complete Bell polynomials
Calling Sequence
Parameters
Description
Examples
References
Compatibility
BellB(n,z)
IncompleteBellB(n,k,z1,z2,...,zn=k+1)
IncompleteBellB[DiamondConvolution](n,k,z1,z2,...,zn−k+1)
CompleteBellB(n,z1,z2,...,zn)
n,k
-
non-negative integers, or algebraic expressions representing them
z,z1,...,zn
the main variables of the polynomials, or algebraic expressions representing them
The BellB, IncompleteBellB, and CompleteBellB respectively represent the Bell polynomials, the incomplete Bell polynomials - also called Bell polynomials of the second kind - and the complete Bell polynomials. For the Bell numbers, see bell.
The BellB polynomials are polynomials of degree n defined in terms of the Stirling numbers of the second kind as
BellB⁡n,z=∑k=0n⁡Stirling2⁡n,k⁢zk
For the definition of the IncompleteBellB polynomials, consider a sequence zn with n=1,2,3,..., with which we construct the sequence
z⋄z⁢⁢=⁢z⋄z1⁢,⁢z⋄z2⁢,⁢z⋄z3⁢,⁢...
where the nth element is here defined as
z⋄zn⁢=⁢∑j=1n−1nj⁢zj⁢⁢zn−j
Taking z⋄z⋄z=z⋄z⋄z, the IncompleteBellB polynomials are defined in terms of an operation z⋄...⋄z involving k factors as
IncompleteBellBn,⁢k,⁢z1,⁢z2,⁢...=z⋄...⋄znk!
The output of IncompleteBellB is thus a multivariable polynomial of degree k in the zj variables. Note that the right-hand side of this formula involves only the first n−k+1 elements of the sequence zj; so in the left-hand side only the first n−k+1 zj are relevant, and all those not given in the input to IncompleteBellB will be assumed equal to zero.
To compute the first n elements of the sequence obtained by performing this diamond operation z⋄...⋄z between k factors you can use the IncompleteBellB:-DiamondConvolution command. This command makes use of the first n−k+1 elements of the sequence zj and returns a sequence of n elements, where the first k−1 are equal to zero and the remaining n−k+1 are all polynomials of degree k in the zj variables. Note that, unlike IncompleteBellB, IncompleteBellB:-DiamondConvolution expects the sequence zj enclosed as a list as third argument (see the Examples section).
The CompleteBellB polynomials are in turn defined in terms of the IncompleteBellB polynomials as
CompleteBellB⁡n,z1,z2,...,zn=∑k=1n⁡IncompleteBellB⁡n,k,z1,z2,...,zn−k+1
When the sequence zj passed to CompleteBellB contains less than n elements, the missing ones will be assumed equal to zero.
All of CompleteBellB, IncompleteBellB and IncompleteBellB:-DiamondConvolution accept inert sequences constructed with %seq or the quoted 'seq' functions as part of the zj arguments, in which case they return unevaluated, echoing the input.
The Bell polynomials appear in various applications, including for instance Faà di Bruno's formula
ⅆnⅆxnf⁡g⁡x=∑k=0n⁡fk⁡gx⁢IncompleteBellB⁡n,k,g′⁡x,g′′⁡x,...,gn−k+1⁡x
where fk⁢g⁡x represents the kth derivative of f⁡x evaluated at g⁡x; the exponential of a formal power series
ⅇ⁢⁢∑n=1∞⁡an⁢znn!=∑n=0∞⁢zn⁢CompleteBellBn,a1,...,an
and in the following exponential generating function
ⅇⅇt−1⁢z⁢⁢=∑n=0∞BellB⁡n,z⁢tnn!
The Bell functions only evaluate to a polynomial when the arguments specifying the degree are positive integers
BellB⁡n,z=Sum⁡Stirling2⁡n,k⁢zk,k=0..n
eval⁡,n=4
z4+6⁢z3+7⁢z2+z=∑k=04⁡Stirling2⁡4,k⁢zk
value⁡
z4+6⁢z3+7⁢z2+z=z4+6⁢z3+7⁢z2+z
A sequence with the values of BellB⁡n,z for n=0..3
seq⁡BellB⁡n,z=BellB⁡n,z,n=0..3
BellB⁡0,z=1,BellB⁡1,z=z,BellB⁡2,z=z2+z,BellB⁡3,z=z3+3⁢z2+z
The IncompleteBellB polynomials have a special form for some particular values of the function's parameters. For illustration purposes consider the generic sequence
Z≔z1,z2,z3,z4,z5
IncompleteBellB⁡0,0,Z
1
For n=0 and 0<k, or 0<n and k=0, or n<k, IncompleteBellB is equal to 0
IncompleteBellB⁡0,1,Z,IncompleteBellB⁡1,0,Z
0,0
IncompleteBellB⁡1,2,Z,IncompleteBellB⁡2,3,Z,IncompleteBellB⁡3,4,Z
0,0,0
For n=k, the following identity holds
IncompleteBellB⁡n,n,Z=Z1n
IncompleteBellB⁡n,n,z1,z2,z3,z4,z5=z1n
eval⁡,n=3
z13=z13
If zj=1 for all j, the following identity holds
IncompleteBellB⁡n,k,1,1,1,1,1,1,1=Stirling2⁡n,k
eval⁡,k=4,n=7
350=350
If zj=j! for all j=1,..,n−k+1, the following identity, here expressed in terms of the inert sequence %seq, holds
IncompleteBellB⁡n,k,%seq⁡j!,j=1..n−k+1=binomial⁡n,k⁢binomial⁡n−1,k−1⁢n−k!
IncompleteBellB⁡n,k,seq⁡j!,j=1..n−k+1=nk⁢n−1k−1⁢n−k!
eval⁡,k=3,n=8
IncompleteBellB⁡8,3,seq⁡j!,j=1..6=141120
141120=141120
The diamond operation that enters the definition of IncompleteBellB can be invoked directly as IncompleteBellB:-DiamondConvolution. These are the first 4 elements of z⋄z⁢, a diamond operation involving 2 factors
IncompleteBellB:-DiamondConvolution⁡4,2,Z
0,2⁢z12,6⁢z1⁢z2,8⁢z1⁢z3+6⁢z22
Note that when calling IncompleteBellB:-DiamondConvolution, you pass the sequence Z enclosed in a list. The value of IncompleteBellB⁡4,2,Z is equal to the 4th element of the above sequence divided by 2!
IncompleteBellB⁡4,2,Z
4⁢z1⁢z3+3⁢z22
These are the first 5 elements of z⋄z⋄z, a diamond operation involving 3 factors and the value of IncompleteBellB⁡5,3,Z
IncompleteBellB:-DiamondConvolution⁡5,3,Z
0,0,6⁢z13,36⁢z12⁢z2,60⁢z12⁢z3+90⁢z1⁢z22
IncompleteBellB⁡5,3,Z
10⁢z12⁢z3+15⁢z1⁢z22
The value of CompleteBellB⁡5,Z is obtained by adding the values of IncompleteBellB⁡5,k,Z for k=1..5 as explained in the Description
CompleteBellB⁡5,Z
z15+10⁢z13⁢z2+10⁢z12⁢z3+15⁢z1⁢z22+5⁢z1⁢z4+10⁢z2⁢z3+z5
Bell, E. T. "Exponential Polynomials", Ann. Math., Vol. 35 (1934): 258-277.
The BellB, IncompleteBellB and CompleteBellB commands were introduced in Maple 15.
For more information on Maple 15 changes, see Updates in Maple 15.
See Also
bell
FunctionAdvisor
Stirling2
Download Help Document