Next Article in Journal
From Invariance to Symmetry Breaking in FIM-Aware Cooperative Heterogeneous Agent Networks
Previous Article in Journal
Detour Eccentric Sum Index for QSPR Modeling in Molecular Structures
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Generalized Fibonacci Polynomials and Their Properties

1
Department of Mathematics, Bursa Uludağ University, 16059 Bursa, Türkiye
2
Department of Mathematics, Kocaeli University, 41380 İzmit Kocaeli, Türkiye
3
Department of Mathematics, Qassim University, Buraydah 51452, Saudi Arabia
4
Department of Electrical Engineering, Prince Mohammad Bin Fahd University, P.O. Box 1664, Al Khobar 31952, Saudi Arabia
*
Author to whom correspondence should be addressed.
Symmetry 2025, 17(11), 1898; https://doi.org/10.3390/sym17111898 (registering DOI)
Submission received: 13 October 2025 / Revised: 25 October 2025 / Accepted: 3 November 2025 / Published: 7 November 2025
(This article belongs to the Section Mathematics)

Abstract

This study presents a unified framework for the simultaneous analysis of generalized Fibonacci numbers and their associated polynomial extensions, both of which play a significant role in combinatorial analysis and discrete mathematics. The generalized Fibonacci polynomials have been extended to four new families of polynomials, each defined through systematic extensions of the generalized Fibonacci polynomials U k l ( ς ) and V k l ( ς ) . In addition, we explore further generalizations involving the extended Humbert-type polynomials U k l , m ( r ) ( ς ) and V k l , m ( r ) ( ς ) . Based on the algebraic structure and generating functions of these newly defined polynomial families, several algebraic identities that reveal their rich mathematical properties have been derived. Additionally, we aim to present the graphical representations of a family of polynomials, analyze their roots, examine the distribution of the roots, and investigate the correlations among the largest roots. Finally, to gain a deeper understanding of the structural properties of the polynomials, the root magnitude distribution and the density distribution of root values are also examined.

1. Introduction

The ( P , Q ) -Fibonacci and ( P , Q ) -Lucas polynomials are generalizations of the classical Fibonacci and Lucas sequences. These polynomials extend the well-known recurrence relations and combinatorial interpretations into a broader algebraic framework through the use of ( P , Q ) -polynomials, allowing for the exploration of richer mathematical structures. When P = Q = 1 , the classical sequences are obtained as special cases, making these polynomials both a general and inclusive approach. The ( P , Q ) -generalizations play an important role in various areas of mathematics, including quantum calculus, number theory, combinatorics, and the study of special functions. In the literature, numerous studies have been devoted to investigating the structural properties of these polynomials.
Horadam [1] defined the following polynomial sequence { W n ζ } as
W n ζ = P ζ W n 1 ζ + Q ζ W n 2 ζ for n 2 ,
with W 0 ζ = c 0 and W 1 ζ = c 1 ζ d . Nalli and Haukkanen [2] introduced the h ζ -Fibonacci polynomials h ζ -Lucas polynomials, which encompass the Fibonacci, Pell, Lucas, and Pell–Lucas polynomials as particular cases.
Let P ( ς ) and Q ( ς ) be real coefficients polynomials. For a fixed integer m 2 , the generalized ( P , Q ) -Fibonacci and Lucas polynomials U l , m ( ς ) and V l , m ( ς ) [3] are shown that for l m ,
U l , m ( ς ) = P ( ς ) U l 1 , m ( ς ) + Q ( ς ) U l m , m ( ς )
with U 0 , m ( ς ) = 0 , U 1 , m ( ς ) = 1 , U 2 , m ( ς ) = P ( ς ) , , U m 1 , m ( ς ) = P m 2 ( ς ) and
V l , m ( ς ) = P ( ς ) V l 1 , m ( ς ) + Q ( ς ) V l m , m ( ς )
with V 0 , m ( ς ) = 2 , V 1 , m ( ς ) = P ( ς ) , V 2 , m ( ς ) = P 2 ( ς ) , , V m 1 , m ( ς ) = P m 1 ( ς ) . Specially, when m = 2 ,   U l , 2 ( ς ) = U l ( ς ) and V l , 2 ( ς ) = V l ( ς ) are the ( P , Q ) -Fibonacci and Lucas polynomials, respectively.
In 1965, Gould introduced the Humbert polynomials defined by P l ( m , ς , y , r , c ) , and investigated their explicit expressions, recurrence relations, and higher-order derivatives. By assigning specific values to the parameters m , ς , y , r , c , these polynomials reduce to certain well-known ones, such as Fibonacci, Chebyshev and Legendre polynomials. In recent years, numerous studies have been conducted on Humbert polynomials. In particular, many of these studies have focused on special polynomials and explored them from various perspectives [4].
Gould [5] introduced the generating function of the Humbert-Gould polynomials P l ( m , ς , y , r , c )
l = 0 P l ( m , ς , y , r , c ) t l = c m ς t + y t m r ,
where m is a positive integer and other parameters are unrestricted in general.
For each complex number r , Wang et al. [4] defined the generalized Humbert polynomials U l , m ( r ) ( ς ) as convolutions of U l , m ( ς ) by the generating function
l = 0 U l + 1 , m ( r ) ( ς ) t l = 1 P ( ς ) t Q ( ς ) t m r .
Note that when r = 1 , U l , m 1 ς = U l , m ς are generalized P , Q -Fibonacci polynomials. The explicit expression of U l r ς is given by
U l + 1 r ς = k = 0 l / 2 r + k 1 k r + l k 1 l 2 k P l 2 k ς Q k ς .
Pathan and Khan [6] aimed to present a unified framework for a class of generalized Humbert polynomials encompassing well-known families such as Gegenbauer, Legendre, Hermite, and Laguerre polynomials, along with several related generating functions and hypergeometric representations in their work. Also, Alam et al. [7] presented several expansions of the Humbert–Hermite polynomials, particularly those expressed in terms of Hermite–Gegenbauer (ultraspherical) and Hermite–Chebyshev polynomials. This study not only unifies prior findings but also broadens the theoretical framework of Humbert’s polynomials, paving the way for future research and applications across various areas of mathematics. In [3,7], the generating function of V l , m ( r ) ( ς ) is given by
l = 0 V l , m ( r ) ( ς ) t l = 2 P ( ς ) t 1 P ( ς ) t Q ( ς ) t m r .
Cvijović showed that
l = 1 f l t l r = l = r g l ( r ) t l ,
where the numbers f l are the coefficients of the powers of t
g r ( r ) = f 1 r and g l ( r ) = 1 ( l r ) f 1 j = 1 l r j + 1 r + 1 l + 1 f j + 1 g l j ( r )
for a fixed positive integer r and l r + 1 [8].
In mathematical analysis, the exponential and natural logarithm functions are often represented through their power series expansions, which serve as foundational tools in both theoretical and applied contexts. Specifically, the exponential function e t is given by the infinite series
e t = l = 0 t l l !
which converges for all real and complex values of t . Logarithm function ln ( 1 t ) can be expressed as a power series expansion around t = 0 , valid for t < 1 , as follows
ln ( 1 t ) = l = 1 t l l .
The Stirling numbers are widely recognized for their fundamental role in combinatorial analysis. In [9,10], the Stirling numbers of the first kind S 1 l , k are usually defined as the coefficients of the powers of t in t l ̲ where
t l ̲ = t t + 1 t + l 1 = k = 0 l S 1 l , k t k
in which for l 0 , S 1 l , 0 = δ l , 0 , δ l , k is the Kronecker delta. The generating function of S 1 l , k is given by
ln 1 + t k k ! = l = k S 1 l , k t l l ! for k N .
The Daehee numbers of the first kind of order r , D l r [11], are defined by the generating functions to be
ln 1 + t t r = l = 0 D l r t l l ! .
For r = 1 , D l 1 = D l are called Daehee numbers.
Cauchy numbers play an important role in various fields such as combinatorics, numerical analysis, and special functions. The Cauchy numbers of the first kind C n [9] have the generating function
t ln ( 1 + t ) = l = 0 C l t l l ! .
Although extensive studies have been conducted on classical Fibonacci and Lucas polynomials in recent years, research on their generalizations continues to progress. In this paper, we go beyond these generalizations by extending the generalized Fibonacci and Lucas polynomials into four new families. The main aim of this study is to introduce a new family of polynomials into the literature, to investigate their algebraic and combinatorial structures in detail, to derive new algebraic identities, and to explore their numerical properties comprehensively with potential applications in analysis, applied mathematics, and engineering. Furthermore, it goes beyond the existing references by providing both theoretical studies and their applications.
This paper follows the steps below:
  • Generalized Fibonacci polynomials are defined, and using these polynomials, extended Humbert-type polynomials are examined.
  • By means of the newly defined generalized Fibonacci polynomials, the study is systematically extended to four new polynomial families.
  • Some algebraic identities involving these four new polynomials and the generalized Humbert-type polynomials are presented.
  • For a specific polynomial family, graphs are provided. The roots of certain polynomials are computed and their root distributions are examined. Afterwards, correlations among the largest roots are investigated.
  • Finally, in order to gain a deeper understanding of the structural properties of the polynomials, the magnitude distribution and density distribution of the roots are systematically studied.

