2007
DOI: 10.1216/rmjm/1199649832
|View full text |Cite
|
Sign up to set email alerts
|

On the Permanents of Some Tridiagonal Matrices with Applications to the Fibonacci and Lucas Numbers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
16
0

Year Published

2007
2007
2023
2023

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 24 publications
(16 citation statements)
references
References 5 publications
0
16
0
Order By: Relevance
“…Number theoretic properties such as these obtained from Fibonacci numbers relevant to this paper have been studied by many authors [1,4,7,11,12,20,23,27,28]. Now we define the generalized Fibonacci-circulant-Hurwitz numbers and then, we obtain their miscellaneous properties using the generating matrix and the generating function of these numbers.…”
Section: Introductionmentioning
confidence: 99%
“…Number theoretic properties such as these obtained from Fibonacci numbers relevant to this paper have been studied by many authors [1,4,7,11,12,20,23,27,28]. Now we define the generalized Fibonacci-circulant-Hurwitz numbers and then, we obtain their miscellaneous properties using the generating matrix and the generating function of these numbers.…”
Section: Introductionmentioning
confidence: 99%
“…Lehmer [7] demonstrated some generalizations for the permanent of a tridiagonal matrix by using expansion by minors. Kılıc and Tascı [8] presented some relationships between the permanents of some tridiagonal matrices and some famous number sequences. Jina and Trojovsky [9] presented new results about the relationships between the permanents of some tridiagonal matrices and the Fibonacci numbers.…”
Section: Introductionmentioning
confidence: 99%
“…In [11], the authors presented a nice result involving the permanent of an (−1, 0, 1)−matrix and the Fibonacci number F n+1 . The authors then explored similar directions involving the positive subscripted Fibonacci and Lucas Numbers as well as their uncommon negatively subscripted counterparts.…”
Section: Introductionmentioning
confidence: 99%