Binomial type

This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (March 2013) (Learn how and when to remove this message)

In mathematics, a polynomial sequence, i.e., a sequence of polynomials indexed by non-negative integers { 0 , 1 , 2 , 3 , … } {\textstyle \left\{0,1,2,3,\ldots \right\}} in which the index of each polynomial equals its degree, is said to be of binomial type if it satisfies the sequence of identities

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).}

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 may be expressed in terms of the Bell polynomials. 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.

• In consequence of this definition the binomial theorem can be stated by saying that the sequence { x n : n = 0 , 1 , 2 , … } {\displaystyle \{x^{n}:n=0,1,2,\ldots \}} is of binomial type.
• The sequence of "lower factorials" is defined by ( x ) n = x ( x − 1 ) ( x − 2 ) ⋅ ⋯ ⋅ ( x − n + 1 ) . {\displaystyle (x)_{n}=x(x-1)(x-2)\cdot \cdots \cdot (x-n+1).} (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.^[1]
• Similarly the "upper factorials" x ( n ) = x ( x + 1 ) ( x + 2 ) ⋅ ⋯ ⋅ ( x + n − 1 ) {\displaystyle x^{(n)}=x(x+1)(x+2)\cdot \cdots \cdot (x+n-1)} are a polynomial sequence of binomial type.
• The Abel polynomials p n ( x ) = x ( x − a n ) n − 1 {\displaystyle p_{n}(x)=x(x-an)^{n-1}} are a polynomial sequence of binomial type.
• The Touchard polynomials p n ( x ) = ∑ k = 0 n S ( n , k ) x k {\displaystyle p_{n}(x)=\sum _{k=0}^{n}S(n,k)x^{k}} where S ( n , k ) {\displaystyle S(n,k)} is the number of partitions of a set of size n {\displaystyle n} into k {\displaystyle k} disjoint non-empty 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 ) {\displaystyle S(n,k)} are "Stirling numbers of the second kind". This sequence has a curious connection with the Poisson distribution: If X {\displaystyle X} is a random variable with a Poisson distribution with expected value λ {\displaystyle \lambda } then E ( X n ) = p n ( λ ) {\displaystyle E(X^{n})=p_{n}(\lambda )} . In particular, when λ = 1 {\displaystyle \lambda =1} , we see that the n {\displaystyle n} th moment of the Poisson distribution with expected value 1 {\displaystyle 1} is the number of partitions of a set of size n {\displaystyle n} , called the n {\displaystyle n} th Bell number. This fact about the n {\displaystyle n} th moment of that particular Poisson distribution is "Dobinski's formula".

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 p n ( x ) ↦ n p n − 1 ( x ) {\displaystyle p_{n}(x)\mapsto np_{n-1}(x)} is shift-equivariant, and
• p₀(x) = 1 for all x, and
• p_n(0) = 0 for n > 0.

(The statement that this operator is shift-equivariant 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.)

That linear transformation is clearly a delta operator, i.e., a shift-equivariant 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^[1] and differentiation. It can be shown that every delta operator can be written as a power series of the form: Q = ∑ n = 1 ∞ c n D n {\displaystyle Q=\sum _{n=1}^{\infty }c_{n}D^{n}} 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

1. p 0 ( x ) = 1 , {\displaystyle p_{0}(x)=1,}
2. p n ( 0 ) = 0 f o r   n ≥ 1 ,   a n d {\displaystyle p_{n}(0)=0\quad {\rm {for\ }}n\geq 1,{\rm {\ and}}}
3. Q p n ( x ) = n p n − 1 ( x ) . {\displaystyle Qp_{n}(x)=np_{n-1}(x).}

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.^[2] Therefore, this paragraph amounts to a recipe for generating as many polynomial sequences of binomial type as one may wish.

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

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

where B_n,k(a₁, …, a_n−k+1) is the Bell polynomial. Then this polynomial sequence is of binomial type. Note that for each n ≥ 1,

