Skip to search formSkip to main contentSkip to account menu

Fibonacci polynomials

Known as: Fibonacci function, Fibonacci polynomial 
In mathematics, the Fibonacci polynomials are a polynomial sequence which can be considered as a generalization of the Fibonacci numbers. The… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Chebyshev polynomialsDickson polynomialLucas sequencePadovan sequence

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A Novel Operational Matrix of Caputo Fractional Derivatives of Fibonacci Polynomials: Spectral Solutions of Fractional Differential Equations
Herein, two numerical algorithms for solving some linear and nonlinear fractional-order differential equations are presented and… 
Highly Cited
2012
Highly Cited
2012
Some Properties of the (p, q)-Fibonacci and (p, q)-Lucas Polynomials
Riordan arrays are useful for solving the combinatorial sums by the help of generating functions. Many theorems can be easily… 
Highly Cited
2012
Highly Cited
2012
Some identities involving Fibonacci, Lucas polynomials and their applications
The main purpose of this paper is to study some sums of powers of Fibonacci polynomials and Lucas polynomials, and give several… 
Highly Cited
2010
Highly Cited
2010
DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS
As one would expect, these polynomials possess many properties of the Fibonacci sequence which, of course, is just the integral… 
2009
2009
Identities Involving the Fibonacci Polynomials
for » = (>, 1,2,.... If x = 1, then the sequence F(l) is called the Fibonacci sequence, and we shall denote it by F = {F„). The… 
Highly Cited
2003
Highly Cited
2003
A New Class of q-Fibonacci Polynomials
We introduce a new q-analogue of the Fibonacci polynomials and derive some of its properties. Extra attention is paid to a… 
2000
2000
-̂FIBONACCI POLYNOMIALS
Let MC be the monoid of all Morse code sequences of dots a(:=®) and dashes b(: = -) with respect to concatenation. MC consists of… 
1997
1997
Dynamics of the Zeros of Fibonacci Polynomials
The Fibonacci polynomials are defined by the recursion relation Fn+2{x) = xF„+l(x) + Fn(x), (1) with the initial values Fx(x) = 1… 
Highly Cited
1991
Highly Cited
1991
Derivative Sequences of Fibonacci and Lucas Polynomials
Let us consider the Fibonacci polynomials U n(x) and the Lucas polynomials V n (x) (or simply U n and Vn, if there is no danger… 
Highly Cited
1969
Highly Cited
1969
Divisibility Properties of Fibonacci Polynomials
1 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)