One level summations for powers of Fibonacci and Lucas polynomials
Helmut Prodinger
TL;DR
This paper presents a simplified single-sum expression for powers of Fibonacci polynomials, enhancing previous double-sum formulas and contributing to the mathematical understanding of Fibonacci and Lucas polynomials.
Contribution
It introduces a novel single-sum representation for powers of Fibonacci polynomials, simplifying calculations and theoretical analysis.
Findings
Single-sum formulas for powers of Fibonacci polynomials
Improved computational efficiency over double-sum methods
Enhanced theoretical understanding of Fibonacci and Lucas polynomials
Abstract
Powers of Fibonacci polynomials are expressed as single sums, improving on a double sum recently seen in the literature.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Theories and Applications · Advanced Mathematical Identities · Advanced Combinatorial Mathematics