Next Article in Journal
Laplacian Split-BREAK Process with Application in Dynamic Analysis of the World Oil and Gas Market
Next Article in Special Issue
A New Family of Appell-Type Changhee Polynomials with Geometric Applications
Previous Article in Journal
Cut-Free Gentzen Sequent Calculi for Tense Logics
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Matrix Approaches for Gould–Hopper–Laguerre–Sheffer Matrix Polynomial Identities

1
Department of Mathematics, School of Advanced Sciences, Vellore Institute of Technology, Vellore 632014, India
2
Department of Mathematics, Dongguk University, Gyeongju 38066, Republic of Korea
*
Author to whom correspondence should be addressed.
Axioms 2023, 12(7), 621; https://doi.org/10.3390/axioms12070621
Submission received: 28 May 2023 / Revised: 17 June 2023 / Accepted: 18 June 2023 / Published: 21 June 2023
(This article belongs to the Special Issue Research in Special Functions)

Abstract

:
The Gould–Hopper–Laguerre–Sheffer matrix polynomials were initially studied using operational methods, but in this paper, we investigate them using matrix techniques. By leveraging properties of Pascal functionals and Wronskian matrices, we derive several identities for these polynomials, including recurrence relations. It is highlighted that these identities, acquired via matrix techniques, are distinct from the ones obtained when using operational methods.

1. Introduction and Preliminaries

Ongoing research in the field of special functions, including special polynomials, is driven primarily by their wide-ranging applications in mathematics, statistics, physics, and engineering. Numerous special polynomials have been introduced, studied, and utilized in various applications. Special matrix functions and polynomials represent a notable generalization of special functions, with their study being crucial due to numerous applications in fields such as statistics, physics, and engineering. The special matrix polynomials are found in a variety of mathematical and engineering disciplines. For instance, the matrix polynomials are used to form matrix polynomial equations, which encode a variety of problems ranging from elementary world problems to complicated problems in the sciences, in settings ranging from basic chemistry and physics to economics and social science, as well as in calculus and numerical analysis to approximate other functions. Thus, many researchers have investigated the special matrix polynomials (see, e.g., [1,2,3,4,5] and references therein).
The focus of this research is on the methodologies employed in the study of these polynomials. Conveniently, we classify the methodologies about the cited articles in this work into three rough categories: conventional methods, operational methods, and matrix methods. For example, conventional techniques are used in [1,6]; operational techniques are used in [2,3]; matrix techniques are used in [4,5]; conventional and operational techniques are used in [7].
This study concentrates on the matrix-based approaches by selecting the matrix polynomials given in [2]. It highlights that the identities obtained in this article using matrix techniques differ from those in [2] obtained using operational methods. This article utilizes matrix techniques, specifically certain identities of the generalized Pascal functional matrix of an analytic function and the Wronskian matrix of several analytic functions, to present several identities and recurrence relations for the Gould–Hopper–Laguerre–Sheffer matrix polynomials in (12). This article is structured as follows: Section 2 establishes recurrence relations for the Gould–Hopper–Laguerre–Sheffer matrix polynomials, while Section 3 provides certain identities for these polynomials. Additionally, particular cases are demonstrated to showcase the applications of the results presented in Section 2 and Section 3. Section 4 presents several particular cases of the results in Section 2. In conclusion, Section 5 of this article provides final remarks, emphasizing that the identities obtained in this study using matrix techniques differ from those derived in [2] through operational methods.
Exploring the properties of multivariable special polynomials is facilitated by a powerful method provided by linear algebra. The features of the generalized Pascal functional matrix and the Wronskian matrix [4] play a crucial role in establishing the theoretical basis for this method. Let us recall certain definitions and properties pertaining to the Pascal and Wronskian matrices: Let F be a class of functions which are analytic at the origin. The generalized Pascal functional matrix P [ a ( u ) ] ( a ( u ) F ) is a lower triangular matrix of order ( + 1 ) (see, e.g., [4,5]):
P [ a ( u ) ] η , ξ = η ξ a ( η ξ ) ( u ) , if η ξ , 0 , otherwise ,
for all η , ξ = 0 , 1 , 2 , , . In the present and subsequent instances, for any nonnegative integer τ , a ( τ ) denotes the τ t h order derivative of a , while a τ stands for the τ t h power of a . In particular, a ( 0 ) = a and a 0 = 1 .
The t h order Wronskian matrix of analytic functions a 1 ( u ) , a 2 ( u ) , a 3 ( u ) , , a m ( u ) F is an ( + 1 ) × m matrix which is defined as
W [ a 1 ( u ) , a 2 ( u ) , a 3 ( u ) , , a m ( u ) ] = a 1 ( u ) a 2 ( u ) a 3 ( u ) a m ( u ) a 1 ( u ) a 2 ( u ) a 3 ( u ) a m ( u ) a 1 ( ) ( u ) a 2 ( ) ( u ) a 3 ( ) ( u ) a m ( ) ( u ) .
For any constants α , β and any analytic functions a ( u ) and b ( u ) , the following properties hold true (see, e.g., [5]):
P [ α a ( u ) + β b ( u ) ] = α P [ a ( u ) ] + β P [ b ( u ) ] ;
W [ α a ( u ) + β b ( u ) ] = α W [ a ( u ) ] + β W [ b ( u ) ] ;
P [ a ( u ) ] P [ b ( u ) ] = P [ b ( u ) ] P [ a ( u ) ] = P [ a ( u ) b ( u ) ] ;
P [ a ( u ) ] W [ b ( u ) ] = P [ b ( u ) ] W [ a ( u ) ] = W [ a ( u ) b ( u ) ] ;
W [ b ( a ( u ) ) ] u = 0 = W [ 1 , a ( u ) , a 2 ( u ) , a 3 ( u ) , , a ( u ) ] u = 0 Λ 1 W [ b ( u ) ] u = 0 ,
where Λ : = diag [ 0 ! , 1 ! , 2 ! , , ! ] (and elsewhere), a ( 0 ) = 0 and a ( 0 ) 0 . Equations (3)–(5) reveal that W exhibits linearity, whereas P satisfies both linearity and the multiplicative law. Furthermore, the multiplication of P is commutative. Furthermore, for any analytic functions b ( u ) and a 1 ( u ) , a 2 ( u ) , ⋯, a m ( u ) , the following property holds true:
P [ b ( u ) ] W [ a 1 ( u ) , a 2 ( u ) , , a m ( u ) ] = W [ ( b a 1 ) ( u ) , ( b a 2 ) ( u ) , , ( b a m ) ( u ) ] .
Here and elsewhere, b ( u ) is an invertible analytic function, that is, b ( 0 ) 0 , while a ( u ) is analytic function with a ( 0 ) = 0 and a ( 0 ) 0 that admits compositional inverse a 1 (see Remark 1).
It is also noted that the involved functions are analytic at u = 0 and have power series representations centered at the origin and its suitable neighborhood. It is recalled (see Theorem 2.3.4 in [8]) that a sequence s ( x ) is Sheffer for ( b ( u ) , a ( u ) ) if and only if it is generated by
1 b ( a 1 ( u ) ) e x a 1 ( u ) = = 0 s ( x ) ! u ( x C ) .
Furthermore, the Gould–Hopper–Laguerre–Sheffer matrix polynomials (GHLSMaP) g L s m ( x , y , z ; A , B ) are defined by the following generating function (see [2]):
1 b ( a 1 ( u ) ) e ( x 2 A a 1 ( u ) + B y a 1 ( u ) m ) C 0 ( z a 1 ( u ) ) = = 0 g L s m ( x , y , z ; A , B ) u ! ,
where C 0 ( x u ) is the 0th-order Bessel–Tricomi function and given by (see Equations (5)–(7) in [2])
C 0 ( α x ) = exp ( α D x 1 ) { 1 } ,
and A, B are matrices in C k × k ( k N ) , which denotes the set of k by k square matrices with entries of complex numbers, such that A is positive stable, C and N being, respectively, the sets of complex numbers and positive integers, and elsewhere. In addition, the other notations and restrictions about (10) would follow from those in [2]. In view of (11), the generating relation (10) takes the following form:
F ( x , y , z ; A , B ; u ) : = 1 b ( a 1 ( u ) ) e ( x 2 A D z 1 ) a 1 ( u ) + B y a 1 ( u ) m = = 0 g L s m ( x , y , z ; A , B ) u ! .
For a ( u ) = u , the GHLSMaP g L s m ( x , y , z ; A , B ) gives the Gould–Hopper–Laguerre–Appell matrix polynomials (GHLAMaPs), g L A m ( x , y , z ; A , B ) , which are generated by the following function (see [3]):
G ( x , y , z ; A , B ; u ) : = 1 b ( u ) e ( x 2 A D z 1 ) u + B y u m = = 0 g L A m ( x , y , z ; A , B ) u ! .
Remark 1.
In (9), the functions a and b are called delta series and invertible series, respectively, because they are treated as series centered at 0 (see [8]). The followings are well-known in the geometric function theory (see [9]). Let S denote the class of functions a ( u ) normalized by the following Maclaurin series:
a ( u ) = u + = 2 a u ( u U ) ,
which are analytic in the open unit disk U : = { u C : | u | < 1 } and univalent in U . Then, it is well known that every function a S has compositional inverse a 1 , given by
a 1 ( a ( u ) ) = u ( u U )
and
a a 1 ( v ) = v ( | v | < r 0 ( a ) ; r 0 ( a ) 1 4 ) ,
the latter one of which means that v belongs to the range of a and r 0 ( a ) is the radius centered at 0 including the range of a . Indeed, the inverse function a 1 is given by
a 1 ( v ) = v a 2 v 2 + 2 a 2 2 a 3 v 3 5 a 2 3 5 a 2 a 3 + a 4 v 4 + .
It is found that the analytic function a S and the delta series a are the same when their domains are adjusted and the delta series a ( u ) is normalized. Take an example a ( u ) : = u 1 u . Then, a 1 ( u ) = u 1 + u . Since both a ( u ) and a 1 ( u ) are univalent in U , a ( u ) is called bi-univalent in U (see [9]). The sequence s ( x ) is Sheffer for ( 1 , a ( u ) ) , which is also called associated with a ( u ) , and generated by
e x u 1 + u = = 0 s ( x ) ! u ( x C ) .
It is observed from the Taylor–Maclaurin expansion that
s 0 ( x ) = 1 and s k ( x ) = k u k e x u 1 + u | u = 0 ( k N ) .
By using Faá di Bruno’s formula (see [10]), which is a recursive formula for finding higher-order derivatives of a composite function, we have
s ( x ) = B ( x 1 , , x ) , x k : = ( 1 ) k 1 k ! x ( k N ) ,
where B ( x 1 , , x ) are the ℓth complete exponential Bell polynomials which can be expressed as determinants (see [11]):
B ( x 1 , , x ) = det x 1 0 ! x 2 1 ! x 3 2 ! x 4 3 ! x ( 1 ) ! 1 x 1 0 ! x 2 1 ! x 3 2 ! x 1 ( 2 ) ! 0 2 x 1 0 ! x 2 1 ! x 2 ( 3 ) ! 0 0 3 x 1 0 ! x 3 ( 4 ) ! 0 0 0 4 x 4 ( 5 ) ! 0 0 0 0 ( 1 ) x 1 0 !
The first few associated polynomials s ( x ) for a ( u ) = u 1 u are
s 0 ( x ) = 1 ,   s 1 ( x ) = x ,   s 2 ( x ) = x 2 2 x ,   s 3 ( x ) = x 3 6 x 2 + 6 x , s 4 ( x ) = x 4 12 x 3 + 36 x 2 24 x .

2. Recurrence Relations

