Generalized Appell Representation
   HOME

TheInfoList



OR:

In
mathematics Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...
, a
polynomial sequence In mathematics, a polynomial sequence is a sequence of polynomials indexed by the nonnegative integers 0, 1, 2, 3, ..., in which each index is equal to the degree of the corresponding polynomial. Polynomial sequences are a topic of interest in en ...
\ has a generalized Appell representation if the
generating function In mathematics, a generating function is a way of encoding an infinite sequence of numbers () by treating them as the coefficients of a formal power series. This series is called the generating function of the sequence. Unlike an ordinary seri ...
for the
polynomial In mathematics, a polynomial is an expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An exa ...
s takes on a certain form: :K(z,w) = A(w)\Psi(zg(w)) = \sum_^\infty p_n(z) w^n where the generating function or
kernel Kernel may refer to: Computing * Kernel (operating system), the central component of most operating systems * Kernel (image processing), a matrix used for image convolution * Compute kernel, in GPGPU programming * Kernel method, in machine learnin ...
K(z,w) is composed of the series :A(w)= \sum_^\infty a_n w^n \quad with a_0 \ne 0 and :\Psi(t)= \sum_^\infty \Psi_n t^n \quad and all \Psi_n \ne 0 and :g(w)= \sum_^\infty g_n w^n \quad with g_1 \ne 0. Given the above, it is not hard to show that p_n(z) is a polynomial of degree n.
Boas–Buck polynomials In mathematics, Boas–Buck polynomials are sequences of polynomials \Phi_n^(z) defined from analytic functions B and C by generating functions of the form :\displaystyle C(zt^r B(t))=\sum_\Phi_n^(z)t^n. The case r=1, sometimes called generalized ...
are a slightly more general class of polynomials.


Special cases

* The choice of g(w)=w gives the class of
Brenke polynomials William Charles Brenke (April 12, 1874, Berlin – 1964) was an American mathematician who introduced Brenke polynomials and wrote several undergraduate textbooks. He received his PhD in mathematics at Harvard under Maxime Bôcher. Brenke taught ...
. * The choice of \Psi(t)=e^t results in the
Sheffer sequence In mathematics, a Sheffer sequence or poweroid is a polynomial sequence, i.e., a sequence of polynomials in which the index of each polynomial equals its degree, satisfying conditions related to the umbral calculus in combinatorics. They are ...
of polynomials, which include the
general 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 interpolatio ...
, such as the
Newton polynomials In the mathematical field of numerical analysis, a Newton polynomial, named after its inventor Isaac Newton, is an interpolation polynomial for a given set of data points. The Newton polynomial is sometimes called Newton's divided differences inter ...
. * The combined choice of g(w)=w and \Psi(t)=e^t gives the
Appell sequence In mathematics, an Appell sequence, named after Paul Émile Appell, is any polynomial sequence \_ satisfying the identity :\frac p_n(x) = np_(x), and in which p_0(x) is a non-zero constant. Among the most notable Appell sequences besides the ...
of polynomials.


Explicit representation

The generalized Appell polynomials have the explicit representation :p_n(z) = \sum_^n z^k \Psi_k h_k. The constant is :h_k=\sum_ a_ g_ g_ \cdots g_ where this sum extends over all
compositions Composition or Compositions may refer to: Arts and literature * Composition (dance), practice and teaching of choreography *Composition (language), in literature and rhetoric, producing a work in spoken tradition and written discourse, to include ...
of n into k+1 parts; that is, the sum extends over all \ such that :j_0+j_1+ \cdots +j_k = n.\, For the Appell polynomials, this becomes the formula :p_n(z) = \sum_^n \frac .


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 = c(w) K(z,w)+\frac \frac where b(w) and c(w) have the power series :b(w) = \frac \frac g(w) = 1 + \sum_^\infty b_n w^n and :c(w) = \frac \frac A(w) = \sum_^\infty c_n w^n. Substituting :K(z,w)= \sum_^\infty p_n(z) w^n immediately gives the
recursion relation In mathematics, a recurrence relation is an equation according to which the nth term of a sequence of numbers is equal to some combination of the previous terms. Often, only k previous terms of the sequence appear in the equation, for a parameter ...
: z^ \frac \left \frac \right -\sum_^ c_ p_k(z) -z \sum_^ b_ \frac 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.


See 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. * * {{cite journal, first1=W. N., last1= Huff, title=The type of the polynomials generated by f(xt) φ(t), year=1947, journal=Duke Mathematical Journal, volume=14, number=4, pages=1091–1104, doi=10.1215/S0012-7094-47-01483-X Polynomials