Related papers: Fibonacci identities from Jordan Identities
Rogers-Ramanujan type identities occur in various branches of mathematics and physics. As a classic and powerful tool to deal with Rogers-Ramanujan type identities, the theory of Bailey's lemma has been extensively studied and generalized.…
We introduce a new four-parameters sequence that simultaneously generalizes some well-known integer sequences, including Fibonacci, Padovan, Jacobsthatl, Pell, and Lucas numbers. Combinatorial interpretations are discussed and many…
We survey and prove properties a family of recurrences bears in relation to integer representations, compositions, the Pascal triangle, sums of digits, Nim games and Beatty sequences.
In this article, we introduce and study a new integer sequence referred to as the higher order Mersenne sequence. The proposed sequence is analogous to the higher order Fibonacci numbers and closely associated with the Mersenne numbers.…
We investigate general properties of number sequences which allow explicit representation in terms of products. We find that such sequences form whole families of number sequences sharing similar recursive identities. Restricting to the…
We study the combinatorial properties of final types, which are certain non-decreasing sequences of integers, together with the partitions naturally associated with them. As a consequence, we obtain an identity expressing the $n$-nacci…
We discuss an equivalence relation on the set of square binary matrices with the same number of 1's in each row and each column. Each binary matrix is represented using ordered n-tuples of natural numbers. We give a few starting values of…
Pre-Jordan algebras were introduced recently in analogy with pre-Lie algebras. A pre-Jordan algebra is a vector space $A$ with a bilinear multiplication $x \cdot y$ such that the product $x \circ y = x \cdot y + y \cdot x$ endows $A$ with…
We study a recursively defined two-parameter family of graphs which generalize Fibonacci cubes and Pell graphs and determine their basic structural and enumerative properties. In particular, we show that all of them are induced subgraphs of…
In this study, we define a new type of Fibonacci and Lucas num- bers which are called bicomplex Fibonacci and bicomplex Lucas numbers. We obtain the well-known properties e.g. Docagnes, Cassini, Catalan for these new types. We also give the…
In this paper we derive some new identities involving the Fibonacci and Lucas polynomials and the Chebyshev polynomials of the first and the second kind. Our starting point is a finite trigonometric sum which equals the resolvent kernel on…
In this paper we present a family of identities for recursive sequences arising from a second order recurrence relation, that gives instances of Zeckendorf representation. We prove these results using a special case of an universal property…
This is a survey on certain results which bring about a connection between Fibonacci sequences on the one hand and the areas of matrix theory and quantum information theory, on the other.
In this article, a new approach based on linear algebra is adopted to study a hybrid Sheffer polynomial sequences. The recurrence relations and differential equation for these polynomials are derived by using the properties and…
This paper introduces a variation on an identity by Bruckman and Good. Using this identity, we are able to derive various well-known sums involving reciprocals of Fibonacci and Lucas numbers, including the case when the indices form an…
We find various series that involves the central binomial coefficients $\binom{2n}{n}$, harmonic numbers and Fibonacci Numbers.\\ Contrary to the traditional hypergeometric function $_pF_q$ approach, our method utilizes a straightforward…
We classify, up to isomorphism, the 2-dimensional algebras over a field K. We focuse also on the case of characteristic 2, identifying the matrices of GL(2,F_2) with the elements of the symmetric group S_3. The classification is then given…
Recently, the numbers $Y_{n}(\lambda )$ and the polynomials $Y_{n}(x,\lambda)$ have been introduced by the second author [22]. The purpose of this paper is to construct higher-order of these numbers and polynomials with their generating…
We define Leibniz triple systems in a functorial manner using the algorithm of Kolesnikov and Pozhidaev which converts identities for algebras into identities for dialgebras. We verify that Leibniz triple systems are the natural analogues…
Classical studies of the Fibonacci sequence focus on its periodicity modulo $m$ (the Pisano periods) with canonical initialization. We investigate instead the complete periodic structure arising from all $m^2$ possible initializations in…