You are currently viewing a new version of our website. To view the old version click .
Symmetry
  • Article
  • Open Access

20 February 2019

New Families of Three-Variable Polynomials Coupled with Well-Known Polynomials and Numbers

,
,
and
1
Faculty of Art and Science, Department of Mathematics, Zonguldak Bülent Ecevit University, Zonguldak 67100, Turkey
2
Faculty of Science, Department of Mathematics, Gazi University, Teknikokullar, Ankara 06500, Turkey
3
Department of Mathematics, Kwangwoon University, Seoul 139-701, Korea
*
Author to whom correspondence should be addressed.
This article belongs to the Special Issue Current Trends in Symmetric Polynomials with their Applications

Abstract

In this paper, firstly the definitions of the families of three-variable polynomials with the new generalized polynomials related to the generating functions of the famous polynomials and numbers in literature are given. Then, the explicit representation and partial differential equations for new polynomials are derived. The special cases of our polynomials are given in tables. In the last section, the interesting applications of these polynomials are found.

1. Introduction

In literature, the Fibonacci and Lucas numbers have been studied extensively and some authors tried to enhance and derive some directions to mathematical calculations using these special numbers [,,]. By favour of the Fibonacci and Lucas numbers, one of these directions verges on the tribonacci and the tribonacci-Lucas numbers. In fact, M. Feinberg in 1963 has introduced the tribonacci numbers and then derived some properties for these numbers in [,,,]. Elia in [] has given and investigated the tribonacci-Lucas numbers. The tribonacci numbers T n for any integer n > 2 are defined via the following recurrence relation
T n = T n 1 + T n 2 + T n 3 ,
with the initial values T 0 = 0 , T 1 = 1 , and T 2 = 1 . Similarly, by way of the initial values K 0 = 3 , K 1 = 1 , and K 2 = 3 , the tribonacci-Lucas numbers K n are given by the recurrence relation
K n = K n 1 + K n 2 + K n 3 .
By dint of the above extensions, the tribonacci and tribonacci-Lucas numbers are introduced with the help of the following generating functions, respectively:
n = 0 T n t n = t 1 t t 2 t 3 ,
and
n = 0 K n t n = 3 2 t t 2 1 t t 2 t 3 .
Moreover, some authors define a large class of polynomials by using the Fibonacci and the tribonacci numbers [,,,]. Firstly, the well-known Fibonacci polynomials are defined via the recurrence relation
F n + 1 ( x ) = x F n ( x ) + F n 1 ( x ) ,
with F 0 ( x ) = 0 , F 1 ( x ) = 1 . The well-known Lucas polynomials are defined with the help of the recurrence relation
L n + 1 ( x ) = x L n ( x ) + L n 1 ( x ) ,
with L 0 ( x ) = 2 , L 1 ( x ) = x .
Fibonacci or Fibonacci-like polynomials have been studied by many mathematicians for many years. Recently, in [], Kim et al. kept in mind the sums of finite products of Fibonacci polynomials and of Chebyshev polynomials of the second kind and obtained Fourier series expansions of functions related to them. In [], Kim et al. studied the convolved Fibonacci numbers by using the generating functions of them and gave some new identities for the convolved Fibonacci numbers. In [], Wang and Zhang studied some sums of powers Fibonacci polynomials and Lucas polynomials. In [], Wu and Zhang obtained the several new identities involving the Fibonacci polynomials and Lucas polynomials.
Afterwards, by giving the Pell and Jacobsthal polynomials, in 1973, Hoggatt and Bicknell [] introduced the tribonacci polynomials. The tribonacci polynomials are defined by the recurrence relation for n 0 ,
t n + 3 ( x ) = x 2 t n + 2 ( x ) + x t n + 1 ( x ) + t n ( x ) ,
where t 0 ( x ) = 0 , t 1 ( x ) = 1 , and t 2 ( x ) = x 2 . The tribonacci-Lucas polynomials are defined by the recurrence relation for n 0 ,
k n + 3 ( x ) = x 2 k n + 2 ( x ) + x k n + 1 ( x ) + k n ( x ) ,
where k 0 ( x ) = 3 , k 1 ( x ) = x 2 , and k 2 ( x ) = x 4 + 2 x , respectively. Here we note that t n ( 1 ) = T n which is the tribonacci numbers and k n ( 1 ) = K n which is the tribonacci-Lucas numbers. Also for these polynomials, we have the generating function as follows:
n = 0 t n ( x ) t n = t 1 x 2 t x t 2 t 3 ,
and
n = 0 k n ( x ) t n = 3 2 x 2 t x t 2 1 x 2 t x t 2 t 3 .
On the other hand, some authors try to define the second and third variables of these polynomials with the help of these numbers. For example [], for integer n > 2 , the recurrence relations of the trivariate Fibonacci and Lucas polynomials are as follows:
H n ( x , y , z ) = x H n 1 ( x , y , z ) + y H n 2 ( x , y , z ) + z H n 3 ( x , y , z ) ,
with H 0 ( x , y , z ) = 0 , H 1 ( x , y , z ) = 1 , H 2 ( x , y , z ) = x and
K n ( x , y , z ) = x K n 1 ( x , y , z ) + y K n 2 ( x , y , z ) + z K n 3 ( x , y , z ) ,
with K 0 ( x , y , z ) = 3 , K 1 ( x , y , z ) = x , K 2 ( x , y , z ) = x 2 + 2 y , respectively. Also for these, we have the generating functions as follows:
n = 0 H n ( x , y , z ) t n = t 1 x t y t 2 z t 3 ,
and
n = 0 K n ( x , y , z ) t n = 3 2 x t y t 2 1 x t y t 2 z t 3 .
After that, Ozdemir and Simsek [] give the family of two-variable polynomials, reducing some well-known polynomials and obtaining some properties of these polynomials. In light of these polynomials, we introduce the families of three-variable polynomials with the new generalized polynomials reduced to the generating functions of the famous polynomials and numbers in literature. Then, we obtain the explicit representations and partial differential equations for new polynomials. The special cases of our polynomials are given in tables. Also the last section, we give the interesting applications of these polynomials.

