Abstract
Riordan arrays give us an intuitive method of solving combinatorial problems. They also help to apprehend number patterns and to prove many theorems. In this paper, we consider the Pascal matrix, define a new generalization of Fibonacci and Lucas polynomials called $d-$Fibonacci and $d-$Lucas polynomials (respectively) and provide their properties. Combinatorial identities are obtained for the defined polynomials and by using Riordan method we get factorizations of Pascal matrix involving $d-$Fibonacci polynomials.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
