2003
DOI: 10.1016/s0166-218x(03)00331-7
|View full text |Cite
|
Sign up to set email alerts
|

Some combinatorial identities via Fibonacci numbers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

1
27
0
3

Year Published

2007
2007
2023
2023

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 25 publications
(31 citation statements)
references
References 3 publications
1
27
0
3
Order By: Relevance
“…In this section we want to investigate correlation between the matrix F (a,b,−1) n and Pascal matrices. Since rank(F (a,b,−1) n ) = n−1 and rank(P n ) = n, it is not possible to use P n in the usual manner as in [23], [32], [21]. For this purpose we introduce the following definition of Pascal matrices of type s. …”
Section: Generalized Fibonacci Matrix and Pascal Matricesmentioning
confidence: 99%
“…In this section we want to investigate correlation between the matrix F (a,b,−1) n and Pascal matrices. Since rank(F (a,b,−1) n ) = n−1 and rank(P n ) = n, it is not possible to use P n in the usual manner as in [23], [32], [21]. For this purpose we introduce the following definition of Pascal matrices of type s. …”
Section: Generalized Fibonacci Matrix and Pascal Matricesmentioning
confidence: 99%
“…The inverse of F n was also given as follows: In fact, formula (3) is an immediate consequence of the isomorphism between lower formal power series and lower triangular Toeplitz matrices. In [5], Lee et al obtained the following result:…”
Section: Introductionmentioning
confidence: 98%
“…In this short note, we give a second factorization of the Pascal matrix which was apparently missed by the authors in [5].…”
Section: Introductionmentioning
confidence: 99%
“…Pascal matrices, binomial coefficients, Fibonomial coefficients, F-nomial coefficients, their generalizations and factorizations are studied by many authors [2,3,[7][8][9][10][11][12]14,[18][19][20][21].…”
Section: Introductionmentioning
confidence: 99%