Generalized Appell polynomials

Generalized Appell polynomials

In mathematics, a polynomial sequence {p_n(z) } has a generalized Appell representation if the generating function for the polynomials takes on a certain form:

:K(z,w) = A(w)Psi(zg(w)) = sum_{n=0}^infty p_n(z) w^nwhere the generating function or kernel K(z,w) is composed of the series

:A(w)= sum_{n=0}^infty a_n w^n quad with a_0 e 0

and :Psi(t)= sum_{n=0}^infty Psi_n t^n quad and all Psi_n e 0

and:g(w)= sum_{n=1}^infty g_n w^n quad with g_1 e 0.

Given the above, it is not hard to show that p_n(z) is a polynomial of degree n.

pecial cases

* The choice of g(w)=w gives the class of Brenke polynomials.

* The choice of Psi(t)=e^t results in the Sheffer sequence of polynomials, which include the general difference polynomials, such as the Newton polynomials.

* The combined choice of g(w)=w and Psi(t)=e^t gives the Appell sequence of polynomials.

Explicit representation

The generalized Appell polynomials have the explicit representation

:p_n(z) = sum_{k=0}^n z^k Psi_k h_k.

The constant is

:h_k=sum_{P} a_{j_0} g_{j_1} g_{j_2} cdots g_{j_k}

where this sum extends over all partitions of n into k+1 parts; that is, the sum extends over all {j} such that

:j_0+j_1+ cdots +j_k = n.,

For the Appell polynomials, this becomes the formula

:p_n(z) = sum_{k=0}^n frac {a_{n-k} z^k} {k!}.

Recursion relation

Equivalently, a necessary and sufficient condition that the kernel K(z,w) can be written as A(w)Psi(zg(w)) with g_1=1 is that

:frac{partial K(z,w)}{partial w} = c(w) K(z,w)+frac{zb(w)}{w} frac{partial K(z,w)}{partial z}

where b(w) and c(w) have the power series

:b(w) = frac{w}{g(w)} frac {d}{dw} g(w)= 1 + sum_{n=1}^infty b_n w^n

and

:c(w) = frac{1}{A(w)} frac {d}{dw} A(w)= sum_{n=0}^infty c_n w^n.

Substituting

:K(z,w)= sum_{n=0}^infty p_n(z) w^n

immediately gives the recursion relation

: z^{n+1} frac {d}{dz} left [ frac{p_n(z)}{z^n} ight] = -sum_{k=0}^{n-1} c_{n-k-1} p_k(z) -z sum_{k=1}^{n-1} b_{n-k} frac{d}{dz} p_k(z).

For the special case of the Brenke polynomials, one has g(w)=w and thus all of the b_n=0, simplifying the recursion relation significantly.

ee also

* q-difference polynomials

References

* Ralph P. Boas, Jr. and R. Creighton Buck, "Polynomial Expansions of Analytic Functions (Second Printing Corrected)", (1964) Academic Press Inc., Publishers New York, Springer-Verlag, Berlin. Library of Congress Card Number 63-23263.

* William C. Brenke, "On generating functions of polynomial systems", (1945) American Mathematical Monthly, 52 pp. 297-301.

* W. N. Huff, "The type of the polynomials generated by f(xt) φ(t)" (1947) Duke Mathematical Journal, 14 pp 1091-1104.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Appell sequence — In mathematics, an Appell sequence, named after Paul Émile Appell, is any polynomial sequence { p n ( x )} n = 0, 1, 2, ... satisfying the identity:{d over dx} p n(x) = np {n 1}(x),and in which p 0( x ) is a non zero constant.ExamplesAmong the… …   Wikipedia

  • Paul Émile Appell — M. P. Appell is the same person: it stands for Monsieur Paul Appell. Paul Appell Born 27 September 1855( …   Wikipedia

  • Classical orthogonal polynomials — In mathematics, the classical orthogonal polynomials are the most widely used orthogonal polynomials, and consist of the Hermite polynomials, the Laguerre polynomials, the Jacobi polynomials together with their special cases the ultraspherical… …   Wikipedia

  • Difference polynomials — In mathematics, in the area of complex analysis, the general difference polynomials are a polynomial sequence, a certain subclass of the Sheffer polynomials, which include the Newton polynomials, Selberg s polynomials, and the Stirling… …   Wikipedia

  • Hermite polynomials — In mathematics, the Hermite polynomials are a classical orthogonal polynomial sequence that arise in probability, such as the Edgeworth series; in combinatorics, as an example of an Appell sequence, obeying the umbral calculus; in numerical… …   Wikipedia

  • Orthogonal polynomials — In mathematics, an orthogonal polynomial sequence is a family of polynomials such that any two different polynomials in the sequence are orthogonal to each other under some inner product. The most widely used orthogonal polynomials are the… …   Wikipedia

  • Generating function — This article is about generating functions in mathematics. For generating functions in classical mechanics, see Generating function (physics). For signalling molecule, see Epidermal growth factor. In mathematics, a generating function is a formal …   Wikipedia

  • Sheffer sequence — In mathematics, a Sheffer sequence is a polynomial sequence, i.e., a sequence { p n ( x ) : n = 0, 1, 2, 3, ... } of polynomials in which the index of each polynomial equals its degree, satisfying conditions related to the umbral calculus in… …   Wikipedia

  • List of special functions and eponyms — This is a list of special function eponyms in mathematics, to cover the theory of special functions, the differential equations they satisfy, named differential operators of the theory (but not intended to include every mathematical eponym).… …   Wikipedia

  • List of mathematics articles (G) — NOTOC G G₂ G delta space G networks Gδ set G structure G test G127 G2 manifold G2 structure Gabor atom Gabor filter Gabor transform Gabor Wigner transform Gabow s algorithm Gabriel graph Gabriel s Horn Gain graph Gain group Galerkin method… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”