2. Generalized Fibonacci Polynomials and Their Properties

In this section, we focus on the simultaneous treatment of generalized Fibonacci numbers [12] and their associated polynomial extensions, which constitute two central constructs in combinatorial analysis and discrete mathematics. Specifically, we introduce and analyze four families of polynomials denoted by M E ( k , l , ς ) ,   M L ( k , l , ς ) ,   N E ( k , l , ς ) and N L ( k , l , ς ) , each of which is constructed based on extensions of classical Fibonacci sequences and polynomials. There are some identities involving these polynomials.
The generalized second order sequences U l and V l [13], are defined for l > 0 and nonzero integer number p by
U l + 1 = p U l + U l 1 and V l + 1 = p V l + V l 1
in which U 0 = 0 ,   U 1 = 1 and V 0 = 2 ,   V 1 = p , respectively.
Kılıç and Stanica [14] derived the following recurrence relations for the sequences U k l and V k l for k 0 , l > 0 . It is clearly that
U k l + 1 = V k U k l + 1 k + 1 U k l 1 and V k l + 1 = V k V k l + 1 k + 1 V k l 1 ,
where the initial conditions are 0 ,   U k and 2 ,   V k , respectively.
Now, we will define the generalized Fibonacci and Lucas polynomials.
Definition 1.
For any positive integers l , k , the generalized Fibonacci and Lucas polynomials are defined by
U k l ( ς ) = ς V k U k ( l 1 ) ( ς ) + 1 k + 1 U k ( l 2 ) ( ς ) , V k l ( ς ) = ς V k V k ( l 1 ) ( ς ) + 1 k + 1 V k ( l 2 ) ( ς ) ,
with initial conditions 0 , U k and 2 , ς V k , respectively, where U l is l-th generalized Fibonacci number and V l is l-th. generalized Lucas number.
Clearly, Binet forms of U k l ( ς ) and V k l ( ς ) are given by
U k l ( ς ) = U k α k ( ς ) l β k ( ς ) l α k ( ς ) β k ( ς ) and V k l ( ς ) = α k ( ς ) l + β k ( ς ) l ,
where α k ( ς ) = ς V k + ς 2 V k 2 + 4 ( 1 ) k + 1 / 2 and β k ( ς ) = ς V k ς 2 V k 2 + 4 ( 1 ) k + 1 / 2 . Note that U k l ( ς ) = 1 k l + l + 1 U k l ( ς ) .
Lemma 1.
For any positive integer k , we have
l = 0 U k l ( ς ) t l = U k t 1 ς V k t + ( 1 ) k t 2 and l = 0 V k l ( ς ) t l = 2 ς V k t 1 ς V k t + ( 1 ) k t 2 .
Proof. 
Consider that
1 ς V k t + ( 1 ) k t 2 l = 0 U k l ( ς ) t l = l = 0 U k l ( ς ) t l ς V k l = 1 U k ( l 1 ) ( ς ) t l + ( 1 ) k l = 2 U k ( l 2 ) ( ς ) t l = U k t + l = 2 U k l ( ς ) ς V k U k ( l 1 ) ( ς ) + ( 1 ) k U k ( l 2 ) ( ς ) t l = U k t
with (10). Similarly, the generating function of V k l ( ς ) is obtained.    □
Now, from (1) and (2), Definition 2 can be given as follows:
Definition 2.
For any positive integers l , m , k , the generalized ( P k , Q k ) -Fibonacci polynomials U k l , m ( ς ) and the generalized ( P k , Q k ) -Lucas polynomials V k l , m ( ς ) [3] are defined by for l m ,
U k l , m ( ς ) = ς V k U k ( l 1 ) , m ( ς ) + 1 k + 1 U k ( l m ) , m ( ς )
with the initial conditions U 0 , m ( ς ) = 0 ,   U k , m ( ς ) = U k ,   U 2 k , m ( ς ) = ς V k , , U k ( m 1 ) , m ( ς ) = ς m 2 V k m 2 and
V k l , m ( ς ) = ς V k V k ( l 1 ) , m ( ς ) + 1 k + 1 V k ( l m ) , m ( ς )
with the initial conditions V 0 , m ( ς ) = 2 ,   V k , m ( ς ) = ς V k ,   V 2 k , m ( ς ) = ς 2 V k 2 , , V k ( m 1 ) , m ( ς ) = ς m 1 V k m 1 .
Taking P ( ς ) = ς V k and Q ( ς ) = 1 k + 1 in (3) and (4), the generating functions of the generalized Humbert polynomial U k l , m ( r ) ( ς ) and polynomial V k l , m ( r ) ( ς ) are given by
l = 0 U k ( l + 1 ) , m ( r ) ( ς ) t l = 1 ς V k t + ( 1 ) k t m r ,
and
l = 0 V k l , m ( r ) ( ς ) t l = 2 ς V k t 1 ς V k t + ( 1 ) k t m r .
Now, the finite sums involving the generalized Fibonacci and Lucas polynomials are defined as follows:
i = 0 l ς i i ! U k ( l i ) ( ς ) = M E ( k , l , ς ) and i = 1 l ς i i U k ( l i ) ( ς ) = M L ( k , l , ς ) , i = 0 l ς i i ! V k ( l i ) ( ς ) = N E ( k , l , ς ) and i = 1 l ς i i V k ( l i ) ( ς ) = N L ( k , l , ς ) .
These sums are called as M-type polynomials and N-type polynomials (Table 1 and Table 2). The graphical representations of these polynomials obtained for the values k = p = 2 and l = 5 are presented in Figure 1.
While M E ( k , l , ς ) and M L ( k , l , ς ) are smoother and less oscillatory functions, N E ( k , l , ς ) and N L ( k , l , ς ) are more oscillatory and complex. Moreover, all functions except M E ( k , l , ς ) pass through the origin.
Now, the following recurrence relations characterize the behavior of M E ( k , l , ς ) ,   M L ( k , l , ς ) ,   N E ( k , l , ς ) and N L ( k , l , ς ) . These relations involve the parameter k and variable ς , and hold for all integer l 1 .
Lemma 2.
For any positive integers l , k , we have
M E ( k , l + 1 , ς ) ς V k M E ( k , l , ς ) + ( 1 ) k M E ( k , l 1 , ς ) = ς l l ! U k , N E ( k , l + 1 , ς ) ς V k N E ( k , l , ς ) + ( 1 ) k N E ( k , l 1 , ς ) = ς l + 1 l ! 2 l + 1 V k , M L ( k , l + 1 , ς ) ς V k M L ( k , l , ς ) + ( 1 ) k M L ( k , l 1 , ς ) = ς l l U k , N L ( k , l + 1 , ς ) ς V k N L ( k , l , ς ) + ( 1 ) k N L ( k , l 1 , ς ) = ς l + 1 2 l + 1 V k l .
Proof. 
From (14), we can write
ς V k M E ( k , l , ς ) ( 1 ) k M E ( k , l 1 , ς ) = i = 0 l ς i i ! ς V k U k ( l i ) ( ς ) ( 1 ) k i = 0 l 1 ς i i ! U k ( l 1 i ) ( ς ) = i = 0 l 1 ς i i ! ς V k U k ( l i ) ( ς ) ( 1 ) k U k ( l 1 i ) ( ς ) = i = 0 l 1 ς i i ! U k ( l + 1 i ) ( ς ) = M E ( k , l + 1 , ς ) ς l l ! U k ,
as claimed. Similarly, the other recurrence relations can be given.    □
Lemma 3.
For any positive integers l , k , the generating functions of M E ( k , l , ς ) ,   M L ( k , l , ς ) ,   N E ( k , l , ς ) and N L ( k , l , ς ) are given by
l = 0 M E ( k , l , ς ) t l = U k t 1 ς V k t + ( 1 ) k t 2 e ς t ,
l = 1 M L ( k , l , ς ) t l = U k t 1 ς V k t + ( 1 ) k t 2 ln ( 1 ς t ) , l = 0 N E ( k , l , ς ) t l = 2 ς V k t 1 ς V k t + ( 1 ) k t 2 e ς t , l = 1 N L ( k , l , ς ) t l = 2 ς V k t 1 ς V k t + ( 1 ) k t 2 ln ( 1 ς t ) .
Proof. 
By Lemma 1, consider that
l = 0 M E ( k , l , ς ) t l = l = 0 i = 0 l ς i i ! U k ( l i ) ( ς ) t l = l = 0 ς l l ! t l l = 0 U k l ( ς ) t l = U k t 1 ς V k t + ( 1 ) k t 2 e ς t .
Similarly, the other generating functions are obtained.    □
In Theorems 1 and 2, various identities are presented in detail, involving the four newly defined polynomial families, the generalized Humbert polynomial U k l , m ( r ) ( ς ) , the polynomial V k l , m ( r ) ( ς ) , and the Cauchy numbers of the first kind. These identities not only reveal the underlying algebraic structures but also provide a framework for exploring the combinatorial properties of the polynomials.
Theorem 1.
For any positive integers l , k , r , we have
U k U k l , 2 ( r ) ( ς ) = j = 0 l i = 0 j M E ( k , l j , ς ) U k ( j i + 1 ) , 2 ( r 1 ) ( ς ) ς i i ! , = 1 ς j = 0 l i = 0 j ( ς ) i C i i ! U k ( j i + 1 ) , 2 ( r 1 ) ( ς ) M L ( k , l j + 1 , ς ) .
Proof. 
By (12) and (15), we can write
l = 0 U k l , 2 ( r ) ( ς ) t l = t e ς t 1 ς V k t + 1 k t 2 1 1 ς V k t + 1 k t 2 r 1 e ς t = 1 U k l = 0 M E ( k , l , ς ) t l l = 0 U k ( l + 1 ) , 2 ( r 1 ) ( ς ) t l l = 0 ς l t l l ! = 1 U k l = 0 M E ( k , l , ς ) t l l = 0 i = 0 l ς i U k ( l i + 1 ) , 2 ( r 1 ) ( ς ) t l i ! = 1 U k l = 0 j = 0 l i = 0 j ς i M E ( k , l j , ς ) U k ( j i + 1 ) , 2 ( r 1 ) ( ς ) t l i !
from the product of the generating functions. Thus, the first equality is given. Similarly, with the help of (9), using product of generating functions, we have the second equality.    □
Theorem 2.
For any positive integers l , k , r , we have
V k l , 2 ( r ) ( ς ) = j = 0 l i = 0 j N E ( k , l j , ς ) V k ( j i ) , 2 ( r 1 ) ( ς ) ς i i ! = 1 ς j = 0 l i = 0 j N L ( k , l j + 1 , ς ) V k ( j i ) , 2 ( r 1 ) ( ς ) C i ς i i ! .
Proof. 
From Lemma 3, (9) and (13), the proof is complete.    □
The polynomials g l ( r ) and f l ( r ) , which are expressed by recurrence relations, are represented in closed form by means of the generalized Humbert polynomial U k l , m ( r ) ( ς ) , the polynomial V k l , m ( r ) ( ς ) and (8).
Theorem 3.
For any positive integers l , k and r , we have
g l ( r ) = U k r i = 0 l r U k ( l r i + 1 ) , 2 ( r ) ( ς ) r i ς i i ! and f l ( r ) = i = 0 l r V k ( l r i ) , 2 ( r ) ( ς ) D i r ς i + r i ! ,
where as shown in (5), for l r + 1
g r ( r ) = U k r , g l ( r ) = 1 ( l r ) U k j = 1 l r j + 1 r + 1 l + 1 M E ( k , j + 1 , ς ) g l j ( r ) , f r ( r ) = 2 ς r , f l ( r ) = 1 2 ς ( l r ) j = 1 l r j + 1 r + 1 l + 1 N L ( k , j + 1 , ς ) f l j ( r ) .
Proof. 
By (12), we have   
l = r g l ( r ) t l = l = 1 M E ( k , l , ς ) t l r = U k r l = 0 U k ( l + 1 ) , 2 ( r ) ( ς ) t l l = 0 r ς l t l l ! = U k r l = r i = 0 l r U k ( l r i + 1 ) , 2 ( r ) ( ς ) r ς i i ! t l ,
as claimed. Similarly, the other identity is obtained.    □
In the following theorem, the polynomials M E ( k , l , ς ) and M L ( k , l , ς ) are expressed in closed form involving the generalized Fibonacci and Lucas polynomials.
Theorem 4.
For any positive integers l , k , we have
M L ( k , l , ς ) = j = 0 l 2 i = 1 l j 1 ς l j 1 V k l j i 1 i U k V k j ( ς ) U k ( j + 1 ) ( ς ) ,
and
N L ( k , l , ς ) + 1 k ς l + 2 V k l + 2 i = 1 l 1 i V k i = j = 1 l i = 1 j ς j V k j i 1 i ς 2 V k 2 U k U k ( l j 1 ) ( ς ) 2 ς V k U k U k ( l j ) ( ς ) + V k ( l j ) ( ς ) .
Proof. 
By (6) and (16), consider that
l = 1 M L ( k , l , ς ) t l = U k t ln ( 1 ς t ) 1 ς V k t 1 ς V k t 1 ς V k t + ( 1 ) k t 2 = U k t ln ( 1 ς t ) 1 ς V k t 2 ς V k t 1 ς V k t + ( 1 ) k t 2 1 U k U k 1 ς V k t + ( 1 ) k t 2 = U k t ln ( 1 ς t ) 1 ς V k t i = 0 V k i ( ς ) t i 1 U k i = 0 U k i + 1 ( ς ) t i = U k l = 2 i = 1 l 1 ς l 1 V k l i 1 i t l i = 0 V k i ( ς ) 1 U k U k ( i + 1 ) ( ς ) t i
and then, equals
U k l = 2 j = 0 l 2 i = 1 l j 1 ς l j 1 V k l j i 1 i V k j ( ς ) 1 U k U k ( j + 1 ) ( ς ) t l
with product of the generating functions, the first sum is obtained. Similarly, by Lemma 3, the other sum is given. Thus, we have the proof.    □
The following theorem clearly reveals the relationship between the polynomials M E ( k , l , ς ) and M L ( k , l , ς ) .
Theorem 5.
For any positive integers l , k , we have
M L ( k , l , ς ) = j = 1 l i = 1 j 1 j i ς j i ( j i ) ! M E ( k , l j , ς ) .
Proof. 
By (6), (11) and (14), we have   
l = 1 M L ( k , l , ς ) t l = U k t 1 ς V k t + ( 1 ) k t 2 ln ( 1 ς t ) = ln ( 1 ς t ) e ς t l = 0 M E ( k , l , ς ) t l = l = 1 ς l t l l l = 0 ς l t l l ! l = 0 M E ( k , l , ς ) t l = l = 1 i = 1 l ς l i 1 l i ( l i ) ! t l l = 0 M E ( k , l , ς ) t l = l = 1 j = 1 l i = 1 j ς j i 1 j i ( j i ) ! M E ( k , l j , ς ) t l ,
as claimed.    □
The following theorem establishes a fundamental identity between the newly defined M E ( k , j , ς ) polynomial family and the generalized Fibonacci polynomials U k l ( ς ) , formulated through the Stirling numbers of the first kind S 1 ( i , j ) .
Theorem 6.
For any positive integers l , k , we have
i = 0 l j = 0 i j ! ( 1 ) j + i i ! ς l i U k j ( ς ) S 1 ( i , j ) = ( 1 ) l l ! j = 0 l 1 j j ! M E ( k , j , ς ) S 1 ( l , j ) .
Proof. 
From (7) and (11), we obtain that
U k ln ( 1 t ) e ς ln ( 1 t ) 1 ς V k ln ( 1 t ) + ( 1 ) k ln ( 1 t ) 2 = ( 1 t ) ς l = 0 U k l ( ς ) ( ln ( 1 t ) ) l = ( 1 t ) ς l = 0 1 l l ! U k l ( ς ) i = l S 1 ( i , l ) t i i ! = l = 0 ς l ( 1 ) l t l i = 0 l = 0 i 1 l U k l ( ς ) l ! S 1 ( i , l ) t i i ! = j = 0 i = 0 j l = 0 i ( 1 ) l + j i U k l ( ς ) S 1 ( i , l ) l ! i ! ς j i t j
and by (7), (14)
l = 0 M E ( k , l , ς ) ( ln ( 1 t ) ) l = l = 0 1 l l ! M E ( k , l , ς ) i = l S 1 ( i , l ) t i i ! = l = 0 j = 0 l 1 j M E ( k , j , ς ) j ! S 1 ( l , j ) t l l ! .
Thus, combining (17) and (18), we have the proof.    □

