Processing math: 100%
Research article

Determinantal and permanental representations of convolved (u, v)-Lucas first kind p-polynomials

  • Received: 01 December 2019 Accepted: 07 February 2020 Published: 18 February 2020
  • MSC : 11B37, 11B39, 15A15

  • The convolved (u, v)-Lucas first kind p-polynomials are defined using the generating function of the (u, v)-Lucas first kind p-polynomials. The determinantal and permanental representations of the convolved (u, v)-Lucas first kind p-polynomials are used to derive some identities of these polynomials.

    Citation: Adikanda Behera, Prasanta Kumar Ray. Determinantal and permanental representations of convolved (u, v)-Lucas first kind p-polynomials[J]. AIMS Mathematics, 2020, 5(3): 1843-1855. doi: 10.3934/math.2020123

    Related Papers:

    [1] Waseem Ahmad Khan, Kottakkaran Sooppy Nisar, Dumitru Baleanu . A note on (p, q)-analogue type of Fubini numbers and polynomials. AIMS Mathematics, 2020, 5(3): 2743-2757. doi: 10.3934/math.2020177
    [2] Xi-Fan Huang, Miao-Kun Wang, Hao Shao, Yi-Fan Zhao, Yu-Ming Chu . Monotonicity properties and bounds for the complete p-elliptic integrals. AIMS Mathematics, 2020, 5(6): 7071-7086. doi: 10.3934/math.2020453
    [3] Haikun Liu, Yongqiang Fu . On the variable exponential fractional Sobolev space Ws(·),p(·). AIMS Mathematics, 2020, 5(6): 6261-6276. doi: 10.3934/math.2020403
    [4] Chunhong Li, Dandan Yang, Chuanzhi Bai . Some Opial type inequalities in (p, q)-calculus. AIMS Mathematics, 2020, 5(6): 5893-5902. doi: 10.3934/math.2020377
    [5] Ala Amourah, B. A. Frasin, G. Murugusundaramoorthy, Tariq Al-Hawary . Bi-Bazilevič functions of order $ \vartheta +i\delta $ associated with $ (p, q)- $ Lucas polynomials. AIMS Mathematics, 2021, 6(5): 4296-4305. doi: 10.3934/math.2021254
    [6] Tekin Toplu, Mahir Kadakal, İmdat İşcan . On n-Polynomial convexity and some related inequalities. AIMS Mathematics, 2020, 5(2): 1304-1318. doi: 10.3934/math.2020089
    [7] Zhongbin Zheng, Jinwu Fang, Wentao Cheng, Zhidong Guo, Xiaoling Zhou . Approximation properties of modified (p, q)-Szász-Mirakyan-Kantorovich operators. AIMS Mathematics, 2020, 5(5): 4959-4973. doi: 10.3934/math.2020317
    [8] Yulu Feng, Min Qiu . Some results on p-adic valuations of Stirling numbers of the second kind. AIMS Mathematics, 2020, 5(5): 4168-4196. doi: 10.3934/math.2020267
    [9] Shoubin Sun, Lingqiang Li, Kai Hu, A. A. Ramadan . L-fuzzy upper approximation operators associated with L-generalized fuzzy remote neighborhood systems of L-fuzzy points. AIMS Mathematics, 2020, 5(6): 5639-5653. doi: 10.3934/math.2020360
    [10] Zitong He, Xiaolin Ma, Ghulam Farid, Absar Ul Haq, Kahkashan Mahreen . Bounds of a unified integral operator for (s,m)-convex functions and their consequences. AIMS Mathematics, 2020, 5(6): 5510-5520. doi: 10.3934/math.2020353
  • The convolved (u, v)-Lucas first kind p-polynomials are defined using the generating function of the (u, v)-Lucas first kind p-polynomials. The determinantal and permanental representations of the convolved (u, v)-Lucas first kind p-polynomials are used to derive some identities of these polynomials.


    The integer sequence (un)n0 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,n0 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

    Lp(j)=aLp(j1)+bLp(jp1),j(p+1) (1.1)

    with initials Lp(j)=aj1, 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

    (1tt2)r=j=0F(r)j+1tj,rZ+.

    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

    g(r)p,q(t)=(1p(x)tq(x)t2)r=j=0F(r)p,q,j+1(x)tj,rZ+,

    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.

    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)}jN are defined by the recurrence relation

    Lpu,v,j(x)=u(x)Lpu,v,j1(x)+v(x)Lpu,v,jp1(x) (2.1)

    with initials Lpu,v,0(x)=0 and Lpu,v,j(x)=uj1(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)j1 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

    gpu,v(t)=j=0Lpu,v,j+1(x)tj=11u(x)tv(x)tp+1.

    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)}jN for p1 are defined by

    g(p,r)u,v(t)=j=0L(p,r)u,v,j+1(x)tj=(1u(x)tv(x)tp+1)r,rZ+ (2.2)

    where u(x) and v(x) are polynomials with real coefficients.

    From equation (2.2), we have

    j=0L(p,r)u,v,j+1(x)tj=j=0(rj)(t)j(u(x)+v(x)tp)j=j=0(r)jj!tjjk=0(jk)ujk(x)vk(x)tpk=j=0jp+1k=0(r)jpk(j(p+1)k)!k!uj(p+1)k(x)vk(x)tj.

    Here we conclude that

    L(p,r)u,v,j+1(x)=jp+1k=0(r)jpk(j(p+1)k)!k!uj(p+1)k(x)vk(x). (2.3)

    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.

    Table 1.  Convolved (u,v)-Lucas first kind p-polynomials.
    j (p,r)=(1,3) (p,r)=(2,3) (p,r)=(3,3) (p,r)=(4,3)
    0 1 1 1 1
    1 3u(x) 3u(x) 3u(x) 3u(x)
    2 6u2(x)+3v(x) 6u2(x) 6u2(x) 6u2(x)
    3 10u3(x)+12u(x)v(x) 10u3(x)+3v(x) 10u3(x) 10u3(x)
    4 15u4(x)+30u2(x)v(x)+6v2(x) 15u4(x)+12u(x)v(x) 15u4(x)+3v(x) 15u4(x)
    5 21u5(x)+60u3(x)v(x)+30u(x)v2(x) 21u5(x)+30u2(x)v(x) 21u5(x)+12u(x)v(x) 21u5(x)+3v(x)
    6 28u6(x)+105u4(x)v(x)+90u2(x)v2(x)+10v3(x) 28u6(x)+60u3(x)v(x)+6v2(x) 28u6(x)+30u2(x)v(x) 28u6(x)+12u(x)v(x)

     | Show Table
    DownLoad: CSV
    Table 2.  Convolved (u,v)-Lucas first kind p-polynomials.
    j (p,r)=(1,4) (p,r)=(2,4) (p,r)=(3,4) (p,r)=(4,4)
    0 1 1 1 1
    1 4u(x) 4u(x) 4u(x) 4u(x)
    2 10u2(x)+4v(x) 10u2(x) 10u2(x) 10u2(x)
    3 20u3(x)+20u(x)v(x) 20u3(x)+4v(x) 20u3(x) 20u3(x)
    4 35u4(x)+60u2(x)v(x)+10v2(x) 35u4(x)+20u(x)v(x) 35u4(x)+4v(x) 35u4(x)
    5 56u5(x)+140u3(x)v(x)+60u(x)v2(x) 56u5(x)+60u2(x)v(x) 56u5(x)+20u(x)v(x) 56u5(x)+4v(x)
    6 84u6(x)+280u4(x)v(x)+210u2(x)v2(x)+20v3(x) 84u6(x)+140u3(x)v(x)+10v2(x) 84u6(x)+60u2(x)v(x) 84u6(x)+20u(x)v(x)

     | Show Table
    DownLoad: CSV

    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,jp(x)+L(p,r1)u,v,j+1(x),j2;

    (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,jp(x)],j1.

    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)}jN obey the second order recurrence relation

    L(p,r)u,v,j+1(x)=r+j1ju(x)L(p,r)u,v,j(x)+(p+1)r+jp1jv(x)L(p,r)u,v,jp(x), (2.4)

    with initials L(p,r)u,v,1(x)=1 and L(p,r)u,v,k+1(x)=kj=1(r+j1ju(x)) for k=1,2,,p1.

    Proof. From relation (iii) of Lemma 2.3, we have

    jL(p,r)u,v,j+1(x)=(ru(x)t+(p+1)rv(x)tp+1)L(p,r+1)u,v,j+1(x).

    Multiplying (1u(x)tv(x)tp+1) on both the sides yields

    jL(p,r)u,v,j+1(x)u(x)(j1)L(p,r)u,v,j(x)v(x)(jp1)L(p,r)u,v,jp(x)=ru(x)L(p,r)u,v,j(x)+(p+1)rv(x)L(p,r)u,v,jp(x).

    Further simplification gives

    jL(p,r)u,v,j+1(x)=(r+j1)u(x)L(p,r)u,v,j(x)+((p+1)r+jp1)v(x)L(p,r)u,v,jp(x),

    and the result follows.

    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 1i,lj be the lower Hessenberg matrix for all j1 and define det(A0)=1. Then, det(A1)=a11 and for j2

    det(Aj)=ajjdet(Aj1)+j1l=1[(1)jraj,l(j1i=lai,i+1)det(Al1)].

    Theorem 3.2. Let F(p,r)u,v,j=(fst) be j×j Hessenberg matrix defined as

    fst={r+s1su(x),if t=s;(p+1)r+sp1sv(x)(i)p,if st=p;i,if ts=1;0,otherwise, 

    that is, F(p,r)u,v,j=

    [ru(x)i0000r+12u(x)00000r+p1pu(x)i0rv(x)(i)p00r+pp+1u(x)000(p+1)rp+j1jv(x)(i)p00r+j1ju(x)],

    where i=1. Then

    det(F(p,r)u,v,j)=L(p,r)u,v,j+1(x). (3.1)

    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 j1, 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

    det(F(p,r)u,v,j+1)=fj+1,j+1det(F(p,r)u,v,j)+jt=1[(1)j+1tfj+1,t(js=tfs,s+1)det(F(p,r)u,v,t1)]=r+jj+1u(x)det(F(p,r)u,v,j)+jpt=1[(1)j+1tfj+1,t(js=tfs,s+1)det(F(p,r)u,v,t1)]+(1)pfj+1,jp+1(js=jp+1fs,s+1)det(F(p,r)u,v,jp)+jt=jp+2[(1)j+1tfj+1,t(js=tfs,s+1)det(F(p,r)u,v,t1)]=r+jj+1u(x)det(F(p,r)u,v,j)+(1)p(p+1)rp+jj+1v(x)(i)p(js=jp+1i)det(F(p,r)u,v,jp)=r+jj+1u(x)det(F(p,r)u,v,j)+(1)p(p+1)rp+jj+1v(x)(i)p(i)pdet(F(p,r)u,v,jp)=r+jj+1u(x)L(p,r)u,v,j+1(x)+(p+1)rp+jj+1v(x)L(p,r)u,v,jp+1(x)=L(p,r)u,v,j+2(x).

    This completes the proof.

    Theorem 3.3. Let D(p,r)u,v,j=(dst) be j×j Hessenberg matrix defined as

    dst={r+s1su(x),if t=s;(p+1)r+sp1sv(x),if st=p;1,if ts=1;0,otherwise, 

    that is,

    D(p,r)u,v,j=[ru(x)10000r+12u(x)00000r+p1pu(x)10rv(x)00r+pp+1u(x)000(p+1)rp+j1jv(x)00r+j1ju(x)].

    Then

    det(D(p,r)u,v,j)=L(p,r)u,v,j+1(x). (3.2)

    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.

    L(2,4)u,v,7(x)=det[4u(x)i0000052u(x)i0004v(x)02u(x)i000134v(x)074u(x)i000145v(x)085u(x)i00052v(x)032u(x)]6×6
    =84u6(x)+140u3(x)v(x)+10v2(x).

    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.

    L(3,4)u,v,6(x)=det[4u(x)1000052u(x)100002u(x)104v(x)0074u(x)10175v(x)0085u(x)]5×5
    =56u5(x)+20u(x)v(x).

    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 1i,lj be the lower Hessenberg matrix for all j1, and define per(A0)=1. Then per(A1)=a11, and for j2,

    per(Aj)=aj,jper(Aj1)+j1l=1(aj,lj1i=lai,i+1per(Al1)).

    Theorem 4.2. Let G(p,r)u,v,j=(gst) be j×j Hessenberg matrix, given by

    gst={r+s1su(x),if t=s;(p+1)r+sp1sv(x)(i)p,if st=p;i,if ts=1;0,otherwise, 

    that is, G(p,r)u,v,j=

    [ru(x)i0000r+12u(x)00000r+p1pu(x)i0rv(x)(i)p00r+pp+1u(x)000(p+1)rp+j1jv(x)(i)p00r+j1ju(x)],

    where i=1. Then

    per(G(p,r)u,v,j)=L(p,r)u,v,j+1(x). (4.1)

    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 j1, 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

    per(G(p,r)u,v,j+1)=gj+1,j+1per(G(p,r)u,v,j)+jt=1(aj+1,tjs=tas,s+1per(Gt1))=r+jj+1u(x)per(G(p,r)u,v,j)+jpt=1(aj+1,tjs=tas,s+1per(Gt1))+aj+1,jp+1js=jp+1(i)per(Gjp)+jt=jp+2(aj+1,tjs=tas,s+1per(Gt1))=r+jj+1u(x)per(G(p,r)u,v,j)+(p+1)rp+jj+1v(x)(i)p(i)pper(Gjp)=r+jj+1u(x)L(p,r)u,v,j+1(x)+(p+1)rp+jj+1v(x)L(p,r)u,v,jp+1(x),

    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

    hst={r+s1su(x),if t=s;(p+1)r+sp1sv(x),if st=p;1,if ts=1;0,otherwise, 

    that is,

    H(p,r)u,v,j=[ru(x)10000r+12u(x)00000r+p1pu(x)10rv(x)00r+pp+1u(x)000(p+1)rp+j1jv(x)00r+j1ju(x)].

    Then

    per(H(p,r)u,v,j)=L(p,r)u,v,j+1(x). (4.2)

    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.

    L(4,3)u,v,6(x)=per[3u(x)i00002u(x)i000053u(x)i000032u(x)i3v(x)00075u(x)]5×5
    =σs55i=1ai,σ(i)=a11a22a33a44a55+a12a23a34a45a51=21u5(x)+3v(x).

    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.

    L(3,3)u,v,5(x)=per[3u(x)10002u(x)100053u(x)13v(x)0032u(x)]4×4
    =σs44i=1ai,σ(i)=a11a22a33a44+a12a23a34a41=15u4(x)+3v(x).

    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

    ˜F(p,r)u,v,j+1=[10000F(p,r)u,v,j001],

    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

    [L(p,r)u,v,1(x)iL(p,r)u,v,2(x)ij1L(p,r)u,v,j(x)ij+1L(p,r)u,v,j+1(x)],

    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

    ˜D(p,r)u,v,j+1=[10000D(p,r)u,v,j001],

    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

    [L(p,r)u,v,1(x)L(p,r)u,v,2(x)L(p,r)u,v,j(x)L(p,r)u,v,j+1(x)],

    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

    Fα+fej=0, (4.3)

    which is obtained from ˜F˜F1=Ij+1 and the second result is

    det(F)=(1)jfdet(˜F), (4.4)

    where

    F=[f11f1200f21f22f230f(j1)1f(j1)2f(j1)3f(j1)jfj1fj2fj3fjj],
    ˜F=[10000f11f12000f21f22f2300f(j1)1f(j1)2f(j1)3f(j1)j0fj1fj2fj3fjj1]=[eT10Fej]and

    ˜F1=[α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

    ˜F(2,3)u,v,6=[1000003u(x)i000002u(x)i0003v(x)053u(x)i00052v(x)032u(x)i000115v(x)075u(x)1].

    Let us consider

    (˜F(2,3)u,v,6)1=[[α]j×1[L]j×j[f]1×1[βT]1×j].

    Using (4.4), we have

    det(F(2,3)u,v,5)=(1)5fdet(˜F(2,3)u,v,6),

    and further applying (3.1), we get

    f=L(2,3)u,v,6(x).

    Using (4.3), we get

    α=(F(2,3)u,v,5)1L(2,3)u,v,6(x)[00001]=adj(F(2,3)u,v,5)[00001]=[1i3u(x)i26u2(x)i3[10u3(x)+3v(x)]i4[15u4(x)+12u(x)v(x)]].

    Hence by Table 1, it is verified that the first column of (˜F(2,3)u,v,6)1 is

    [αf]=[L(2,3)u,v,1(x)iL(2,3)u,v,2(x)i2L(2,3)u,v,3(x)i3L(2,3)u,v,4(x)i4L(2,3)u,v,5(x)i6L(2,3)u,v,6(x)].

    Example 4.9. We verify the Theorem 4.7 by taking (p,r)=(4,3) and j=5

    ˜D(4,3)u,v,6=[1000003u(x)1000002u(x)10000053u(x)10000032u(x)103v(x)00075u(x)1].

    Let us consider

    (˜D(4,3)u,v,6)1=[[α]j×1[L]j×j[d]1×1[βT]1×j].

    Using (4.4), we have

    det(D(4,3)u,v,5)=(1)5ddet(˜D(4,3)u,v,6),

    and further applying (3.2), we get

    d=L(4,3)u,v,6(x).

    Using (4.3), we get

    α=(D(4,3)u,v,5)1L(4,3)u,v,6(x)[00001]=adj(D(4,3)u,v,5)[00001]=[13u(x)6u2(x)10u3(x)15u4(x)].

    Hence by Table 1, it is verified that the first column of (˜D(4,3)u,v,6)1 is

    [αd]=[L(4,3)u,v,1(x)L(4,3)u,v,2(x)L(4,3)u,v,3(x)L(4,3)u,v,4(x)L(4,3)u,v,5(x)L(4,3)u,v,6(x)].

    The authors declare there are no conflicts of interest in this paper.



    [1] N. D. Cahill, J. R. D'Errico, D. A. Narayan, Fibonacci determinants, College Math. J., 33 (2002), 221-225. doi: 10.1080/07468342.2002.11921945
    [2] Y. H. Chen, C. Y. Yu, A new algorithm for computing the inverse and the determinant of a Hessenberg matrix, Appl. Math. Comput., 218 (2011), 4433-4436.
    [3] P. Moree, Convoluted convolved Fibonacci numbers, J. Integer Seq., 7 (2004), 1-14.
    [4] A. A. Öcal, N. Tuglu, E. Altinişik, On the representation of k-generalized Fibonacci and Lucas numbers, Appl. Math. Comput., 170 (2005), 584-596.
    [5] J. L. Ramírez, Some properties of convolved k-Fibonacci numbers, ISRN Combinatorics., 2013 (2013), 1-6.
    [6] A. Şahin, J. L. Ramírez, Determinantal and permanental representations of convolved Lucas polynomials, Appl. Math. Comput., 281 (2016), 314-322.
    [7] X. Ye, Z. Zhang, A common generalization of convolved generalized Fibonacci and Lucas polynomials and its applications, Appl. Math. Comput., 306 (2017), 31-37.
  • Reader Comments
  • © 2020 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(3547) PDF downloads(312) Cited by(0)

Figures and Tables

Tables(2)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog