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
of a number
is defined by
The
q-factorial
is defined by
The
q-binomial coefficient
is defined by
The
q-analogue of the function
are defined by
The
q-derivative of a function
f is defined by
Exponential functions based on
q-calculus is used in the standard approach as follows:
Let
y and
x be elements of a commutative multiplicative semigroup. Then, the NWA
q-addition is given by [
29]
For every power series
with
the
q-Appell polynomials of degree
and order
n have the following generating function [
29]:
Putting
we have:
where
is called a
q-Appell number of degree
and order
nq-Appell polynomials of degree
and order
n satisfy the following
q-differential Equation [
29]:
1. Quantum Binomial Convolutions and Generating Functions
Let
denote the set of positive integers and
Now, onwards
and
satisfying
Let us denote by
the set of all real sequences
where
and:
If
then its generating function will be denoted by
The
q-binomial convolution [
8] of
and
will be denoted by
for
and
is defined as
The
q-addition is a special case of the
q-binomial convolution [
29].
The
q-multinomial coefficient is given by
Proposition 1. Let that μ belong to the set of positive integers (see [29]). Then, and: Proof. Suppose
and
with
r and
s as their radii, respectively. Let
. Then, from (
2), we have:
□
Then Thus, by applying the induction on m, result follows.
Corollary 1. is an Abelian group having an identity element as , where and for
Proof. Closure: for then as
Associativity: let be any elements:
and
Existence of identity: it is easy to see that
for all
where
Existence of inverse: let
Since
then
for some
This implies that
is a well-defined function that can be represented via power series due to analyticity as
for some real sequence
and some
Here, one can observe that
by (
4), and that
Again, it can be observed from (
3) and (
4), that
is the inverse of
Thus,
is the unique solution to the systems of equations:
Commutative: it is easy to see that for all
The proof is complete. □
Let
be a sequence of polynomials such that
. Recall that
is called a
q-Appell sequence if one of the following equivalent conditions is satisfied:
or:
The set of all
q-Appell sequence will be denoted by
Let
be the unit
q-Appell sequence. Using (
2), the condition (
7) can be expressed as
From Proposition (1),
for any
From the binomial identity,
for
Thus, from Equation (
9) and Corollary (1):
2. The Abelian Group Structure of
Let
The
q-binomial convolution of
and
denoted by
and is defined as
The last two equalities of (
11) can be obtained using (
9) and Corollary (1). Equivalently:
Theorem 1. Let Then, is an q-Appell sequences characterized by its generating function: As a consequence, is an Abelian group with identity element In addition, we have: In general, for any and with : Proof. By (
12),
Using (
11) and proposition 1, we have:
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
will be the inverse of
Similar to the method used in Corollary 1, let
be the real sequence having a generating function as
Then, the
q-Appell sequences
will be inverse of
Equivalently,
will be the unique solution to the systems of equations:
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 and whose generating function is represented in (16). Then, and we have for : 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
and
is defined as
where the last equality of the first equation of (
18) is by using (
7). These transformations will be characterized next.
Proposition 2. Let then is a q-Appell sequence if and characterized by generating function: As a consequence, the map is an isomorphism, whenever
Proof. By (
18),
Again by (
18) and Proposition 1, we have:
since
Hence, the first statement in Proposition 2 follows from (
8). On the other hand, we have from (
13) and (
19):
thus showing (
20). Moreover, by (
13) and (
19), we have
as both sides of (
21) have the same generating function.
On the other hand, if
then
as follows from (
19) and we have
By (
19),
thus it shows that
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
as
Relation (
22) can be obtained using above the table and Proposition 2 as follows:
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
as
Finally, we have the relating
q-Bernoulli and
q-Euler polynomials:
4. Transformations Based on Expectations
Let
X be a random variables such that:
Here, we consider expectations and transformations of
q-Appell sequences
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
and a random variable
X, we define
as
follow from (
7) and (
10). Notice that whenever
In addition:
Identity
transformation plays an important role as which is evident from equality in (
25), we obtain:
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 Then, is a q-Appell sequence represented in terms of generating a function as Moreover, the following properties are true:
- (a)
- (b)
- (c)
Proof. Using (
25),
By interchanging sum with expectation, from (
26) we have:
□
Thus, from (
13), (
27)–(
29) can be obtained. Formula (
28) implies that:
Combining it with (
8), will prove the first statement in Proposition 3. From Proposition 1 and (
27), we obtain:
hence, we obtain (a). Notice that:
as it is clear from (
13), (
29), and the independence between the variables
Y and
X. From (
27) and Proposition 1, we obtain:
which justifies (b). Similarly, one can prove (c).
It is to note that the map is not a homomorphism, which follows from Proposition 3(a).
5. The Subset
Let us consider the exponential moments (finite)
for a random variable
X s.t.
similar to its classical case defined in [
30]. Then,
for all
and:
For
the right hand side of (5) will be a complex analytic function
As
for
due to the continuity of
Thus,
is a well-defined analytic function and can be expressed in the form of power series:
where
denotes the radius of convergence. For
such that
we have:
where
For
and
it holds:
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
Definition 1. Let X be a random variable having some exponential moments. The polynomials satisfying:where are called as q-Appell polynomials of order μ associated with random variable Now, we denote by
the set of Appell sequences
such that:
for a random variable
For another random variable
Y satisfying (
32), due to the uniqueness theorem for characteristic functions,
Y and
X will follow same law. Thus,
has associated the random variable
Notice that for
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: , respectively, where Then, belong to a with the associated random variable
In particular, if then belongs to with associated random variable
Proof. From Equations (
13), (
19), and (
32) and using the property that
Y and
X are independent:
where we get the required result. □
The q-Appell sequence in is characterized as follows.
Theorem 2. The following statements are equivalent:
- (a)
with the associated random variable
- (b)
- (c)
- (d)
The inverse element of is
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:
which together with (
8), shows (c). Finally, if (d) holds, we see from (
13) and (
28):
thus showing (b) which completes the proof. □
For any q-Appell sequence, its determinantal form can be expressed in terms of the moments of its associated random variable
Corollary 3. Let with associated random variable Denote Then, and: Proof. From Corollary 2 and Theorem 2(d) proof follows. □
Another important result from Theorem 2 is as follows:
Corollary 4. Let with associated random variable For any we have: As a consequence, we have for any : Proof. By Proposition 3(a) and Theorem 2(c), we have:
which shows (
34). Formula (
35) follows by replacing
y by
in (
34) and then applying (
14). Identity (
36) follows by setting
and
in (
35). Thus, the proof is completed. □