2. The New Generalized Polynomials: Definitions and Properties

Now, we introduce the original and wide generating functions reduce the well-known polynomials and the well-known numbers such as the trivariate Fibonacci and Lucas polynomials, the tribonacci and the tribonacci-Lucas polynomials, the tribonacci and the tribonacci-Lucas numbers, and so on.
Firstly, some properties of these functions are investigated. Then, in the case of the new generating function, we give some properties the particular well-known polynomials as tables.
Via the following generating functions, a new original and wide family of three-variable polynomials denoted by S j : = S j ( x , y , z ; k , m , n , c ) is defined as follows:
T : = M ( t ; x , y , z ; k , m , n , c ) = j = 0 S j t j = 1 1 x k t y m t m + n z c t m + n + c ,
where k , m , n , c N { 0 } , and x k t + y m t m + n + z c t m + n + c < 1 . Now we derive the explicit representation for polynomials S j . By means of Taylor series of the generating function of the right hand side of (13), we can write
T = j = 0 S j t j = j = 0 x k t + y m t m + n + z c t m + n + c j .
After that, using the binomial expansion and taking j + s instead of j , we get
T = j = 0 s = 0 j + s s x k t j t m + n s y m + z c t c s .
Lastly, using the expansion of y m + z c t c s , taking u + s instead of s , taking j ( m + n + c ) u instead of j and taking j ( m + n ) s instead of j , respectively, we have
T = j = 0 s = 0 j n + m u = 0 j ( m + n ) s n + m + c j ( n + m 1 ) s ( n + m + c 1 ) u s + u s + u u x k j ( n + m ) ( s + u ) c u z c u y m s t j .
Thus after the equalization of coefficients of t j , we obtain
S j = s = 0 j n + m u = 0 j ( m + n ) s n + m + c j ( n + m 1 ) s ( n + m + c 1 ) u s + u s + u u x k j ( n + m ) ( s + u ) c u z c u y m s .
Note that for z = 0 , our polynomials reduces to the polynomials Equation (4) [].
Remark 1.
As a similar to Theorem 2.3 in [], we can write the following relation
S j ( 2 x , 1 , 0 ; 1 , 1 , 1 , c ) = r = 0 j P j r ( x ) P r ( x ) ,
where P r ( x ) are the Legendre polynomials.
To obtain other wide family of well-known polynomials, we define the second new generating function for the family of the polynomials W j : = W j ( x , y , z ; k , m , n , c ) as follows
R : = R ( t ; x , y , z ; k , m , n , c ) = M ( t ; x , y , z ; k , m , n , c ) t n = t n 1 x k t y m t m + n z c t m + n + c = j = 0 W j t j ,
where k , m , n , c N { 0 } , and x k t + y m t m + n + z c t m + n + c < 1 . Similarly for z = 0 , our polynomials reduces to the polynomials in (5) in []. Now we give some special case. Firstly taking k = m = n = c = 1 in (15), we give the generating function
t 1 x t y t 2 z t 3 = j = 0 W j ( x , y , z ; 1 , 1 , 1 , 1 ) t j ,
where W j ( x , y , z ; 1 , 1 , 1 , 1 ) = H j ( x , y , z ) , which are trivariate Fibonacci polynomials in (11). Secondly, writing k = m = n = c = 1 and x x 2 , y x , z 1 , we have the generating function
t 1 x 2 t x t 2 t 3 = j = 0 W j ( x 2 , x , 1 ; 1 , 1 , 1 , 1 ) t j ,
where W j ( x 2 , x , 1 ; 1 , 1 , 1 , 1 ) = t j ( x ) which are the tribonacci polynomials in (7). In the above generating function, for x = 1 , we find the generating function of the tribonacci numbers in (3). Now, we give other special cases as the following table related to (15).
Now, we define a new family of the polynomials denoted by K j : = K j ( x , y , z ; k , m , n , c ) via the generating function
j = 0 K j t j = α ( t ; x , y ) β ( t ; x , y ) t n 1 x k t y m t m + n z c t m + n + c ,
where k , m , n , c N { 0 } , α ( t ; x , y ) and β ( t ; x , y ) are arbitrary polynomials depending on t , x , y and x k t + y m t m + n + z c t m + n + c < 1 . Thirdly, via (16), we give
3 M ( t ; x , y , z ; 1 , 1 , 1 , 1 ) 2 x R ( t ; x , y , z ; 1 , 1 , 1 , 1 ) y t R ( t ; x , y , z ; 1 , 1 , 1 , 1 ) = 3 2 x t y t 2 1 x t y t 2 z t 3 = j = 0 K j ( x , y , z ) t j ,
where K j ( x , y , z ) are the trivariate Lucas polynomials in (12). Due to the last equation, we have the polynomial representation
3 S j ( x , y , z ; 1 , 1 , 1 , 1 ) 2 x W j ( x , y , z ; 1 , 1 , 1 , 1 ) y t W j ( x , y , z ; 1 , 1 , 1 , 1 ) = K j ( x , y , z ) .
In (17) substituting x x 2 , y x , z 1 , we get
3 S j ( x 2 , x , 1 ; 1 , 1 , 1 , 1 ) 2 x W j ( x 2 , x , 1 ; 1 , 1 , 1 , 1 ) y t W j ( x 2 , x , 1 ; 1 , 1 , 1 , 1 ) = k j ( x ) ,
where k j ( x ) are the tribonacci-Lucas polynomials in (6). In the above representation, for x = 1 , we find the generating function of the tribonacci-Lucas numbers in (4).
Now, we give other special cases as Table 1 and Table 2 related to (15) and (16) respectively.
Table 1. Special cases of W j .
Table 2. Special cases of K j .

3. Partial Differential Equations for Polynomials in (13)

With the help of the derivatives of these generating functions with regard to some variable and algebraic arrangements, we derive some partial differential equations for new polynomials. Taking the derivative with regard to x , y , z , t of the generating function in (13), respectively, they hold
x M = k x k 1 t M 2 ,
y M = m y m 1 t n + m M 2 ,
z M = c z c 1 t n + m + c M 2 ,
t M = x k + y m ( n + m ) t n + m 1 + z c ( n + m + c ) t n + m + c 1 M 2 .
From (13) and (18), we get the following theorem.
Theorem 1.
For j 0 , we have the first relation as follows:
x S j = k x k 1 l = 0 j 1 S j l 1 S l .
Combining (13) and (19), we have the next theorem.
Theorem 2.
For j m + n , we have the second relation as follows:
y S j = l = 0 j m n m y m 1 S j m n l S l .
With the help of considering (13) and (20), we get the next result.
Theorem 3.
For j m + n + c , we have the third relation as follows:
z S j = c z c 1 l = 0 j m n c S j m n c l S l .
Lastly, by means of (13) and (21), we get the following result.
Theorem 4.
(i) 
For m + n 1 j m + n + c 1 , then we obtain
( j + 1 ) S j + 1 = x k l = 0 j S j l S l + y m ( n + m ) l = 0 j m n + 1 S l S j m n l + 1 .
(ii) 
For j m + n 1 , then we derive
( j + 1 ) S j + 1 = x k l = 0 j S j l S l .
(iii) 
For j m + n + c 1 , then we get
( j + 1 ) S j + 1 = x k l = 0 j S j l S l + y m ( n + m ) l = 0 j m n + 1 S l S j m n l + 1 + z c ( n + m + c ) l = 0 j m n c + 1 S l S j m n c l + 1 .
After that, using the partial differential equations in (18)–(21), we get the new partial differential equation for S j .
Theorem 5.
For j 0 , we have
j S j = x k x S j + n + m m y y S j + n + m + c c z z S j .
Proof. 
Combining (18)–(21), we get
t M x k t x M = n + m m y t y M + n + m + c c z t z M .
In the above, using (13), we get the desired result. □

4. Some Applications of Generating Functions

In this section, by using these functions, some identities connected with these polynomials are derived. Furthermore, in the special case, we show that these identities reduce to the well-known sum identities connected with the well-known numbers in literature.
Case 1.
Taking t = 1 a in (15) for a > 1 , we get the following equation
j = 0 W j a j = a m + c a m + n + c x k a m + n + c 1 y m a c z c .
(i)
Substituting a = 2 , x x 2 , y x , z 1 and k = m = n = c = 1 in (22), we obtain the relation for the tribonacci polynomials as
j = 0 t j ( x ) 2 j = 4 7 4 x 2 2 x .
Writing x = 1 in (23), we have
j = 0 T j 2 j = 4 ,
where T j are the tribonacci numbers.
(ii)
Taking a = 10 , x x 2 , y x , z 1 and k = m = n = c = 1 in (22), we get
j = 0 T j ( x ) 10 j + 2 = 1 999 100 x 2 10 x ,
and writing x = 1 (24), we get for the tribonacci numbers
j = 0 T j 10 j + 2 = 1 889 .
(iii)
Substituting x x , y 1 , z 0 , a = 2 , and k = m = n = c = 1 into (22), we get for the Fibonacci polynomials
j = 0 F j ( x ) 2 j = 2 3 2 x ,
which was given in []. Then taking x = 1 in (25), we have for Fibonacci numbers
j = 0 F j 2 j = 2 ,
which was given in [].
(iv)
Substituting x x , y 1 , z 0 , a = 3 , and k = m = n = c = 1 in (22), we get for the Fibonacci polynomials
j = 0 F j ( x ) 3 j + 1 = 1 8 3 x .
Taking x = 1 in (26), we get for the Fibonacci numbers
j = 0 F j 3 j + 1 = 1 5 = 1 F 5 ,
was given in page 424 in [].
(v)
Substituting x x , y 1 , z 0 , a = 8 , and k = m = n = c = 1 in (22), we get for the Fibonacci polynomials
j = 0 F j ( x ) 8 j + 1 = 1 63 3 x .
Taking x = 1 in (27), we get for the Fibonacci numbers
j = 0 F j 8 j + 1 = 1 55 = 1 F 10 ,
was given in page 424 in [].
(vi)
Substituting x x , y 1 , z 0 , a = 10 , and k = m = n = c = 1 in (22), we get for the Fibonacci polynomials
j = 0 F j ( x ) ( 10 ) j + 1 = 1 99 + 10 x .
Taking x = 1 in (28), we get for the Fibonacci numbers
j = 0 F j ( 10 ) j + 1 = 1 109 ,
was given in page 427 in [].
(vii)
Substituting x 2 x , y 1 , z 0 , a = 3 , and k = m = n = c = 1 in (22), we get
j = 0 P j ( x ) 3 j + 1 = 1 8 6 x ,
where P j ( x ) are the Pell polynomials. Then taking x = 1 in (29), we have
j = 0 P j 3 j + 1 = 1 2 ,
where P j are the Pell numbers.
(viii)
Substituting x 1 , y 2 y , z 0 , a = 3 , and k = m = n = c = 1 in (22), we get
s = 0 J s ( x ) 3 s + 1 = 1 6 2 y ,
where J s ( x ) are the Jacobsthal polynomials. Then taking y = 1 in (30), we have
s = 0 J s 3 s + 1 = 1 4 ,
where J s are the Jacobsthal numbers.
Case 2.
Taking t = 1 a in (16) for a > 1 , we get the following equation
j = 0 K j a j = a m + n + c α ( t ; x , y ) a m + c β ( t ; x , y ) a m + n + c x k a m + n + c 1 y m a c z c .
(i)
Substituting x x 2 , y x , z 1 , a = 2 , and k = m = n = c = 1 , α ( t ; x , y ) = 3 , β ( t ; x , y ) = 2 x 2 + x t in (31), we get
j = 0 k j ( x ) 2 j = 24 8 x 4 2 x 2 7 4 x 2 2 x ,
where k j ( x ) are the tribonacci-Lucas polynomials. Then taking x = 1 in (32), we have
j = 0 k j 2 j + 1 = 7 ,
where k j ( x ) are the tribonacci-Lucas numbers.
(ii)
Substituting x x , y 1 , z 0 , a = 2 , and k = m = n = c = 1 , α ( t ; x , y ) = 2 , β ( t ; x , y ) = x in (31), we get
j = 0 L j ( x ) 2 j + 1 = 4 x 3 2 x ,
where L j ( x ) are the Lucas polynomials. Then taking x = 1 in (33), we have
j = 0 L j 2 j + 1 = 3 ,
where L j are the Lucas numbers.
(iii)
Substituting x x , y 1 , z 0 , a = 10 , and k = m = n = c = 1 , α ( t ; x , y ) = 2 , β ( t ; x , y ) = x in (31), we get
j = 0 L j ( x ) 10 j = 200 10 x 99 10 x ,
where L j ( x ) are the Lucas polynomials. Then taking x = 1 in (34), for L j are the Lucas numbers, we have
j = 0 L j 10 j + 1 = 19 89 = L 6 L 1 F 11
was given in page 427 in [].
(iv)
Substituting x x , y 1 , z 0 , a = 3 , and k = m = n = c = 1 , α ( t ; x , y ) = 2 , β ( t ; x , y ) = x in (31), we get
j = 0 L j ( x ) 3 j + 1 = 6 x 8 3 x ,
and taking x = 1 in (35), we have
j = 0 L j 3 j + 1 = 1 .
(v)
Substituting x x , y 1 , z 0 , a = 8 , and k = m = n = c = 1 , α ( t ; x , y ) = 2 , β ( t ; x , y ) = x in (31), we get
j = 0 L j ( x ) 8 j + 1 = 16 x 63 8 x ,
and taking x = 1 in (36), we have
j = 0 L j 8 j + 1 = 3 11 = L 2 L 5 .
(vi)
Substituting x x , y 1 , z 0 , a = 10 , and k = m = n = c = 1 , α ( t ; x , y ) = 2 , β ( t ; x , y ) = x in (31), we get
j = 0 L j ( x ) ( 10 ) j + 1 = 20 x 99 + 10 x .
Taking x = 1 in (37), we have
j = 0 L j ( 10 ) j + 1 = 21 109 ,
was given in page 427 in [].
(vii)
Substituting x 2 x , y 1 , z 0 , a = 5 , and k = m = n = c = 1 , α ( t ; x , y ) = 2 , β ( t ; x , y ) = 2 x in (31), we get
j = 0 Q j ( x ) 5 j + 1 = 5 x 12 5 x ,
where Q j ( x ) are the Pell Lucas polynomials. Then taking x = 1 in (38), we have
j = 0 Q j 5 j + 1 = 4 7 ,
where Q j are the Pell Lucas numbers.
(viii)
Substituting x 1 , y 2 y , z 0 , a = 3 , and k = m = n = c = 1 , α ( t ; x , y ) = 2 , β ( t ; x , y ) = 1 in (31), we get
s = 0 j s ( y ) 3 s + 1 = 5 6 2 y ,
where j s ( y ) are the Jocabsthal Lucas polynomials. Then taking y = 1 in (39), we have
s = 0 j s 3 s + 1 = 5 4 ,
where j s is Jocabsthal Lucas number.
(ix)
Substituting x 2 , y 2 , z 1 , a = 4 , and k = m = n = c = 1 , α ( t ; x , y ) = t , β ( t ; x , y ) = t in (31), for the square of Fibonacci numbers F j , we get
j = 0 F j 2 4 j = 12 25 ,
was given in page 439 in [].
Let us give Table 3 and Table 4 containing the obtained formulas for simplify reading.
Table 3. Special cases of Equation (22) for k = m = n = c = 1 .
Table 4. Special cases of Equation (31) for k = m = n = c = 1 .

5. Conclusions

In the present paper, we considered the families of three-variable polynomials with the generalized polynomials reduce to generating function of the polynomials and numbers in the literature. In Section 2, we gave special polynomials and numbers as the tables related to (15) and (16). Then we obtained the explicit representations and partial differential equations for new polynomials. In the last section, we gave the interesting sum identities related to the well-known numbers and polynomials in the literature.
For all of the resuts, if the appropriate values given in the tables are taken, many infinite sums including various polynomials are obtained.
In recent years, some authors use the well-known polynomials and numbers in the applications of ordinary and fractional differential equations and difference equations (for example [,,,]). Therefore, our new families of three variables polynomials could been used for future works of some application areas such as mathematical modelling, physics, engineering, and applied sciences.

Author Contributions

All authors contributed equally to this work. All authors read and approved the final manuscript.

Funding

This research received no external funding.

Acknowledgments

The authors would like to express their sincere gratitude to the referees for their valuable comments which have significantly improved the presentation of this paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Koshy, T. Fibonacci and Lucas Numbers with Applications; John Wiley and Sons Inc.: New York, NY, USA, 2001. [Google Scholar]
  2. Nalli, A.; Haukkanen, P. On generalized Fibonacci and Lucas polynomials. Chaos Solitons Fractals 2009, 42, 3179–3186. [Google Scholar] [CrossRef]
  3. Vajda, S. Fibonacci and Lucas Numbers, and the Golden Section, Theory and Applications; Ellis Horwood Limited: Chichester, UK, 1989. [Google Scholar]
  4. Elia, M. Derived sequences, the tribonacci recurrence and cubic forms. Fibonacci Q. 2001, 39, 107–109. [Google Scholar]
  5. Feinberg, M. Fibonacci-tribonacci. Fibonacci Q. 1963, 3, 70–74. [Google Scholar]
  6. Hoggatt, V.E., Jr.; Bicknell, M. Generalized Fibonacci polynomials. Fibonacci Q. 1973, 11, 457–465. [Google Scholar]
  7. Tan, M.; Zhang, Y. A note on bivariate and trivariate Fibonacci polynomials. Southeast Asian Bull. Math. 2005, 29, 975–990. [Google Scholar]
  8. Kocer, E.G.; Gedikli, H. Trivariate Fibonacci and Lucas polynomials. Konuralp J. Math. 2016, 4, 247–254. [Google Scholar]
  9. Tuglu, N.; Kocer, E.G.; Stakhov, A. Bivariate Fibonacci like p-polynomials. Appl. Math. Comput. 2011, 217, 10239–10246. [Google Scholar] [CrossRef]
  10. Kim, T.; Kim, D.S.; Dolgy, D.V.; Park, J.W. Sums of finite products of Chebyshev polynomials of the second kind and of Fibonacci polynomials. J. Inequal. Appl. 2018, 148. [Google Scholar] [CrossRef] [PubMed]
  11. Kim, T.; Dolgy, D.V.; Kim, D.S.; Seo, J.J. Convolved Fibonacci numbers and their applications. arXiv, 2017; arXiv:1607.06380. [Google Scholar]
  12. Wang, T.; Zhang, W. Some identities involving Fibonacci, Lucas polynomials and their applications. Bull. Math. Soc. Sci. Math. Roum. 2012, 55, 95–103. [Google Scholar]
  13. Wu, Z.; Zhang, W. Several identities involving the Fibonacci polynomials and Lucas polynomials. J. Inequal. Appl. 2013, 2013, 14. [Google Scholar] [CrossRef]
  14. Ozdemir, G.; Simsek, Y. Generating functions for two-variable polynomials related to a family of Fibonacci type polynomials and numbers. Filomat 2016, 30, 969–975. [Google Scholar] [CrossRef]
  15. Lee, G.Y.; Asci, M. Some properties of the (p,q)-Fibonacci and (p,q)-Lucas polynomials. J. Appl. Math. 2012, 2012, 264842. [Google Scholar] [CrossRef]
  16. Horadam, A.F. Chebyshev and Fermat polynomials for diagonal functions. Fibonacci Q. 1979, 17, 328–333. [Google Scholar]
  17. Lidl, R.; Mullen, G.; Tumwald, G. Dickson Polynomials. In Pitman Monographs and Surveys in Pure and Applied Mathematics; Longman Scientific and Technical: Essex, UK, 1993; Volume 65. [Google Scholar]
  18. Shannon, A.G.; Horadam, A.F. Some relationships among Vieta, Morgan-Voyce and Jacobsthal polynomials. In Applications of Fibonacci Numbers; Howard, F.T., Ed.; Kluwer Academic Publishers: Dordrecht, The Netherlands, 1999; pp. 307–323. [Google Scholar]
  19. Cheon, G.-S.; Kim, H.; Shapiro, L.W. A generalization of Lucas polynomial sequence. Discret. Appl. Math. 2009, 157, 920–927. [Google Scholar] [CrossRef]
  20. Bulut, H.; Pandir, Y.; Baskonus, H.M. Symmetrical hyperbolic Fibonacci function solutions of generalized Fisher equation with fractional order. AIP Conf. Proc. 2013, 1558, 1914–1918. [Google Scholar]
  21. Mirzaee, F.; Hoseini, S.F. Solving singularly perturbed differential-difference equations arising in science and engineering whit Fibonacci polynomials. Results Phys. 2013, 3, 134–141. [Google Scholar] [CrossRef]
  22. Mirzaee, F.; Hoseini, S.F. Solving systems of linear Fredholm integro-differential equations with Fibonacci polynomials. Ain. Shams Eng. 2014, 5, 271–283. [Google Scholar] [CrossRef]
  23. Kurt, A.; Yalinbash, S.; Sezer, M. Fibonacci-collocation method for solving high-order linear Fredholm integro-differential-difference equations. Int. J. Math. Math. Sci. 2013, 2013, 486013. [Google Scholar] [CrossRef]

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.