Since F ( x , y , z ; A , B ; u ) is analytic at u = 0 , it follows from (12) and Taylor–Maclaurin series expansion that, for k N 0 : = N { 0 } (and elsewhere),
g L s k m ( x , y , z ; A , B ) = d d u k F ( x , y , z ; A , B ; u ) | u = 0 .
Thus, it is found from (2) and (19) that
W F ( x , y , z ; A , B ; u ) u = 0       = [ g L s 0 m ( x , y , z ; A , B ) g L s 1 m ( x , y , z ; A , B ) g L s m ( x , y , z ; A , B ) ] T ,
where T denotes the transpose of a matrix.
The following lemma is a modified version of Lemma 3.3 in [5].
Lemma 1.
The following identity holds true:
W [ g L s 0 m ( x , y , z ; A , B ) g L s 1 m ( x , y , z ; A , B ) g L s m ( x , y , z ; A , B ) ] | x T Λ 1 Ξ 1 = W 1 , a 1 ( u ) , ( a 1 ( u ) ) 2 , , ( a 1 ( u ) ) u = 0 Λ 1 P e D z 1 u + B y u m b ( u ) u = 0 P [ e x 2 A u ] u = 0 = W 1 , a 1 ( u ) , ( a 1 ( u ) ) 2 , , ( a 1 ( u ) ) u = 0 Λ 1 P [ G ( x , y , z ; A , B ; u ) ] u = 0 = W 1 , a 1 ( u ) , ( a 1 ( u ) ) 2 , , ( a 1 ( u ) ) u = 0 Λ 1 P = 0 g L A m ( x , y , z ; A , B ) u ! u = 0 ,
where Λ 1 = diag [ 1 , 1 / 1 ! , 1 / 2 ! , , 1 / ! ] , Ξ 1 : = diag 1 , 1 / 2 A , , 1 / ( 2 A ) , and G ( x , y , z ; A , B ; u ) is the same as in (13).
Proof. 
Using (7) in the right member of (20) provides
[ g L s 0 m ( x , y , z ; A , B ) g L s 1 m ( x , y , z ; A , B ) . . . g L s m ( x , y , z ; A , B ) ] T   = W [ 1 , a 1 ( u ) , ( a 1 ( u ) ) 2 , , ( a 1 ( u ) ) ] u = 0   × Λ 1 W e x 2 A u e D z 1 u + B y u m b ( u ) u = 0 .
Employing (6) in (22) and noting that
W [ e x 2 A u ] u = 0 = [ 1 x 2 A ( x 2 A ) 2 ( x 2 A ) ] T ,
one obtains
[ g L s 0 m ( x , y , z ; A , B ) g L s 1 m ( x , y , z ; A , B ) . . . g L s m ( x , y , z ; A , B ) ] T     = W [ 1 , a 1 ( u ) , , ( a 1 ( u ) ) ] u = 0 Λ 1   × P e D z 1 u + B y u m b ( u ) u = 0 [ 1 x 2 A ( x 2 A ) 2 ( x 2 A ) ] T .
Taking k th order partial derivatives with respect to x on both sides of (23) and dividing each side of the resultant equation by ( 2 A ) k k ! yields the following identity:
1 k ! 1 ( 2 A ) k k x k g L s 0 m ( x , y , z ; A , B ) k x k g L s 1 m ( x , y , z ; A , B ) . . . k x k g L s m ( x , y , z ; A , B ) T = W 1 , a 1 ( u ) , ( a 1 ( u ) ) 2 , , ( a 1 ( u ) ) u = 0 Λ 1 P e D z 1 u + B y u m b ( u ) u = 0 × 0 0 k terms 1 k + 1 k x 2 A k + 2 k ( x 2 A ) 2 k ( x 2 A ) k T .
The last observation is that the right and left members of (24) are equal to the ( k + 1 ) th columns of the corresponding members of the first equality of (21), respectively. The second and third equalities of (21) follow from (5) and (13). This completes the proof. □
Theorem 1.
For finite order N 0 , the GHLSMaP g L s m ( x , y , z ; A , B ) satisfies the following differential matrix recurrence relation:
g L s + 1 m ( x , y , z ; A , B ) = k = 0 ( ( x 2 A D z 1 ) P k + m B y Q k + R k ) ( 2 A ) k k ! k x k g L s m ( x , y , z ; A , B ) ,
where
g L s 0 m ( x , y , z ; A , B ) = F ( x , y , z ; A , B ; 0 ) ,   P k : = 1 a ( u ) ( k ) | u = 0 ,   Q k : = u m 1 a ( u ) ( k ) | u = 0 ,   R k : = b ( u ) b ( u ) a ( u ) ( k ) | u = 0 .
Proof. 
In view of Definition 2 and Equation (19), we have
W d d u F ( x , y , z ; A , B ; u ) u = 0 = [ g L s 1 m ( x , y , z ; A , B ) g L s 2 m ( x , y , z ; A , B ) g L s 3 m ( x , y , z ; A , B ) . . . g L s + 1 m ( x , y , z ; A , B ) ] T .
On the other hand, performing the differentiation in the expression
W d d u F ( x , y , z ; A , B ; u ) u = 0
and then using properties (5)–(7) in a suitable manner, we find that
W d d u F ( x , y , z ; A , B ; u ) u = 0   = W [ 1 , a 1 ( u ) , ( a 1 ( u ) ) 2 , , ( a 1 ( u ) ) ] u = 0 Λ 1 P e D z 1 u + B y u m b ( u ) u = 0 × P [ e x 2 A u ] u = 0 W x 2 A D z 1 + m B y u m 1 b ( u ) b ( u ) 1 a ( u ) u = 0 .
Using Lemma 1, Equation (27) yields
W d d u F ( x , y , z ; A , B ; u ) ) u = 0 = W g L s 0 m ( x , y , z ; A , B ) g L s 1 m ( x , y , z ; A , B ) . . . g L s m ( x , y , z ; A , B ) T Λ 1 Ξ 1 × W ( x 2 A D z 1 ) a ( u ) + m B y u m 1 a ( u ) b ( u ) b ( u ) a ( u ) u = 0 ,
which, upon using Definition 2, leads to
W d d u F ( x , y , z ; A , B ; u ) u = 0 = g L s 0 m ( x , y , z ; A , B ) x g L s 0 m ( x , y , z ; A , B ) ( 2 A ) 1 ! 2 x 2 g L s 0 m ( x , y , z ; A , B ) ( 2 A ) 2 2 ! x g L s 0 m ( x , y , z ; A , B ) ( 2 A ) ! g L s 1 m ( x , y , z ; A , B ) x g L s 1 m ( x , y , z ; A , B ) ( 2 A ) 1 ! 2 x 2 g L s 1 m ( x , y , z ; A , B ) ( 2 A ) 2 2 ! x g L s 1 m ( x , y , z ; A , B ) ( 2 A ) ! g L s 2 m ( x , y , z ; A , B ) x g L s 2 m ( x , y , z ; A , B ) ( 2 A ) 1 ! 2 x 2 g L s 2 m ( x , y , z ; A , B ) ( 2 A ) 2 2 ! x g L s 2 m ( x , y , z ; A , B ) ( 2 A ) ! g L s m ( x , y , z ; A , B ) x g L s m ( x , y , z ; A , B ) ( 2 A ) 1 ! 2 x 2 g L s m ( x , y , z ; A , B ) ( 2 A ) 2 2 ! x g L s m ( x , y , z ; A , B ) ( 2 A ) ! × ( x 2 A D z 1 ) P 0 + m B y Q 0 + R 0 ( x 2 A D z 1 ) P 1 + m B y Q 1 + R 1 ( x 2 A D z 1 ) P 2 + m B y Q 2 + R 2 ( x 2 A D z 1 ) P + m B y Q + R .
Equating the last rows of Equations (26) and (28), our assertion (25) is proved. □
Set a ( u ) = u and find that P 0 = 1 , P k = 0 ( k N ) , Q m 1 = ( m 1 ) ! , Q k = 0 ( k N 0 { m 1 } ) . Therefore, setting a ( u ) = u in Theorem 1 provides the following corollary.
Corollary 1.
The GHLAMaP g L A m ( x , y , z ; A , B ) satisfies the following differential matrix recurrence relation of finite order N 0 :
g L A + 1 m ( x , y , z ; A , B ) = ( x 2 A D z 1 ) g L A m ( x , y , z ; A , B ) + m B y ( 2 A ) m 1 m 1 x m 1 g L A m ( x , y , z ; A , B ) + k = 0 D k ( 2 A ) k k ! k x k g L A m ( x , y , z ; A , B ) ,
where
D k = b ( u ) b ( u ) ( k ) | u = 0 .
Theorem 2.
For finite order N 0 , the GHLSMaP g L s m ( x , y , z ; A , B ) satisfies the following recurrence relation:
T 0 g L s + 1 m ( x , y , z ; A , B ) = k = 0 1 ( 2 A ) k k ! U k x 2 A D z 1 U k + 1 + m B y V k × k x k g L s m ( x , y , z ; A , B ) k = 1 k 1 T k + 1 g L s k m ( x , y , z ; A , B ) ,
where
g L s 0 m ( x , y , z ; A , B ) = F ( x , y , z ; A , B ; 0 ) , T k : = a ( a 1 ( u ) ) g ( a 1 ( u ) ) ( k ) | u = 0 , U k : = b ( u ) ( k ) | u = 0 , V k : = u m 1 b ( u ) ( k ) | u = 0 .
Proof. 
Consider the following:
W a ( a 1 ( u ) ) b ( a 1 ( u ) ) d d u F ( x , y , z ; A , B ; u ) u = 0 .
By using the relation (6) in Equation (31), we obtain
P a ( a 1 ( u ) ) b ( a 1 ( u ) ) u = 0 W d d u F ( x , y , z ; A , B ; u ) u = 0 ,
which, in view of (2) and Equation (19), becomes
P a ( a 1 ( u ) ) b ( a 1 ( u ) ) u = 0 × [ g L s 1 m ( x , y , z ; A , B ) g L s 2 m ( x , y , z ; A , B ) . . . g L s + 1 m ( x , y , z ; A , B ) ] T .
Using (1) in Equation (33), we find
T 0 0 0 0 T 1 T 0 0 0 T 1 T 1 2 T 2 T 0 g L s 1 m ( x , y , z ; A , B ) g L s 2 m ( x , y , z ; A , B ) g L s + 1 m ( x , y , z ; A , B ) .
On the other hand, we can write (31) as
W x 2 A D z 1 + m B y a 1 ( u ) m 1 b a 1 ( u ) b a 1 ( u ) e ( x 2 A D z 1 ) a 1 ( u ) + B y ( a 1 ( u ) ) m u = 0 ,
which, upon using (7), gives
W [ 1 , a 1 ( u ) , ( a 1 ( u ) ) 2 , , ( a 1 ( u ) ) ] u = 0 Λ 1 × W x 2 A D z 1 + m B y u m 1 b ( u ) b ( u ) e ( x 2 A D z 1 ) u + B y u m b ( u ) u = 0 .
Using (4)–(6) and Lemma 1 in Equation (35), we have
W [ g L s 0 m ( x , y , z ; A , B ) g L s 1 m ( x , y , z ; A , B ) . . . g L s m ( x , y , z ; A , B ) ] | x T Λ 1 Ξ 1   × x 2 A D z 1 W b ( u ) u = 0 + m B y W u m 1 b ( u ) u = 0 W b ( u ) u = 0 ,
which, upon using (2), yields
g L s 0 m ( x , y , z ; A , B ) x g L s 0 m ( x , y , z ; A , B ) ( 2 A ) 1 ! 2 x 2 g L s 0 m ( x , y , z ; A , B ) ( 2 A ) 2 2 ! x g L s 0 m ( x , y , z ; A , B ) ( 2 A ) ! g L s 1 m ( x , y , z ; A , B ) x g L s 1 m ( x , y , z ; A , B ) ( 2 A ) 1 ! 2 x 2 g L s 1 m ( x , y , z ; A , B ) ( 2 A ) 2 2 ! x g L s 1 m ( x , y , z ; A , B ) ( 2 A ) ! g L s 2 m ( x , y , z ; A , B ) x g L s 2 m ( x , y , z ; A , B ) ( 2 A ) 1 ! 2 x 2 g L s 2 m ( x , y , z ; A , B ) ( 2 A ) 2 2 ! x g L s 2 m ( x , y , z ; A , B ) ( 2 A ) ! g L s m ( x , y , z ; A , B ) x g L s m ( x , y , z ; A , B ) ( 2 A ) 1 ! 2 x 2 g L s m ( x , y , z ; A , B ) ( 2 A ) 2 2 ! x g L s m ( x , y , z ; A , B ) ( 2 A ) ! × ( x 2 A D z 1 ) U 0 + m B y V 0 U 1 ( x 2 A D z 1 ) U 1 + m B y V 1 U 2 ( x 2 A D z 1 ) U 2 + m B y V 2 U 3 ( x 2 A D z 1 ) U + m B y V U + 1 .
Equating the last rows of Equations (34) and (37), our assertion (30) is proved. □

