1.
Introduction
The integer sequence (un)n≥0 is said to be a Lucas sequence of first kind if there exist non zero integers A and B such that un+2=Aun+1+Bun,n≥0 with initials u0=0 and u1=1. Since the last few decades, researchers keep a constant interest in this sequence and have been placed their results to many modern sciences. Lucas sequence of the first kind comprises many sequences, like Fibonacci numbers, Pell numbers, balancing numbers, Jacobsthal numbers etc. that always make a constant attraction to the recent researchers. In one of the communicated papers of the authors, the Lucas first kind p-numbers Lp(j) is defined by the recurrence relation
with initials Lp(j)=aj−1, for j=1,2,…,p and Lp(0)=0, where p is taken as non-negative integer and the coefficients a and b are non zero integers. For p=1, (1.1) reduces to the recurrence relation of the Lucas first kind numbers.
A new generalization of the Fibonacci sequence based on its generating function is the convolved Fibonacci numbers F(r)j that have been studied in several manner (for e.g. [3,5,7]) and are defined by
Nowadays it is the most challenging task for the authors to investigate several properties of number and polynomial sequences in a matrix way. Determinantal and permanental representations of numbers, polynomials and functions play a crucial role in many areas of mathematics. Şahin and Ramírez [6] introduced the convolved generalized Lucas polynomials F(r)p,q,j(x) and are defined by
where p(x) and q(x) are polynomials coefficient. They derived several identities using the matrix representations of F(r)p,q,j(x) with real and imaginary entries.
In this article, we generalize Şahin and Ramírez paper by introducing convolved (u,v)-Lucas first kind p-polynomials. Based on determinantal and permanental representations, some similar type identities of [6] are studied for these polynomials using different proof methods.
2.
Convolved (u,v)-Lucas first kind p-polynomials
In this section the (u,v)-Lucas first kind p-polynomials and convolved (u,v)-Lucas first kind p-polynomials are defined. Using some results of convolved (u,v)-Lucas first kind p-polynomials the recurrence relation of these polynomials is also established.
Definition 2.1. Let p be any non negative integer and u(x) and v(x) are polynomials with real coefficients. The (u,v)-Lucas first kind p-polynomials {Lpu,v,j(x)}j∈N are defined by the recurrence relation
with initials Lpu,v,0(x)=0 and Lpu,v,j(x)=uj−1(x) for j=1,…,p.
It is noticed that, when we consider u(x)=ax and v(x)=b, equation (2.1) reduced to Lucas first kind p-polynomials {Lp,j(x)} with initial values Lp,0(x)=0 and Lp,j(x)=(ax)j−1 for j=1,2,…,p.
If gpu,v(t) is the generating function of Lpu,v,j+1(x), then it can be easily seen that
By virtue of the gnerating function gpu,v(t), the convolved (u,v)-Lucas first kind p-polynomials can be defined as follows.
Definition 2.2. The convolved (u,v)-Lucas first kind p-polynomials {L(p,r)u,v,j(x)}j∈N for p≥1 are defined by
where u(x) and v(x) are polynomials with real coefficients.
From equation (2.2), we have
Here we conclude that
Using (2.3), we yield convolved (u,v)-Lucas first kind p-polynomials L(p,r)u,v,j(x) for j=0,1,2,3,4,5, and 6 with different (p,r) values, which are listed in both Table 1 and Table 2.
Using the definition of convolved (u,v)-Lucas first kind p-polynomials the following results can be easily verified.
Lemma 2.3. The following relations holds for convolved (u,v)-Lucas first kind p-polynomials
(i) L(p,r)u,v,2(x)=ru(x);
(ii) L(p,r)u,v,j+1(x)=u(x)L(p,r)u,v,j(x)+v(x)L(p,r)u,v,j−p(x)+L(p,r−1)u,v,j+1(x),j≥2;
(iii) jL(p,r)u,v,j+1(x)=r[u(x)L(p,r+1)u,v,j(x)+(p+1)v(x)L(p,r+1)u,v,j−p(x)],j≥1.
Now we are in a position to find the recurrence relation of the convolved (u,v)-Lucas first kind p-polynomials.
Theorem 2.4. The recurrence relation of the convolved (u,v)-Lucas first kind p-polynomials {L(p,r)u,v,j(x)}j∈N obey the second order recurrence relation
with initials L(p,r)u,v,1(x)=1 and L(p,r)u,v,k+1(x)=∏kj=1(r+j−1ju(x)) for k=1,2,…,p−1.
Proof. From relation (iii) of Lemma 2.3, we have
Multiplying (1−u(x)t−v(x)tp+1) on both the sides yields
Further simplification gives
and the result follows.
3.
Determinantal representations of convolved (u,v)-Lucas first kind p-polynomials
In this section we consider various Hessenberg matrices with some adjustable real or imaginary entries. Based upon these matrices we establish some results involving determinantal representations of convolved (u,v)-Lucas first kind p-polynomials.
The following result is useful while proving the subsequent theorems.
Lemma 3.1. [1] Let Aj=(ail)j×j with 1≤i,l≤j be the lower Hessenberg matrix for all j≥1 and define det(A0)=1. Then, det(A1)=a11 and for j≥2
Theorem 3.2. Let F(p,r)u,v,j=(fst) be j×j Hessenberg matrix defined as
that is, F(p,r)u,v,j=
where i=√−1. Then
Proof. Using induction on j, the result is clearly holds for j=1 by (2.4). Assume that the result is true for all positive integers less than or equal to j−1, i.e. det(F(p,r)u,v,j)=L(p,r)u,v,j+1(x). By virtue of Lemma 3.1 and the relation (2.4), we have
This completes the proof.
Theorem 3.3. Let D(p,r)u,v,j=(dst) be j×j Hessenberg matrix defined as
that is,
Then
Proof. The proof is analogous to the proof of Theorem 3.2.
To better understand the above theorems, let us consider the following examples.
Example 3.4. We calculate the polynomial L(p,r)u,v,j+1(x) with (p,r)=(2,4) and j=6 by using Theorem 3.2.
Example 3.5. We calculate the polynomial L(p,r)u,v,j+1(x) with (p,r)=(3,4) and j=5 by using Theorem 3.3.
4.
Permanental representations of convolved (u,v)-Lucas first kind p-polynomials
In this section we consider various Hessenberg matrices and upon these matrices we establish some results involving permanental representations of convolved (u,v)-Lucas first kind p-polynomials. Moreover, we consider some non-singular matrices and establish the first column of inverse of these matrices is written in convolved (u,v)-Lucas first kind p-polynomials.
The following result is useful while proving the subsequent theorems.
Lemma 4.1. [4] Let Aj=(ail)j×j with 1≤i,l≤j be the lower Hessenberg matrix for all j≥1, and define per(A0)=1. Then per(A1)=a11, and for j≥2,
Theorem 4.2. Let G(p,r)u,v,j=(gst) be j×j Hessenberg matrix, given by
that is, G(p,r)u,v,j=
where i=√−1. Then
Proof. By the induction on j the result is true for j=1. Let us consider the result is true for all positive integers less than or equal to j−1, i.e. per(G(p,r)u,v,j)=L(p,r)u,v,j+1(x). Then by using Lemma 4.1, we have
which is true by (2.4). This hence the proof.
Theorem 4.3. Let H(p,r)u,v,j=(hst) be j×j Hessenberg matrix, given by
that is,
Then
Proof. The proof is analogous to the proof of Theorem 4.2.
To better understand the above theorems, let us consider the following examples.
Example 4.4. We calculate the polynomial L(p,r)u,v,j+1(x) for (p,r)=(4,3) and j=5 by using Theorem 4.2.
Example 4.5. We calculate the polynomial L(p,r)u,v,j+1(x) with (p,r)=(3,3) and j=4 by using Theorem 4.3.
At the end of this section, we present two important results concerning convolved (u,v)-Lucas first kind p-polynomials. We omit the proofs of these results because they are similar to the methods which are adopted in Theorem 9 of [6].
Theorem 4.6. Let ˜F(p,r)u,v,j+1 be the (j+1)−by−(j+1) non singular matrix given by
where F(p,r)u,v,j is the Hessenberg matrix of order j defined in Theorem 3.2. Then the first column of (˜F(p,r)u,v,j+1)−1 is
where i=√−1 and L(p,r)u,v,j(x) is the convolved (u,v)-Lucas first kind p-polynomials.
Theorem 4.7. Let ˜D(p,r)u,v,j+1 be the (j+1)−by−(j+1) non singular matrix given by
where D(p,r)u,v,j is the Hessenberg matrix of order j defined in Theorem 3.3. Then the first column of (˜D(p,r)u,v,j+1)−1 is
where L(p,r)u,v,j(x) is the convolved (u,v)-Lucas first kind p-polynomials.
In order to verify these theorems, we need the following results of [2]. The first result is
which is obtained from ˜F⋅˜F−1=Ij+1 and the second result is
where
˜F−1=[αLfβT] with α,L,f and βT are of order j×j,j×j,1×1 and 1×j respectively.
Example 4.8. We verify the Theorem 4.6 by taking (p,r)=(2,3) and j=5
Let us consider
Using (4.4), we have
and further applying (3.1), we get
Using (4.3), we get
Hence by Table 1, it is verified that the first column of (˜F(2,3)u,v,6)−1 is
Example 4.9. We verify the Theorem 4.7 by taking (p,r)=(4,3) and j=5
Let us consider
Using (4.4), we have
and further applying (3.2), we get
Using (4.3), we get
Hence by Table 1, it is verified that the first column of (˜D(4,3)u,v,6)−1 is
Conflict of interest
The authors declare there are no conflicts of interest in this paper.