3. Numerical Investigation of Root Properties of the Generalized Fibonacci Polynomials

In this section, we present the graphical representations of the polynomials, analyze their zeros [15], examine the distribution of roots, explore the correlations among the largest roots, and investigate both the root magnitude distribution and the root density distribution. The study of root structures arises from the need to observe the fundamental mathematical properties of these generalized polynomial families [16]. While root distribution patterns reveal structural relationships between different types of polynomials, the correlation analysis among the largest roots provides insights into their asymptotic behavior. Moreover, the density distribution analysis helps to characterize how these polynomials partition the complex plane and offers implications for special cases. In this paper, all data analysis and visualization processes were carried out using Python 3.12.4 [17] in the Jupyter Notebook [18] environment within the Anaconda distribution.
Now, the initial terms of the M-type and N-type polynomials are shown in Table 3 and Table 4.
For each pairwise polynomial of degrees 2 l 13 , the roots of M E 2 , l , ς = 0 and M L 3 , l , ς = 0 are distributed in a simpler, ring-like pattern, while the roots of N E 4 , l , ς = 0 and N L 5 , l , ς = 0 exhibit a denser and more complex structure near the center (Table 5 and Table 6). All roots are symmetric with respect to the real axis, and as l increases, the roots spread vertically, forming layered distributions. Among them, N L 5 , l , ς shows the most complex root behavior, whereas M E 2 , l , ς remains the simplest.
In Figure 2, each color represents a different value of k, and the roots illustrate their distribution on the complex plane. The fact that the roots form vertical layers as l increases indicates that there are characteristic ranges of root magnitudes for each degree. The symmetric distribution of all roots with respect to the real axis is a consequence of the polynomials having real coefficients. The tendency of the roots to cluster closer to the origin as k increases demonstrates the systematic influence of the parameter k on root magnitudes. The differences in the observed root distribution patterns between the polynomials M E 2 , l , ς and N L 5 , l , ς reflect the fundamental distinction between the generalized Fibonacci polynomials U k l ( ς ) and the generalized Lucas polynomials V k l ( ς ) used in their definitions. Although these polynomials have the same recurrence relations, they possess different initial conditions, which contribute to the differing root behaviors observed in the visualizations. The formation of vertical layers by the roots as l increases further confirms the presence of characteristic ranges of root magnitudes for each degree. More specifically, this difference can be explained by how the initial values propagate through the recurrence relations. The M-type polynomials, which originate from initial values of U 0 ( ς ) = 0 . This allows for the possibility of roots at the origin ( ς = 0 ) for certain degrees, contributing to their simpler, ring-like patterns. In contrast, the N-type polynomials start from initial values of V 0 ( ς ) = 2 . The nonzero constant term ‘2’ in their definition generally results in a non-zero value at ς = 0 , preventing a root at the origin and contributing to the denser and more complex root distributions observed for the N E k , l , ς and N L k , l , ς polynomials.
The Figure 3 clearly demonstrate how each polynomial family evolves with increasing degree. While M-type polynomials exhibit relatively smoother oscillatory behavior, N-type polynomials display more pronounced fluctuations, reflecting the different initial conditions in their recurrence relations. Notably, despite these visual differences in oscillation patterns, as l increases, the maximum root magnitudes across all families converge toward similar values and exhibit proportional growth rates.
In Figure 4, high correlation values ( r > 0.8 ) indicate that the polynomial families exhibit similar behavior for different values of k. As expected from the visual analysis in Figure 4, as l increases (lighter-colored points), the maximum root values display a stronger linear relationship. The minimal influence of changes in the parameter k on correlation values demonstrates that these relationships are fundamental properties independent of the choice of k. As illustrated in Figure 3 and Figure 4, the consistency of these behavioral patterns across different polynomial types reinforces the fundamental mathematical relationships underlying these generalized Fibonacci-based polynomial families. While the newly introduced polynomial families are not orthogonal in the classical sense, they are defined by recurrence relations. For high degrees, the leading-order behavior of solutions to such recurrences tends to dominate, overriding the influence of initial conditions or lower-order terms. This is the likely reason why the largest roots follow a similar, predictable pattern across the different families, explaining the high correlation observed.
In some correlation plots, particularly for lower-order polynomials ( l = 2 , 3 , represented by dark-colored points), slight deviations of a few data points from the overall linear trend can be observed. These potential outliers correspond to cases where the recurrence relations have not yet converged to their asymptotic behavior. However, when the value of l exceeds 5, all polynomial families exhibit strong correlations, indicating that the linear relationships between the maximum roots become increasingly robust for higher-order polynomials. This observation is consistent with the expectation that, for sufficiently large degrees, the dominant terms in the recurrence relations govern the behavior, minimizing the influence of initial conditions that may cause deviations at lower degrees. Therefore, although outliers appear for small l values, they do not affect the general conclusion regarding the strong correlation patterns observed among the polynomial families.
Figure 5 histograms reveal that the root magnitudes of different polynomial families exhibit distinct patterns. The M E 4 , l , ς polynomial shows a relatively balanced distribution—that is, the histogram bars remain at comparable heights across different magnitude intervals—and contains roots spread over a wider range compared to the other families. The roots of each M L 4 , l , ς polynomial tend to cluster at smaller values—as evidenced by the higher frequency counts concentrated on the left side of the histogram—and exhibit a narrower distribution range—illustrated by the compressed width of the non-zero bins. The N E 4 , l , ς polynomial displays a pronounced accumulation of roots at larger magnitudes—observable as progressively taller bars toward the right side of the histogram—reflecting the nature of Lucas polynomials. The N L 4 , l , ς polynomial shows the most dramatic behavior, with the majority of its roots concentrated in the highest-density interval—as indicated by the dominant peak in the rightmost bins containing significantly more roots than other intervals.
The increase of the k value from 4 to 7 leads to a general rise in density values for all polynomials; this is an expected outcome due to the direct influence of the k parameter on polynomial coefficients. Notably, the characteristic shape of each polynomial’s distribution is preserved—the relative pattern of bar heights and the location of concentration regions remain qualitatively similar despite the scale change. This indicates that the observed distribution patterns arise from the intrinsic structural properties of the polynomial families and are independent of the k value.
The clustering of large-magnitude roots in the N L 4 , l , ς polynomial—referring to the accumulation in high-magnitude bins—supports the correlation analysis shown in Figure 4. The systematic behavior of these large roots arises from the fact that, as the polynomial degree increases, the largest roots dominate the overall behavior of the polynomial. The “maximum roots” compared in Figure 4 originate from this dense region—the area corresponding to the highest bars in the histogram. While the M-type polynomials M E 4 , l , ς and M L 4 , l , ς , which include generalized Fibonacci polynomials, exhibit a more uniform distribution—with roots spread over multiple bins without any interval dominating the frequency count—the N-type polynomials N E 4 , l , ς and N L 4 , l , ς , which include generalized Lucas polynomials, show concentration at extreme values—appearing as pronounced peaks at the high-magnitude end of the histograms. This distinction highlights the different mathematical characteristics of the two groups.
In Figure 6, the kernel density estimation (KDE) provides a detailed view of how the root values of each polynomial family are distributed along the real axis. To obtain smooth probability density estimates from discrete root samples, we employ Gaussian kernel density estimation using scipy.stats.gaussian_kde. The KDE method approximates the underlying continuous probability density function as:
f ^ ( x ) = 1 n h i = 1 n K x x i h
where K is the Gaussian kernel function K ( u ) = 1 2 π e 1 2 u 2 , n is the total number of root samples across all degrees ( 2 l 13 ), h is the bandwidth parameter automatically selected using Scott’s rule h = n 1 / ( d + 4 ) σ (with d = 1 denoting the dimensionality and σ the standard deviation of the root data), and x i are the observed root values. The density curves are computed over 1000 equally spaced points in the interval [ 0.35 , 0.35 ] .
The M L ( 4 , l , ς ) polynomial (blue) exhibits a sharp, high peak centered around zero, indicating that most of its roots are concentrated near the origin. In contrast, the M E ( 4 , l , ς ) polynomial (red) shows a bimodal distribution with peaks in two distinct regions, reflecting a tendency for roots to cluster in certain symmetric areas.
The N E ( 4 , l , ς ) (green) and N L ( 4 , l , ς ) (orange) polynomials display broader and more uniform distributions; however, N E ( 4 , l , ς ) also exhibits a slight bimodal characteristic similar to M E ( 4 , l , ς ) . When the value of k increases from 4 to 7, the overall shapes of the distributions remain preserved, with only a scaling factor changing. This consistency confirms that the characteristic root distribution patterns of each polynomial family are intrinsic structural features, independent of the k parameter.