3. Identities

This section provides certain identities for the GHLSMaP g L s m ( x , y , z ; A , B ) .
Theorem 3.
The following relation between GHLSMaP g L s m ( x , y , z ; A , B ) and GHLAMaP g L A m ( x , y , z ; A , B ) holds true: For N 0 ,
k = 0 g L A k m ( x , y , z ; A , B ) ( 2 A ) k k ! k x k g L s m ( x , y , z ; A , B ) = α ,
where
α : = 1 ( b ( a 1 ( u ) ) ) 2 ( ) | u = 0 .
Proof. 
We find from (2) that
W 1 ( b ( a 1 ( u ) ) ) 2 u = 0 = [ α 0 α 1 α ] T .
We can write
W 1 ( b ( a 1 ( u ) ) ) 2 u = 0 = W e ( x 2 A D z 1 ) a 1 ( u ) + B y ( a 1 ( u ) ) m b ( a 1 ( u ) ) b ( a 1 ( u ) ) e ( x 2 A D z 1 ) a 1 ( u ) + B y ( a 1 ( u ) ) m u = 0 .
Utilizing the identities (5), (6), and (7) in the right member of Equation (40) suitably, we obtain
W 1 ( b ( a 1 ( u ) ) ) 2 u = 0 = W [ 1 , a 1 ( u ) , ( a 1 ( u ) ) 2 , , ( a 1 ( u ) ) ] u = 0 Λ 1 P 1 b ( u ) u = 0 × P e ( x 2 A D z 1 ) u + B y u m u = 0 W e ( x 2 A + D z 1 ) u + B ( y ) u m b ( u ) u = 0 ,
which, upon noting that D z 1 { 1 } = D z 1 { 1 } (see, e.g., Equation (6) in [2]) and employing Equation (13) and Lemma 1, yields
W 1 ( b ( a 1 ( u ) ) ) 2 u = 0 = W [ g L s 0 m ( x , y , z ; A , B ) g L s 1 m ( x , y , z ; A , B ) g L s m ( x , y , z ; A , B ) ] | x T × Λ 1 Ξ 1 W j = 0 g L A j m ( x , y , z ; A , B ) u j j ! u = 0 .
Then, the use of (2) in Equation (41) gives
W 1 ( g ( a 1 ( u ) ) ) 2 u = 0 = g L s 0 m ( x , y , z ; A , B ) x g L s 0 m ( x , y , z ; A , B ) ( 2 A ) 1 ! 2 x 2 g L s 0 m ( x , y , z ; A , B ) ( 2 A ) 2 2 ! x g L s 0 m ( x , y , z ; A , B ) ( 2 A ) ! g L s 1 m ( x , y , z ; A , B ) x g L s 1 m ( x , y , z ; A , B ) ( 2 A ) 1 ! 2 x 2 g L s 1 m ( x , y , z ; A , B ) ( 2 A ) 2 2 ! x g L s 1 m ( x , y , z ; A , B ) ( 2 A ) ! g L s 2 m ( x , y , z ; A , B ) x g L s 2 m ( x , y , z ; A , B ) ( 2 A ) 1 ! 2 x 2 g L s 2 m ( x , y , z ; A , B ) ( 2 A ) 2 2 ! x g L s 2 m ( x , y , z ; A , B ) ( 2 A ) ! g L s m ( x , y , z ; A , B ) x g L s m ( x , y , z ; A , B ) ( 2 A ) 1 ! 2 x 2 g L s m ( x , y , z ; A , B ) ( 2 A ) 2 2 ! x g L s m ( x , y , z ; A , B ) ( 2 A ) ! × g L A 0 m ( x , y , z ; A , B ) g L A 1 m ( x , y , z ; A , B ) g L A 2 m ( x , y , z ; A , B ) g L A m ( x , y , z ; A , B ) .
Equating the last row of Equations (39) and (42), the desired identity (38) is proved. □
Theorem 4.
GHLSMaP g L s m ( x , y , z ; A , B ) satisfies the following identity:
k = 0 k β k g L s + 1 k m ( x , y , z ; A , B ) = k = 0 k ( x 2 A D z 1 ) γ k + m B y δ k + ϵ k g L s k m ( x , y , z ; A , B ) .
where
β k : = b ( a 1 ( u ) ) ( k ) | u = 0 , γ k : = b ( a 1 ( u ) ) a ( a 1 ( u ) ) ( k ) | u = 0 , δ k : = ( a 1 ( u ) ) m 1 b ( a 1 ( u ) ) a ( a 1 ( u ) ) ( k ) | u = 0 , ϵ k : = b ( a 1 ( u ) ) a ( a 1 ( u ) ) ( k ) | u = 0 .
Proof. 
Using (6), with the aid of Definitions (1) and (2), yields
W b ( a 1 ( u ) ) d d u F ( x , y , z ; A , B ; u ) u = 0 = P d d u e ( x 2 A D z 1 ) a 1 ( u ) + B y ( a 1 ( u ) ) m b ( a 1 ( u ) ) u = 0 W b ( a 1 ( u ) ) u = 0 = g L s 1 m ( x , y , z ; A , B ) 0 0 g L s 2 m ( x , y , z ; A , B ) g L s 1 m ( x , y , z ; A , B ) 0 g L s 3 m ( x , y , z ; A , B ) 2 1 g L s 2 m ( x , y , z ; A , B ) 0 g L s + 1 m ( x , y , z ; A , B ) 1 g L s m ( x , y , z ; A , B ) g L s 1 m ( x , y , z ; A , B ) β 0 β 1 β 2 β .
From the left-most term of Equation (44) and d d u a 1 ( u ) = 1 / a ( a 1 ( u ) ) , we find
W b ( a 1 ( u ) ) d d u F ( x , y , z ; A , B ; u ) u = 0 = W [ ( ( x 2 A D z 1 ) b ( a 1 ( u ) ) a ( a 1 ( u ) ) b ( a 1 ( u ) ) a ( a 1 ( u ) ) + m B y ( a 1 ( u ) ) m 1 b ( a 1 ( u ) ) a ( a 1 ( u ) ) ) F ( x , y , z ; A , B ; u ) ] u = 0 .
Using (6) and (4) in the right member of (45), we obtain
W b ( a 1 ( u ) ) d d u F ( x , y , z ; A , B ; u ) u = 0 = P F ( x , y , z ; A , B ; u ) u = 0 × ( ( x 2 A D z 1 ) W b ( a 1 ( u ) ) a ( a 1 ( u ) ) u = 0 + m B y W ( a 1 ( u ) ) m 1 b ( a 1 ( u ) ) a ( a 1 ( u ) ) u = 0 + W b ( a 1 ( u ) ) a ( a 1 ( u ) ) u = 0 ) .
Employing (1) in the first factor and γ k , δ k , and ϵ k in the second factor in the right member of (46), we obtain a column ( + 1 ) × 1 matrix, say M. Finally, identifying the ( + 1 ) -th row of the resulting matrix in the right-hand side of (44) with ( + 1 ) -th row of M, we prove the desired identity (43). □
Theorem 5.
Let N . Then, GHLSMaP g L s m ( x , y , z ; A , B ) satisfies the following identity:
g L s 1 m ( x , y , z ; A , B ) = k = 0 ζ k ( 2 A ) k k ! k x k g L s m ( x , y , z ; A , B ) ,
where
ζ k : = a ( u ) ( k ) | u = 0 k N 0 .
Proof. 
Using (6), in view of Definitions (1) and (2), and (12), we have
W u F ( x , y , z ; A , B ; u ) u = 0 = P u u = 0 W F ( x , y , z ; A , B ; u ) u = 0 = 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 g L s 0 m ( x , y , z ; A , B ) g L s 1 m ( x , y , z ; A , B ) g L s 2 m ( x , y , z ; A , B ) g L s 1 m ( x , y , z ; A , B ) g L s m ( x , y , z ; A , B ) .
Furthermore, since a ( a 1 ( u ) ) = u , in terms of (12), the left-most term of (48) can be written as
W u F ( x , y , z ; A , B ; u ) u = 0 = W a ( a 1 ( u ) ) 1 b ( a 1 ( u ) ) e ( x 2 A D z 1 ) a 1 ( u ) + B y a 1 ( u ) m u = 0 ,
the right member of which, in view of (7), becomes
W u F ( x , y , z ; A , B ; u ) u = 0 = W [ 1 , a 1 ( u ) , ( a 1 ( u ) ) 2 , , ( a 1 ( u ) ) ] u = 0 Λ 1 W a ( u ) G ( x , y , z ; A , B ; u ) u = 0 .
Using (6) at the right-most factor in (49), we find
W u F ( x , y , z ; A , B ; u ) u = 0 = W [ 1 , a 1 ( u ) , ( a 1 ( u ) ) 2 , , ( a 1 ( u ) ) ] u = 0 Λ 1 P [ G ( x , y , z ; A , B ; u ) ] u = 0 W [ a ( u ) ] u = 0 .
Applying Lemma 1 to the right member of (50), we obtain
W u F ( x , y , z ; A , B ; u ) u = 0 = W [ g L s 0 m ( x , y , z ; A , B ) g L s 1 m ( x , y , z ; A , B ) g L s m ( x , y , z ; A , B ) ] | x T Λ 1 Ξ 1 × W a ( u ) u = 0 .
Using Definition 2 in Equation (51), and, then, equating the last row of the resultant equation with the last row of Equation (48), our desired identity (47) is proved. □
Theorem 6.
For the GHLSMaP g L s m ( x , y , z ; A , B ) , the following identity holds true:
k = 1 1 k 1 β k g L s k m ( x , y , z ; A , B ) = k = 0 1 ( 2 A ) k k ! ( x 2 A D z 1 ) θ k + m B y ϕ k + ψ k k x k g L s m ( x , y , z ; A , B ) ,
where
θ k : = b ( u ) a ( u ) a ( u ) ( k ) | u = 0 , ϕ k : = u m 1 b ( u ) a ( u ) a ( u ) ( k ) | u = 0 , ψ k : = b ( u ) a ( u ) a ( u ) ( k ) | u = 0 .
Proof. 
Using (5) and (6), Definitions 1 and 2, and Equation (12), we obtain
W u b ( a 1 ( u ) ) d d u F ( x , y , z ; A , B ; u ) u = 0 = P u u = 0 P b ( a 1 ( u ) ) u = 0 W d d u F ( x , y , z ; A , B ; u ) u = 0 = 0 0 0 0 0 β 0 0 0 0 0 2 1 0 β 1 2 1 1 β 0 0 0 0 1 0 β 1 1 1 β 2 1 2 β 3 1 1 β 0 0 g L s 1 m ( x , y , z ; A , B ) g L s 2 m ( x , y , z ; A , B ) g L s 3 m ( x , y , z ; A , B ) g L s + 1 m ( x , y , z ; A , B ) .
On the other hand,
d d u F ( x , y , z ; A , B ; u ) = 1 b ( a 1 ( u ) ) 2 e ( x 2 A D z 1 ) a 1 ( u ) + B y a 1 ( u ) m × ( x 2 A D z 1 ) + m B y a 1 ( u ) m 1 b ( a 1 ( u ) ) b ( a 1 ( u ) ) 1 a ( a 1 ( u ) ) ,
which, upon using u = a ( a 1 ( u ) ) , gives
u b ( a 1 ( u ) ) d d u F ( x , y , z ; A , B ; u ) = a ( a 1 ( u ) ) b ( a 1 ( u ) ) e ( x 2 A D z 1 ) a 1 ( u ) + B y a 1 ( u ) m × ( x 2 A D z 1 ) + m B y a 1 ( u ) m 1 b ( a 1 ( u ) ) b ( a 1 ( u ) ) 1 a ( a 1 ( u ) ) .
Employing (7) in the right member of (54), with the aid of (6), we have
W [ u b ( a 1 ( u ) ) d d u F ( x , y , z ; A , B ; u ) ] u = 0 = W [ 1 , a 1 ( u ) , ( a 1 ( u ) ) 2 , , ( a 1 ( u ) ) ] u = 0 Λ 1 P [ G ( x , y , z ; A , B ; u ) ] u = 0 × W ( x 2 A D z 1 ) b ( u ) a ( u ) a ( u ) + m B y u m 1 b ( u ) a ( u ) a ( u ) b ( u ) a ( u ) a ( u ) u = 0
Using (4) and Lemma 1 in the right member of (55), we obtain the resultant ( + 1 ) × 1 matrix, say M 1 . Finally, equating the ( + 1 ) -th row of the resulting matrix in (53) and the ( + 1 ) -th row of M 1 yields the desired identity (52). This completes the proof. □

