Related papers: Fibonacci identities and Fibonacci pairs
We introduce a natural generalization of Maya diagrams -- the space of infinite Fibonacci configurations, which are specified functions on $\mathbb{Z}$ with values $1$ and $0$. Infinite Fibonacci configurations are particularly interesting…
One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…
In this paper, we consider a generalization of Horadam sequence fwng which is defined by the recurrence relation wn = x(n)wn-1+ cwn-2; where x(n) = a if n is even, x(n) = b if n is odd with arbitrary initial conditions w0;w1 and nonzero…
In this work, by using Pauli matrices, we introduce four families of polynomials indexed over the positive integers. These polynomials have rational or imaginary rational coefficients. It turns out that two of these families are closely…
We give an overview about well-known basic properties of two classes of q-Fibonacci and q-Lucas polynomials and offer a common generalization.
We show how the Fibonacci's identity is used to obtain Euler bricks. Also,we put forward the relation between Fibonacci's identity and Euler's formula, which provides the description of Euler's bricks with noninteger spatial diagonal.…
Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…
A Filbert matrix is a matrix whose (i,j) entry is 1/F_(i+j-1), where F_n is the nth Fibonacci number. The inverse of the n by n Filbert matrix resembles the inverse of the n by n Hilbert matrix, and we prove that it shares the property of…
Philip Matchett Wood and Doron Zeilberger have constructed identities for the Fibonacci numbers $f_n$ of the form $1f_n = f_n$ for all $n \geq 1$; $2f_n = f_{n-2} + f_{n+1}$ for all $n \geq 3$; $3f_n = f_{n-2} + f_{n+2}$ for all $n \geq 3$;…
We offer several new summation identities involving harmonic numbers, odd harmonic numbers, and Fibonacci numbers. Our results are derived using three different approaches: partial summation, polynomial identities and binomial…
In this work, we define a more general family of polynomials in several variables satisfying a linear recurrence relation. Then we provide explicit formulas and determinantal expressions. Finally, we apply these results to recurrent…
The Fibonacci numbers are a sequence of integers in which every number after the first two, 0 and 1, is the sum of the two preceding numbers. These numbers are well known and algorithms to compute them are so easy that they are often used…
Given any two sequences of complex numbers, we establish simple relations between their binomial convolution and the binomial convolution of their individual binomial transforms. We employ these relations to derive new identities involving…
The equation commonly known as Sury's identity is a deceptively simple summation formula that connects the Lucas numbers, Fibonacci numbers, and powers of two. Many authors have given extensions and generalizations over the years; in this…
A combinatorial construction proves an identity for the product of the Pfaffian of a skew-symmetric matrix by the Pfaffian of one of its submatrices. Several applications of this identity are followed by a brief history of Pfaffians.
A filter lattice is a distributive lattice formed by all filters of a poset in the anti-inclusion order. We study the combinatorial properties of the Hasse diagrams of filter lattices of certain posets, so called Fibonacci-like cubes, in…
The Fibonacci sequence $\mathbb{F}$ is the fixed point beginning with $a$ of morphism $\sigma(a,b)=(ab,a)$. Since $\mathbb{F}$ is uniformly recurrent, each factor $\omega$ appears infinite many times in the sequence which is arranged as…
In this study, we define the dual Fibonacci quaternion and the dual Lucas quternion. We derive the relations between the dual Fibonacci and the dual Lucas quaternion which connected the Fibonacci and the Lucas numbers. Furthermore, we give…
We study the extended Frobenius problem for sequences of the form $\{f_a+f_n\}_{n\in\mathbb{N}}$, where $\{f_n\}_{n\in\mathbb{N}}$ is the Fibonacci sequence and $f_a$ is a Fibonacci number. As a consequence, we show that the family of…
We define a length function for a perfect crystal. As an application, we derive a variant of the Rogers-Ramanujan identities which involves (a $q$-analog of) the Fibonacci numbers.