Live briefing
Everything about Fibonacci polynomials
Sequence of polynomials defined recursively
In mathematics, the Fibonacci polynomials are a polynomial sequence which can be considered as a generalization of the Fibonacci numbers. The polynomials generated in a similar way from the Lucas numbers are called Lucas polynomials. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Fibonacci polynomialsA 5-minute orientation
- Skim a recent paper: On parametric types of Apostol Bernoulli-Fibonacci, Apostol Euler-Fibonacci, and Apostol Genocchi-Fibonacci polynomials via Golden calculusInfluential work since 2022
- Pick up a classic book: Applications of Fibonacci NumbersThe most-reprinted book on the subject
- Read the landmark paper: Roots of Fibonacci PolynomialsCited 75 times
- Go sideways: Kravchuk polynomialsA closely related topic
- Go sideways: Generating function transformationA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Roots of Fibonacci Polynomials
Divisibility Properties of Fibonacci Polynomials
Divisibility Properties of Generalized Fibonacci Polynomials
Generalized Fibonacci Polynomials
Fibonacci, Chebyshev, and Orthogonal Polynomials
Generalized Lucas polynomials and relationships between the Fibonacci polynomials and Lucas polynomials
Bivariate fibonacci like p–polynomials
Fibonacci Notes - 4: q -Fibonacci Polynomials
🆕 Influential since 2022
On parametric types of Apostol Bernoulli-Fibonacci, Apostol Euler-Fibonacci, and Apostol Genocchi-Fibonacci polynomials via Golden calculus
Apostol Bernoulli-Fibonacci Polynomials, Apostol Euler-Fibonacci Polynomials and Their Generating Functions
A study of harmonic Fibonacci polynomials associated With Bernoulli-F and Euler–Fibonacci polynomials
A note on Fibonacci-Hermite polynomials
On Convolved Fibonacci Polynomials
📚 Books worth reading
Applications of Fibonacci NumbersFrederic T. Howard · 2004
Applications of fibonacci numbersInternational Conference on Fibonacci Numbers and Their Applications (8th 1998 Rochester Institute of Technology) · 1999- 📕Representations of Lie Algebras, Quantum Groups and Related TopicsNaihuan Jing, Kailash C. Misra · 2018
Analytic number theoryJ. M. de Koninck · 2012
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Kravchuk polynomials Kravchuk polynomials or Krawtchouk polynomials (also written using several other transliterations of the Ukrainian surname Кравчу́к) are discrete orthogonal…
- Generating function transformation In mathematics a transformation of a sequence's generating function provides a method of converting the generating function for one sequence into a generating…
- Padovan polynomials In mathematics, Padovan polynomials are a generalization of Padovan sequence numbers. These polynomials are defined by: P n ( x ) = { 1 , if n = 1 0…
- Dyadic transformation The dyadic transformation (also known as the dyadic map, bit shift map, 2x mod 1 map, Bernoulli map, doubling map or sawtooth map) is the mapping (i.e…
- Fabius function In mathematics, the Fabius function is a smooth cumulative distribution function F : R → [ 0 , 1 ] {\displaystyle F:\mathbb {R} \to [0,1]} that is strictly…
- Bell polynomials In combinatorial mathematics, the Bell polynomials, named in honor of Eric Temple Bell, are used in the study of set partitions. They are related to Stirling…
- Quot scheme In algebraic geometry, the Quot scheme is a scheme parametrizing sheaves on a projective scheme. More specifically, if X is a projective scheme over a…
- Touchard polynomials The Touchard polynomials, studied by Jacques Touchard (1956), also called the exponential polynomials or Bell polynomials, comprise a polynomial sequence…