4. Particular Cases

This section considers several particular cases of the results in Section 2.
Example 1.
The case of b ( u ) = 1 and a ( u ) = e u 1 e u + 1 . Then, the Sheffer polynomials s ( x ) in (9) become the Mittag–Leffler polynomials M ( x ) (see [8] (pp. 75–78) and the references therein). In this regard, the GHLSMaPs g L s m ( x , y , z ; A , B ) are named as Gould–Hopper–Laguerre–Mittag—Leffler matrix polynomials and denoted by (GHLMLMaP) g L M m ( x , y , z ; A , B ) .
In Theorems 2, 3 and 5, we find
U 0 = 1 , U k = 0 ( k N ) ; V m 1 = ( m 1 ) ! , V k = 0 ( k m 1 ) ; α 0 = 1 , α k = 0 ( k N ) ; ζ k = 1 2 E k ( 1 ) E k ( 1 ) ( 0 ) ; T k = 1 2 , i f k = 0 , 1 , i f k = 2 , 0 , i f k 0 , 2 .
Here, E k ( x ) are the Euler polynomials and E k ( α ) ( x ) are the generalized Euler polynomials which are generated by (see, e.g., [12] (pp. 86 and 88))
2 e x u e u + 1 = k = 0 E k ( x ) u k k ! ( | u | < π ) ,
and
2 e u + 1 α e x u = k = 0 E k ( α ) ( x ) u k k ! ( | u | < π ; 1 α = 1 ) .
Therefore Equations (30), (38), and (47) provide the following identities for GHLMLMaP g L M m ( x , y , z ; A , B ) :
1 2 g L M + 1 m ( x , y , z ; A , B ) = ( x 2 A D z 1 ) ( 2 A ) g L M m ( x , y , z ; A , B ) + 2 g L M 1 m ( x , y , z ; A , B ) + m B y ( 2 A ) m 1 m 1 x m 1 g L M m ( x , y , z ; A , B ) .
g L A 0 ( x , y , z ; A , B ) g L M m ( x , y , z ; A , B ) = 1 .
g L M 1 m ( x , y , z ; A , B ) = 1 k = 0 E k ( 1 ) E k ( 2 A ) k k ! k x k g L M m ( x , y , z ; A , B ) .
Example 2.
The case of b ( u ) = 1 and a ( u ) = ln ( 1 + u ) . Then, the Sheffer polynomials in (9) become the exponential polynomials e ( x ) (see, e.g., [7] and [8] (pp. 63–67)). In this connection, the GHLSMaPs g L s m ( x , y , z ; A , B ) are named as the Gould–Hopper–Laguerre exponential matrix polynomials and denoted by (GHLEMaP) g L e m ( x , y , z ; A , B ) .
In Theorem 2, Theorem 3 and Theorem 5, we find
U 0 = 1 , U k = 0 ( k N ) ; V m 1 = ( m 1 ) ! , V k = 0 ( k m 1 ) ; T k = ( 1 ) k ;
α 0 = 1 , α k = 0 ( k N ) ; β 0 = 1 , β k = 0 ( k N ) ; γ 0 = γ 1 = 1 , γ k = 0 ( k N { 1 } ) ;
ϵ k = 0 ; δ m 1 = ( m 1 ) ! , δ m = m ! , δ k = 0 ( k m , m 1 ) ; ζ k = ( 1 ) k 1 ( k 1 ) ! .
Therefore Equations (30), (38), (43) and (47) give the following identities for GHLEMaP g L e m ( x , y , z ; A , B ) :
k = 0 k ( 1 ) k g L e k + 1 m ( x , y , z ; A , B ) = ( x 2 A D z 1 ) ( 2 A ) g L e m ( x , y , z ; A , B ) + m B y ( 2 A ) m 1 m 1 x m 1 g L e m ( x , y , z ; A , B ) .
g L A 0 ( x , y , z ; A , B ) g L e m ( x , y , z ; A , B ) = 1 .
g L e + 1 m ( x , y , z ; A , B ) = ( x 2 A D z 1 ) g L e m ( x , y , z ; A , B )   + ( x 2 A D z 1 ) ( 2 A ) x g L e m ( x , y , z ; A , B ) + m B y ( 2 A ) m 1 m 1 x m 1 g L e m ( x , y , z ; A , B )     + m B y ( 2 A ) m m x m g L e m ( x , y , z ; A , B ) .
g L e 1 m ( x , y , z ; A , B ) = 1 k = 0 ( 1 ) k 1 k ( 2 A ) k k x k g L e m ( x , y , z ; A , B ) .
Example 3.
The case of b ( u ) = ( 1 u ) α 1 and a ( u ) = u u 1 . Then the Sheffer polynomials in (9) become the generalized Laguerre polynomials L ( α ) ( x ) (see, e.g., [8,13] (pp. 108–113)). In this regard, GHLSMaP g L s m ( x , y , z ; A , B ) are named as the Gould-Hopper-Laguerre-generalized Laguerre Matrix polynomials and denoted by (GHLgLMaP) g L L ( α , m ) ( x , y , z ; A , B ) .
In Theorem 2, Theorem 3 and Theorem 5, we find
U k = ( α + k ) k ; V k = ( u m 1 g ( u ) ) ( k ) | u = 0 ; T k = ( 1 ) k ( α + 1 ) k ; α = ( 2 α + + 1 ) n ; ζ k = k ! .
Therefore Equations (30), (38) and (47) offer the following identities for GHLgLMaP g L L ( α , m ) ( x , y , z ; A , B ) :
k = 0 k ( 1 ) k ( α + 1 ) k g L L k + 1 ( α , m ) ( x , y , z ; A , B ) = k = 0 1 ( 2 A ) k k ! ( ( x 2 A D z 1 ) × ( α + k ) k ( α + k + 1 ) k + 1 + m B y V k ) k x k g L L ( α , m ) ( x , y , z ; A , B ) .
= 0 g L A k ( x , y , z ; A , B ) ( 2 A ) k k ! k x k g L L ( α , m ) ( x , y , z ; A , B ) = ( 2 α + + 1 ) .
g L L 1 ( α , m ) ( x , y , z ; A , B ) = 1 k = 0 1 ( 2 A ) k k x k g L L ( α , m ) ( x , y , z ; A , B ) .
Example 4.
The case of b ( u ) = e u 1 u and a ( u ) = u . The Sheffer polynomials in (9) become the Bernoulli polynomials B ( x ) (see, e.g., [8] (pp. 93–100) and [6]). In this connection, the GHLSMaPs g L s m ( x , y , z ; A , B ) are named as the Gould-Hopper-Laguerre-Bernoulli matrix polynomials and denoted by (GHLBMaP) g L B m ( x , y , z ; A , B ) .
In Theorems 2–6, we find
U 0 = 1 , U k = 1 k + 1 ( k 0 ) ; V 0 = 0 , V k = k ! ( k m + 2 ) ! ( k 0 ) ;   T 0 = 1 , T k = 1 k + 1 ( k 0 ) ;
α = k = 0 k B k B k ; β k = 1 k + 1 ; γ k = 1 k + 1 ; ϵ k = 1 k + 2 ; δ k = k ! ( k m + 2 ) ! ;
ζ 1 = 1 , ζ k = 0 ( k 1 ) ; θ 0 = 0 , θ k = 1 ( k 0 ) ; ϕ k = k ! ( k m + 1 ) ! ; ψ k = k k + 1 .
Therefore Equations (30), (38), (43), (47), and (53) give the following identities for GHLBMaP g L B m ( x , y , z ; A , B ) :
k = 0 k 1 k + 1 g L B k + 1 m ( x , y , z ; A , B ) = k = 0 1 ( 2 A ) k k ! ( x 2 A D z 1 ) k + 1 1 k + 2 + m B y k ! ( k m + 2 ) ! × k x k g L B m ( x , y , z ; A , B ) .
k = 0 g L B k ( x , y , z ; A , B ) ( 2 A ) k k ! k x k g L B m ( x , y , z ; A , B ) = k = 0 k B k B k .
k = 0 k 1 k + 1 g L B + 1 k m ( x , y , z ; A , B ) = k = 0 1 ( 2 A ) k k ! ( x 2 A D z 1 ) k + 1 1 k + 2 + m B y k ! ( k m + 2 ) ! × k x k g L B m ( x , y , z ; A , B ) .
( 2 A ) g L B 1 m ( x , y , z ; A , B ) = 1 x g L B m ( x , y , z ; A , B ) .
k = 1 1 k 1 g L B k m ( x , y , z ; A , B ) k + 1 = k = 1 1 ( 2 A ) k k ! ( x 2 A D z 1 ) + m B y k ! ( k m + 1 ) ! k k + 1 × k x k g L B m ( x , y , z ; A , B ) .

