Polynomial Identities for Generalized Fibonacci Sequences
Joey Glampe, Aryaman Joshi, Swagat Malla, Matthew Richey, Matthew Wright
Abstract
The Fibonacci, Lucas, and Pell sequences satisfy certain families of ``polynomial'' identities. While a few members of these families are well-known, we are not able to find a general statement of these identities in the mathematical literature. We show that such polynomial identities exist for many generalized Fibonacci sequences, and we classify sequences that have these identities obtained by two distinct approaches. One approach uses the Girard-Waring formula, while the other relies on Binet's formula and linear algebra.
Create a lesson
Related papers
Cones of Theta Graphs are Enumeratively Chromatic-Choosable
Kingston Barnes, Vincent Fesenmeier, Braxton Gaither et al.
Davenport Constants of Finite Abelian Groups
Dongchun Han, Hanbin Zhang
How iterated sumsets grow under the assumption of small doubling
Dongchun Han, Qinghai Zhong
Sharp lower bounds for bisections of graphs with bounded maximum degree
Qiwen Guo, Gregory Gutin
Hilbert functions over the exterior algebra and f-vectors in higher rank II: Generalizing Linusson's count to sumsets of f-vectors
Jan Snellman
Sharp bounds and extremal structure of minimally strongly k-connected digraphs
Junran Yu, Gregory Gutin, Hong-Jian Lai et al.