dc.contributor.author |
Köme, Cahit |
|
dc.date.accessioned |
2022-06-28T06:51:57Z |
|
dc.date.available |
2022-06-28T06:51:57Z |
|
dc.date.issued |
2022-06 |
|
dc.identifier.uri |
http://hdl.handle.net/20.500.11787/7356 |
|
dc.description.abstract |
Matrix factorizations have been widely used in recent years, especially in engineering problems, to facilitate performance-requiring computations. In this paper, we investigate some interesting relationships between some combinatorial matrices such as Pascal matrix, Stirling matrices and k-order Fibonacci matrices. We give factorizations and inverse factorizations of the Pascal and Stirling matrices via k-order Fibonacci matrices. Moreover, we derive various combinatorial properties by using relationships between these matrices. Finally, compared to previous studies, we present more general results for specific values of k |
tr_TR |
dc.language.iso |
eng |
tr_TR |
dc.publisher |
Miskolc Mathematical Notes |
tr_TR |
dc.relation.isversionof |
http://dx.doi.org/10.18514/MMN.2022.3683 |
tr_TR |
dc.rights |
info:eu-repo/semantics/openAccess |
tr_TR |
dc.subject |
Pascal matrix |
tr_TR |
dc.subject |
Stirling matrix |
tr_TR |
dc.subject |
k-order Fibonacci matrix |
tr_TR |
dc.subject |
factorization |
tr_TR |
dc.title |
Some combinatorial identities via k-order Fibonacci matrices |
tr_TR |
dc.type |
article |
tr_TR |
dc.relation.journal |
Miskolc Mathematical Notes |
tr_TR |
dc.contributor.department |
Matematik |
tr_TR |
dc.contributor.authorID |
116690 |
tr_TR |
dc.identifier.volume |
23 |
tr_TR |
dc.identifier.issue |
1 |
tr_TR |
dc.identifier.startpage |
281 |
tr_TR |
dc.identifier.endpage |
294 |
tr_TR |