5. Concluding Remarks

In [2], a novel type of polynomials, named as the Gould–Hopper–Laguerre–Sheffer matrix polynomials, was introduced, and various identities of these polynomials were demonstrated through the utilization of operational methods. In this article, the Gould–Hopper–Laguerre–Sheffer matrix polynomials in [2] were also investigated using matrix techniques, and several of their identities, such as recurrence relations, were derived. Some particular cases of the main findings in this article were further demonstrated. It is pointed out that the identities derived in this article via matrix techniques are different from the ones in [2] derived via operational methods.
The Sheffer polynomials and their hybrid forms have been extensively explored (see, e.g., [8] and references therein). The Sheffer matrix polynomials and their hybrid matrix forms have recently been investigated (see, e.g., [1,2,3,4,5] and references therein). In this article, some properties of the generalized Pascal functional matrix and Wronskian matrix were mainly utilized.
The operational methods (referenced as [2]) and the matrix methods employed in this article each exhibit distinct advantages. To conclude, we raise an essential question: Is it possible to attain the identities derived using the matrix methods presented in this article by employing the operational methods described in [2]?

Author Contributions

Writing—original draft, T.N., P.A. and J.C.; Writing—review and editing, T.N., P.A. and J.C. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Acknowledgments

The authors would like to extend their sincere appreciation to the anonymous referees for their invaluable feedback. Their constructive and uplifting comments have greatly contributed to enhancing the quality of this paper.