4. Conclusions

This study introduces a unified framework for the simultaneous investigation of generalized Fibonacci numbers and their associated polynomial extensions. Four novel families of polynomials— M E ( k , l , ς ) , M L ( k , l , ς ) , N E ( k , l , ς ) , and N L ( k , l , ς ) —have been defined through systematic extensions of the generalized Fibonacci polynomials U k l ( ς ) and V k l ( ς ) . Furthermore, broader generalizations have been explored via the extended Humbert-type polynomials U k l , m ( r ) ( ς ) and V k l , m ( r ) ( ς ) .
Based on the algebraic structures and generating functions of these newly introduced polynomial families, several original algebraic and combinatorial identities have been derived. In addition, graphical representations of selected polynomial families were presented, their roots were analyzed, the distribution of root values was examined, and the correlations among the largest roots were investigated. The root magnitude distribution and root value density distribution were also evaluated, contributing to a deeper understanding of the underlying structural properties of these polynomial sequences.
In future research, several directions can be pursued. These include investigating the combinatorial interpretations of the newly introduced polynomial families, deriving the differential equations for which these polynomials serve as solutions, exploring the applications of the obtained identities in other fields of mathematics and physics, and examining the orthogonality properties of these new polynomials. Such studies would further broaden the theoretical and applied significance of the proposed framework.

