Dynamics of the Zeros of Fibonacci Polynomials

Alsrmcr -We study some fundamental properties of generalized Fibonacci polynomials, by using the properties and characteristics of classical Fibonacci polynomials as a motivation. We derive the generating function and an explicit representation of these polynomials. A trace relation for a related r x r matrix Q. is derived. We then

The current research around the Fibonacci´s and Lucas´sequence evidences the scientific vigor of both mathematical models that continue to inspire and provide numerous specializations and generalizations, especially from the sixthies. One of the current of research and investigations around the Generalized Sequence of Lucas, involves it´s polinomial representations. Therefore, with the introduction of one or two variables, we begin to discuss the family of the Bivariate Lucas Polynomias (BLP) and the Bivariate Fibonacci Polynomials (BFP). On the other hand, since it´s representation requires enormous employment of a large algebraic notational system, we explore some particular properties in order to convince the reader about an inductive reasoning that produces a meaning and produces an environment of scientific and historical investigation supported by the technology. Finally, throughout the work we bring several figures that represent some examples of commands and algebraic operations with the CAS Maple that allow to compare properties of the Lucas´polynomials, taking as a reference the classic of Fibonacci´s model that still serves as inspiration for several current studies in Mathematics.

Chaos, Solitons & Fractals, 2009

Let hðxÞ be a polynomial with real coefficients. We introduce hðxÞ-Fibonacci polynomials that generalize both Catalan's Fibonacci polynomials and Byrd's Fibonacci polynomials and also the k-Fibonacci numbers, and we provide properties for these hðxÞ-Fibonacci polynomials. We also introduce hðxÞ-Lucas polynomials that generalize the Lucas polynomials and present properties of these polynomials. In the last section we introduce the matrix Q h ðxÞ that generalizes the Q-matrix 1 1 1 0 whose powers generate the Fibonacci numbers.

2009

This article introduces a new class of polynomials arising in a course of exploring a qualitative behavior of orbits of a two-parametric difference equation. The use of symbolic computations and computational experiments in the context of Maple made it possible to prove polynomial generalizations of Cassini's identity for Fibonacci numbers and formulate conjectures about polynomial forms of Catalan's identity.

In this paper we generalize to bivariate Fibonacci and Lucas polynomials, properties obtained for Chebyshev polynomials. We prove that the coordinates of the bivariate polynomials over appropriate bases are families of integers satisfying remarkable recurrence relations.

J. Integer Seq., 2019

A second order polynomial sequence is of \emph{Fibonacci-type} (\emph{Lucas-type}) if its Binet formula has a structure similar to that for Fibonacci (Lucas) numbers. Known examples of these type of sequences are: Fibonacci polynomials, Pell polynomials, Fermat polynomials, Chebyshev polynomials, Morgan-Voyce polynomials, Lucas polynomials, Pell-Lucas polynomials, Fermat-Lucas polynomials, Chebyshev polynomials. The \emph{resultant} of two polynomials is the determinant of the Sylvester matrix and the \emph{discriminant} of a polynomial $p$ is the resultant of $p$ and its derivative. We study the resultant, the discriminant, and the derivatives of Fibonacci-type polynomials and Lucas-type polynomials as well combinations of those two types. As a corollary we give explicit formulas for the resultant, the discriminant, and the derivative for the known polynomials mentioned above.

We give an answer to a recent question of Prodinger, which consists of finding q-analogues of identities related to Fibonacci and Lucas polynomials.

Rendiconti Del Circolo Matematico Di Palermo, 2002

Families of polynomials which obey the Fibonacci recursion relation can be generated by repeated iterations of a 2 × 2 matrix, Q 2 , acting on an initial value matrix, R 2 . One matrix fixes the recursion relation, while the other one distinguishes between the different polynomial families. Each family of polynomials can be considered as a single trajectory of a discrete dynamical system whose dynamics are determined by Q 2 . The starting point for each trajectory is fixed by R 2 (x). The forms of these matrices are studied, and some consequences for the properties of the corresponding polynomials are obtained. The main results generalize to the so-called r -Bonacci polynomials.

arXiv: Number Theory, 2007

In this paper we generalize to bivariate polynomials of Fibonacci and Lucas, properties obtained for Chebyshev polynomials. We prove that the coordinates of the bivariate polynomials over appropriate basis are families of integers satisfying remarkable recurrence relations.

Notes on Number Theory and Discrete Mathematics, 2021

In this paper, we define new families of Generalized Fibonacci polynomials and Generalized Lucas polynomials and develop some elegant properties of these families. We also find the relationships between the family of the generalized k-Fibonacci polynomials and the known generalized Fibonacci polynomials. Furthermore, we find new generalizations of these families and the polynomials in matrix representation. Then we establish Cassini’s Identities for the families and their polynomials. Finally, we suggest avenues for further research.