This paper presents a construction of m-by-m irreducible Fibonacci matrices for any even m. The proposed technique relies on matrix representations of algebraic number fields which are an extension of the golden section field. The explicit construction of some 6-by-6 and 8-by-8 irreducible Fibonacci matrices is given. 2000 Mathematics Subject Classification. 11B39, 15A36.

The purpose of the present paper is to prove that there are finitely many binomial coefficients of the form (f in certain binary recurrences, and give a simple method for the determination of these coefficients. We illustrate the method by the Fibonacci, the Lucas, and the Pell sequences. First, we transform both of the title equations into two elliptic equations and apply a theorem of Mordell ...

Recent publications advocate the use of various variable length codes for which each codeword consists of an integral number of bytes in compression applications using large alphabets. This paper shows that another tradeoff with similar properties can be obtained by Fibonacci codes. These are fixed codeword sets, using binary representations of integers based on Fibonacci numbers of order m ≥ 2...

Abstract: In this paper, we consider norms and spreads of RFMLR circulant matrices involving the Fermat, Mersenne sequences and Gaussian Fibonacci number, respectively. Firstly, we reviewed some properties of the Fermat, Mersenne sequences, Gaussian Fibonacci number and RFMLR circulant matrices. Furthermore, we give lower and upper bounds for the spectral norms and spread of these special matri...

we introduce a matricial toeplitz transform and prove that the toeplitz transform of a second order recurrence sequence is another second order recurrence sequence. we investigate the injectivity of this transform and show how this distinguishes the fibonacci sequence among other recurrence sequences. we then obtain new fibonacci identities as an application of our transform.

The sequence obtained to solve this problem—the celebrated Fibonacci sequence 1, 1, 2, 3, 5, 8, 13, 21, ...—appears in a large number of natural phenomena (see [2], [6]) and has natural applications in computer science (see [1]). Here we reformulate the rabbit problem to recover two generalizations of the Fibonacci sequence presented elsewhere (see [7], [8]). Then, using a fixed-point technique...

A Filbert matrix is a matrix whose (i, j) entry is 1/Fi+j−1, where Fn is the n Fibonacci number. The inverse of the n × n Filbert matrix resembles the inverse of the n× n Hilbert matrix, and we prove that it shares the property of having integer entries. We prove that the matrix formed by replacing the Fibonacci numbers with the Fibonacci polynomials has entries which are integer polynomials. W...

A Fibonacci d-polytope of order k is defined as the convex hull of {0, 1}-vectors with d entries and no consecutive k ones, where k ≤ d. We show that these vertices can be partitioned into k subsets such that the convex hull of the subsets give the equivalent of Fibonacci (d− i)polytopes, for i = 1, . . . , k, which yields a “Fibonacci like” recursive formula to enumerate the vertices. Surprisi...

The Fibonacci polynomials are defined by the recursion relation Fn+2{x) = xF„+l(x) + Fn(x), (1) with the initial values Fx(x) = 1 and F2(x) = x. When x = l, Fn(x) is equal to the /1 Fibonacci number, Fn. The Lucas polynomials, Ln(x) obey the same recursion relation, but have initial values Li(x) = x and L^x) = x +2. Explicit expressions for the zeros of the Fibonacci and Lucas polynomials have ...

We provide explicit formulas for the maximum number qk(n) of disjoint subgraphs isomorphic to the k-dimensional hypercube in the n-dimensional Fibonacci cube Γn for small k, and prove that the limit of the ratio of such cubes to the number of vertices in Γn is 1 2k for arbitrary k. This settles a conjecture of Gravier, Mollard, Špacapan and Zemljič about the limiting behavior of qk(n).