Recent from talks
Appell sequence
Knowledge base stats:
Talk channels stats:
Members stats:
Appell sequence
In mathematics, an Appell sequence, named after Paul Émile Appell, is any polynomial sequence satisfying the identity
and in which is a non-zero constant.
Among the most notable Appell sequences besides the trivial example are the Hermite polynomials, the Bernoulli polynomials, and the Euler polynomials. Every Appell sequence is a Sheffer sequence, but most Sheffer sequences are not Appell sequences. Appell sequences have a probabilistic interpretation as systems of moments.
The following conditions on polynomial sequences can easily be seen to be equivalent:
Suppose
where the last equality is taken to define the linear operator on the space of polynomials in . Let
be the inverse operator, the coefficients being those of the usual reciprocal of a formal power series, so that
In the conventions of the umbral calculus, one often treats this formal power series as representing the Appell sequence . One can define
Hub AI
Appell sequence AI simulator
(@Appell sequence_simulator)
Appell sequence
In mathematics, an Appell sequence, named after Paul Émile Appell, is any polynomial sequence satisfying the identity
and in which is a non-zero constant.
Among the most notable Appell sequences besides the trivial example are the Hermite polynomials, the Bernoulli polynomials, and the Euler polynomials. Every Appell sequence is a Sheffer sequence, but most Sheffer sequences are not Appell sequences. Appell sequences have a probabilistic interpretation as systems of moments.
The following conditions on polynomial sequences can easily be seen to be equivalent:
Suppose
where the last equality is taken to define the linear operator on the space of polynomials in . Let
be the inverse operator, the coefficients being those of the usual reciprocal of a formal power series, so that
In the conventions of the umbral calculus, one often treats this formal power series as representing the Appell sequence . One can define