d−Fibonacci and d−Lucas polynomials

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.