Author Contributions

Conceptualization, S.K., N.Ö., S.B., K.S.M., W.A.K. and A.A.; methodology, S.K., N.Ö., S.B., K.S.M., W.A.K. and A.A.; software, A.A. and W.A.K.; validation, S.K., N.Ö., S.B., K.S.M., W.A.K. and A.A.; formal analysis, W.A.K.; investigation, N.Ö.; resources, S.K.; data curation, S.B.; writing—original draft preparation, K.S.M., W.A.K. and A.A.; writing—review and editing, W.A.K.; visualization, S.K., N.Ö., S.B., K.S.M., W.A.K. and A.A.; supervision, S.K., N.Ö., S.B., K.S.M., W.A.K. and A.A.; project administration, S.K., N.Ö. and S.B.; funding acquisition, K.S.M. All authors have read and agreed to the published version of the manuscript.

Funding

The Researchers would like to thank the Deanship of Graduate Studies and Scientific Research at Qassim University for financial support (QU-APC-2025).

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Acknowledgments

The authors would like to thank the Reviewers’ for their valuable comments and suggestions, which have improved the presentation of this paper.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Horadam, A.F. Extension of a synthesis for a class of polynomial sequences. Fibonacci Quart. 1996, 34, 68–74. [Google Scholar] [CrossRef]
  2. Nallı, A.; Haukkanen, P. On generalized Fibonacci and Lucas polynomials. Chaos Solitons Fractals 2009, 42, 3179–3186. [Google Scholar] [CrossRef]
  3. Wang, W.; Wang, H. Generalized Humbert polynomials via generalized Fibonacci polynomials. Appl. Math. Comput. 2017, 307, 204–216. [Google Scholar] [CrossRef]
  4. Wang, W.; Wang, H. Some results on convolved (p, q)-Fibonacci polynomials. Integral Transform. Spec. Funct. 2015, 26, 340–356. [Google Scholar] [CrossRef]
  5. Gould, H.W. Inverse series relations and other expansions involving Humbert polynomials. Duke Math. J. 1965, 32, 697–711. [Google Scholar] [CrossRef]
  6. Pathan, M.A.; Khan, M.A. On polynomials associated with Humbert’s polynomials. Publ. Inst. Math. 1997, 62, 53–62. [Google Scholar]
  7. Alam, N.; Wani, S.A.; Khan, W.A.; Kotecha, K.; Zaidi, H.N.; Gassem, F.; Altaleb, A. On a class of generalized multivariate Hermite–Humbert polynomials via generalized Fibonacci polynomials. Symmetry 2024, 16, 1415. [Google Scholar] [CrossRef]
  8. Cvijović, D. New identities for the partial Bell polynomials. Appl. Math. Lett. 2011, 24, 1544–1547. [Google Scholar] [CrossRef]
  9. Comtet, L. Advanced combinatorics. In The Art of Finite and Infinite Expansions, Revised and Enlarged Edition; D. Reidel Publishing Co.: Dordrecht, The Netherlands; Boston, MA, USA, 1974. [Google Scholar]
  10. Srivastava, H.M.; Choi, J. Zeta and q-Zeta Functions and Associated Series and Integrals; Elsevier; Science Publishers: Amsterdam, The Netherlands; London, UK; New York, NY, USA, 2012. [Google Scholar]
  11. Kim, D.S.; Kim, T.; Lee, S.H.; Seo, J.J. Higher-order Daehee numbers and polynomials. Int. J. Math. Anal. 2014, 8, 273–283. [Google Scholar] [CrossRef]
  12. Koshy, T. Fibonacci and Lucas Numbers with Applications, 2nd ed.; Pure and Applied Mathematics (Hoboken); John Wiley & Sons, Inc.: Hoboken, NJ, USA, 2018; Volume 1. [Google Scholar]
  13. Horadam, A.F. Basic properties of a certain generalized sequence of numbers. Fibonacci Q. 1965, 3, 161–176. [Google Scholar] [CrossRef]
  14. Kılıç, E.; Stanica, P. Factorizations and representations of second order linear recurrences with indices in arithmetic progressions. Bull. Mex. Math. Soc. 2009, 15, 23–36. [Google Scholar]
  15. Gilewicz, J. Zeros of polynomials and recurrence relations with periodic coefficients. J. Comput. Appl. Math. 1999, 107, 241–255. [Google Scholar] [CrossRef]
  16. Abd-Elhameed, W.M.; Ahmed, H.M.; Napoli, A.; Kowalenko, V. New Formulas Involving Fibonacci and Certain Orthogonal Polynomials. Symmetry 2023, 15, 736. [Google Scholar] [CrossRef]
  17. Python Software Foundation. Python: A Dynamic, Open Source Programming Language, Version 3.12.4. 2024. Available online: https://www.python.org/ (accessed on 22 July 2025).
  18. Kluyver, T.; Ragan-Kelley, B.; Pérez, F.; Granger, B.; Bussonnier, M.; Frederic, J.; Kelley, K.; Hamrick, J.; Grout, J.; Corlay, S.; et al. Jupyter Notebooks—A publishing format for reproducible computational workflows. In Positioning and Power in Academic Publishing: Players, Agents and Agendas; Loizides, F., Schmidt, B., Eds.; IOS Press: Amsterdam, The Netherlands, 2016; pp. 87–90. [Google Scholar] [CrossRef]
