1. Introduction
The -Fibonacci and -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 -polynomials, allowing for the exploration of richer mathematical structures. When , the classical sequences are obtained as special cases, making these polynomials both a general and inclusive approach. The -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
as
with
and
. Nalli and Haukkanen [
2] introduced the
-Fibonacci polynomials
-Lucas polynomials, which encompass the Fibonacci, Pell, Lucas, and Pell–Lucas polynomials as particular cases.
Let
and
be real coefficients polynomials. For a fixed integer
the generalized
-Fibonacci and Lucas polynomials
and
[
3] are shown that for
with
and
with
Specially, when
and
are the
-Fibonacci and Lucas polynomials, respectively.
In 1965, Gould introduced the Humbert polynomials defined by
and investigated their explicit expressions, recurrence relations, and higher-order derivatives. By assigning specific values to the parameters
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
where
m is a positive integer and other parameters are unrestricted in general.
For each complex number
Wang et al. [
4] defined the generalized Humbert polynomials
as convolutions of
by the generating function
Note that when
are generalized
-Fibonacci polynomials. The explicit expression of
is given by
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
is given by
Cvijović showed that
where the numbers
are the coefficients of the powers of
t
for a fixed positive integer
r and
[
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
is given by the infinite series
which converges for all real and complex values of
Logarithm function
can be expressed as a power series expansion around
valid for
as follows
The Stirling numbers are widely recognized for their fundamental role in combinatorial analysis. In [
9,
10], the Stirling numbers of the first kind
are usually defined as the coefficients of the powers of
t in
where
in which for
is the Kronecker delta. The generating function of
is given by
The Daehee numbers of the first kind of order
[
11], are defined by the generating functions to be
For
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
[
9] have the generating function
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
and
, 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
and
[
13], are defined for
and nonzero integer number
p by
in which
and
, respectively.
Kılıç and Stanica [
14] derived the following recurrence relations for the sequences
and
for
,
. It is clearly that
where the initial conditions are
and
respectively.
Now, we will define the generalized Fibonacci and Lucas polynomials.
Definition 1. For any positive integers the generalized Fibonacci and Lucas polynomials are defined bywith initial conditions and respectively, where is l-th generalized Fibonacci number and is l-th. generalized Lucas number. Clearly, Binet forms of
and
are given by
where
and
Note that
Lemma 1. For any positive integer we have Proof. Consider that
with (
10). Similarly, the generating function of
is obtained. □
Now, from (
1) and (
2), Definition 2 can be given as follows:
Definition 2. For any positive integers the generalized -Fibonacci polynomials and the generalized -Lucas polynomials [3] are defined by for with the initial conditions andwith the initial conditions Taking
and
in (
3) and (
4), the generating functions of the generalized Humbert polynomial
and polynomial
are given by
and
Now, the finite sums involving the generalized Fibonacci and Lucas polynomials are defined as follows:
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
and
are presented in
Figure 1.
While and are smoother and less oscillatory functions, and are more oscillatory and complex. Moreover, all functions except pass through the origin.
Now, the following recurrence relations characterize the behavior of and . These relations involve the parameter k and variable , and hold for all integer .
Lemma 2. For any positive integers we have Proof. From (
14), we can write
as claimed. Similarly, the other recurrence relations can be given. □
Lemma 3. For any positive integers the generating functions of and are given by Proof. By Lemma 1, consider that
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 , the polynomial , 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 we have Proof. By (
12) and (
15), we can write
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 we have Proof. From Lemma 3, (
9) and (
13), the proof is complete. □
The polynomials
and
, which are expressed by recurrence relations, are represented in closed form by means of the generalized Humbert polynomial
, the polynomial
and (
8).
Theorem 3. For any positive integers and we havewhere as shown in (5), for Proof. By (
12), we have
as claimed. Similarly, the other identity is obtained. □
In the following theorem, the polynomials and are expressed in closed form involving the generalized Fibonacci and Lucas polynomials.
Theorem 4. For any positive integers we haveand Proof. By (
6) and (
16), consider that
and then, equals
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 and
Theorem 5. For any positive integers we have Proof. By (
6), (
11) and (
14), we have
as claimed. □
The following theorem establishes a fundamental identity between the newly defined polynomial family and the generalized Fibonacci polynomials , formulated through the Stirling numbers of the first kind .
Theorem 6. For any positive integers we have Proof. From (
7) and (
11), we obtain that
and by (
7), (
14)
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
, the roots of
and
are distributed in a simpler, ring-like pattern, while the roots of
and
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,
shows the most complex root behavior, whereas
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
and
reflect the fundamental distinction between the generalized Fibonacci polynomials
and the generalized Lucas polynomials
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
. This allows for the possibility of roots at the origin (
) for certain degrees, contributing to their simpler, ring-like patterns. In contrast, the N-type polynomials start from initial values of
. The nonzero constant term ‘2’ in their definition generally results in a non-zero value at
, preventing a root at the origin and contributing to the denser and more complex root distributions observed for the
and
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
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 (, 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
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
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
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
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
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
and
, 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
and
, 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:
where
K is the Gaussian kernel function
,
n is the total number of root samples across all degrees (
),
h is the bandwidth parameter automatically selected using Scott’s rule
(with
denoting the dimensionality and
the standard deviation of the root data), and
are the observed root values. The density curves are computed over 1000 equally spaced points in the interval
.
The polynomial (blue) exhibits a sharp, high peak centered around zero, indicating that most of its roots are concentrated near the origin. In contrast, the polynomial (red) shows a bimodal distribution with peaks in two distinct regions, reflecting a tendency for roots to cluster in certain symmetric areas.
The (green) and (orange) polynomials display broader and more uniform distributions; however, also exhibits a slight bimodal characteristic similar to . 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—, , , and —have been defined through systematic extensions of the generalized Fibonacci polynomials and . Furthermore, broader generalizations have been explored via the extended Humbert-type polynomials and .
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.