k –step Fibonacci sequences and Fibonacci matrices.

Saved in:
Bibliographic Details
Title: k –step Fibonacci sequences and Fibonacci matrices.
Authors: Adam, Maria1, Assimakis, Nicholas2
Source: Journal of Discrete Mathematical Sciences & Cryptography. Aug2017, Vol. 20 Issue 5, p1183-1206. 24p.
Subjects: Fibonacci sequence, Mathematical bounds, Eigenvalues
Abstract: In this paper, the powers of the Fibonacci matrices are investigated and closed formulas for their entries are derived, related to the suitable terms of thek− step Fibonacci sequences in order to develop the properties of the irreducibility and primitivity of the Fibonacci matrices. Some bounds for the spectral radius and the modulus of the remaining eigenvalues of the Fibonacci matrices are presented. New formulas for computing of the odd and even terms of a special Fibonacci sequence are discussed, generalizing the Cassin’s and Sharpe’s formulas. [ABSTRACT FROM PUBLISHER]
Copyright of Journal of Discrete Mathematical Sciences & Cryptography is the property of Taru Publications and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:In this paper, the powers of the Fibonacci matrices are investigated and closed formulas for their entries are derived, related to the suitable terms of thek− step Fibonacci sequences in order to develop the properties of the irreducibility and primitivity of the Fibonacci matrices. Some bounds for the spectral radius and the modulus of the remaining eigenvalues of the Fibonacci matrices are presented. New formulas for computing of the odd and even terms of a special Fibonacci sequence are discussed, generalizing the Cassin’s and Sharpe’s formulas. [ABSTRACT FROM PUBLISHER]
ISSN:09720529
DOI:10.1080/09720529.2015.1104929