Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

On Matrices with Bidimensional Fibonacci Numbers

View through CrossRef
Abstract In this paper, the bidimensional extensions of the Fibonacci numbers are explored, along with a detailed examination of their properties, characteristics, and some identities. We introduce and study the matrices with bidimensional Fibonacci numbers, focusing in particular on their recurrence relation, key properties, determinant, and various other identities. It is our purpose to study the matrix version of bidimensional Fibonacci numbers and provide new results and sometimes extensions of some results existing in the literature. We aim to introduce these matrices using the bidimensional Fibonacci numbers and to give the determinant of these matrices.
Title: On Matrices with Bidimensional Fibonacci Numbers
Description:
Abstract In this paper, the bidimensional extensions of the Fibonacci numbers are explored, along with a detailed examination of their properties, characteristics, and some identities.
We introduce and study the matrices with bidimensional Fibonacci numbers, focusing in particular on their recurrence relation, key properties, determinant, and various other identities.
It is our purpose to study the matrix version of bidimensional Fibonacci numbers and provide new results and sometimes extensions of some results existing in the literature.
We aim to introduce these matrices using the bidimensional Fibonacci numbers and to give the determinant of these matrices.

Related Results

Some Properties of the Fibonacci Sequence
Some Properties of the Fibonacci Sequence
The purposes of this paper are; (a) to develop a relationship between subscripts of the symbols of Fibonacci and Lucas numbers and the numbers themselves; (b) to develop relationsh...
Subespacios hiperinvariantes y característicos : una aproximación geométrica
Subespacios hiperinvariantes y característicos : una aproximación geométrica
The aim of this thesis is to study the hyperinvariant and characteristic subspaces of a matrix, or equivalently, of an endomorphism of a finite dimensional vector space. We restric...
More on the Fascinating Characterizations of Mulatu’s Numbers
More on the Fascinating Characterizations of Mulatu’s Numbers
Background The discoveries of Mulatu’s numbers, better known as Mulatu’s sequence, represent revolutionary contributions to the mathematical world. His best-known...
More on the Fascinating Characterizations of Mulatu’s Numbers
More on the Fascinating Characterizations of Mulatu’s Numbers
Background The discoveries of Mulatu’s numbers, better known as Mulatu’s sequence, represent revolutionary contributions to the mathematical world. His best-known work is Mulatu’s ...
More on the Fascinating Characterizations of Mulatu’s Numbers
More on the Fascinating Characterizations of Mulatu’s Numbers
Background The discoveries of Mulatu’s numbers, better known as Mulatu’s sequence, represent revolutionary contributions to the mathematical world. His best-known work is Mulatu’s ...
Mòduls locals de sistemes dinàmics lineals amb coeficients constants
Mòduls locals de sistemes dinàmics lineals amb coeficients constants
La present memòria estudia l'estabilitat estructural de ternes de matrius. Es ben conegut que els sistemes dinàmic lineals amb coeficients constants poden venir definits per ternes...
Beauty of Plants and Flowers Obeys Fibonacci Sequences
Beauty of Plants and Flowers Obeys Fibonacci Sequences
The aim of the study is to test the hypothesis that plants or flowers exhibiting Fibonacci sequences with larger numbers possess greater aesthetic beauty. As the number of Fibonacc...
Determinants and inverses of circulant matrices with complex Fibonacci numbers
Determinants and inverses of circulant matrices with complex Fibonacci numbers
Abstract Let ℱn = circ (︀F*1 , F*2, . . . , F*n︀ be the n×n circulant matrix associated with complex Fibonacci numbers F*1, F*2, . . . , F*n. In the present paper we...

Back to Top