Touchard polynomials

For a different family of polynomials Qn occasionally called Touchard polynomials, see Bateman polynomials.
Not to be confused with Bell polynomials.

The Touchard polynomials, studied by Jacques Touchard (1939), also called the exponential polynomials[1][2][3] or Bell polynomials,[4] comprise a polynomial sequence of binomial type defined by

where is a Stirling number of the second kind, i.e., the number of partitions of a set of size n into k disjoint non-empty subsets.

Properties

The value at 1 of the nth Touchard polynomial is the nth Bell number, i.e., the number of partitions of a set of size n:

If X is a random variable with a Poisson distribution with expected value λ, then its nth moment is E(Xn) = Tn(λ), leading to the definition:

Using this fact one can quickly prove that this polynomial sequence is of binomial type, i.e., it satisfies the sequence of identities:

The Touchard polynomials constitute the only polynomial sequence of binomial type with the coefficient of x equal 1 in every polynomial.

The Touchard polynomials satisfy the Rodrigues-like formula:

The Touchard polynomials satisfy the recurrence relation

and

In the case x = 1, this reduces to the recurrence formula for the Bell numbers.

Using the umbral notation Tn(x)=Tn(x), these formulas become:

The generating function of the Touchard polynomials is

which corresponds to the generating function of Stirling numbers of the second kind.

Touchard polynomials have contour integral representation:

Generalizations

See also

References

  1. Roman, Steven (1984). The Umbral Calculus. Dover. ISBN 0-486-44139-3.
  2. Boyadzhiev, Khristo N. "Exponential polynomials, Stirling numbers, and evaluation of some gamma integrals". arXiv:0909.0979Freely accessible.
  3. Brendt, Bruce C. "RAMANUJAN REACHES HIS HAND FROM HIS GRAVE TO SNATCH YOUR THEOREMS FROM YOU" (PDF). Retrieved 23 November 2013.
  4. Weisstein, Eric W. "Bell Polynomial". MathWorld.
This article is issued from Wikipedia - version of the 7/13/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.