Related papers: Lucas, Fibonacci, and Chebyshev polynomials from m…
Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…
In this work, new closed-form formulas for the matrix exponential are provided. Our method is direct and elementary, it gives tractable and manageable formulas not current in the extensive literature on this essential subject. Moreover,…
Ozeki and Prodinger showed that the odd power sum of the first several consecutive Fibonacci numbers of even order is equal to a polynomial evaluated at certain Fibonacci number of odd order. We prove that this polynomial and its derivative…
In this paper, we provide new applications of Fibonacci and Lucas numbers. In some circumstances, we find algebraic structures on some sets defined with these numbers, we generalize Fibonacci and Lucas numbers by using an arbitrary binary…
Motivated by Elementary Problem B-1172 in the Fibonacci Quarterly (vol. 53, no. 3, pg. 273), formulas for the areas of triangles and other polygons having vertices with coordinates taken from various sequences of integers are obtained. The…
Orthogonal polynomials and multiple orthogonal polynomials are interesting special functions because there is a beautiful theory for them, with many examples and useful applications in mathematical physics, numerical analysis, statistics…
Efficient algorithms are known for many operations on truncated power series (multiplication, powering, exponential, ...). Composition is a more complex task. We isolate a large class of power series for which composition can be performed…
The golden binomials, introduced in the golden quantum calculus, have expansion determined by Fibonomial coefficients and the set of simple zeros given by powers of Golden ratio. We show that these golden binomials are equivalent to Carlitz…
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.
We present a survey of central developments in the theory of Chebyshev polynomials, introduced by P.~L.~Chebyshev and later extended to the complex plane by G.~Faber. Our primary focus is their defining extremal property: among all…
We introduce a large family of combinatorial objects, called standard puzzles, defined by very simple rules. We focus on the standard puzzles for which the enumeration problems can be solved by explicit formulas or by classical numbers,…
In this paper, we derive new matrix representation for Daehee numbers and polynomials, the lambda-Daehee numbers and polynomials and the twisted Daehee numbers and polynomials. This helps us to obtain simple and short proofs of many…
A Fibonacci pair $F_s(w,x)$ of rank $s$ is a pair $s \times s$ nonsingular matrices such that $wx=xw$ and that the entries of $aw^n$ and $axw^m$ are polynomials of Fibonacci or Lucas numbers for some nonzero $a$. We construct identities…
We prove a universal identity for powers of elements in quadratic algebras, expressing x^m in terms of x and the identity. As a consequence, we obtain a general formula for powers of 2x2 matrices depending only on trace and determinant.…
We study in detail two families of $q$-Fibonacci polynomials and $q$-Lucas polynomials, which are defined by non-conventional three-term recurrences. They were recently introduced by Cigler and have been then employed by Cigler and Zeng to…
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…
We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…
We give an elementary account of generalized Fibonacci and Lucas polynomials whose moments are Narayana polynomials of type A and type B.
This paper presents a method to analyze the powers of a given trilinear form (a special kind of algebraic constructions also called a tensor) and obtain upper bounds on the asymptotic complexity of matrix multiplication. Compared with…
This note is dedicated to Professor Gould. The aim is to show how the identities in his book "Combinatorial Identities" can be used to obtain identities for Fibonacci and Lucas polynomials. In turn these identities allow to derive a wealth…