1.
Introduction and preliminaries
Special polynomials with two variables are critical from the standpoint of applications. These polynomials make it simple to derive a variety of useful identities and aid in the introduction of new families of special polynomials. Bretti et al. [5], established the general classes of two-variable Appell polynomials in utilising the features of an iterated isomorphism linked to Laguerre-type exponentials. Several writers investigated the two variable forms of the Hermite, Laguerre, and truncated exponential polynomials, as well as their generalisations (see [3,6,7,8].
The truncated exponential polynomials (TEP) em(u) possess the series[1]:
Many issues in optics and quantum physics use these polynomials. The features of these polynomials aren't well understood. The literatures of Dattoli et al. [7] provided the first detailed research of some properties of these polynomials.
The Succeeding series formulation can be used to deduce the most notable features of these polynomials, and the integral illustration for em(u) is given as:
which being a significant outcome of relation [1]:
Consequently, em(u) are defined [7,p. 596 (4)]:
Dattoli et al. [7] developed a 2-variable extension of the truncated exponential polynomials(TEP), which is being useful in the evaluation of integrals involving products of special functions and in a variety of optics and quantum mechanics situations.
We recall that the following generating relation [7] for 2-variable TEP is given by
and the succeeding series relation
Recalling the generating relation of higher order 2-variable TEP [7,p. 599 (31)]
and the succeeding series relation:
In light of the expressions (1.7), (1.5) and (1.4), we find
Note down that
where Um(v) denotes the second-order Chebyshev polynomials given by the generating relation [1]
We know that the class of Sheffer sequences [14] is an important class which appears in a variety of problems in applied mathematics, theoretical physics, approximation theory, and other disciplines of mathematics.
and
sm(u) is determined uniquely in Roman [12] by two formal power series and it is given by exponential generating relation for sm(u) as
where the compositional inverse of f(t) is f−1(t).
It should be noted that for g(t)=1, the sm(u) reduces to sm(u) called associated-Sheffer sequence and for f(t)=t, it reduces to Am(u) known as the Appell sequence [2].
These sequences are given by the generating relations
and
respectively.
In the table below, chosen members of the Sheffer, associated Sheffer, and Appell polynomial families are listed:
The truncated exponential-Sheffer polynomials are introduced and studied by Khan et al. [9] in 2014. Recalling that the truncated exponential-Sheffer polynomials (TESP) e(r)sm(u,v) are defined by the following generating function:
where f−1(t) is the compositional inverse of f(t).
Note. It should be noted that for g(t)=1, the truncated exponential-Sheffer sequence e(r)sm(u,v) becomes the truncated exponential-associated Sheffer sequence e(r)sm(u,v) and for f(t)=t, it becomes the truncated exponential-Appell sequence e(r)Am(u,v).
We review some definitions and concepts related to the Pascal and Wronskian matrices which will be used for derivation of the results in Sections 2, 3 and 5.
Let {j(u)=∞∑k=0aktii!=F|ai∈C} be power series in the C-algebra. The generalized Pascal functional matrix [15] of an analytic function g(t) for g(t)∈F is a square matrix of order (m+1) denoted by Pm[g(t)] and defined as:
It should be noted that g(i) represents the ith order derivative of g and gi denotes the ith power of g throughout the article.
Also, Wronskian matrix of the nth order of an analytic functions g1(t),g2(t),g3(t),⋯,gm(t) is an (m+1)×m matrix defined by:
It is important to note that in the expressions Pm[g(x,t)]t=0 and Wm[g(x,t)]t=0, we consider t as working variable and x is as a parameter.
We recall certain important properties and relationships between the Pascal functional and Wronskian matrices [16].
For any a,b∈C and any analytic functions g(t),g(t)∈F, the following properties hold true:
where Λm= diag[0!,1!,2!,⋯,m!]; g(0)=0 and g′(0)≠0.
Further, for any analytic functions g1(t),g2(t),⋯,gm(t) and f(t), the following property holds true:
The significance of the two variable forms of special polynomials in applications, as well as recent work on Sheffer sequences using a matrix approach [10,16], provides an incentive to develop recursive formulas and differential equations for truncated exponential-Sheffer polynomials using the generalised Pascal functional matrix of an analytic function and the Wronskian matrix of several analytic functions. Section 2 establishes several recursive formulas for truncated exponential-Sheffer polynomials e(r)sm(u,v). The differential equations for these polynomials are derived in Section 3. In Section 4, we look at few cases that provide solutions for some hybrid special polynomials. The identity for the truncated exponential-Sheffer polynomial sequences is determined in the final section.
2.
Recursive formulas
To utilize the Wronskian matrices, the vector form of the TESP is required.
The TES vector denoted by ¯e(r)sm(u,v) is defined as:
where {e(r)sm(u,v)} is the TESP sequence defined by Eq (1.17).
Since exp(uf−1(t))g(f−1(t))(1−v(f−1(t))r) is analytic, therefore by Taylor's expansion, it follows that
In view of Eq (2.2), the truncated exponential-Sheffer vector (2.1) can be expressed as:
The following Lemma must be proved before proceeding with the formulation of the recursive formulas for the truncated exponential-Sheffer polynomial sequence.
Lemma 2.1. The following property holds for the truncated exponential-Sheffer polynomial sequence e(r)sm(u,v):
Proof. It follows from using property (1.24) in the r.h.s. of Eq (2.3) that
For, Wm[ext]t=0=[1xx2⋯xn]T and using relation (1.23), the above expression can be written as
Division by k! and differentiation of (2.6) k times with regard to x results in
The left part of (2.7) is the kth column of
and the right part of (2.7) is the kth column of
Thus (2.4) is proved.
Next, for e(r)sm(u,v) certain recursive formulas are established.
First, we expresses e(r)sm+1(u,v) in terms of e(r)sm(u,v) by deriving a recursive formula and its derivatives in the following manner.
Theorem 2.2. For e(r)sm(u,v), the succeeding recursive formula holds:
where
and
Proof. In light of (1.19) and (2.2), we find
Using expressions (1.22)–(1.24) in a suitable manner and differentiating Wm[ddt(exp(uf−1(t))g(f−1(t))(1−v(f−1(t))r))]t=0, we find
which in light of Lemma 2.1 becomes
Assertion (2.8) is obtained by comparing the last rows of (2.9) and (2.11).
Remark 2.3. For g(t)=1⟹ ηk=0 (k≥0), thus for g(t)=1 and as a result of Theorem 2.1, we arrive at the following conclusion.
Corollary 2.4. For e(r)sn(u,v), the succeeding recursive relation holds
where
Remark 2.5. Consequently for f(t)=t⟹ δ0=1; δk=0 (k≠0), thus for t=f(t) as a result of Theorem 2.1, we arrive at the following conclusion.
Corollary 2.6. For the e(r)Am(u,v), the succeeding recursive formula holds
where
Further, a pure recursive formula for the truncated exponential-Sheffer polynomials is derived by proving the result.
Theorem 2.7. For e(r)sm(u,v), the succeeding recursive formula holds.
where
Proof. In light of property (1.23), the expression Wm[f′(f−1(t))ddt(exp(uf−1(t))g(f−1(t))(1−v(f−1(t))r))]t=0 takes the form:
When differentiation is performed in the same expression and properties (1.21) and (1.23) are used, it follows that
Assertion (2.14) is established by comparing the last rows of (2.15) and (2.13).
Remark 2.8. Since g(t)=1⟹ θk=0 (k≥0), thus for g(t)=1 and as a result of Theorem 2.2, we arrive at the following conclusion.
Corollary 2.9. For e(r)sn(u,v), the succeeding pure recursive formula holds.
where
Remark 2.10. Since f(t)=t⟹ ϵ0=1; ϵk=0 (k≠0), thus for f(t)=t.
Corollary 2.11. For e(r)Am(u,v), the succeeding pure recursive formula holds
where
Finally, by proving the following result, we derive a pure recursive formula that provides a representation of e(r)sm+1(u,v) in terms of e(r)sn−k(u,v) (k=0,1,2,cdotsn).
Theorem 2.12. For e(r)sm(u,v), the succeeding pure recursive formula holds:
where
Proof. Differentiating Wm[ddt(exp(uf−1(t))g(f−1(t))(1−v(f−1(t))r))]t=0 and then using (1.23), we have
Assertion (2.19) is established by comparing the last rows of (2.9) and (2.20).
Remark 2.13. Since g(t)=1⟹ ψk=0 (k≥0), therefore for g(t)=1and as a result of Theorem 2.3, we arrive at the following conclusion.
Corollary 2.14. For Lsn(u,v), the succeeding pure recursive formula holds
where
Remark 2.15. Noting down for f(t)=t⟹ϕ0=1; ϕk=0 (k≠0). Thus, taking f(t)=t, in Theorem 2.3, we deduce the consequence of Theorem 2.3.
Corollary 2.16. For e(r)Am(u,v), the succeeding pure recursive formula holds
where
The differential equation satisfied by the truncated exponential-Sheffer polynomials e(r)sm(u,v) is derived in the following section.
3.
Differential equation
We prove the following result in order to derive the differential equation for the truncated exponential-Sheffer polynomials e(r)sm(u,v).
Theorem 3.1. The following differential equation is satisfied by the truncated exponential-Sheffer polynomials e(r)sm(u,v).
where
Proof. In light of (1.23), the relation Wn[tddt(exp(uf−1(t))g(f−1(t))(1−v(f−1(t))r))]t=0 takes the form
On the other hand, by performing differentiation in the same expression and appropriately applying properties (1.23)–(1.25), we have
In light of Lemma 2.1, (3.3) becomes
Assertion (3.1) is proved by comparing the last rows of (3.2) and (3.4) and in light of the fact that
Remark 3.2. For g(t)=1, the polynomials e(r)sm(u,v) reduces to the polynomials e(r)sn(u,v) and since g(t)=1⟹αk=0(k≥1), the succeeding consequence of Theorem 3.1 is obtained.
Corollary 3.3. The polynomials e(r)sn(u,v) satisfy the succeeding differential equation
where
Remark 3.4. For f(t)=t, the polynomials e(r)sm(u,v) reduces to the polynomials e(r)Am(u,v) and since f(t)=t⟹β1=1; βk=0(k≠1), therefore, for f(t)=t, the succeeding consequence of Theorem 3.1 is obtained.
Corollary 3.5. The polynomials e(r)Am(u,v) satisfy the succeeding differential equation
where
The differential equation and recursive formulas for certain members of the truncated exponential-Sheffer and truncated exponential-associated Sheffer families are derived in the following section.
4.
Examples
We use Theorem 3.1 to derive the differential equation and Theorems 2.1–2.3 to find the recursive formulas for certain members of the truncated exponential-Sheffer family.
Example 4.1, For e(tν)m,f(t)=tν=g(t) and νt=f−1(t), the Sheffer polynomials become the generalized Hermite polynomials Hn,m,ν(x) and consequently the truncated exponential-Sheffer polynomials become the truncated exponential-generalized Hermite polynomials e(r)Hn,m,ν(u,v).
It folllows from Theorem 3.1 that
Inserting (4.1) into expression (3.1), the differential equation for the truncated exponential-generalized Hermite polynomials e(r)Hn,m,ν(u,v) is obtained as follows
Similarly, in light of Theorems 2.1–2.3, the recursive formulas for the truncated exponential-generalized Hermite polynomials e(r)Hn,m,ν(u,v) are obtained as follows
and
Example 4.2. For (1−t)−κ−1=g(t) and tt−1=f−1(t), the Sheffer polynomials become the generalized Laguerre polynomials Lκn(x) and consequently the truncated exponential-Sheffer polynomials become the generalized truncated exponential-Laguerre polynomials e(r)Lκn(u,v).
From Theorem 3.1, we find
Inserting (4.7) into (3.1), the succeeding differential equation for e(r)Lκn(u,v) is obtained
Similarly, in light of Theorems 2.1–2.3, the succeeding recursive formulas for e(r)Lκn(u,v) are obtained
Next, The differential equation is then derived using Corollary 3.1, and the recursive formulas for certain members of the truncated exponential-associated Sheffer family are derived using Corollaries 2.1, 2.3, and 2.5.
Example 4.3. For ln(1+t)=f(t) and et−1=f−1(t), the associated Sheffer polynomials reduces to the exponential polynomials ϕn(x) and consequently the truncated exponential-associated Sheffer polynomials become the truncated exponential-exponential polynomials e(r)ϕn(u,v).
It follows from Corollary 3.1
Inserting (4.13) into (3.5), the succeeding differential equation for polynomials e(r)ϕn(u,v) is obtained:
Similarly, Corollaries 2.1, 2.3, and 2.5 are used to obtain the recursive formulas for the polynomials e(r)ϕn(u,v)
and
In the following section, we look at an identity for truncated exponential-Sheffer polynomials.
5.
Appendix
The approach used in the preceding sections can be extended to yield additional results. As an example, we prove the following result to derive an identity for the truncated exponential-Sheffer polynomial sequences.
Theorem 5.1. The following identity for the truncated exponential-Sheffer polynomials e(r)sm(u,v) holds true
where f(k)(0)=Λk.
Proof. In light of property (1.23), expression Wm[t(exp(uf−1(t))g(f−1(t))(1−v(f−1(t))r))]t=0 takes the the form as given under
In contrast, using Lemma 2.1 and the properties (1.22)–(1.24), we have
Assertion (5.1) is proved by comparing the nth rows of (5.2) and (5.3) and replacing m by m+1.
To demonstrate the application of Theorem 5.1, consider the following examples in the form of a table.
The recursive formulas and differential equations are critical in the analysis of algorithms [13]. These appear in infinite impulse response (IIR) digital filters. The attempt to model population dynamics gave rise to recurrence relations. Fibonacci numbers, for example, were once used as a model for rabbit population growth.
6.
Conclusions
Hence we provided some specific properties of truncated exponential-Sheffer polynomials and multi variable special polynomial properties. The properties and association between the Pascal functional and Wronskian matrices are used to build the recursive equations and differential equation for these polynomials, as well as for several members of the truncated exponential-Sheffer family. The corresponding results for the truncated exponential-associated Sheffer and truncated exponential-Appell families are provided with some examples.
Conflict of interest
The author declares that there is no conflict of interest.