Binomial transform

In combinatorial mathematics the binomial transform is a sequence transformation (ie, a transform of a sequence) that computes its forward differences. It is closely related to the Euler transform, which is the result of applying the binomial transform to the sequence associated with its ordinary generating function.

Definition

The binomial transform, "T", of a sequence, $\{a\_n\}$, is the sequence $\{s\_n\}$ defined by

:$s\_n\; =\; sum\_\{k=0\}^n\; (-1)^k\; \{nchoose\; k\}\; a\_k.$

Formally, one may write $(Ta)\_n\; =\; s\_n$ for the transformation, where "T" is an infinite-dimensional operator with matrix elements $T\_\{nk\}$:

:$s\_n\; =\; (Ta)\_n\; =\; sum\_\{k=0\}^infty\; T\_\{nk\}\; a\_k.$

The transform is an involution, that is,

:$TT\; =\; 1\; ,$

or, using index notation,

:$sum\_\{k=0\}^infty\; T\_\{nk\}T\_\{km\}\; =\; delta\_\{nm\}$

where δ is the Kronecker delta function. The original series can be regained by

:$a\_n=sum\_\{k=0\}^n\; (-1)^k\; \{nchoose\; k\}\; s\_k.$

The binomial transform of a sequence is just the "n"th forward difference of the sequence, namely

:$s\_0\; =\; a\_0$:$s\_1\; =\; -\; (\; riangle\; a)\_0\; =\; -a\_1+a\_0$:$s\_2\; =\; (\; riangle^2\; a)\_0\; =\; -(-a\_2+a\_1)+(-a\_1+a\_0)\; =\; a\_2-2a\_1+a\_0$:$dots,$ :$s\_n\; =\; (-1)^n\; (\; riangle^n\; a)\_0$

where Δ is the forward difference operator.

Some authors define the binomial transform with an extra sign, so that it is not self-inverse:

:$t\_n=sum\_\{k=0\}^n\; (-1)^\{n-k\}\; \{nchoose\; k\}\; a\_k$

whose inverse is

:$a\_n=sum\_\{k=0\}^n\; \{nchoose\; k\}\; t\_k.$

hift states

The binomial transform is the shift operator for the Bell numbers. That is,

:$B\_\{n+1\}=sum\_\{k=0\}^n\; \{nchoose\; k\}\; B\_k$

where the $B\_n$ are the Bell numbers.

Ordinary generating function

The transform connects the generating functions associated with the series. For the ordinary generating function, let

:$f(x)=sum\_\{n=0\}^infty\; a\_n\; x^n$

and

:$g(x)=sum\_\{n=0\}^infty\; s\_n\; x^n$

then

:$g(x)\; =\; (Tf)(x)\; =\; frac\{1\}\{1-x\}\; fleft(frac\{-x\}\{1-x\}\; ight).$

Euler transform

The relationship between the ordinary generating functions is sometimes called the Euler transform. It commonly makes its appearance in one of two different ways. In one form, it is used to accelerate the convergence of an alternating series. That is, one has the identity

:$sum\_\{n=0\}^infty\; (-1)^n\; a\_n\; =\; sum\_\{n=0\}^infty\; (-1)^n\; frac\; \{Delta^n\; a\_0\}\; \{2^\{n+1$

which is obtained by substituting "x"=1/2 into the above. The terms on the right hand side typically become much smaller, much more rapidly, thus allowing rapid numerical summation.

The Euler transform is also frequently applied to the hypergeometric series $,\_2F\_1$. Here, the Euler transform takes the form:

:$,\_2F\_1\; (a,b;c;z)\; =\; (1-z)^\{-b\}\; ,\_2F\_1\; left(c-a,\; b;\; c;frac\{z\}\{z-1\}\; ight)$

The binomial transform, and its variation as the Euler transform, is notable for its connection to the continued fraction representation of a number. Let have the continued fraction representation

:$x=\; [0;a\_1,\; a\_2,\; a\_3,cdots]$

then

:$frac\{x\}\{1-x\}=\; [0;a\_1-1,\; a\_2,\; a\_3,cdots]$

and

:$frac\{x\}\{1+x\}=\; [0;a\_1+1,\; a\_2,\; a\_3,cdots]$

Exponential generating function

For the exponential generating function, let

:$overline\{f\}(x)=\; sum\_\{n=0\}^infty\; a\_n\; frac\{x^n\}\{n!\}$

and

:$overline\{g\}(x)=\; sum\_\{n=0\}^infty\; s\_n\; frac\{x^n\}\{n!\}$

then

:$overline\{g\}(x)\; =\; (Toverline\{f\})(x)\; =\; e^x\; overline\{f\}(-x)$

The Borel transform will convert the ordinary generating function to the exponential generating function.

Integral representation

When the sequence can be interpolated by a complex analytic function, then the binomial transform of the sequence can be represented by means of a Nörlund-Rice integral on the interpolating function.

Generalizations

Prodinger gives a related, modular-like transformation: letting

:$u\_n\; =\; sum\_\{k=0\}^n\; \{nchoose\; k\}\; a^k\; (-c)^\{n-k\}\; b\_k$

gives

:$U(x)\; =\; frac\{1\}\{cx+1\}\; Bleft(frac\{ax\}\{cx+1\}\; ight)$

where "U" and "B" are the ordinary generating functions associated with the series $\{u\_n\}$ and $\{b\_n\}$, respectively.

The rising "k"-binomial transform is sometimes defined as

:$sum\_\{j=0\}^n\; \{nchoose\; j\}\; j^k\; a\_j$

The falling "k"-binomial transform is

:$sum\_\{j=0\}^n\; \{nchoose\; j\}\; j^\{n-k\}\; a\_j$.

Both are homomorphisms of the kernel of the Hankel transform of a series.

In the case where the binomial transform is defined as

:

Let this be equal to the function $mathfrak\; J(a)\_n=b\_n$

If a new forward difference table is made and the first elements from each row of this table are taken to form a new sequence $\{b\_n\}$, then the second binomial transform of the original sequence is,

:

If the same process is repeated "k" times, then it follows that,

:

It's inverse is,

:

This can be generalized as,

:$mathfrak\; J^k(a)\_n=b\_n=(mathbf\; E-k)^na\_0$

where $mathbf\; E$ is the shift operator

It's inverse is

:$mathfrak\; J^\{-k\}(b)\_n=a\_n=(mathbf\; E+k)^nb\_0$

ee also

* Newton series
* Hankel matrix
* Möbius transform
* Stirling transform
* List of factorial and binomial topics

References

* John H. Conway and Richard K. Guy, "The Book of Numbers", (1996)
* Donald E. Knuth, "The Art of Computer Programming Vol. 3", (1973) Addison-Wesley, Reading, MA.
* Helmut Prodinger, " [http://math.sun.ac.za/~prodinger/abstract/abs_87.htm Some information about the Binomial transform] ", (1992)
* Michael Z. Spivey and Laura L. Steil, " [http://www.cs.uwaterloo.ca/journals/JIS/VOL9/Spivey/spivey7.pdf The k-Binomial Transforms and the Hankel Transform] ", (2006)

External links

* [http://mathworld.wolfram.com/BinomialTransform.html Binomial Transform]