Related papers: Bicomplex k-Fibonacci quaternions
We define the convolved h(x)-Fibonacci polynomials as an extension of the classical convolved Fibonacci numbers. Then we give some combinatorial formulas involving the h(x)-Fibonacci and h(x)-Lucas polynomials. Moreover we obtain the…
We derive some q-analogs of Euler-Cassini-type identities and of recurrence formulas for powers of Fibonacci polynomials.
We use the inversion of coefficient arrays to define dual polynomials to the Fibonacci and Catalan-Fibonacci polynomials, and we explore the properties of these new polynomials sequences. Many of the arrays involved are Riordan arrays.…
The roots of -1 in the set of biquaternions (quaternions with complex components, or complex numbers with quaternion real and imaginary parts) are studied and it is shown that there is an infinite number of non-trivial complexified…
In this note we introduce several instructive examples of bijections found between several different combinatorially defined sequences of sets. Each sequence has cardinalities given by the Catalan numbers. Our results answer some questions…
We present some new linear, quadratic, cubic and quartic binomial Fibonacci, Lucas and Fibonacci--Lucas summation identities.
In this study, we investigate Horadam sequence as generalization of linear recurrence equations of order two. By the aid of this sequence we obtain a new generalization for sequences of dual quaternions and dual octonions. Moreover, we…
We extend our investigation of $2$-determinants, which we defined in a previous paper. For a linear homogenous recurrence of the second order, we consider relations between different sequences satisfying the same linear homogeneous…
We derive a new Fibonacci identity. This single identity subsumes important known identities such as those of Catalan, Ruggles, Halton and others, as well as standard general identities found in the books by Vajda, Koshy and others. We also…
In this paper, first we define Horadam octonions by Horadam sequence which is a generalization of second order recurrence relations. Also, we give some fundamental properties involving the elements of that sequence. Then, we obtain their…
A generalization of the Catalan numbers is considered. New results include binomial identities, recursive relations and a close formula for the multivariate generating function. A simple expression for the Catalan determinant is derived.
We investigate some arithmetic properties of the q-Fibonacci numbers and the q-Pell numbers.
In this paper, we evaluate determinants of some families of Toeplitz-Hessenberg matrices having tribonacci number entries. These determinant formulas may also be expressed equivalently as identities that involve sums of products of…
We derive various weighted summation identities, including binomial and double binomial identities, for Tribonacci numbers. Our results contain some previously known results as special cases.
We study certain series with Catalan numbers and reciprocal Catalan numbers, respectively, and provide seemingly new closed form evaluations of these series with Fibonacci (Lucas) entries. In addition, we state some combinatorial sums that…
We derive some Fibonacci and Lucas identities which contain inverse binomial coefficients. Extension of the results to the general Horadam sequence is possible, in some cases.
In this paper, we define the incomplete h(x)-Fibonacci and h(x)-Lucas polynomials, we study recurrence relations and some properties of these polynomials
We present Capelli type identities associated with the quaternions and the octonions, which are noncommutative versions of multiplicative norm identities for the quaternions and the octonions.
The focus of this paper is the study of generalized Fibonacci polynomials and Fibonomial coefficients. The former are polynomials {n} in variables s and t given by {0} = 0, {1} = 1, and {n} = s{n-1}+t{n-2} for n ge 2. The latter are defined…
We present a differential-calculus-based method which allows one to derive more identities from {\it any} given Fibonacci-Lucas identity containing a finite number of terms and having at least one free index. The method has two {\it…