Next Article in Journal
On Convex F-Contraction in b-Metric Spaces
Next Article in Special Issue
Quadruple Integral Involving the Logarithm and Product of Bessel Functions Expressed in Terms of the Lerch Function
Previous Article in Journal
The χ-Hessian Quotient for Riemannian Metrics
Previous Article in Special Issue
Explicit, Determinantal, and Recurrent Formulas of Generalized Eulerian Polynomials
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

q-Binomial Convolution and Transformations of q-Appell Polynomials

1
Department of Mathematics, Aligarh Muslim University, Aligarh-202002, India
2
Department of Mathematics, College of Arts and Sciences, Prince Sattam bin Abdulaziz University, Wadi Aldawaser 11991, Saudi Arabia
*
Author to whom correspondence should be addressed.
Axioms 2021, 10(2), 70; https://doi.org/10.3390/axioms10020070
Submission received: 9 February 2021 / Revised: 12 April 2021 / Accepted: 14 April 2021 / Published: 19 April 2021
(This article belongs to the Special Issue p-adic Analysis and q-Calculus with Their Applications)

Abstract

:
In this paper, binomial convolution in the frame of quantum calculus is studied for the set A q of q-Appell sequences. It has been shown that the set A q of q-Appell sequences forms an Abelian group under the operation of binomial convolution. Several properties for this Abelian group structure A q have been studied. A new definition of the q-Appell polynomials associated with a random variable is proposed. Scale transformation as well as transformation based on expectation with respect to a random variable is used to present the determinantal form of q-Appell sequences.

Appell polynomials [1] were defined by Appell in 1880. F.A. Costabile and E. Longo studied the Appell polynomial using determinantal approach [2]. Based on the quantum calculus, The family of q-Appell polynomials [3] were introduced by Al-Salam in 1967. Furthermore, M.E. Keleshteri and N.I. Mahmudov studied q-Appell polynomial using determinantal approach [4]. For other literature related to Appell polynomials, one can refer [5,6,7,8,9,10,11].
These polynomials have been used in many branches of mathematics including number theory, applied mathematics and theoretical physics. According to the Weierstrass approximation theorem [12], every continuous function can be approximated by polynomials. Thus, polynomials play an important role in approximation theory. For some recent papers related to approximation by polynomials and applications in CAGD, one can refer to [13,14,15,16,17,18,19]. Appell and q-Appell polynomial have been studied for interpolation by several authors [20,21]. T. Ernst in [22] introduced the term multiplicative q-Appell polynomial and has shown that the set of q-Appell polynomials forms a commutative ring. Apart from this, convolution plays a very important role in approximation theory, probability, statistics, computer vision, image and signal processing, etc. Motivated by the above facts, we study here various properties of the q-Appell polynomial with the operation of convolution using q-calculus. This paper is organized as follows:
The paper considers the binomial convolution for the set of q-Appel sequences. It is proven that the set of q-Appel sequences equipped with the binomial convolution forms an Abelian group. By using the probabilistic approach to q-Appel polynomials, a new definition of q-Appel polynomials related to a random variable similar to the work done in [21] is discussed. Furthermore, the scale transform and transformations based on expectations are defined and their characteristics discussed.
Let us recall some basics from the quantum calculus (see [23,24,25,26,27,28]). The quantum or q-analogue [ μ ] q of a number μ is defined by
[ μ ] q = 1 q μ 1 q , q 1 , μ , q = 1 .
The q-factorial [ μ ] q ! is defined by
[ μ ] q ! = [ μ ] q [ μ 1 ] q [ 1 ] q , μ N , 1 , μ = 0 .
The q-binomial coefficient μ s q is defined by
μ s q = [ μ ] q ! [ s ] q ! [ μ s ] q ! , μ , s N ; 0 s μ .
The q-analogue of the function ( y + x ) μ are defined by
( y + x ) q μ = j = 0 μ 1 ( y + q j x ) , f o r μ = 1 , 2 , 3 , 1 , f o r μ = 0 = k = 0 μ μ k q q k ( k 1 ) 2 y μ k x k .
The q-derivative of a function f is defined by
D q f ( y ) = f ( y ) f ( q y ) ( 1 q ) y , y 0 f ( 0 ) , y = 0 .
Exponential functions based on q-calculus is used in the standard approach as follows:
e q ( y ) = μ = 0 y μ [ μ ] q ! , 0 < q < 1 ; y < 1 1 q .
Let y and x be elements of a commutative multiplicative semigroup. Then, the NWA q-addition is given by [29]
( y q x ) μ = k = 0 μ μ k q y k x μ k .
For every power series f n ( t ) , with f n ( 0 ) 0 , the q-Appell polynomials of degree μ and order n have the following generating function [29]:
f n ( t ) e q ( t x ) = μ = 0 A μ , q ( n ) ( x ) t μ [ μ ] q ! ,
Putting x = 0 , we have:
f n ( t ) = μ = 0 A μ , q ( n ) t μ [ μ ] q ! ,
where A μ , q ( n ) is called a q-Appell number of degree μ and order n
q-Appell polynomials of degree μ and order n satisfy the following q-differential Equation [29]:
D q , y A μ , q ( n ) ( y ) = [ μ ] q A μ 1 , q ( n ) ( y ) , μ = 1 , 2 , .

