1. Introduction
Several mathematicians were attracted to work on Hankel matrices because of their connections and applications to some areas in mathematics, physics, and computer science. Several theories and applications of these matrices were established including the Hankel determinant and Hankel transform. The notion of Hankel transform was first introduced in Sloane’s sequence A055878 [
1] and was later on studied by Layman [
2].
The Hankel matrix
of order
n of a sequence
is defined by
On the other hand, the Hankel determinant
of order
n of
A is defined to be the determinant of the corresponding Hankel matrix of order
n. That is,
. The Hankel transform of the sequence
A, denoted by
, is the sequence
of Hankel determinants of
A. For instance, the Hankel transform of the sequence of Catalan numbers
is given by
and the sequence of the sum of two consecutive Catalan numbers,
with
, the
nth Catalan numbers, has the Hankel transform
where
is the
nth Fibonacci numbers [
2].
One remarkable property of the Hankel transform was established by Layman [
2], which states that the Hankel transform of an integer sequence is invariant under binomial and inverse transforms. That is, if
A is an integer sequence,
B is the binomial transform of
A and
C is the inverse transform of
A, then,
This property played an important role in proving that the Hankel transform of the sequence of Bell number
[
3] and that of
r-Bell numbers
[
4] are equal. Corcino and Corcino [
5] also used this property in proving that the Hankel transform of the sequence of generalized Bell numbers
, known as the
-Bell numbers. It is important to note that the numbers
are equivalent to the
r-Dowling numbers
, which were defined in [
6] as:
where
denotes the
r-Whitney numbers of the second kind introduced in [
7].
In the same paper, the authors tried to establish the Hankel transform for the
q-analogue of
-Bell numbers by using the
q-analogue defined in [
8]. However, their attempt was not fruitful. In another paper, Corcino et al. [
9] introduced a new way of defining the
q-analogue of Stirling-type and Bell-type numbers and established the Hankel transforms for the
q-analogue of non-central Bell numbers using the method of Mezӧ. On the other hand, the Hankel transforms of the non-central Dowling numbers and the translated Dowling numbers were investigated using the property established by Layman [
2] in [
10,
11].
Recently, a definition of
q-analogue of
r-Whitney numbers of the second kind
was introduced in [
12,
13] by means of the following triangular recurrence relation:
where
n and
k are nonnegative integers, and the parameters
m and
r may be real or complex numbers and
if
and
and
if
or
. From this definition, two more forms of
q-analogue were defined in [
12,
13] as:
and
where
and
denote the second and third form of the
q-analogue of the
r-Whitney numbers of the second kind, respectively. In line with this, three forms of
q-analogue of
r-Dowling numbers were defined in [
12,
13] as follows:
and
The
r-Dowling numbers
were defined in [
6] as:
where
denotes the
r-Whitney numbers of the second kind introduced in [
7]. One can easily verify that the
r-Whitney numbers of the second kind and
r-Dowling numbers are equivalent to
-Stirling numbers and
-Bell numbers, respectively. The Hankel transform of the
q-analogue of
r-Whitney numbers of the second kind was established in [
12], while the Hankel transforms of the three forms of the
q-analogues of the
r-Dowling numbers were derived in [
13,
14,
15], which are given as follows:
and
The
-analogues of some mathematical concepts, special functions, polynomials, numbers and their generalizations have been the object of investigations of several mathematicians and physicists since 1991. For instance, the
-analogues of binomial coefficients, derivative operator, Volkenborn integration, Stirling and Bell numbers and their generalizations, Apostol type Bernoulli, Euler, Genocchi, Frobenious–Euler, Fubini, Appell polynomials have been extensively studied by researchers in the papers [
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
27,
28,
29]. Moreover,
-analogues of the Bernstein–Durrmeyer operators, multifarious formulas and properties of the derivation and the integration have been defined and studied in [
30,
31], which gave two
-Taylor formulas for polynomials, the formula of
- integration by part and the fundamental theorem of
-calculus.
Ehrenborg [
32] has established the Hankel transform of
q-Stirling numbers and that of
q-exponential polynomials or
q-Bell polynomials. In the final remark of his paper, he has posed a question whether these Hankel transforms can be extended to
-analogues of Stirling numbers and exponential polynomials. This question has not been considered and answered in the papers [
18,
26,
27,
29], which deal with
-analogues of Stirling and Bell numbers and their generalizations. With this, the present authors have been motivated to establish such Hankel transforms using the methods employed in [
12,
13,
14,
15]. In the previous paper of the present authors (see [
33]), they have made an initiative to define a
-analogue of
r-Whitney numbers of the second kind by means of the following horizontal generating function:
where
In the desire to establish the Hankel transform of the
-analogue of
r-Whitney numbers of the second kind, they have derived some fundamental properties of
. However, they have failed to obtain the properties that are necessary for deriving the Hankel transform of
. To address this shortcoming, it is necessary to introduce and investigate another type of
-analogue of
r-Whitney numbers of the second kind, which is parallel to the definition of the
q-analogue of
r-Whitney numbers of the second kind in three different forms as shown in (
1)–(
3). It is also necessary to investigate another type of
-analogue of
r-Dowling numbers, which is parallel to the definition of the
q-analogue of
r-Dowling numbers as shown in (
4)–(
6). With this, the
-analogues considered in [
33] may then be called a type 1
-analogue of
r-Whitney numbers of the second kind and a type 1
-analogue of
r-Dowling numbers.
This research aims to attain the following objectives:
- 1.
Introduce type 2 -analogue of r-Whitney numbers of the second kind is introduced;
- 2.
Derive some combinatorial properties of the type 2 -analogue of r-Whitney numbers of the second kind;
- 3.
Establish an explicit formula of the type 2 -analogue of the r-Whitney numbers of the second kind in symmetric function form;
- 4.
Construct a combinatorial interpretation of the type 2 -analogue of r-Whitney numbers of the second kind in the terms of A-tableaux;
- 5.
Obtain some convolution identities of the type 2 -analogue of r-Whitney numbers of the second kind;
- 6.
Derive the Hankel transform of the type 2 -analogue of r-Whitney numbers of the second kind;
- 7.
Define type 2 -analogues of the r-Dowling numbers in three forms;
- 8.
Establish the Hankel transform of one of these forms.
3. Results
In this section, results of the investigation are presented, which are based on the above-mentioned research objectives. Detailed discussion of the proofs are provided, which justify the validity of the results.
3.1. Type 2 -Analogue of the r-Whitney Numbers of the Second Kind: First Form
In this section, another type of -analogue of the r-Whitney numbers of the second kind, denoted by , will be introduced, which is called the type 2 -analogue of the r-Whitney numbers of the second kind. This is the first form of the type 2 -analogue. Some necessary properties will be obtained including the vertical recurrence relation, rational generating function and a certain explicit formula in the symmetric function form.
Now, let us define the type 2 -analogue of the r-Whitney numbers of the second kind.
Definition 1. For nonnegative integers n and k, and real number r, the -analogue is defined by: Remark 1. Using the above recurrence relation, it can be verified that: By applying (
9), we obtain some properties for
, which are necessary for deriving the desired Hankel transforms. These properties are given in the following theorems:
Theorem 1. For nonnegative integers n and k, and real number r, the -analogue of r-Whitney numbers of the second kind satisfies the following vertical recurrence relation: Proof. Replacing
k by
in (
9) gives:
Applying this repeatedly to (
9), gives us:
Using the fact that
gives (
10). □
Theorem 2. For nonnegative integers n and k, and real number r, the -analogue satisfies the following rational generating function: Proof. When
and applying the triangular recurrence relation in (
9), we have
By backward substitution, we obtain:
□
Now, to establish a homogeneous symmetric function form for
, note that (
11) can be expressed as follows:
Comparing the coefficient of
, we have:
This is equivalent with the next theorem.
Theorem 3. For nonnegative integers n and k, the explicit formula for in the homogeneous symmetric function form is given by: Proof. Note that each term of the sum in (
12) is of the form:
where
are nonnegative integers satisfying
This means that the each term is just a product
factors which are not necessarily distinct factors. That is, we can write each term as a product:
where
and
’s are not necessarily distinct, i.e.
With this, (
12) implies (
13). □
3.2. Type 2 -Analogue of r-Whitney Numbers of the Second kind: Second Form
In this section, the second form of the type 2
-analogue of
r-Whitney numbers of the second kind, denoted by
, will be introduced. This is defined in terms of the first form of type 2
-analogue of
r-Whitney numbers of the second kind as follows:
From the explicit formula in symmetric form in Theorem 3, we have:
Definition 2. [
18]
. An A-tableau is a list ϕ of column c of a Ferrer’s diagram of a partition λ (by decreasing order of length) such that the lengths are part of the sequence , a strictly increasing sequence of nonnegative integers. Now, let
be a function from the set of nonnegative integers
N to a ring
K and suppose
is an
A-tableau with
l columns of lengths
. We use
to denote the set of such
A-tableaux. Then, we set:
Note that might contain a finite number of columns whose lengths are zero since . From this point onward, whenever an A-tableau is mentioned, it is always associated with the sequence .
The next theorem expresses in terms of a sum of weights of A-tableaux.
Theorem 4. Let denote a function from N to a ring K over (column weights according to length), which is defined by , where r is a complex number, and is the length of column c of an A-tableau in . Then, Proof. Let
. This implies that
has exactly
columns, say
, whose lengths are
, respectively. Moreover, for each column
, we have
and
. Hence, we get:
Since
, then:
□
Suppose that
, for some numbers
and
. Then the explicit formula in (
15) can be rewritten as:
For any
,
where
. Note that:
Hence,
where
.
Suppose that is the set of all A-tableaux corresponding to such that for each , one of the following is true:
has no columns whose weight is ;
has one columns whose weight is ;
has two columns whose weight is ;
⋮
has columns whose weight is .
Now, if
l columns in
with weights other than
, then:
where
. Note that, for each
l, there corresponds an
tableaux with
l columns having weights
. It can easily be verified that
Thus, for all
,
contains a total of
A-tableaux with
l columns of weights
. However, only
tableaux with
l columns in
are distinct. Hence, every distinct tableaux
with
l columns of weight other than
appears
times in the collection. Thus, we have:
where
denotes the set of all tableaux
having
l columns of weights
. Reindexing the sum, we get:
where
is the set of all tableaux with
columns of weights
, for each
. Clearly,
. Hence,
This result is formally stated in the next theorem.
Theorem 5. The -analogue satisfies the following identity:where for some numbers and . Now, suppose:
is a tableau with columns whose lengths are in the set ; and
is a tableau with columns whose lengths are in the set .
Then,
where
and
. We can generate an
A-tableau
with
columns whose lengths are in the set
by joining the columns of
and
. Hence, for
, we have:
Thus, using Equation (
15), we obtain the following theorem.
Theorem 6. The satisfy the following convolution-type identity: The next theorem provides another convolution-type identity.
Theorem 7. The satisfy the following second form convolution-type identity: be a tableau with columns whose lengths are in the set , and
be a tableau with columns whose lengths are in the set ;
then, and . Using the same argument with the proof in the previous theorem, we can obtain the desired convolution formula. □
Notice that (
19) can be written as:
Replacing
s with
,
p with
j, and
u with
, we get:
This gives the LU factorization of the matrix:
Since
and
we have the following theorem.
Theorem 8. For nonnegative integers n and k, the Hankel transform for is given by: Multiplying both sides of Equation (20) by
, we have
Hence, we established the following corollary.
Corollary 1. For nonnegative integers n and k, the Hankel transform for is given by: 3.3. Hankel Transform of Type 2 -Analogue of r-Dowling Numbers
A
-analogue of
r-Dowling Numbers that has been investigated in [
33] is defined as the sum of type 1
-Analogue of
r-Whitney numbers of the second kind. We may also call this a type 1
-analogue of
r-Dowling numbers. In this section, the type 2
-analogue of the
r-Dowling numbers will be defined in three different forms. Moreover, the Hankel transform of the second form of the type 2
-analogue of
r-Dowling numbers will be derived.
Now, let us define the three forms of type 2 -analogue of the r-Dowling numbers.
Definition 3. The first, second and third forms of type 2 -analogue of the r-Dowling numbers, denoted by , and , respectively, are defined as follows:where , denote the first, second and third forms of the -analogue of the r-Whitney numbers of the second kind, respectively.
Our focus in this section is on the second form of type 2 -analogue of the r-Dowling numbers in (24), particularly, its Hankel transform. The other forms will be considered in separate papers.
In deriving the Hankel transform of , the following theorem is necessary.
Theorem 9. The -analogue of r-Dowling numbers satisfy the following relation: Proof. Letting
in Theorem 5 yields:
Then, summing up both sides of the preceding sum over
k yields:
Taking
gives
. Thus,
which is exactly the desired relation. □
As a direct consequence of Theorem 9, we have the following corollary.
Corollary 2. The -analogue of r-Dowling numbers satisfy the following relation: To establish the Hankel tranform of
, the concept of rising
k-binomial transform by Spivey and Steil [
34] as well as its property in relation to the Hankel transform are necessary. In Spivey and Steil [
34], the rising
k-binomial transform
R of a sequence
is the sequence
, where
is given by:
Hence, we use
to denote the set of rising
k-binomial transform of
A. Then, given a sequence
and
,
If
,
as seen in [
34]. We are now ready to state the final theorem of this paper.
Theorem 10. The Hankel transform of the sequence of -analogue of r-Dowling numbers is given by: Proof. From Corollary 2, we say that
is the binomial transform of
, that means that:
By Layman’s theorem [
2],
that is,
Now, Theorem 9 can be stated, as
is the rising
-binomial transform of
. Using the Spivey–Steil Theorem, with
and
, we have:
Recall that the Hankel transform of
in [
15] is given by:
□
Remark 2. When and , the Hankel transform in (26) reduces to: which is the Hankel transform for the noncentral Bell numbers in [35]. Remark 3. When and , the Hankel transform in (26) yields: which is the Hankel transform of the -Bell numbers with in [5]. Illustration 1. When
and
in Theorem 10, we have:
When
and
, this further gives: