In this paper, we provide combinatorial interpretations for some determinantal identities involving Fibonacci numbers. We use the method due to Lindström-Gessel-Viennot in which we count nonintersecting n-routes in carefully chosen digraphs in order to gain insight into the nature of some well-known determinantal identities while allowing room to generalize and discover new ones.

We use both Abel’s lemma on summation by parts and Zeilberger’s algorithm to find recurrence relations for definite summations. The role of Abel’s lemma can be extended to the case of linear difference operators with polynomial coefficients. This approach can be used to verify and discover identities involving harmonic numbers and derangement numbers. As examples, we use the Abel-Zeilberger alg...

In this paper, we study the relations between the Bell matrix and the Fibonacci matrix, which provide a unified approach to some lower triangular matrices, such as the Stirling matrices of both kinds, the Lah matrix, and the generalized Pascal matrix. To make the results more general, the discussion is also extended to the generalized Fibonacci numbers and the corresponding matrix. Moreover, ba...

The Fibonacci sequence {Fn} is defined by the recurrence relation Fn = Fn−1+ Fn−2, for n ≥ 2 with F0 = 0 and F1 = 1. The Lucas sequence {Ln} , considered as a companion to Fibonacci sequence, is defined recursively by Ln = Ln−1 + Ln−2, for n ≥ 2 with L0 = 2 and L1 = 1. It is well known that F−n = (−1)Fn and L−n = (−1)Ln, for every n ∈ Z. For more detailed information see [9],[10]. This paper pr...

Abstract We consider an identity relating Fibonacci numbers to Pascal’s triangle discovered by G. E. Andrews. Several authors provided proofs of this identity, all of them rather involved or else relying on sophisticated number theoretical arguments. We not only give a simple and elementary proof, but also show the identity generalizes to arrays other than Pascal’s triangle. As an application w...

In this paper, we investigate the generalized Fibonacci (Horadam) polynomials and deal with, in detail, two special cases which call them $(r,s)$-Fibonacci $(r,s)$-Lucas polynomials. We present Binet's formulas, generating functions, Simson's summation formulas for these polynomial sequences. Moreover, give some identities matrices associated with Finally, several expressions combinatorial resu...