Touchard polynomials

From HandWiki
Short description: Sequence of polynomials


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

Tn(x)=k=0nS(n,k)xk=k=0n{nk}xk,

where S(n,k)={nk}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.[1][2][3][4]

The first few Touchard polynomials are

T1(x)=x,
T2(x)=x2+x,
T3(x)=x3+3x2+x,
T4(x)=x4+6x3+7x2+x,
T5(x)=x5+10x4+25x3+15x2+x.

Properties

Basic 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:

Tn(1)=Bn.

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:

Tn(x)=exk=0xkknk!.

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

Tn(λ+μ)=k=0n(nk)Tk(λ)Tnk(μ).

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:

Tn(ex)=eexdndxneex.

The Touchard polynomials satisfy the recurrence relation

Tn+1(x)=x(1+ddx)Tn(x)

and

Tn+1(x)=xk=0n(nk)Tk(x).

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

A generalization of both this formula and the definition, is a generalization of Spivey's formula[5]

Tn+m(x)=k=0n{nk}xkj=0m(mj)kmjTj(x)

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

Tn(λ+μ)=(T(λ)+T(μ))n,
Tn+1(x)=x(1+T(x))n.

The generating function of the Touchard polynomials is

n=0Tn(x)n!tn=ex(et1),

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

Touchard polynomials have contour integral representation:

Tn(x)=n!2πiex(et1)tn+1dt.

Zeroes

All zeroes of the Touchard polynomials are real and negative. This fact was observed by L. H. Harper in 1967.[6]

The absolute value of the leftmost zero is bounded from above by[7]

1n(n2)+n1n(n2)22nn1((n3)+3(n4)),

although it is conjectured that the leftmost zero grows linearly with the index n.

The Mahler measure M(Tn)of the Touchard polynomials can be estimated as follows:[8]

{nΩn}(nΩn)M(Tn)n+1{nKn},

where Ωn and Kn are the smallest of the maximum two k indices such that {nk}/(nk) and {nk} are maximal, respectively.

Generalizations

  • Complete Bell polynomial Bn(x1,x2,,xn) may be viewed as a multivariate generalization of Touchard polynomial Tn(x), since Tn(x)=Bn(x,x,,x).
  • The Touchard polynomials (and thereby the Bell numbers) can be generalized, using the real part of the above integral, to non-integer order:
    Tn(x)=n!π0πex(ecos(θ)cos(sin(θ))1)cos(xecos(θ)sin(sin(θ))nθ)dθ.

See also

References

  1. Roman, Steven (1984). The Umbral Calculus. Dover. ISBN 0-486-44139-3. 
  2. Boyadzhiev, Khristo N. (2009). "Exponential polynomials, Stirling numbers, and evaluation of some gamma integrals". Abstract and Applied Analysis 2009: 1–18. doi:10.1155/2009/168672. Bibcode2009AbApA2009....1B. 
  3. Brendt, Bruce C. "RAMANUJAN REACHES HIS HAND FROM HIS GRAVE TO SNATCH YOUR THEOREMS FROM YOU". http://www.math.uiuc.edu/~berndt/articles/gravesnatching.pdf. Retrieved 23 November 2013. 
  4. Weisstein, Eric W.. "Bell Polynomial". http://mathworld.wolfram.com/BellPolynomial.html. 
  5. "Implications of Spivey's Bell Number Formula". https://cs.uwaterloo.ca/journals/JIS/VOL11/Gould/gould35.html. 
  6. Harper, L. H. (1967). "Stirling behavior is asymptotically normal". The Annals of Mathematical Statistics 38 (2): 410–414. doi:10.1214/aoms/1177698956. 
  7. Mező, István; Corcino, Roberto B. (2015). "The estimation of the zeros of the Bell and r-Bell polynomials". Applied Mathematics and Computation 250: 727–732. doi:10.1016/j.amc.2014.10.058. 
  8. István, Mező. "On the Mahler measure of the Bell polynomials". https://sites.google.com/site/istvanmezo81/others. Retrieved 7 November 2017.