Abstract
We study a generalized class of Jacobsthal–Lucas polynomials that depends on two parameters. First, we introduce essential formulas for these polynomials, involving their series representation, inverse formula, and moment formula. These formulas allow us to investigate this generalized class of polynomials further and to develop novel formulations. The essential standard linearization problem of these polynomials is solved, and the linearization coefficients are given in simple forms. In addition, some mixed linearization formulas with other classes of polynomials are presented. The derivative formulas of these polynomials, expressed as combinations of different polynomials, are given. By employing symbolic algebra methods—most notably Zeilberger’s algorithm and other well-known identities from the literature—many hypergeometric functions appearing in the coefficients can be reduced, resulting in simpler expressions. In addition, some definite integrals are evaluated using the newly introduced formulas.
Keywords:
recurrence relations; moment formulas; linearization formulas; symbolic computation; definite integrals MSC:
11B83; 33C45; 33F10
1. Introduction
Special functions and their modified and generalized forms are crucial in many applied sciences. They are used as fundamental tools in modern applications. In physics, especially in quantum mechanics, special functions appear in closed-form solutions of differential equations describing fields, potentials, or scattering integrals; see, for example [1,2]. In addition, special functions play important roles in epidemiology and biological modeling, where fractional operators involving Mittag–Leffler and Wright functions capture memory and hereditary effects in disease dynamics; see, for example [3]. In statistics and probability, special functions are also important because they form the mathematical foundation for many common and advanced distributions; see, for example [4]. For additional applications of various special functions, the reader may consult [5,6,7].
The study of special polynomials, as well as their modified and generalized polynomials, continues to attract considerable attention across theoretical and applied mathematics. We present several theoretical contributions to the study of many polynomial sequences. A class of Sobolev orthogonal polynomials on the unit circle was introduced [8]. The theory of orthogonality in two variables was extended through establishing a class of bivariate Koornwinder–Sobolev orthogonal polynomials [9]. Exceptional orthogonal systems were analyzed [10]. In [11], finite exceptional orthogonal polynomial sequences that arise from rational Darboux transforms of Romanovski–Jacobi polynomials were developed. The connection between classical and generalized polynomial sequences was investigated [12]. Authors [13] developed some new formulas regarding specific classes of Jacobi polynomials, and other authors [14] introduced new polynomials that combine the Fibonacci and Lucas polynomials. Some new formulas of the convolved Fibonacci polynomials were established [15]. A study [16] introduced probabilistic Bernoulli and Euler polynomials, and an extension to multi-poly-Bernoulli polynomials was developed [17]. Probabilistic degenerate Bernoulli and Euler polynomials were formulated [18]. In addition, degenerate hypergeometric Bernoulli–Euler polynomials with new recurrence and generating function identities were investigated [19].
Among the essential sequences of polynomials are the Jacobsthal and Jacobsthal–Lucas polynomials. Many contributions have addressed these types of polynomials. In [20], some new results for specific Jacobsthal polynomials were derived. Authors [21] introduced Gaussian–Jacobsthal and Jacobsthal–Lucas polynomials and established several new formulas for them, including their generating functions and recurrence relations. In [22], the authors established generalized Jacobsthal and Jacobsthal–Lucas polynomial and developed some operational identities. In [23], the authors investigated certain third-order Jacobsthal and Jacobsthal–Lucas sequences. In [24], the authors proposed higher-order Jacobsthal–Lucas quaternions, extending the polynomial concept to quaternionic structures and established some algebraic and geometric interpretations. Other authors [25] introduced bivariate Jacobsthal and Jacobsthal–Lucas polynomial sequences. In [26], generalized Jacobsthal polynomials and certain associated formulas are presented, while [27] developed some formulas regarding Jacobsthal-type polynomials. In [28], the authors studied Jacobsthal representation polynomials and established connections with Lucas and Fibonacci frameworks. In [29], the authors investigated third-order Jacobsthal polynomials. Other modified Jacobsthal polynomials were proposed and investigated [30]. In [31], some applications of Jacobsthal and Jacobsthal–Lucas numbers in coding theory were given. Other generalized Jacobsthal polynomials were investigated [32]. Finally, in [33], the authors introduced a Jacobsthal-like sequence associated with k–Jacobsthal–Lucas numbers and presented some of their properties with potential cryptographic and computational applications.
Many formulas related to the study of sequences of polynomials are crucial in numerical analysis, particularly within the framework of spectral methods for the numerical solutions to various types of differential equations. The derivation of the derivatives of various sequences of polynomials in terms of their original polynomials is useful when applying the collocation method, as they help construct the operational matrices of the derivatives that are used to reformulate the governing equation and its associated conditions as a system of equations suitable for numerical treatment; see, for example [34,35]. In addition, the different derivative formulas are useful for computing the required inner products when employing the tau and Galerkin spectral methods; see, for example [36].
Hypergeometric functions are crucial in special functions and their applications. They can represent almost all important functions and polynomials. In addition, linearization and connection problems, which are important problems in this area, can be solved using these functions. Linearization and connection coefficients can often be expressed using the hypergeometric functions of different arguments; see, for example [37,38,39,40,41].
Here, we list the main contributions and the novelty of this work in the following points:
- We introduce a generalized class of Jacobsthal–Lucas polynomials depending on two parameters, which extends some of the special sequences.
- We establish some fundamental formulas of the generalized polynomials, such as the series form, the inversion formula, and the moment formulas. These formulas are derived in closed forms and, to the best of our knowledge, have not been reported in earlier works. In addition, they provide a fundamental basis for further investigation of such generalized polynomials.
- We derive new linearization formulas for these polynomials. More precisely, both standard and some mixed linearization formulas are obtained in closed forms.
- We establish new derivative formulas of these polynomials in terms of various polynomials. The inverse derivative formulas are also established.
- We establish new connection formulas between GLPs and other orthogonal and non-orthogonal polynomials.
- We obtain some new expressions of definite integrals involving the generalized Jacobsthal–Lucas polynomials, which further demonstrates the usefulness of the obtained results.
Here, we discuss the main contributions of related works and highlight the differences between the main results of these works and our results.
- The work in [22] focused mainly on generalized Jacobsthal and Jacobsthal–Lucas polynomials and some of their basic properties, including recurrence relations, generating functions, classical identities, and matrix representations.
- In [26], the authors studied generalized Jacobsthal and Jacobsthal–Lucas polynomials that were defined via higher-order recurrence relations depending on a parameter m.
- In [27], the authors derived some derivative sequences of generalized Jacobsthal and Jacobsthal–Lucas polynomials based on using the generating functions.
- In [32], the authors introduced -Jacobsthal-type polynomials and investigated their properties, including generating functions, Binet formulas, summation formulas, and combinatorial representations.
- In [33], the authors introduced a Jacobsthal-like sequence associated with the k–Jacobsthal–Lucas numbers, studied algebraic identities, and presented applications in computational and cryptographic contexts.
- From the above discussion, we note that none of the previous works considered the formulas developed in this paper, such as the linearization formulas or the connections of these generalized polynomials with different orthogonal and non-orthogonal polynomials, which may be useful for further analytical and computational applications. This motivated the development of such formulas.
The rest of this manuscript is structured as follows: Section 2 presents an account of some generalized Horadam polynomials, including Jacobsthal–Lucas polynomials as well as an account of some other polynomials. In Section 3, some fundamental formulas regarding GJLPs, such as their series form, their inversion formula, and the moment formula, are developed. Section 4 derives new linearization formulas for GJLPs, including the standard linearization formula of these polynomials. Section 5 derives some derivative formulas of GJLPs as combinations of different sequences of polynomials. This section also presents the inverse derivative formulas. Some new definite integrals involving GJLPs are developed in Section 6 based on the formulas obtained in the earlier sections. Finally, this paper concludes with remarks given in Section 7.
2. An Account of Some Generalized Polynomials and Symbolic Computation
We present an overview of some generalized sequences. Furthermore, we introduce a generalized sequence of polynomials, namely, generalized Jacobsthal–Lucas polynomials (GJLPs), which extend the well-known Jacobsthal–Lucas polynomials. Some other classes of polynomials are also considered. Additionally, an overview of the application of some useful symbolic algorithms is provided.
In [42], Horadam established two important classes of polynomials that can be generated using the following recurrence relations:
They have the following Binet formulas:
Certain choices of , and yield some important generalizations of Fibonacci and Lucas polynomials. The two generalized classes that are constructed by the following recurrence relations:
are, respectively, particular classes of (3) and (4).
Remark 1.
Jacobsthal–Lucas polynomials are particular cases of (4). They can be constructed with the aid of the following recurrence relation [43]:
Remark 2.
In this paper, we investigate a class of polynomials that generalizes the Jacobsthal–Lucas class of polynomials. More explicitly, we focus on the generalized class of polynomials generated by the recurrence formula given below:
The first few polynomials of are
2.1. An Overview of Some Polynomials
Some orthogonal and non-orthogonal polynomials are described. The emphasis is on two groups of polynomials: symmetric and non-symmetric. Here we denote them and . They can be expressed as
where and are known coefficients.
The inversion formulas corresponding to (9) and (10) can be assumed to have the following forms:
and and stand for known coefficients.
We provide some famous polynomials. The normalized Jacobi polynomials can be expressed as [14]
Note that the ultraspherical (normalized Gegenbauer polynomials) are defined as
The shifted normalized Jacobi polynomials on are defined as
which can be expressed as [14]:
and its inverse formula is
The set forms an orthogonal system on in the following sense:
with
Remark 3.
It is worth noting that the four kinds of Chebyshev polynomials are special cases of the classical Jacobi polynomials and admit trigonometric expressions. If , we can write [5]
Remark 4.
The following unified recurrence relation can be used to construct the four kinds of Chebyshev polynomials:
but with different starting values.
Remark 5.
Note that the repeated use of the recurrence relation (22) yields the following moment formula:
Remark 6.
The four shifted Chebyshev polynomials are included in the particular forms of . We have
2.2. An Account of Some Symbolic Computation Including Zeilberger’s Algorithm
In some parts of this paper, we use symbolic computation to derive formulas. The application of Zeilberger’s algorithm is useful for obtaining closed-form expressions for sums and terminating hypergeometric functions in the context of special functions. We present the steps for using this algorithm and other symbolic algorithms to obtain the desired closed forms.
- First, a recurrence relation satisfied by the sum or by the terminating hypergeometric function is derived. This step is carried out using Zeilberger’s algorithm [44,45], which can be implemented via computer algebra programs such as Maple (e.g., using the sumrecursion command).
- The second step is solving the resulting recurrence relation analytically. This can also be performed through suitable symbolic algorithms, such as Petkovšek’s algorithm or van Hoeij’s method [46]. Alternatively, dedicated tools such as the Maple (version 17) package LREtools[hypergeomsols] can be used to obtain closed-form solutions.
- Using the two steps above, many sums and terminating hypergeometric functions can be expressed in closed form, thereby yielding reduced forms.
3. Some New Key Formulas of GJLPs
This section aims to develop new fundamental formulas for GJLPs. The series form, its inversion formula, and the moment formula will be developed. These formulas will help with further investigating GJLPs.
3.1. Power Form and Inversion Formula of GJLPs
Theorem 1.
For every positive integer j, the following expression is valid:
where denotes the well-known floor function.
Proof.
First, consider the polynomial:
We note that . In addition, some algebraic manipulations lead to the following identity:
and therefore for all . □
The following two expressions can be deduced from the expression in (24).
Corollary 1.
For every positive integer j, we have the following two expressions:
Proof.
This is directly obtained from Formula (24). □
Theorem 2.
The following inversion formula follows for any non-negative integer k:
3.2. The Moment Formula of GJLPs
The following theorem derives the moment formula of GJLPs.
Theorem 3.
Let be non-negative integers (NNIs). The following moment formula follows:
4. Linearization Formulas of GJLPs
In this section, we develop novel linearization formulas of GJLPs. First, we derive the standard linearization formulas for the GJLPs; thereafter, we derive additional mixed linearization formulas using different polynomials.
4.1. Standard Linearization Formulas of GJLPs
In this part, we develop new linearization formulas for the GJLPs.
Theorem 4.
The following two linearization formulas hold for all positive integers m and n:
and is defined as
Proof.
Using the series form in (27), we can write
Given the moment formula in (34), the last formula becomes
Rearranging and expanding the above formula enables one to write (44) in the following form:
where
The coefficients and can be represented in hypergeometric form as
where the general regularized generalized hypergeometric function that appears in (48) and (49) is defined by
and the generalized hypergeometric function is defined by
where denotes the Pochhammer symbol.
4.2. Some Other Linearization Formulas Involving GJLPs
In this part, we give a general theorem for linearizing the products of the GJLPs with non-symmetric polynomials.
Theorem 5.
Proof.
We apply the inversion formula of the GJLPs in (29) in the last formula to obtain the following LF:
which, upon expanding and rearranging the terms, results in the following expression:
This ends the proof. □
Remark 7.
The general LF in (52) yields several linearization formulas for different non-symmetric polynomials and GJLPs.
Corollary 2.
Let be two NNIs. The below LF follows:
Proof.
Remark 8.
It is worth mentioning here that the LF in (55) can be reduced for specific choices of the involved parameters. The following corollary presents simplified linearization formulas for particular classes. From now on and due to the importance of the specific case corresponding to the choice , we denote
Corollary 3.
Let be NNIs. For and , the following LF follows:
Proof.
The substitution with and in (55) yields the following formula:
Corollary 4.
For all positive integers , the below LF follows:
Corollary 5.
For all positive integers , the below LF follows:
Corollary 6.
Consider as NNIs, and let be the Chebyshev polynomials that are generated by (22). The following LFs hold:
5. Some New Derivative Formulas of GJLPs and Their Inverse Formulas
In this section, we give several expressions of the derivatives of GJLPs in terms of different polynomials. We provide closed-form expressions for the derivatives of the GJLPs as combinations of their original expressions. In addition, other expressions of the derivatives of the GJLPs are given in terms of other polynomials. Some inverse formulas are also given.
5.1. Derivatives of GJLPs in Terms of Their Original Polynomials
The following theorem presents the two expressions of the general derivative formulas of the GJLPs in terms of their original polynomials.
Theorem 6.
Let be two NNIs with . The following derivative formulas hold:
Proof.
The two formulas can be proved in a similar manner. Here, we prove (69). Using the series form in (27), we get
Applying the inversion formula in (29) transforms the previous formula into
which can be converted again into the following formula after some algebraic manipulations:
Finally, in hypergeometric form, we can write
This proves Formula (69). Formula (70) can be proved in a similar manner. □
5.2. Derivatives of GJLPs in Terms of Non-Symmetric Polynomials
This part is confined to presenting a general derivative formula for the GJLPs in terms of any non-symmetric polynomial. Additionally, some connection formulas are derived as special cases.
Theorem 7.
For two NNIs with , the following two derivative formulas hold:
where are the coefficients that appear in (12).
Proof.
Remark 9.
Many formulas regarding the derivatives of GJLPs in terms of various non-symmetric polynomials can be obtained. The following corollaries present some of these formulas.
Corollary 7.
Let r and m be NNIs with . In combinations of the shifted Jacobi polynomials, the derivatives of the GJLPs are represented as
Proof.
The preceding formulas follow from Theorem 7 by employing the inversion coefficients of given in (17). □
Corollary 8.
Let r and m be NNIs with . In combinations of Bernoulli polynomials, the derivatives of the GJLPs are represented as
Proof.
The above results can be deduced from Theorem 7 using the following inversion formula for Bernoulli polynomials:
□
Remark 10.
The derivative formulas in this section provide connection formulas for the GJLPs, with non-symmetric polynomials as special cases. The subsequent corollaries illustrate some of these formulas, and the next section introduces additional ones.
5.3. Some New Connection Formulas
This section introduces new connection formulas for the GJLPs, linking them directly as special cases of the derivative formulas to well-known polynomials. In addition, symbolic algebra helps give some connection formulas in simple reduced formulas.
Corollary 9.
The Jacobsthal–Lucas-shifted Jacobi connection formula can be written in the following form:
Remark 11.
Some simplified connection formulas for specific classes of the shifted Jacobi polynomials with specific classes of the GJLPs can be obtained. The following corollaries exhibit these formulas.
Corollary 10.
For every positive integer r, the below connection formulas follows:
Proof.
Corollary 11.
Let r be any non-negative integer, and let be the shifted Chebyshev polynomials of the first kind. The below connection formula follows:
where
Corollary 12.
Let r be any non-negative integer, and let be the shifted Chebyshev polynomials of the first kind. The below connection formula follows:
Remark 12.
Corollary 13.
The below trigonometric identity follows:
Proof.
The two connection Formulas (90) and (91) yield the following expressions based on the trigonometric expression of the Chebyshev polynomials of the first kind:
□
The above two formulas can be unified to give Formula (94).
Among the important connection formulas are the connection formulas for the GJLPs with Bernoulli polynomials. The following corollary presents these formulas.
Corollary 14.
The GJLP–Bernoulli connection formulas are given in the following:
5.4. Derivatives of the GJLPs in Terms of Symmetric Polynomials
In this section, we develop general formulas for the derivatives of the GLPs in terms of symmetric polynomials.
Theorem 8.
Proof.
We apply Theorem 8 in the following corollary to obtain the derivatives of the GJLPs in terms of the ultraspherical polynomials defined in (14).
Corollary 15.
Let m and r be NNIs with . The following two derivative formulas hold:
Proof.
This is a direct consequence of Theorem 8. □
Remark 13.
The formulas that express the derivatives of symmetric and non-symmetric polynomials can also be derived as combinations of JLPs. We state the following theorem in this regard.
We now give a closed formula for the derivatives of non-symmetric polynomials in terms of GJLPs.
Theorem 9.
For all positive integers with , one has
6. Some New Definite Integrals
In this section, based on the formulas developed in this paper, some new definite integral formulas in closed form are deduced.
We comment here that the definite integrals for a given sequence of polynomials are useful in many applications. For example, they are used to evaluate inner products arising in spectral methods, and in particular in tau and Galerkin methods. Thus, they serve to obtain the matrix system resulting from the application of these methods, and thereby obtain the numerical solutions to solve several types of differential equations.
Now, the first corollary gives an important definite integral formula for the GJLPs.
Corollary 16.
The following definite integral formula follows for every non-negative integer m:
Proof.
Based on the two connection Formulas (97) and (98), integrating over and using the well-known integral
the following two integral formulas hold:
□
The last two formulas can be unified to give (106).
Remark 14.
Corollary 17.
For , the below integral formula follows:
Proof.
Proof.
Corollary 19.
Proof.
Corollary 20.
Corollary 21.
Let be two NNIs. The below integral formula follows:
Proof.
Starting from the connection Formula (90), multiplying both sides by , and making use of the orthogonality relation of , we get
where denotes the Kronecker delta function.
The last formula reduces to the following form:
Following the same procedures for Formula (91), we get
Corollary 22.
The below integral formula follows:
7. Concluding Remarks
This paper was devoted to theoretically investigating a generalized class of polynomials, namely, the generalized Jacobsthal–Lucas class. Many vital expressions in the scope of the special functions for the investigated sequence of polynomials were found. More definitely, the linearization formulas for the GJLPs were derived using the moment formula we obtained. Novel expressions for the derivatives of the GJLPs were represented as combinations of different symmetric and non-symmetric polynomials. Also, it was shown that for a particular class of Jacobi polynomials, a class of GJLPs of one parameter can be connected to them by a simplified connection formula; therefore, a novel trigonometric representation for this class was given. Most of the findings reported in this work are new. The Mathematica (version 12) and Maple (version 17) programs were used to check all formulas presented in this paper. In addition, some Maple packages were used to simplify some formulas. Future work may include applying the obtained formulas in spectral and collocation methods, as well as exploring their use in fractional differential equations and other applied models. Furthermore, other generalizations and computational studies would be of interest for other generalized sequences of polynomials.
Author Contributions
Conceptualization, W.M.A.-E.; methodology, N.M.A.A. and W.M.A.-E.; software, N.M.A.A. and W.M.A.-E.; validation, N.M.A.A. and W.M.A.-E.; formal analysis, W.M.A.-E.; investigation, N.M.A.A. and W.M.A.-E.; writing—original draft, N.M.A.A. and W.M.A.-E.; writing—review and editing, N.M.A.A. and W.M.A.-E.; supervision, W.M.A.-E.; project administration, W.M.A.-E.; funding acquisition, N.M.A.A. All authors have read and agreed to the published version of the manuscript.
Funding
This work was funded by the University of Jeddah, Jeddah, Saudi Arabia, under grant No. (UJ-25-DR-455).
Data Availability Statement
The original contributions presented in this study are included in this article. Further inquiries can be directed to the corresponding author.
Acknowledgments
This work was funded by the University of Jeddah, Jeddah, Saudi Arabia, under grant No. (UJ-25-DR-455). Therefore, the authors thank the University of Jeddah for its technical and financial support.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Akhmedova, V.; Akhmedov, E.T. Selected Special Functions for Fundamental Physics; SpringerBriefs in Physics; Springer: Berlin/Heidelberg, Germany, 2019. [Google Scholar]
- Kilbas, A.A.; Srivastava, H.M.; Trujillo, J.J.; Mainardi, F. Special Functions in Fractional Calculus and Engineering: Applications in Physics, Mechanics, and Control; CRC Press: Boca Raton, FL, USA, 2023. [Google Scholar]
- Mainardi, F.; Gorenflo, R.; Vivoli, A. Renewal processes of Mittag–Leffler and Wright type. Fract. Calc. Appl. Anal. 2010, 13, 299–318. [Google Scholar]
- Mathai, A.M.; Saxena, R.K. Generalized Hypergeometric Functions with Applications in Statistics and Physical Sciences; Springer: Berlin/Heidelberg, Germany, 2006; Volume 348. [Google Scholar]
- Mason, J.C.; Handscomb, D.C. Chebyshev Polynomials; CRC Press: Boca Raton, FL, USA, 2002. [Google Scholar]
- Marcellán, F. Orthogonal Polynomials and Special Functions: Computation and Applications; Springer: Berlin/Heidelberg, Germany, 2006. [Google Scholar]
- Boyd, J.P. Chebyshev and Fourier Spectral Methods; Courier Corporation: Chelmsford, MA, USA, 2001. [Google Scholar]
- Bracciali, C.F.; da Silva, J.V.; Sri Ranga, A. A class of Sobolev orthogonal polynomials on the unit circle and associated continuous dual Hahn polynomials: Bounds, asymptotics and zeros. J. Approx. Theory 2021, 268, 105604. [Google Scholar] [CrossRef] [Scilit]
- Marriaga, M.E.; Pérez, T.E.; Piñar, M.A. Bivariate Koornwinder–Sobolev orthogonal polynomials. Mediterr. J. Math. 2021, 18, 234. [Google Scholar] [CrossRef] [Scilit]
- Masjed-Jamei, M.; Moalemi, Z.; Saad, N. On all symmetric and nonsymmetric exceptional orthogonal X1-polynomials generated by a specific Sturm–Liouville problem. Mathematics 2022, 10, 2464. [Google Scholar] [CrossRef] [Scilit]
- Natanson, G. On finite exceptional orthogonal polynomial sequences composed of rational Darboux transforms of Romanovski–Jacobi polynomials. Axioms 2025, 14, 218. [Google Scholar] [CrossRef] [Scilit]
- Nalli, A.; Haukkanen, P. On generalized Fibonacci and Lucas polynomials. Chaos Solitons Fractals 2009, 42, 3179–3186. [Google Scholar] [CrossRef] [Scilit]
- Abd-Elhameed, W.M.; Abdelkawy, M.A.; Alsafri, N.M.A.; Atta, A.G. Novel formulas of specific non-symmetric Jacobi polynomials with an application in numerical analysis. Symmetry 2025, 17, 1440. [Google Scholar] [CrossRef] [Scilit]
- Abd-Elhameed, W.M.; Alqubori, O.M. New expressions for certain polynomials combining Fibonacci and Lucas polynomials. AIMS Math. 2025, 10, 2930–2957. [Google Scholar] [CrossRef] [Scilit]
- Abd-Elhameed, W.M.; Alqubori, O.M.; Napoli, A. On convolved Fibonacci polynomials. Mathematics 2024, 13, 22. [Google Scholar] [CrossRef] [Scilit]
- Kim, T.; Kim, D.S. Probabilistic Bernoulli and Euler polynomials. Russ. J. Math. Phys. 2024, 31, 94–105. [Google Scholar] [CrossRef] [Scilit]
- Kim, T.; Kim, D.S. Explicit formulas for probabilistic multi-poly-Bernoulli polynomials and numbers. Russ. J. Math. Phys. 2024, 31, 450–460. [Google Scholar] [CrossRef] [Scilit]
- Luo, L.; Kim, T.; Kim, D.S.; Ma, Y. Probabilistic degenerate Bernoulli and degenerate Euler polynomials. Math. Comput. Model. Dyn. Syst. 2024, 30, 342–363. [Google Scholar] [CrossRef] [Scilit]
- Cesarano, C.; Quintana, Y.; Ramírez, W. Degenerate versions of hypergeometric Bernoulli–Euler polynomials. Lobachevskii J. Math. 2024, 45, 3509–3521. [Google Scholar] [CrossRef] [Scilit]
- Abd-Elhameed, W.M.; Alqubori, O.M.; Amin, A.K. New results for certain Jacobsthal-type polynomials. Mathematics 2025, 13, 715. [Google Scholar] [CrossRef] [Scilit]
- Aşcı, M.; Gürel, E. Gaussian Jacobsthal and Gaussian Jacobsthal Lucas polynomials. Notes Number Theory Discrete Math. 2013, 19, 25–36. [Google Scholar]
- Catarino, P.; Morgado, M.L. On generalized Jacobsthal and Jacobsthal–Lucas polynomials. An. Ştiinţ. Univ. Ovidius Constanţa Ser. Mat. 2016, 24, 61–78. [Google Scholar] [CrossRef] [Scilit]
- Cerda-Morales, G. On the third-order Jacobsthal and third-order Jacobsthal–Lucas sequences and their matrix representations. Mediterr. J. Math. 2019, 16, 32. [Google Scholar] [CrossRef] [Scilit]
- Uysal, M. Higher-order Jacobsthal–Lucas quaternions. Axioms 2022, 11, 671. [Google Scholar] [CrossRef] [Scilit]
- Uygun, Ş. Bivariate Jacobsthal and Jacobsthal Lucas polynomial sequences. J. Math. Comput. Sci. 2020, 21, 176–185. [Google Scholar] [CrossRef] [Scilit]
- Djordjević, G.B. Generalized Jacobsthal polynomials. Fibonacci Quart. 2000, 38, 239–243. Available online: https://www.mathstat.dal.ca/FQ/Scanned/38-3/djordjevic.pdf?utm_source (accessed on 7 April 2026). [CrossRef] [Scilit]
- Djordjević, G.B. Derivative sequences of generalized Jacobsthal and Jacobsthal–Lucas polynomials. Fibonacci Quart. 2000, 38, 334–338. [Google Scholar] [CrossRef] [Scilit]
- Horadam, A.F. Jacobsthal representation polynomials. Fibonacci Quart. 1997, 35, 137–148. [Google Scholar] [CrossRef] [Scilit]
- Cerda-Morales, G. On third-order Jacobsthal polynomials and their properties. Miskolc Math. Notes 2021, 22, 123–132. [Google Scholar] [CrossRef] [Scilit]
- Morales, G. Binomial transforms of the third-order Jacobsthal and modified third-order Jacobsthal polynomials. Univ. J. Math. Appl. 2024, 7, 144–151. [Google Scholar] [CrossRef] [Scilit]
- Kuloğlu, B.; Özkan, E. Applications of Jacobsthal and Jacobsthal–Lucas numbers in coding theory. Math. Montisnigri 2023, 57, 54–64. [Google Scholar] [CrossRef] [Scilit]
- Kılıç, N. h(x)–Jacobsthal and h(x)–Jacobsthal–Lucas representation polynomials. Palestine J. Math. 2021, 10, 312–321. [Google Scholar]
- Özkan, E.; Kuloğlu, B. On a Jacobsthal-like sequence associated with k–Jacobsthal–Lucas sequence. J. Contemp. Appl. Math. 2020, 10, 100–113. [Google Scholar]
- Abd-Elhameed, W.M.; Alqubori, O.M.; Alsafri, N.M.A.; Amin, A.K.; Atta, A.G. A matrix approach by convolved Fermat polynomials for solving the fractional Burgers’ equation. Mathematics 2025, 13, 1135. [Google Scholar] [CrossRef] [Scilit]
- Abd-Elhameed, W.M.; Alqubori, O.M.; Atta, A.G. A collocation approach for the nonlinear fifth-order KdV equations using certain shifted Horadam polynomials. Mathematics 2025, 13, 300. [Google Scholar] [CrossRef] [Scilit]
- Abd-Elhameed, W.M.; Abdelkawy, M.A.; Alqubori, O.M.; Atta, A.G. An accurate tau-based spectral algorithm for the time fractional bioheat transfer model. Bound. Value Probl. 2025, 2025, 124. [Google Scholar] [CrossRef] [Scilit]
- Area, I.; Godoy, E.; Ronveaux, A.; Zarzo, A. Solving connection and linearization problems within the Askey scheme and its q-analogue via inversion formulas. J. Comput. Appl. Math. 2001, 133, 151–162. [Google Scholar] [CrossRef] [Scilit]
- Chaggara, H.; Koepf, W. On linearization and connection coefficients for generalized Hermite polynomials. J. Comput. Appl. Math. 2011, 236, 65–73. [Google Scholar] [CrossRef] [Scilit]
- Sánchez-Ruiz, J. Linearization and connection formulae involving squares of Gegenbauer polynomials. Appl. Math. Lett. 2001, 14, 261–267. [Google Scholar] [CrossRef] [Scilit]
- Sánchez-Ruiz, J.; Artés, P.L.; Martínez-Finkelshtein, A.; Dehesa, J. General linearization formulae for products of continuous hypergeometric-type polynomials. J. Phys. A Math. Gen. 1999, 32, 7345. [Google Scholar] [CrossRef] [Scilit]
- Ahmed, H.M. Computing expansions coefficients for Laguerre polynomials. Integral Transforms Spec. Funct. 2021, 32, 271–289. [Google Scholar] [CrossRef] [Scilit]
- Horadam, A.F. Extension of a synthesis for a class of polynomial sequences. Fibonacci Quart. 1996, 34, 68–74. [Google Scholar] [CrossRef] [Scilit]
- Koshy, T. Fibonacci and Lucas Numbers with Applications; John Wiley & Sons: Hoboken, NJ, USA, 2011; Volume 51. [Google Scholar]
- Koepf, W. Hypergeometric Summation, 2nd ed.; Springer Universitext Series; Springer: Berlin/Heidelberg, Germany, 2014. [Google Scholar]
- Petkovšek, M.; Wilf, H.S.; Zeilberger, D. A = B; A. K. Peters: Natick, MA, USA, 1996. [Google Scholar]
- van Hoeij, M. Finite singularities and hypergeometric solutions of linear recurrence equations. J. Pure Appl. Algebra 1998, 139, 109–131. [Google Scholar] [CrossRef] [Scilit]
- Andrews, G.; Askey, R.; Roy, R. Special Functions; Cambridge University Press: Cambridge, UK, 1999; Volume 71. [Google Scholar]
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. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.