p n ′ ( 0 ) = a n . {\displaystyle p_{n}'(0)=a_{n}.}

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^[2] 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

P ( t ) = ∑ n = 1 ∞ a n n ! t n . {\displaystyle P(t)=\sum _{n=1}^{\infty }{a_{n} \over n!}t^{n}.}

Then

P − 1 ( d d x ) , {\displaystyle P^{-1}\left({d \over dx}\right),}

where P − 1 ( P ( x ) ) = P ( P − 1 ( x ) ) = 1 {\displaystyle P^{-1}(P(x))=P(P^{-1}(x))=1} , is the delta operator of this sequence.

For sequences a_n, b_n, n = 0, 1, 2, …, define a sort of convolution by

( a ♢ b ) n = ∑ j = 0 n ( n j ) a j b n − j . {\displaystyle (a{\mathbin {\diamondsuit }}b)_{n}=\sum _{j=0}^{n}{n \choose j}a_{j}b_{n-j}.}

Let a n k ♢ {\displaystyle a_{n}^{k\diamondsuit }} be the nth term of the sequence

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

Then for any sequence a_i, i = 0, 1, 2, ..., with a₀ = 0, the sequence defined by p₀(x) = 1 and

p n ( x ) = ∑ k = 1 n a n k ♢ x k k ! {\displaystyle p_{n}(x)=\sum _{k=1}^{n}{a_{n}^{k\diamondsuit }x^{k} \over k!}\,}

for n ≥ 1, is of binomial type, and every sequence of binomial type is of this form.

Polynomial sequences of binomial type are precisely those whose generating functions are formal (not necessarily convergent) power series of the form

∑ n = 0 ∞ p n ( x ) n ! t n = e x f ( t ) {\displaystyle \sum _{n=0}^{\infty }{p_{n}(x) \over n!}t^{n}=e^{xf(t)}}

where f(t) is a formal power series whose constant term is zero and whose first-degree term is not zero.^[3] It can be shown by the use of the power-series version of Faà di Bruno's formula that

f ( t ) = ∑ n = 1 ∞ p n ′ ( 0 ) n ! t n . {\displaystyle f(t)=\sum _{n=1}^{\infty }{p_{n}'(0) \over n!}t^{n}.}

The delta operator of the sequence is the compositional inverse f − 1 ( D ) {\displaystyle f^{-1}(D)} , so that

f − 1 ( D ) p n ( x ) = n p n − 1 ( x ) . {\displaystyle f^{-1}(D)p_{n}(x)=np_{n-1}(x).}

The coefficients in the product of two formal power series

∑ n = 0 ∞ a n n ! t n {\displaystyle \sum _{n=0}^{\infty }{a_{n} \over n!}t^{n}}

and

∑ n = 0 ∞ b n n ! t n {\displaystyle \sum _{n=0}^{\infty }{b_{n} \over n!}t^{n}}

are

c n = ∑ k = 0 n ( n k ) a k b n − k {\displaystyle c_{n}=\sum _{k=0}^{n}{n \choose k}a_{k}b_{n-k}}

(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

g ( t ) x = e x f ( t ) {\displaystyle g(t)^{x}=e^{xf(t)}}

where f(t) has the form given above.

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

p n ( x ) = ∑ k = 0 n a n , k x k . {\displaystyle p_{n}(x)=\sum _{k=0}^{n}a_{n,k}\,x^{k}.}

Then the umbral composition p o q is the polynomial sequence whose nth term is

( p n ∘ q ) ( x ) = ∑ k = 0 n a n , k q k ( x ) {\displaystyle (p_{n}\circ q)(x)=\sum _{k=0}^{n}a_{n,k}\,q_{k}(x)}

(the subscript n appears in p_n, since this is the n term of that sequence, but not in q, since this refers to the sequence as a whole rather than one of its terms).

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 formal composition of formal power series.

The sequence κ_n of coefficients of the first-degree 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

p n ′ ( 0 ) = κ n = {\displaystyle p_{n}'(0)=\kappa _{n}=} the nth cumulant

and

p n ( 1 ) = μ n ′ = {\displaystyle p_{n}(1)=\mu _{n}'=} 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

f ( t ) = ∑ n = 1 ∞ κ n n ! t n {\displaystyle f(t)=\sum _{n=1}^{\infty }{\frac {\kappa _{n}}{n!}}t^{n}}

be the (formal) cumulant-generating function. Then

f − 1 ( D ) {\displaystyle f^{-1}(D)}

is the delta operator associated with the polynomial sequence, i.e., we have

f − 1 ( D ) p n ( x ) = n p n − 1 ( x ) . {\displaystyle f^{-1}(D)p_{n}(x)=np_{n-1}(x).}

The concept of binomial type has applications in combinatorics, probability, statistics, and a variety of other fields.

• List of factorial and binomial topics
• Binomial-QMF (Daubechies wavelet filters)

• 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.
• Roman, Stephen (2008). Advanced Linear Algebra. Graduate Texts in Mathematics (Third ed.). Springer. ISBN 978-0-387-72828-5.

As the title suggests, the second of the above is explicitly about applications to combinatorial enumeration.

• di Bucchianico, Alessandro. Probabilistic and Analytical Aspects of the Umbral Calculus, Amsterdam, CWI, 1997.
• Weisstein, Eric W. "Binomial-Type Sequence". MathWorld.