1. Quantum Binomial Convolutions and Generating Functions

Let N denote the set of positive integers and N 0 = N { 0 } . Now, onwards μ N 0 , y R , and z C , satisfying z r , r > 0 . Let us denote by G q the set of all real sequences u q = ( u μ , q ) μ 0 where u 0 , q 0 and:
μ = 0 u μ , q r μ [ μ ] q ! < .
If u q G q , then its generating function will be denoted by
G ( u q , z ) = μ = 0 u μ , q z μ [ μ ] q ! .
The q-binomial convolution [8] of u q and v q , will be denoted by u q × q v q = ( u q × q v q ) μ μ 0 for u q and v q G q is defined as
( u q × q v q ) μ = k = 0 μ μ k q u k , q v μ k , q .
The q-addition is a special case of the q-binomial convolution [29].
The q-multinomial coefficient is given by
μ j 1 , , j m q = [ μ ] q ! [ j 1 ] q ! [ j m ] q ! , j 1 + + j m = μ , j i = 0 , 1 , , μ , i = 0 , 1 , , m a n d μ N 0 ,
Proposition 1.
Let that u q ( k ) = ( u μ , q ( k ) ) μ 0 G q , k = 1 , 2 , , m , μ belong to the set of positive integers (see [29]). Then, u q ( 1 ) × q × q u q ( m ) G q and:
( u q ( 1 ) × q × q u q ( m ) ) μ = j 1 + + j m = μ μ j 1 , j 2 , , j m q u j 1 , q ( 1 ) u j m , q ( m ) .
In addition:
G ( u q ( 1 ) × q × q u q ( m ) , z ) = G ( u q ( 1 ) , z ) G ( u q ( m ) , z ) .
Proof. 
Suppose u q and v q G q with r and s as their radii, respectively. Let t = m i n ( r , s ) . Then, from (2), we have:
G ( ( u q × q v q ) , t ) = μ = 0 ( u q × q v q ) μ t μ [ μ ] q ! μ = 0 t μ [ μ ] q ! k = 0 μ μ k q u k , q v μ k , q = k = 0 u k , q t k [ k ] q ! μ = k v μ k , q t μ k [ μ k ] q ! = G ( u q , t ) G ( v q , t ) .
Then G ( u q × q v q , z ) = G ( u q , z ) G ( v q , z ) , z t . Thus, by applying the induction on m, result follows.
Corollary 1.
( G q , × ) is an Abelian group having an identity element as e q = ( δ μ 0 ) μ 0 , where δ 00 = 1 and δ μ 0 = 0 for μ N .
Proof. 
Closure: for u q , v q G q , then u q × q v q = ( u q × q v q ) μ μ 0 G q as ( u q × q v q ) μ = k = 0 μ μ k q u k , q v μ k , q R .
Associativity: let u q , v q , w q G q be any elements:
( u q × q v q ) × q w q = ( ( u q × q v q ) × q w q ) μ μ 0 and u q × q ( v q × q w q ) = ( u q × q ( v q × q w q ) μ μ 0
u q × q ( v q × q w q ) μ = s = 0 μ μ s q u s , q ( v q × q w q ) μ s = s = 0 μ r = 0 μ s μ s q μ s r q u s , q v r , q w μ s r , q = s = 0 μ r = s μ μ s q μ s r s q u s , q v r s , q w μ r , q = r = 0 μ s = 0 r μ r q r s q u s , q v r s , q w μ r , q = r = 0 μ μ r q ( u q × q v q ) r w μ r , q = ( u q × q v q ) × q w q μ
Existence of identity: it is easy to see that u q × q e q = e q × q u q = u q for all u q G q where e q = ( δ μ 0 ) μ 0 , Existence of inverse: let u q G q . Since G ( u q , 0 ) = u 0 , q 0 , then G ( u q , z ) > 0 , z < λ , for some λ > 0 . This implies that 1 G ( u q , z ) is a well-defined function that can be represented via power series due to analyticity as
1 G ( u q , z ) = μ = 0 v μ , q z μ [ μ ] q ! = : G ( v q , z ) , z ρ ,
for some real sequence v q = ( v μ , q ) μ 0 and some ρ > 0 . Here, one can observe that v 0 , q = 1 u 0 , q 0 by (4), and that v q G q . Again, it can be observed from (3) and (4), that v q is the inverse of u q . Thus, v q is the unique solution to the systems of equations:
( u q × q v q ) μ = k = 0 μ μ k q u k , q v μ k , q = δ μ 0 .
Commutative: it is easy to see that u q × q v q = v q × q u q for all u q , v q G q .
The proof is complete. □
Let A q ( y ) = A μ , q ( y ) μ 0 be a sequence of polynomials such that A q ( 0 ) = A μ , q ( 0 ) μ 0 G q . Recall that A q ( y ) is called a q-Appell sequence if one of the following equivalent conditions is satisfied:
D q , y A μ , q ( y ) = [ μ ] q A μ 1 , q ( y ) , μ N ,
A μ , q ( y ) = k = 0 μ μ k q A k , q ( 0 ) y μ k ,
or:
G A q ( y ) , z = G A q ( 0 ) , z e q y z .
The set of all q-Appell sequence will be denoted by A q . Let I q ( y ) = ( y μ ) μ 0 be the unit q-Appell sequence. Using (2), the condition (7) can be expressed as
A q ( y ) = A q ( 0 ) × q I q ( y ) .
From Proposition (1), A q ( y ) G q , for any y R . From the binomial identity, I q ( y q x ) = I q ( y ) × q I q ( x ) , for x R . Thus, from Equation (9) and Corollary (1):
A q ( y q x ) = A q ( y ) × q I q ( x ) = A q ( x ) × q I q ( y ) , x R .

2. The Abelian Group Structure of A q

Let A q ( y ) , C q ( y ) A q . The q-binomial convolution of A q ( y ) and C q ( y ) , denoted by ( A q × q C q ) ( y ) = ( A q × q C q ) μ ( y ) μ 0 and is defined as
( A q × q C q ) ( y ) = A q ( y ) × q C q ( 0 ) = A q ( 0 ) × q C q ( y ) = A q ( 0 ) × q C q ( 0 ) × q I q ( y ) ,
The last two equalities of (11) can be obtained using (9) and Corollary (1). Equivalently:
( A q × q C q ) μ ( y ) = k = 0 μ μ k q A k , q ( 0 ) C μ k , q ( y ) = k = 0 μ μ k q C k , q ( 0 ) A μ k , q ( y ) = k = 0 μ μ k q y μ k j = 0 k k j q A j , q ( 0 ) C k j , q ( 0 ) = j 1 + j 2 + j 3 = μ μ j 1 , j 2 , j 3 q A j 1 , q ( 0 ) C j 2 , q ( 0 ) y j 3 .
Theorem 1.
Let A q ( y ) , C q ( y ) A q . Then, ( A q × q C q ) ( y ) is an q-Appell sequences characterized by its generating function:
G ( A q × q C q ) ( y ) , z = G A q ( 0 ) , z G C q ( 0 ) , z e q y z .
As a consequence, ( A q , × q ) is an Abelian group with identity element I q ( y ) . In addition, we have:
( A q × q C q ) ( y q x ) = A q ( y ) × q C q ( x ) , x R .
In general, for any A q ( i ) ( y ) A q and y i R , i = 1 , , m , with y 1 q q y m = y :
A q ( 1 ) ( y 1 ) × q × q A q ( m ) ( y m ) = A q ( 1 ) × q × q A q ( m ) ( y ) .
Proof. 
By (12), ( A q × q C q ) 0 ( 0 ) = A 0 , q ( 0 ) C 0 , q ( 0 ) 0 . Using (11) and proposition 1, we have:
G ( A q × q C q ) ( y ) , z = G A q ( 0 ) , z G C q ( 0 ) , z e q y z = G ( A q × q C q ) ( 0 ) , z e q y z .
Thus, the first statement in Theorem 1 is evident from (8). Similarly, from (13) and Proposition 1, Formula (14) can be obtained. Now, we will show that C q ( y ) A q will be the inverse of A q ( y ) A q . Similar to the method used in Corollary 1, let C q ( 0 ) = ( C μ , q ( 0 ) ) μ 0 G q be the real sequence having a generating function as
G C q ( 0 ) , z = 1 G ( A q ( 0 ) , z ) .
Then, the q-Appell sequences C q ( y ) = C q ( 0 ) × q I q ( y ) will be inverse of A q ( y ) . Equivalently, C q ( 0 ) will be the unique solution to the systems of equations:
( A q × q C q ) μ ( y ) = k = 0 μ μ k q C k , q ( 0 ) A μ k , q ( y ) = I μ , q ( y ) = y μ ,
which completes the proof. □
Note that Theorem 1 is equivalent to q-Appell polynomials determinantal approach, now we state the following:
Corollary 2.
(Determinantal form). For the real sequence A q ( y ) A q and C q ( 0 ) G q whose generating function is represented in (16). Then, A 0 , q ( y ) = 1 C 0 , q ( 0 ) and we have for μ N :
A μ , q ( y ) = ( 1 ) μ ( C 0 , q ( 0 ) ) μ + 1 × 1 y y 2 y μ 1 y μ C 0 , q ( 0 ) C 1 , q ( 0 ) C 2 , q ( 0 ) C μ 1 , q ( 0 ) C μ , q ( 0 ) 0 C 0 , q ( 0 ) 2 1 q C 1 , q ( 0 ) μ 1 1 q C μ 2 , q ( 0 ) μ 1 q C μ 1 , q ( 0 ) 0 0 C 0 , q ( 0 ) μ 1 2 q C μ 3 , q ( 0 ) μ 2 q C μ 2 , q ( 0 ) 0 0 0 C 0 , q ( 0 ) μ μ 1 q C 1 , q ( 0 )
Proof. 
It suffices to put formula (17) in a determinantal form. □
Corollary 2 has applications in Corollary 3.

3. Scale Transformations

Now, we will study scale transformations. For α R and A q ( y ) A q , T α A q ( y ) = T α A μ , q ( y ) μ 0 is defined as
T α A μ , q ( y ) = α μ A μ , q ( y / α ) = k = 0 μ μ k q α k A k , q ( 0 ) y μ k , a 0 T 0 A μ , q ( y ) = A 0 , q ( 0 ) y μ
where the last equality of the first equation of (18) is by using (7). These transformations will be characterized next.
Proposition 2.
Let α , β R , then T α A q ( y ) is a q-Appell sequence if A q ( y ) , C q ( y ) A q and characterized by generating function:
G T α A q ( y ) , z = G A q ( 0 ) , α z e q y z
In addition
G ( T α A q × q T β C q ) ( y ) , z = G A q ( 0 ) , α z G C q ( 0 ) , β z e q y z .
As a consequence, the map T α : A q A q is an isomorphism, whenever a 0 .
Proof. 
By (18), T α A 0 , q ( 0 ) = A 0 , q ( 0 ) 0 . Again by (18) and Proposition 1, we have:
G T α A q ( y ) , z = G A q ( 0 ) , α z e q y z = G T α A q ( 0 ) , z e q y z
since T α A 0 , q ( 0 ) = α μ A μ , q ( 0 ) . Hence, the first statement in Proposition 2 follows from (8). On the other hand, we have from (13) and (19):
G ( T α A q × q T β C q ) ( y ) , z = G T α A q ( 0 ) , z G T β C q ( 0 ) , z e q y z = G A q ( 0 ) , α z G C q ( 0 ) , β z e q y z ,
thus showing (20). Moreover, by (13) and (19), we have
T α ( A q × q C q ) ( y ) = ( T α A q × q T α C q ) ( y )
as both sides of (21) have the same generating function.
On the other hand, if T α A q ( y ) = T α C q ( y ) , then A q ( 0 ) = C q ( 0 ) , as follows from (19) and we have A q ( y ) = C q ( y ) . By (19), T α T α 1 A q ( y ) = A q ( y ) , thus it shows that T α is an isomorphism and thus the proof is completed. □
The order m generalized q-Bernoulli polynomials can be expressed in terms of the q-Bernoulli polynomials B q ( y ) as
B q ( α 1 , , α m ; y ) = T α 1 B q × q × q T α m B q ( y ) .
Relation (22) can be obtained using above the table and Proposition 2 as follows:
G B q ( α 1 , , α m ; y ) , z = e q y z i = 1 m α i z e q α i z 1 = e q y z i = 1 m G B q ( 0 ) , α i z = G ( T α 1 B q × q T α 2 B q × q × q T α m B q ) ( y ) , z .
Similarly, by using the result of relation (20) in Proposition 2, the order m generalized q-Euler polynomials can be expressed by means of the type q-Euler polynomials E ( y ) as
E q ( α 1 , , α m ; y ) = T α 1 E q × q × q T α m E q ( y ) .
Finally, we have the relating q-Bernoulli and q-Euler polynomials:
( B q × q E q ) ( y ) = T 2 B q ( y ) .
From Table 1:
μ = 0 B μ , q y 2 z μ [ μ ] q ! = z e q y z / 2 e q z 1 = z / 2 e q z / 2 1 2 e q y z / 2 e q z / 2 + 1 = μ = 0 B μ , q ( 0 ) ( z / 2 ) μ [ μ ] q ! s = 0 E s , q ( y ) ( z / 2 ) s [ s ] q ! = μ = 0 2 μ s = 0 μ μ s q B μ s , q ( 0 ) E s , q ( y ) z μ [ μ ] q ! .
Then, we have:
B μ , q y 2 = 2 μ s = 0 μ μ s q B s , q ( 0 ) E μ s , q ( y ) .
Similarly we can get:
B μ , q y 2 = 2 μ s = 0 μ μ s q E s , q ( 0 ) B μ s , q ( y ) .
Then:
( B q × q E q ) μ ( y ) = s = 0 μ μ s q B s , q ( 0 ) E μ s , q ( y ) = s = 0 μ μ s q E s , q ( 0 ) B μ s , q ( y ) = 2 μ B μ , q y 2 = T 2 B μ , q ( y ) .

4. Transformations Based on Expectations

Let X be a random variables such that:
E e q r X < , for r > 0 .
Here, we consider expectations and transformations of q-Appell sequences A q ( y ) by replacing x by X in (10) similar to a classical analogue [7,30]. These transformations are the result due to a probabilistic approach to q-Appell polynomials. For A q ( y ) A q and a random variable X, we define R X A q ( y ) = R X A μ , q ( y ) μ 0 as
R X A μ , q ( y ) = E A μ , q ( y q X ) = k = 0 μ μ k q A k , q ( 0 ) E ( y q X ) μ k
= k = 0 μ μ k q E X k A μ k , q ( y ) = k = 0 μ μ k q E A k , q ( X ) y μ k ,
follow from (7) and (10). Notice that whenever X = 0 , R X A q ( y ) = A q ( y ) . In addition:
R X I q ( y ) = E ( y q X ) μ μ 0 .
Identity I q ( y ) transformation plays an important role as which is evident from equality in (25), we obtain:
R X A q ( y ) = ( A q × q R X I q ) ( y ) .
Now, we will study some results following the characterization of the transformations based on expectations and will present some of their properties.
Proposition 3.
Let Y and X denote two independent random variables and A q ( y ) , C q ( y ) A q . Then, R X A q ( y ) is a q-Appell sequence represented in terms of generating a function as
G R X A q ( y ) , z = G A q ( 0 ) , z E e q z ( y q X ) .
Moreover, the following properties are true:
(a) 
R X ( A q × q C q ) ( y ) = ( R X A q × q C q ) ( y ) = ( A q × q R X C q ) ( y ) .
(b) 
( R Y A q × q R X C q ) ( y ) = R Y q X ( A q × q C q ) ( y ) .
(c) 
R Y R X A q ( y ) = R Y q X A q ( y ) .
Proof. 
Using (25), R X A 0 , q ( 0 ) = A 0 , q ( 0 ) 0 . By interchanging sum with expectation, from (26) we have:
G R X I q ( y ) , z = μ = 0 E ( y q X ) μ z μ [ μ ] q ! = E e q z ( y q X ) .
Thus, from (13), (27)–(29) can be obtained. Formula (28) implies that:
G R X A q ( y ) , z = G R X A q ( 0 ) , z e q y z .
Combining it with (8), will prove the first statement in Proposition 3. From Proposition 1 and (27), we obtain:
R X ( A q × q C q ) ( y ) = ( A q × q C q × q R X I q ) ( y ) = ( R X A q × q C q ) ( y ) = ( A q × q R X C q ) ( y ) ,
hence, we obtain (a). Notice that:
( R Y I q × q R X I q ) ( y ) = R Y q X I q ( y ) ,
as it is clear from (13), (29), and the independence between the variables Y and X. From (27) and Proposition 1, we obtain:
( R Y A q × q R X C q ) ( y ) = ( A q × q R Y I q × q C q × q R X I q ) ( y ) = R Y q X ( A q × q C q ) ( y ) ,
which justifies (b). Similarly, one can prove (c).
It is to note that the map R X : A q A q is not a homomorphism, which follows from Proposition 3(a).

5. The Subset R q

Let us consider the exponential moments (finite) M X ( t ) : = E ( e q t X ) for a random variable X s.t. t < ρ similar to its classical case defined in [30]. Then, E ( X μ ) < for all μ = 1 , 2 , , and:
E ( e q t X ) = μ = 0 t μ [ μ ] q ! E ( X μ ) , t < ρ .
For t C , the right hand side of (5) will be a complex analytic function z φ ( z ) , z < ρ , z C . As M X ( 0 ) = 1 , φ ( z ) > 0 for z < ρ due to the continuity of φ . Thus, z 1 φ ( z ) is a well-defined analytic function and can be expressed in the form of power series:
1 φ ( z ) = μ = 0 c μ , q z μ , z < λ ,
where λ > 0 denotes the radius of convergence. For z = t R such that z < λ we have:
1 E ( e q t X ) = μ = 0 c μ , q t μ = μ = 0 c ^ μ , q t μ [ μ ] q ! ,
where c ^ μ , q = c μ , q [ μ ] q ! . For y R and t < λ it holds:
e q t y E ( e q t X ) = s = 0 t s [ s ] q ! y s m = 0 t m [ m ] q ! c ^ m , q = s = 0 m = 0 t s + m [ s ] q ! [ m ] q ! c ^ m , q y s = μ = 0 t μ [ μ ] q ! m = 0 μ m q c ^ m y μ m .
As both series are absolutely convergent in the neighborhood of the origin, the sum will therefore not depend on the order of summation. Motivated by (30), we now present the definition of q-Appell polynomials related to a random variable X .
Definition 1.
Let X be a random variable having some exponential moments. The polynomials A μ , q ( y ) , μ = 0 , 1 , 2 , , satisfying:
μ = 0 t μ [ μ ] q ! A μ , q ( y ) = e q t y E ( e q t X ) f o r a l l y R
where A μ , q ( y ) are called as q-Appell polynomials of order μ associated with random variable X .
Now, we denote by R q the set of Appell sequences A q ( y ) such that:
G A q ( y ) , z = e q y z E e q z X ,
for a random variable X . For another random variable Y satisfying (32), due to the uniqueness theorem for characteristic functions, Y and X will follow same law. Thus, A q ( y ) has associated the random variable X . Notice that for X = 0 , I q ( y ) R q . Then, we present a preposition for the construction of other q-Appell polynomials.
Proposition 4.
For associated independent random variable Y and X and let: A q ( y ) , C q ( y ) R q , respectively, where α , β R . Then, ( T α A q × q T β C q ) ( y ) belong to a R q with the associated random variable α Y q β X .
In particular, if A q ( y ) , C q ( y ) R q , then ( A q × q C q ) ( y ) belongs to R q with associated random variable Y q X .
Proof. 
From Equations (13), (19), and (32) and using the property that Y and X are independent:
G ( T α A q × q T β C q ) ( y ) , z = G T α A q ( 0 ) , z G T β C q ( 0 ) , z e q y z = G A q ( 0 ) , α z G C q ( 0 ) , β z e q y z = e q y z E e q z ( α Y q β X )
where we get the required result. □
The q-Appell sequence in R q is characterized as follows.
Theorem 2.
The following statements are equivalent:
(a) 
A q ( y ) R q with the associated random variable X .
(b) 
G A q ( 0 ) , z = ( E e q z X ) 1 .
(c) 
R X A q ( y ) = I q ( y ) .
(d) 
The inverse element of A q ( y ) is R X I q ( y ) .
Proof. 
From (32), equivalence of (a) and (b) can be obtained. Similarly, (27) gives equivalence between (c) and (d). If (b) is true, then from (28), we have:
G R X A q ( y ) , z = G A q ( 0 ) , z E e q z ( y q X ) = e q y z = G I q ( y ) , z ,
which together with (8), shows (c). Finally, if (d) holds, we see from (13) and (28):
e q y z = G ( R X I q × q A ) ( y ) , z = G R X I q ( 0 ) , z G A q ( 0 ) , z e q y z = E e q z X G A q ( 0 ) , z e q y z
thus showing (b) which completes the proof. □
For any q-Appell sequence, its determinantal form A q ( y ) R q can be expressed in terms of the moments of its associated random variable X .
Corollary 3.
Let A q ( y ) R q with associated random variable X . Denote R X I μ , q ( 0 ) = E X μ = : T μ , q . Then, A 0 , q ( y ) = 1 T 0 , q = 1 and:
A μ , q ( y ) = ( 1 ) μ 1 y y 2 y μ 1 y μ 1 T 1 , q T 2 , q T μ 1 , q T μ , q 0 1 2 1 q T 1 , q μ 1 1 q T μ 2 , q μ 1 q T μ 1 , q 0 0 1 μ 1 2 q T μ 3 , q μ 2 q T μ 2 , q 0 0 0 1 μ μ 1 q T 1 , q , μ N
Proof. 
From Corollary 2 and Theorem 2(d) proof follows. □
Another important result from Theorem 2 is as follows:
Corollary 4.
Let A q ( y ) R q with associated random variable X . For any C q ( y ) A q , we have:
C q ( y ) = E ( C q × q A q ) ( y q X ) .
As a consequence, we have for any x R :
C μ , q ( y q x ) = E ( C q × q A q ) μ ( y q x q X ) = k = 0 μ μ k q E C k , q ( x q X ) A μ k , q ( y ) .
In particular:
y μ = E A μ , q ( y q X ) = k = 0 μ μ k q T k , q A μ k , q ( y ) .
Proof. 
By Proposition 3(a) and Theorem 2(c), we have:
C q ( y ) = ( I q × q C q ) ( y ) = ( R X A q × q C q ) ( y ) = R X ( A q × q C q ) ( y ) = E ( A q × q C q ) ( y q X ) ,
which shows (34). Formula (35) follows by replacing y by y q x in (34) and then applying (14). Identity (36) follows by setting C q ( y ) = I q ( y ) and x = 0 in (35). Thus, the proof is completed. □

Author Contributions

Conceptualization, A.K.; methodology, A.K.; software, A.M.O., A.K. and K.S.N.; validation, K.S.N.; formal analysis, K.S.N. and A.M.; writing—original draft preparation, A.M.O., A.K. and K.S.N.; writing—review and editing, K.S.N. and A.M.; funding acquisition: K.S.N. and A.M. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Not applicable.

Acknowledgments

The author K.S. Nisar and A. Morsy thanks to the Deanship of Scientific Research, Prince Sattam bin Abdulaziz University for facilities and support.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Appell, P. Une classe de polynomes. Ann. Sci. 1880, 9, 119–144. [Google Scholar]
  2. Costabile, F.A.; Longo, E. A determinantal approach to Appell polynomials. J. Comput. Appl. Math. 2010, 234, 1528–1542. [Google Scholar] [CrossRef] [Green Version]
  3. Al-Salam, W.A. q-Appell polynomials. Ann. Mat. Pura Appl. 1967, 4, 31–45. [Google Scholar] [CrossRef]
  4. Keleshteri, M.E.; Mahmudov, N.I. A study on q-Appell polynomials from determinantal point of view. Appl. Math. Comput. 2015, 260, 351–369. [Google Scholar] [CrossRef] [Green Version]
  5. Agarwal, P.; Jain, S.; Khan, M.A.; Nisar, K.S. On Some Formulas For The Genaralised Appell Type Functions. Commun. Korean Math. Soc. 2017, 32, 835–850. [Google Scholar] [CrossRef]
  6. Choi, J.; Nisar, K.S.; Jain, S. Certain Generalized Appell Type Functions and Their Properties. Appl. Math. Sci. 2015, 9, 6567–6581. [Google Scholar] [CrossRef] [Green Version]
  7. Dell, J.A.; Lekuona, A. Binomial convolution and transformations of Appell polynomials. J. Math. Anal. Appl. 2017, 456, 16–33. [Google Scholar]
  8. Kula, A. The q-deformed convolutions: Examples and applications to moment problem. Oper. Matrices 2010, 4, 593–603. [Google Scholar] [CrossRef]
  9. Riyasat, M.; Khan, S.; Nahid, T. q-difference equations for the composite 2D q-Appell polynomials and their applications. Cogent Math. 2017, 4, 1376972. [Google Scholar] [CrossRef]
  10. Khan, S.; Riyasat, M. A determinantal approach to Sheffer–Appell polynomials via monomiality principle. J. Math. Anal. Appl. 2015, 421, 806–829. [Google Scholar] [CrossRef]
  11. Yasmin, G.; Muhyi, A. Certain results of hybrid families of special polynomials associated with appell sequences. Filomat 2019, 33, 3833–3844. [Google Scholar] [CrossRef]
  12. Bernstein, S.N. Constructive proof of Weierstrass approximation theorem. Comm. Kharkov. Math. Soc. 1912, 13, 1–2. [Google Scholar]
  13. Mursaleen, M.; Ansari, K.J.; Khan, A. On (p, q)-analogue of Bernstein Operators. Appl. Math. Comput. 2015, 266, 874–882, Erratum in 2016, 278, 70–71. [Google Scholar] [CrossRef]
  14. Mursaleen, M.; Nasiruzzaman, M.; Nurgali, A.; Abzhapbarov, A. Higher order generalization of Bernstein type operators defined by (p, q)-integers. J. Comput. Anal. Appl. 2018, 25, 817–829. [Google Scholar]
  15. Mursaleen, M.; Nasiuzzaman, M.; Nurgali, A. Some approximation results on Bernstein-Schurer operators defined by (p, q)-integers. J. Ineq. Appl. 2015, 2015, 249. [Google Scholar] [CrossRef] [Green Version]
  16. Khan, K.; Lobiyal, D.K.; Kilicman, A. Bézier curves and surfaces based on modified Bernstein polynomials. Azerb. J. Math. 2019, 9, 3–21. [Google Scholar]
  17. Khan, K.; Lobiyal, D.K.; Kilicman, A. A de Casteljau Algorithm for Bernstein type Polynomials based on (p, q)-integers. Appl. Appl. Math. 2018, 13, 997–1017. [Google Scholar]
  18. Khan, A.; Sharma, V. Statistical approximation by post quantum-analogue of Bernstein-Stancu Operators. Azerb. J. Math. 2018, 8, 100–121. [Google Scholar]
  19. Mishra, V.N.; Patel, P. On generalized integral Bernstein operators based on q-integers. Appl. Math. Comput. 2014, 242, 931–944. [Google Scholar] [CrossRef]
  20. Costabile, F.A.; Longo, E. Δh-Appell sequences and related interpolation problem. Numer. Algorithms 2013, 63, 165–186. [Google Scholar] [CrossRef]
  21. Costabile, F.; Longo, E. The Appell interpolation problem. J. Comput. Appl. Math. 2011, 236, 1024–1032. [Google Scholar] [CrossRef] [Green Version]
  22. Ernst, T. A solid foundation for q-Appell polynomials. Adv. Dyn. Syst. Appl. 2015, 10, 27–35. [Google Scholar]
  23. Araci, S.; Duran, U.; Acikgoz, M. On weighted q-Daehee polynomials with their applications. Indag. Math. 2019, 30, 365–374. [Google Scholar] [CrossRef]
  24. Srivastava, H.M.; Khan, S.; Araci, S.; Acikgoz, M.; Riyasat, M. A General Class of the Three-Variable Unified Apostol-Type q-Polynomials and Multiple Power q-Sums. Bull. Iran. Math. Soc. 2019, 46, 519–542. [Google Scholar] [CrossRef]
  25. Srivastava, H.M.; Yasmin, G.; Muhyi, A.; Araci, S. Certain Results for the Twice-Iterated 2D q-Appell Polynomials. Symmetry 2019, 11, 1307. [Google Scholar] [CrossRef] [Green Version]
  26. Sadjang, P.N. On (p, q)-Appell Polynomials. Anal. Math. 2019, 45, 583–598. [Google Scholar] [CrossRef]
  27. Victor, K.; Pokman, C. Quantum Calculus; Springer: New York, NY, USA, 2002. [Google Scholar]
  28. Vyas, V.K.; Al-jarrah, A.; Purohit, S.D.; Araci, S.; Nisar, K.S. q-Laplace transform for product of general class of q-polynomials and q-analogue of I-function. J. Ineq. Spec. Funct. 2020, 11, 21–28. [Google Scholar]
  29. Ernst, T. A Comprehensive Treatment of q-Calculus; Birkhäuser: Basel, Switzerland, 2012. [Google Scholar]
  30. Bao, T. Quoc, Probabilistic approach to Appell polynomials. Expo. Math. 2015, 33, 269–294. [Google Scholar]
Table 1. Generating the function of some q-Appell type polynomials.
Table 1. Generating the function of some q-Appell type polynomials.
NotationPolynomialsGenerating Functions
B q ( y ) q-Bernoulli polynomials [26] z e q y z e q z 1
B q ( α 1 , , α m ; y ) Order m generalized q-Bernoulli polynomials [29] (p. 117, 4.125) e q y z i = 1 m α i z e q α i z 1
E q ( y ) q-Euler polynomials [26] 2 e q y z e q z + 1
E q ( α 1 , , α m ; y ) Order m generalized q-Euler polynomials [29] (p. 129, 4.197) e q y z i = 1 m 2 e q α i z + 1
G q ( y ) q-Genocchi polynomials [26] 2 z e q y z e q z + 1
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Obad, A.M.; Khan, A.; Nisar, K.S.; Morsy, A. q-Binomial Convolution and Transformations of q-Appell Polynomials. Axioms 2021, 10, 70. https://doi.org/10.3390/axioms10020070

AMA Style

Obad AM, Khan A, Nisar KS, Morsy A. q-Binomial Convolution and Transformations of q-Appell Polynomials. Axioms. 2021; 10(2):70. https://doi.org/10.3390/axioms10020070

Chicago/Turabian Style

Obad, Alaa Mohammed, Asif Khan, Kottakkaran Sooppy Nisar, and Ahmed Morsy. 2021. "q-Binomial Convolution and Transformations of q-Appell Polynomials" Axioms 10, no. 2: 70. https://doi.org/10.3390/axioms10020070

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