Conflicts of Interest

The authors have no conflict of interest.

References

  1. Çekim, B.; Aktaş, R. Multivariable matrix generalization of Gould-Hopper polynomials. Miskolc Math. Notes 2015, 16, 79–89. [Google Scholar] [CrossRef]
  2. Nahid, T.; Choi, J. Certain hybrid matrix polynomials related to the Laguerre-Sheffer family. Fractal Fract. 2022, 6, 211. [Google Scholar] [CrossRef]
  3. Nahid, T.; Khan, S. Construction of some hybrid relatives of Laguuerre-Appell polynomials associated with Gould-Hopper matrix polynomials. J. Anal. 2021, 29, 927–946. [Google Scholar] [CrossRef]
  4. Yang, Y.; Micek, C. Generalized Pascal functional matrix and its applications. Linear Algebra Appl. 2007, 423, 230–245. [Google Scholar] [CrossRef] [Green Version]
  5. Youn, H.; Yang, Y. Differential equation and recursive formulas of Sheffer polynomial sequences. ISRN Discret. Math. 2011, 2011, 476462. [Google Scholar] [CrossRef] [Green Version]
  6. Srivastava, H.M. Some formulas for the Bernoulli and Euler polynomials at rational arguments. Math. Proc. Camb. Phil. Soc. 2000, 129, 77–84. [Google Scholar] [CrossRef]
  7. Bell, E.T. Exponential polynomials. Ann. Math. 1934, 35, 258–277. [Google Scholar] [CrossRef]
  8. Roman, S. The Umbral Calculus; Academic Press: New York, NY, USA, 1984. [Google Scholar]
  9. Srivastava, H.M.; Mishra, A.K.; Gochhayat, P. Certain subclasses of analytic and bi-univalent functions. Appl. Math. Lett. 2010, 23, 1188–1192. [Google Scholar] [CrossRef] [Green Version]
  10. Johnson, W.P. The curious history of Faà di Bruno’s formula. Am. Math. Mon. 2002, 109, 217–234. Available online: http://www.jstor.org/stable/2695352 (accessed on 2 May 2021).
  11. Comtet, L. Advanced Combinatorics: The Art of Finite and Infinite Expansions; Reidel Publishing Company: Dordrecht, Holland; Boston, MA, USA, 1974. [Google Scholar]
  12. Srivastava, H.M.; Choi, J. Zeta and q-Zeta Functions and Associated Series and Integrals; Elsevier, Inc.: Amsterdam, The Netherlands, 2012; p. xvi + 657. ISBN 978-0-12-385218-2. [Google Scholar]
  13. Andrews, L.C. Special Functions for Engineers and Applied Mathematicians; Macmillan Publishing Company: New York, NY, USA, 1985. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Nahid, T.; Alam, P.; Choi, J. Matrix Approaches for Gould–Hopper–Laguerre–Sheffer Matrix Polynomial Identities. Axioms 2023, 12, 621. https://doi.org/10.3390/axioms12070621

AMA Style

Nahid T, Alam P, Choi J. Matrix Approaches for Gould–Hopper–Laguerre–Sheffer Matrix Polynomial Identities. Axioms. 2023; 12(7):621. https://doi.org/10.3390/axioms12070621

Chicago/Turabian Style

Nahid, Tabinda, Parvez Alam, and Junesang Choi. 2023. "Matrix Approaches for Gould–Hopper–Laguerre–Sheffer Matrix Polynomial Identities" Axioms 12, no. 7: 621. https://doi.org/10.3390/axioms12070621

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop