some properties of the -fibonacci and -lucas polynomials斐波那契和卢卡斯多项式的一些属性.pdfVIP

Hindawi Publishing Corporation Journal of Applied Mathematics Volume 2012, Article ID 264842, 18 pages doi:10.1155/2012/264842 Research Article Some Properties of the p, q-Fibonacci and p, q-Lucas Polynomials GwangYeon Lee1 and Mustafa Asci2 1 Department of Mathematics, Hanseo University, Seosan, Chungnam 356-706, Republic of Korea 2 Department of Mathematics, Science and Arts Faculty, Pamukkale University, Denizli, Turkey Correspondence should be addressed to GwangYeon Lee, gylee@hanseo.ac.kr Received 23 May 2012; Revised 10 July 2012; Accepted 11 July 2012 Academic Editor: Shan Zhao Copyright q 2012 G. Lee and M. Asci. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Riordan arrays are useful for solving the combinatorial sums by the help of generating functions. Many theorems can be easily proved by Riordan arrays. In this paper we consider the Pascal matrix and define a new generalization of Fibonacci polynomials called p, q-Fibonacci polynomials. We obtain combinatorial identities and by using Riordan method we get factorizations of Pascal matrix involving p, q-Fibonacci polynomials. 1. Introduction Large classes of polynomials can be defined by Fibonacci-like recurrence relation and yield Fibonacci numbers 1. Such polynomials, called the Fibonacci polynomials, were studied in 1883 by the Belgian Mathematician Eugene Charles Catalan and the German Mathematician E. Jacobsthal. The polynomials fn x studied by Catalan are defined by the recurrence relation f x xf x f x , 1.1 n n−1 n−2 where f x 1, f x x