In
mathematics, in the area of
complex analysis
Complex analysis, traditionally known as the theory of functions of a complex variable, is the branch of mathematical analysis that investigates functions of complex numbers. It is helpful in many branches of mathematics, including algebra ...
, the general difference polynomials are a
polynomial sequence, a certain subclass of the
Sheffer polynomials
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 na ...
, which include the
Newton polynomial 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 inte ...
s, Selberg's polynomials, and the Stirling interpolation polynomials as special cases.
Definition
The general difference polynomial sequence is given by
:
where
is the
binomial coefficient
In mathematics, the binomial coefficients are the positive integers that occur as coefficients in the binomial theorem. Commonly, a binomial coefficient is indexed by a pair of integers and is written \tbinom. It is the coefficient of the t ...
. For
, the generated polynomials
are the Newton polynomials
:
The case of
generates Selberg's polynomials, and the case of
generates Stirling's interpolation polynomials.
Moving differences
Given an
analytic function
In mathematics, an analytic function is a function that is locally given by a convergent power series. There exist both real analytic functions and complex analytic functions. Functions of each type are infinitely differentiable, but complex ...
, define the moving difference of ''f'' as
:
where
is the
forward difference operator
A finite difference is a mathematical expression of the form . If a finite difference is divided by , one gets a difference quotient. The approximation of derivatives by finite differences plays a central role in finite difference methods for t ...
. Then, provided that ''f'' obeys certain summability conditions, then it may be represented in terms of these polynomials as
:
The conditions for summability (that is, convergence) for this sequence is a fairly complex topic; in general, one may say that a necessary condition is that the analytic function be of less than
exponential type
In complex analysis, a branch of mathematics, a holomorphic function is said to be of exponential type C if its growth is bounded by the exponential function ''e'C'', ''z'', for some real-valued constant ''C'' as , ''z'', → � ...
. Summability conditions are discussed in detail in Boas & Buck.
Generating function
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 ser ...
for the general difference polynomials is given by
:
This generating function can be brought into the form of the
generalized Appell representation
:
by setting
,
,
and
.
See also
*
Carlson's theorem
In mathematics, in the area of complex analysis, Carlson's theorem is a uniqueness theorem which was discovered by Fritz David Carlson. Informally, it states that two different analytic functions which do not grow very fast at infinity can not c ...
*
Bernoulli polynomials of the second kind
References
{{reflist
*
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.
Polynomials
Finite differences
Factorial and binomial topics