Binomial type

 For other concepts using the name "binomial", see binomial (disambiguation).
 For related mathematical concepts, see list of factorial and binomial topics.
In mathematics, a polynomial sequence, i.e., a sequence of polynomials indexed by { 0, 1, 2, 3, ... } in which the index of each polynomial equals its degree, is said to be of binomial type if it satisfies the sequence of identities
 <math>p_n(x+y)=\sum_{k=0}^n{n \choose k}\, p_k(x)\, p_{nk}(y).<math>
Many such sequences exist. The set of all such sequences forms a Lie group under the operation of umbral composition, explained below. Every sequence of binomial type is a Sheffer sequence (but most Sheffer sequences are not of binomial type). Polynomial sequences put on firm footing the vague 19th century notions of umbral calculus.
Contents 
Examples
 In consequence of this definition the binomial theorem can be stated by saying that the sequence { x^{n} : n = 0, 1, 2, ... } is of binomial type.
 The sequence of "lower factorials" is defined by
 <math>(x)_n=x(x1)(x2)\cdot\cdots\cdot(xn+1).<math>
 (In the theory of special functions, this same notation denotes upper factorials, but this present usage is universal among combinatorialists.) The product is understood to be 1 if n = 0, since it is in that case an empty product. This polynomial sequence is of binomial type.
 Similarly the "upper factorials"
 <math>x^{(n)}=x(x+1)(x+2)\cdot\cdots\cdot(x+n1)<math>
 are a polynomial sequence of binomial type.
 The Abel polynomials
 <math>p_n(x)=x(xan)^{n1} \,<math>
 are a polynomial sequence of binomial type.
 <math>p_n(x)=\sum_{k=1}^n S(n,k)x^k<math>
 where S(n, k) is the number of partitions of a set of size n into k disjoint nonempty subsets, is a polynomial sequence of binomial type. Eric Temple Bell called these the "exponential polynomials" and that term is also sometimes seen in the literature. The coefficients S(n, k ) are "Stirling numbers of the second kind". This sequence has a curious connection with the Poisson distribution: If X is a random variable with a Poisson distribution with expected value λ then E(X^{n}) = p_{n}(λ). In particular, when λ = 1, we see that the nth moment of the Poisson distribution with expected value 1 is the number of partitions of a set of size n, called the nth Bell number. This fact about the nth moment of that particular Poisson distribution is "Dobinski's formula".
Characterization by delta operators
It can be shown that a polynomial sequence { p_{n}(x) : n = 0, 1, 2, ... } is of binomial type if and only if all three of the following conditions hold:
 The linear transformation on the space of polynomials in x that is characterized by
 <math>p_n(x)\mapsto np_{n1}(x)<math>
 is shiftequivariant, and
 p_{0}(x) = 1 for all x, and
 p_{n}(0) = 0 for n > 0.
(The statement that this operator is shiftequivariant is the same as saying that the polynomial sequence is a Sheffer sequence; the set of sequences of binomial type is properly included within the set of Sheffer sequences.)
Delta operators
That linear transformation is clearly a delta operator, i.e., a shiftequivariant linear transformation on the space of polynomials in x that reduces degrees of polynomials by 1. The most obvious examples of delta operators are difference operators and differentiation. It can be shown that every delta operator can be written as a power series of the form
 <math>Q=\sum_{n=1}^\infty c_n D^n<math>
where D is differentiation (note that the lower bound of summation is 1). Each delta operator Q has a unique sequence of "basic polynomials", i.e., a polynomial sequence satisfying
 <math>p_0(x)=1, \,<math>
 <math>p_n(0)=0\quad{\rm for\ }n\geq 1,{\rm\ and}<math>
 <math>Qp_n(x)=np_{n1}(x). \,<math>
It was shown in 1973 by Rota, Kahaner, and Odlyzko, that a polynomial sequence is of binomial type if and only if it is the sequence of basic polynomials of some delta operator. Therefore, this paragraph amounts to a recipe for generating as many polynomial sequences of binomial type as one may wish.
Characterization by Bell polynomials
For any sequence a_{1}, a_{2}, a_{3}, ... of scalars, let
 <math>p_n(x)=\sum_{k=1}^n B_{n,k}(a_1,\dots,a_{nk+1}) x^k.<math>
Where B_{n,k(a1, ..., an−k+1) is the Bell polynomial. Then this polynomial sequence is of binomial type. Note that for each n ≥ 1, }
 <math>p_n'(0)=a_n.\,<math>
Here is the main result of this section:
Theorem: All polynomial sequences of binomial type are of this form.
A result in Mullin and Rota, repeated in Rota, Kahaner, and Odlyzko (see References below) states that every polynomial sequence { p_{n}(x) }_{n} of binomial type is determined by the sequence { p_{n}′(0) }_{n}, but those sources do not mention Bell polynomials.
This sequence of scalars is also related to the delta operator. Let
 <math>P(t)=\sum_{n=1}^\infty {a_n \over n!} t^n.<math>
Then
 <math>P^{1}\left({d \over dx}\right)\,<math>
is the delta operator of this sequence.
Characterization by generating functions
Polynomial sequences of binomial type are precisely those whose generating functions are formal (not necessarily convergent) power series of the form
 <math>\sum_{n=0}^\infty {p_n(x) \over n!}t^n=e^{xf(t)}<math>
where f(t) is a formal power series whose constant term is zero and whose firstdegree term is not zero. It can be shown by the use of the powerseries version of Faà di Bruno's formula that
 <math>f(t)=\sum_{n=1}^\infty {p_n'(0) \over n!}t^n.<math>
The delta operator of the sequence is f^{−1}(D), so that
 <math>f^{1}(D)p_n(x)=np_{n1}(x).<math>
A way to think about these generating functions
The coefficients in the product of two formal power series
 <math>\sum_{n=0}^\infty {a_n \over n!}t^n<math>
and
 <math>\sum_{n=0}^\infty {b_n \over n!}t^n<math>
are
 <math>c_n=\sum_{k=0}^n {n \choose k} a_k b_{nk}<math>
(see also Cauchy product). If we think of x as a parameter indexing a family of such power series, then the binomial identity says in effect that the power series indexed by x + y is the product of those indexed by x and by y. Thus the x is the argument to a function that maps sums to products: an exponential function
 <math>g(t)^x=e^{x f(t)}<math>
where f(t) has the form given above.
Umbral composition of polynomial sequences
The set of all polynomial sequences of binomial type is a group in which the group operation is "umbral composition" of polynomial sequences. That operation is defined as follows. Suppose { p_{n}(x) : n = 0, 1, 2, 3, ... } and { q_{n}(x) : n = 0, 1, 2, 3, ... } are polynomial sequences, and
 <math>p_n(x)=\sum_{k=0}^n a_{n,k}\, x^k.<math>
Then the umbral composition p o q is the polynomial sequence whose nth term is
 <math>(p_n\circ q)(x)=\sum_{k=0}^n a_{n,k}\, q_k(x).<math>
With the delta operator defined by a power series in D as above, the natural bijection between delta operators and polynomial sequences of binomial type, also defined above, is a group isomorphism, in which the group operation on power series is (perhaps surprisingly) formal composition of formal power series.
Cumulants and moments
The sequence κ_{n} of coefficients of the firstdegree terms in a polynomial sequence of binomial type may be termed the cumulants of the polynomial sequence. It can be shown that the whole polynomial sequence of binomial type is determined by its cumulants, in a way discussed in the article titled cumulant. Thus
 <math> p_n'(0)=\kappa_n= \,<math> the nth cumulant
and
 <math> p_n(1)=\mu_n'= \,<math> the nth moment.
These are "formal" cumulants and "formal" moments, as opposed to cumulants of a probability distribution and moments of a probability distribution.
Let
 <math>f(t)=\sum_{n=1}^\infty\frac{\kappa_n}{n!}t^n<math>
be the (formal) cumulantgenerating function. Then
 <math>f^{1}(D) \,<math>
is the delta operator associated with the polynomial sequence, i.e., we have
 <math>f^{1}(D)p_n(x)=np_{n1}(x). \,<math>
Applications
The concept of binomial type has applications in combinatorics, probability, statistics, and a variety of other fields.
References
 G.C. Rota, D. Kahaner, and A. Odlyzko, "Finite Operator Calculus," Journal of Mathematical Analysis and its Applications, vol. 42, no. 3, June 1973. Reprinted in the book with the same title, Academic Press, New York, 1975.
 R. Mullin and G.C. Rota, "On the Foundations of Combinatorial Theory III: Theory of Binomial Enumeration," in Graph Theory and Its Applications, edited by Bernard Harris, Academic Press, New York, 1970.
As the title suggests, the second of the above is explicitly about applications to combinatorial enumeration.