Fibonacci Matrix Research Articles

On the K-generalized Fibonacci matrix Qk

The k-generalized Fibonacci sequence { g ( k) n } is defined as follows: g ( k) 1 = … = g ( k) k − 2 = 0, g ( k) k − 1 = g ( k) k = 1, and for n > k ⩾ 2, g ( k) n = g ( k) n − 1 + g ( k) n − 2 + … g ( k) n − k . We consider the relationship between g ( k) n and 1-factors of a bipartite graph and the eigenvalues of k-generalized Fibonacci matrix Q k for k ⩾ 2. We give some interesting examples in combinatorics and probability with respect to the k-generalized Fibonacci sequence.

Approximate indexing of icosahedral polyhedra with fibonacci numbers

Abstract In general, indexing faces of icosahedral face-forms requires irrational numbers. However, for many practical purposes an approximate indexing based on triplets of integer numbers can be used. Two possible approaches called, respectively, “Fibonacci Matrix Methods” (FMM) and the “Linear Combination Method” (LCM) are described. FMM relies on the use of “auxiliary” matrices Fn, F2 n, F3 n and F4 n which have Fibonacci numbers as their elements. These matrices allow good approximation of the results usually obtained using the standard five-fold rotation matrices which are typical of icosahedral symmetry. LCM is based on the use of a classical crystallographic rule i.e. the so-called “Goldschmidt Complication Law” which is just a particular case of linear combination of triplets of face indices, with integers as coefficients. The occurrence of large integer indices is remarked.

A Fibonacci Matrix and the Permanent Function

A Fibonacci Matrix and the Permanent Function

A Singular Fibonacci Matrix and its Related Lambda Function

A Singular Fibonacci Matrix and its Related Lambda Function