Figure 1. For p = 2 ,   graphs   of   M E ( 2 , 5 , ς ) ,   M L ( 2 , 5 , ς ) ,   N E ( 2 , 5 , ς ) and N L ( 2 , 5 , ς ) using Python 3.12.4 in Jupyter Notebook 7.0.8.
Figure 1. For p = 2 ,   graphs   of   M E ( 2 , 5 , ς ) ,   M L ( 2 , 5 , ς ) ,   N E ( 2 , 5 , ς ) and N L ( 2 , 5 , ς ) using Python 3.12.4 in Jupyter Notebook 7.0.8.
Symmetry 17 01898 g001
Figure 2. Three-dimensional visualization of the roots of the M E 2 , l , ς = 0 , M L 3 , l , ς = 0 , N E 4 , l , ς = 0 , and N L 5 , l , ς = 0 polynomials for the cases k = 2 , 3 , 4 , 5 (degree 2 l 13 ).
Figure 2. Three-dimensional visualization of the roots of the M E 2 , l , ς = 0 , M L 3 , l , ς = 0 , N E 4 , l , ς = 0 , and N L 5 , l , ς = 0 polynomials for the cases k = 2 , 3 , 4 , 5 (degree 2 l 13 ).
Symmetry 17 01898 g002
Figure 3. Comparison of M-type and N-type polynomials for k = 4 and l = 2 , 5 , 8 , 11 , 13 .
Figure 3. Comparison of M-type and N-type polynomials for k = 4 and l = 2 , 5 , 8 , 11 , 13 .
Symmetry 17 01898 g003
Figure 4. Maximum root correlation analysis between polynomial pairs for the cases k = 4 in (a) and k = 7 in (b).
Figure 4. Maximum root correlation analysis between polynomial pairs for the cases k = 4 in (a) and k = 7 in (b).
Symmetry 17 01898 g004
Figure 5. Root magnitude distributions for the cases k = 4 in (a) and k = 7 in (b).
Figure 5. Root magnitude distributions for the cases k = 4 in (a) and k = 7 in (b).
Symmetry 17 01898 g005
Figure 6. Root density distributions for the cases k = 4 in (a) and k = 7 in (b) (KDE analysis). The brown shaded region represents the cumulative density combining all four polynomial families.
Figure 6. Root density distributions for the cases k = 4 in (a) and k = 7 in (b) (KDE analysis). The brown shaded region represents the cumulative density combining all four polynomial families.
Symmetry 17 01898 g006aSymmetry 17 01898 g006b
Table 1. The few terms of M-type polynomials.
Table 1. The few terms of M-type polynomials.
l M E ( k , l , ς ) M L ( k , l , ς )
00
1 U k 0
2 ς U k V k + 1 ς U k
3 U k ς 2 V k 2 + V k + 1 2 + 1 k + 1 ς 2 U k V k + 1 2
Table 2. The few terms of N-type polynomials.
Table 2. The few terms of N-type polynomials.
l N E ( k , l , ς ) N L ( k , l , ς )
02
1 ς ( V k + 2 ) 2 ς
2 ς 2 V k 2 + V k + 1 + 2 1 k + 1 ς 2 V k + 1
3 ς 3 V k 3 + V k 2 + 1 2 V k + 1 3 + ( 1 ) k + 1 ς ( 3 V k + 2 ) ς 3 V k 2 + V k 2 + 2 3 + 2 ς ( 1 ) k + 1
Table 3. A few of M-type polynomials for k = 2 , 3 with 1 l 6 .
Table 3. A few of M-type polynomials for k = 2 , 3 with 1 l 6 .
l M E ( 2 , l , ς ) M L ( 3 , l , ς )
120
2 4 ς 2 ς
3 25 2 ς 2 1 9 ς 2
4 1 3 ( 113 ς 3 21 ς ) 2 3 55 ς 3 + 3 ς
5 2713 24 ς 4 67 2 ς 2 + 1 1 6 883 ς 4 + 102 ς 2
6 1 30 10174 ς 5 4145 ς 3 + 300 ς 2 15 4418 ς 5 + 785 ς 3 + 15 ς
Table 4. A few of N-type polynomials for k = 2 , 3 with 1 l 6 .
Table 4. A few of N-type polynomials for k = 2 , 3 with 1 l 6 .
l N E ( 4 , l , ς ) N L ( 5 , l , ς )
1 9 ς 2 ς
2 57 ς 2 2 12 ς 2
3 1 6 2375 ς 3 138 ς 1 6 763 ς 3 + 12 ς
4 11079 4 ς 4 218 ς 2 + 2 1 3 4187 ς 4 + 102 ς 2
5 1 120 2326557 ς 5 230620 ς 3 + 4440 ς 1 60 920999 ς 5 + 30070 ς 3 + 120 ς
6 48857677 360 ς 6 194671 12 ς 4 + 477 ς 2 2 1 20 3376959 ς 6 + 138170 ς 4 + 1120 ς 2
Table 5. Approximate solutions of M E 2 , l , ς = 0 and M L 3 , l , ς = 0 .
Table 5. Approximate solutions of M E 2 , l , ς = 0 and M L 3 , l , ς = 0 .
Degree l ς Solutions of M E 2 , l , ς = 0 ς Solutions of M L 3 , l , ς = 0
200
3±0.28280
4 0 , ± 0.43110, ± 0.2860 i
5±0.5125, ±0.18350, ± 0.3399 i
60, ± 0.5597 , ± 0.3068 0, ± 0.3948 i , ± 0.1476 i
7±0.5888, ±0.3916, ±0.13600, ± 0.4263 i , ± 0.2416 i
80, ±0.6076, ±0.4514, ±0.23790, ± 0.4457 i , ± 0.3039 i , ± 0.1075 i
Table 6. Approximate solutions of N E 4 , l , ς = 0 and N L 5 , l , ς = 0 .
Table 6. Approximate solutions of N E 4 , l , ς = 0 and N L 5 , l , ς = 0 .
Degree l ς Solutions of N E 4 , l , ς = 0 ς Solutions of N L 5 , l , ς = 0
2±0.18730
30, ± 0.2411 0, ± 0.1254 i
4±0.2610, ± 0.1030 0, ± 0.1561 i
50, ±0.2701, ± 0.1617 0, ± 0.1673 i , ± 0.0682 i
6±0.2750, ±0.1972, ± 0.0708 0, ± 0.1726 i , ± 0.1055 i
70, ±0.2780, ±0.2198, ± 0.1199 0, ± 0.1754 i , ± 0.1275 i , ± 0.0440 i
8±0.2798, ±0.2349, ± 0.1548, ± 0.0539 0, ± 0.1771 i , ± 0.1414 i , ± 0.0780 i
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Koparal, S.; Ömür, N.; Boz, S.; Mohamed, K.S.; Khan, W.A.; Adam, A. Generalized Fibonacci Polynomials and Their Properties. Symmetry 2025, 17, 1898. https://doi.org/10.3390/sym17111898

AMA Style

Koparal S, Ömür N, Boz S, Mohamed KS, Khan WA, Adam A. Generalized Fibonacci Polynomials and Their Properties. Symmetry. 2025; 17(11):1898. https://doi.org/10.3390/sym17111898

Chicago/Turabian Style

Koparal, Sibel, Neşe Ömür, Sezer Boz, Khidir Shaib Mohamed, Waseem Ahmad Khan, and Alawia Adam. 2025. "Generalized Fibonacci Polynomials and Their Properties" Symmetry 17, no. 11: 1898. https://doi.org/10.3390/sym17111898

APA Style

Koparal, S., Ömür, N., Boz, S., Mohamed, K. S., Khan, W. A., & Adam, A. (2025). Generalized Fibonacci Polynomials and Their Properties. Symmetry, 17(11), 1898. https://doi.org/10.3390/sym17111898

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Article metric data becomes available approximately 24 hours after publication online.
Back to TopTop