1. Introduction
In this survey article, a uniform method is presented for constructing the differential equations satisfied by several sets of classical and non classical polynomials. This has been done by starting from the basic elements of the relevant generating functions, using the monomiality principle by G. Dattoli [
1] and a general result by Y. Ben Cheikh [
2]. Of course, the polynomials considered in this paper are only examples for showing that the method works, but obviously this technique can be theoretically extended to every polynomial set.
This method has been recently applied in several articles (see [
3,
4,
5,
6,
7,
8,
9]), which include works in collaboration with several authors. The most outstanding of them is Prof. Dr. Hari M. Srivastava, to whom this article is dedicated.
The derived differential equations are generally of infinite order, but they reduce to finite order when applied to polynomials.
It is worth noting that the differential equations for Sheffer polynomial sets have been studied even with different methods (see [
10,
11,
12,
13]), but here we use only elements directly connected with the theory of polynomials.
We start recalling, in
Section 2, the definitions relevant to Sheffer polynomials, the G. Dattoli monomiality principle, and a general result by Y. Ben Cheikh.
The classical polynomial sets, considered in
Section 3, are the Bernoulli, Euler, Genocchi and Mittag–Leffler polynomials. In
Section 4, we show some new polynomial sets derived from non-classical generating functions.
2. Sheffer Polynomials
The Sheffer polynomials
are introduced [
14] by means of the exponential generating function [
15] of the type:
where
According to a different characterization (see [
16], p. 18), the same polynomial sequence can be defined by means of the pair
, where
is an invertible series and
is a delta series:
Denoting by
the compositional inverse of
(i.e., such that
), the exponential generating function of the sequence
is given by
so that
When
, the Sheffer sequence corresponding to the pair
is called the associated Sheffer sequence
for
, and its exponential generating function is given by
A list of known Sheffer polynomial sequences and their associated ones can be found in [
17].
Shift Operators and Differential Equation
We recall that a polynomial set
is called quasi-monomial if and only if there exist two operators
and
such that
is called the derivative operator and the multiplication operator, as they act in the same way as classical operators on monomials.
This definition traces back to a paper by J.F. Steffensen [
18] recently improved by G. Dattoli and widely used in several applications [
19,
20].
Y. Ben Cheikh proved that every polynomial set is quasi-monomial under the action of suitable derivative and multiplication operators. In particular, in the same article, the following result is proved, as a particular case of Corollary 3.2 in [
2]:
Theorem 1. Let denote a Sheffer polynomial set, defined by the generating functionwhereand Denoting, as before, by the compositional inverse of , the Sheffer polynomial set is quasi-monomial under the action of the operatorswhere prime denotes the ordinary derivatives with respect to t. Furthermore, according to the monomiality principle, the quasi-monomial polynomials satisfy the differential equation 3. Differential Equations of Classical Polynomials
3.1. Bernoulli Polynomials
The Bernoulli polynomials are defined by the generating function
so that
where
are the Bernoulli numbers.
Differential Equation of the
Note that, recalling that
, the following expansion holds:
The shift operators for the Bernoulli polynomials are given by
Therefore, by using the factorization method, we find
Theorem 2. The Bernoulli polynomials satisfy the differential equationthat isor, in equivalent form: Proof. It is sufficient to expand in series the operator (
17). Equation (
19) follows because, for any fixed
n, the series expansion in Equation (
18) reduces to a finite sum when applied to a polynomial of degree
n. □
3.2. Euler Polynomials
The Euler polynomials are defined by the generating function
so that
where
are the Euler numbers.
Differential Equation of the
Note that the following expansion holds:
where
, and
.
The shift operators for the Euler polynomials are given by
Therefore, by using the factorization method, we find
Theorem 3. The Euler polynomials satisfy the differential equationthat isor, in equivalent form: Proof. It is sufficient to expand in series the operator (
24). Equation (
26) follows because, for any fixed
n, the series expansion in Equation (
25) reduces to a finite sum when applied to a polynomial of degree
n. □
3.3. Genocchi Polynomials
The Genocchi polynomials are defined by the generating function
so that
where
are the Genocchi numbers.
Differential Equation of the
Note that the following expansion holds:
where
,
, and
,
.
The shift operators for the Genocchi polynomials are given by
so that the Genocchi polynomials satisfy the differential equation
Therefore, by using the factorization method, we find
Theorem 4. The Genocchi polynomials satisfy the differential equationthat isor, in equivalent form: Proof. It is sufficient to expand in series the operator (
32). Equation (
34) follows because, for any fixed
n, the series expansion in Equation (
33) reduces to a finite sum when applied to a polynomial of degree
n. □
3.4. The Mittag–Leffler Polynomials
We recall that the Mittag–Leffler polynomials [
21] are a special case of associated Sheffer polynomials, defined by the generating function
Therefore, we have
so that, for the Mittag-Leffer polynomials, we find the shift operators:
3.5. Differential Equation of the
In the present case, according to the identity:
we can write
so that we have the theorem
Theorem 5. The Mittag–Leffler polynomials satisfy the differential equationthat isorwhere denotes the integral part
of . Proof. It is sufficient to expand in series the operator (
39). Equation (
41) follows because, for any fixed
n, the series expansion in Equation (
40) reduces to a finite sum when applied to a polynomial of degree
n. □
4. Differential Equations of Non-Classical Polynomials
4.1. Euler-Type Polynomials
Here, we introduce a Sheffer polynomial set connected with the classical Euler polynomials.
Assuming:
we consider the Euler-type polynomials
, defined by the generating function
Note that the Euler numbers are recovered, since we have:
so that
.
In what follows, we use the expansions
Note that, in our case, we are dealing with a Sheffer polynomial set, so that, since we have
, the operator
defined by Equation (
6) simply reduces to the derivative operator
. Furthermore, we have:
so that we have the theorem
Theorem 6. The Euler-type polynomial set is quasi-monomial under the action of the operators(by we denote the inverse of the function ), i.e., There is no problem about the convergence of the above series, since they reduce to finite sums when applied to polynomials.
4.2. Differential Equation of the
In the present case, we have
Theorem 7. The Euler-type polynomials satisfy the differential equationi.e., Note that, for any fixed n, the Cauchy product of series expansions in Equation (49) reduces to a finite sum, with upper limit , when it is applied to a polynomial of degree n, because the successive addends vanish. Remark 1. The first few Euler-type polynomials are as follows: 5. Adjointness for Sheffer Polynomial Sequences
According to the above considerations, Sheffer polynomials are characterized both by the ordered couples , or by .
Definition 1. Adjoint Sheffer polynomials are defined by interchanging the ordered couple with , when writing the generating function.
Here and in the following the
tilde “∼” above the symbol of a polynomial set stands for the adjective “
adjoint” (see e.g., [
4]).
5.1. Adjoint Hahn Polynomials
Assuming:
we consider the adjoint Hahn
, defined by the generating function
It is a Sheffer set.
Note that, in this case, we have:
so that we have the theorem
Theorem 8. The adjoint Hahn polynomial set is quasi-monomial under the action of the operatorsi.e., 5.2. Differential Equation of the
In the present case, we have
Theorem 9. The Sheffer-type adjoint Hahn polynomials satisfy the differential equation Note that, for any fixed
n, in Equation (
55), a finite sum appears, with upper limit
, instead of a complete series expansion since, when this series is applied to a polynomial of degree
n, the subsequent addends vanish.
Remark 2. The first few values of the adjoint Hahn polynomials are as follows: Remark 3. Table of adjoint Hahn numbers Note that the sequence
appears in the Encyclopedia of Integer Sequences [
22] under #A000364—Euler (or secant numbers):
= number of downup permutations of
.
Example 1. = 5 counts 4231, 4132, 3241, 3142, 2143. - David Callan, Nov 21, 2011.
5.3. Adjoint Bernoulli Polynomials of the Second Kind
Assuming
we consider the adjoint Bernoulli polynomials of the second kind
, defined by the generating function
Note that, in our case, we are dealing with a Sheffer polynomial set, so that, since we have
, the operator
defined by Equation (
6) simply reduces to the derivative operator
. Furthermore, we have
so that we have the theorem
Theorem 10. The adjoint Bernoulli polynomials of the second kind are quasi-monomials under the action of the operatorsthat is 5.4. Differential Equation of the
In the present case, we have
so that we have the theorem
Theorem 11. The adjoint Bernoulli polynomials of the second kind satisfy the differential equationthat isbecause, for any fixed n, the series expansion in Equation (61) reduces to a finite sum when it is applied to a polynomial of degree n. Note that, in this case, due to the presence of the operator , it is necessary to consider derivatives up to the order .
Remark 4. The first few values of the adjoint Bernoulli polynomials of the second kind are as follows: Note that for
the generating function becomes
so that
, namely the
nth classical Bernoulli number.
6. Conclusions
In this survey article, it has been shown that the common belonging of some polynomial sets to the Sheffer class allows to construct, in a uniform way, the differential equations they verify. This follows from the fact that it is possible to construct their shift operators, on the basis of general results due to G. Dattoli and Y. Ben Cheikh.
The equations derived in such a way are, in general, of infinite order, but they reduce to finite-order equations when they are applied to polynomials of the considered set. This means that the order of the equation increases with the degree of the polynomial, in a similar way to what happens for the order of the recurrence they verify.
Both classic and other polynomials—the so-called associated Sheffer polynomials—have been examined. In fact, it has been shown that, for the polynomials of the Sheffer class, the differential equation follows from the basic elements of their generating function, in a constructive way, using a simple and general method linked to the monomiality principle.