Abstract
A generalization of complex, dual, and hyperbolic numbers has recently been defined as hybrid numbers. In this study, using the Leonardo Pisano numbers and hybrid numbers we investigate Leonardo Pisano polynomials and hybrinomials. Furthermore, we also describe the basic algebraic properties and some identities of the Leonardo Pisano polynomials and hybrinomials.
1. Introduction
Fibonacci numbers, for , are given by the recurrence relation with the initial conditions . There are many works regarding Fibonacci numbers, such as [1,2,3]. Furthermore, they have also been studied on different number systems such as quaternions and hybrid numbers [4,5].
When the literature is examined, it is seen that Leonardo Pisano numbers are only called Leonardo numbers. However, the name Leonardo in these studies refers to Leonardo Pisano, who is also called Fibonacci, from the Latin Filius Bonacci. It is well known that Leonardo commonly stands for Leonardo Da Vinci, so in this study to avoid confusion we prefer to use the name “Leonardo Pisano”.
Leonardo Pisano numbers have recently been studied in detail by Catarino and Borges in [6] and they have demonstrated some properties of this sequence. For , Leonardo Pisano numbers are defined by the following recurrence relation
where the initial conditions are . Moreover, another recurrence relation for Leonardo Pisano’s numbers is
The relationship between Leonardo Pisano numbers and Fibonacci numbers can be given as
Binet’s formula and the characteristic equation of Leonardo Pisano numbers are
respectively. Cassini’s, Catalan and d’Ocagne’s identities were defined in [6]. In [7] generalized Leonardo Pisano numbers have been defined. In [8], incomplete Leonardo Pisano numbers and matrix representation of Leonardo Pisano numbers have also been given. Additionally, in [9] the authors give some important properties of Leonardo Pisano numbers and in [10] hybrid Leonardo Pisano numbers are defined.
Hybrid numbers are a generalization of the complex, dual and hyperbolic numbers. A hybrid number can be denoted by , where are real numbers [11]. Hybrid numbers, , are defined as
Equality, addition and multiplication are defined by
- (i)
- ⇔,
- (ii)
- ,
- (iii)
for hybrid numbers and . More details on hybrid numbers can be found in [11].
Fibonacci polynomials were first studied by Bicknell [12]. Since then, many authors have published works on the subject of Fibonacci-type polynomials [13,14,15,16,17]. These types of polynomials have some considerable applications in number theory, geometry and algebra. Moreover, hybrinomial sequences have become an increasing area of attention. For instance, the authors studied Fibonacci and Lucas hybrinomials [18], Petroudi and Pirouz studied Van der Laan hybrinomials [19] and Petroudi et al. studied Narayana polynomials and Narayana hybrinomial sequences [20]. Moreover, Horadam hybrinomials were studied by Kızılateş in [21].
2. Leonardo Pisano Polynomials and Hybrinomials
In this section, we introduce Leonardo Pisano polynomials and hybrinomials.
Definition 1.
For a non-negative integer n, Leonardo Pisano polynomials are defined by
The first few Leonardo Pisano polynomials are 1, 1, , , , , . Using Leonardo Pisano polynomials, we can define Leonardo Pisano hybrinomials.
Definition 2.
The Leonardo Pisano hybrinomial is defined as follows:
The first four Leonardo Pisano hybrinomials are
If we put , then we obtain
where stand for Leonardo Pisano hybrid numbers. Therefore, it can be easily seen that Leonardo Pisano hybrinomials are a generalization of Leonardo Pisano hybrid numbers.
We can define the character of Leonardo Pisano hybrinomials by making use of the character of hybrid numbers that Özdemir defined in his article.
Definition 3.
The character of Leonardo Pisano hybrinomials is
Using the character of the Leonardo Pisano hybrinomials, we can set the norm.
Theorem 1.
The norm of the Leonardo Pisano hybrinomials is given by
Proof.
From the character of Leonardo Pisano hybrinomials which is given above,
□
In the following theorem using the matrix representation of hybrid numbers:
we give the matrix representation for Leonardo Pisano hybrinomials.
Theorem 2.
Every Leonardo Pisano hybrinomials can be written in the following matrix form, for
Proof.
Using the matrix equivalent of hybrid units 1, , and , we have
then we can write
□
Lemma 1.
Let be the Leonardo Pisano hybrinomial. The recurrence relation of is
Proof.
Using Equation (6);
□
Theorem 3.
Let be the Leonardo Pisano polynomial. The generating function of is defined as
Proof.
Assume that the generating function of Leonardo Pisano polynomial series is,
Using this form, we obtain
Then the proof is completed. □
Corollary 1.
Let be the Leonardo Pisano hybrinomial. The generating function of is
Theorem 4.
Let be the Leonardo Pisano polynomial. The Binet-like formula for the sequence is
where α, β and γ are the roots of the characteristic equation and are as follows:
Proof.
Let be the characteristic equation of the recurrence relation . It is obvious that should have three distinct roots , and . Then, , and are the roots of the equation
Since , then .
From the generating function of Leonardo Pisano polynomials and from the sum of geometric series, we have
Then we have the following equality
If we substitute by , we obtain
then it is easy to obtain
In the same way, we can obtain B and C as follows:
If we substitute into (20), we obtain the following equation
Consequently, we get
□
Theorem 5.
The Binet-like formula for the Leonardo Pisano hybrinomial sequence is
where, and. Additionally,and C are as in (17).
Proof.
We have from (6) and from the previous theorem.
□
3. Some Identities for Leonardo Pisano Polynomial and Hybrinomial Sequences
In this section we state some identities, such as Cassini-like, d’Ocagne-like identities, where Leonardo Pisano polynomials and hybrinomials are involved.
Theorem 6
(Sum identities). Let be an integer, {} is the Leonardo Pisano polynomial sequence and {} is the Leonardo Pisano hybrinomial sequence, respectively. Then
- i.
- ii.
Proof.
- i.
- From the definition of Leonardo Pisano polynomial sequencewe have the following equationswhen we sum up these equations side by side we getIn order to equalize the indexes, we add , , and to both sides. Therefore we can writeEventually, we obtain the desired result.
- ii.
- The proof can be demonstrated the same way.
□
We can verify the previous theorem with the following example.
Example 1.
The sum of the first four Leonardo Pisano polynomials, , , is . Indeed, we can verify this result using the previous theorem as follows:
Theorem 7
(Catalan-like Identities). Let n and r be two non-negative integers and .
- i.
- The Catalan-like identity for Leonardo Pisano polynomials is
- ii.
- The Catalan-like identity for Leonardo Pisano hybrinomials is
Proof.
Proofs can be easily seen if the Binet-like formula is used for Leonardo Pisano polynomials and Leonardo Pisano hybrinomials. □
Corollary 2
(Cassini-like identities). Let n be a positive integer.
- i.
- The Cassini-like identity for Leonardo Pisano polynomials is
- ii.
- The Cassini-like identity for Leonardo Pisano hybrinomials is
Theorem 8
(d’Ocagne-like identities). Let m and n be two non-negative integers.
- i.
- The d’Ocagne-like identity for Leonardo Pisano polynomials is
- ii.
- The d’Ocagne-like identity for Leonardo Pisano hybrinomials is
Proof.
- i.
- Let us use the Binet-like formula for Leonardo Pisano polynomials.
- ii.
- This can be proven similarly to (i) using the Binet-like formula for Leonardo Pisano hybrinomials.
□
Author Contributions
Conceptualization, F.K., A.D. and P.C.; methodology, F.K., A.D. and P.C.; software, F.K. and A.D.; validation, F.K., A.D. and P.C.; formal analysis, F.K. and A.D.; investigation, F.K., A.D. and P.C.; resources, F.K., A.D. and P.C.; data curation, F.K., A.D. and P.C.; writing—original draft preparation, F.K. and A.D.; writing—review and editing, F.K., A.D. and P.C.; visualization, F.K. and A.D.; supervision, P.C.; project administration, P.C. All authors have read and agreed to the published version of the manuscript.
Funding
This research was partially funded by Portuguese Funds through FCT—FUNDAÇÃO PARA A CIẼNCIA E A TECNOLOGIA, within the Projects UIDB/00013/2020, UIDP/00013/2020 and UIDB/00194/2020.
Acknowledgments
The last author is a member of the Research Centre CMAT-UTAD (Polo of Research Centre CMAT—Centre of Mathematics of University of Minho) and also a collaborating member of the Research Centre CIDTFF—Research Centre on Didactics and Technology in the Education of Trainers of University of Aveiro.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Koshy, T. Fibonacci and Lucas Numbers with Applications; John Wiley and Sons: Hoboken, NJ, USA, 2019. [Google Scholar]
- Horadam, A.F. A generalized Fibonacci sequence. Am. Math. Mon. 1961, 68, 455–459. [Google Scholar] [CrossRef]
- Horadam, A.F. Basic properties of a certain generalized sequence of numbers. Fibonacci Q. 1965, 3, 161–176. [Google Scholar]
- Halici, S. On Fibonacci quaternions. Adv. Appl. Clifford Algebras 2012, 22, 321–327. [Google Scholar] [CrossRef]
- Dağdeviren, A.; Kürüz, F. On The Horadam Hybrid Quaternions. arXiv 2020, arXiv:2012.08277. [Google Scholar]
- Catarino, P.; Borges, A. On Leonardo numbers. Acta Math. Univ. Comenianae 2019, 89, 75–86. [Google Scholar]
- Shannon, A.G. A note on generalized Leonardo numbers. Notes Number Theory Discrete Math. 2019, 25, 97–101. [Google Scholar] [CrossRef] [Green Version]
- Catarino, P.; Borges, A. A note on incomplete Leonardo numbers. Integers 2020, 20, 1–7. [Google Scholar]
- Alp, Y.; Koçer, E.G. Some properties of Leonardo numbers. Konuralp J. Math. 2021, 9, 183–189. [Google Scholar]
- Alp, Y.; Koçer, E.G. Hybrid Leonardo numbers. Chaos Solitons Fractals 2021, 150, 111–128. [Google Scholar] [CrossRef]
- Özdemir, M. Introduction to hybrid numbers. Adv. Appl. Clifford Algebras 2018, 28, 1–32. [Google Scholar] [CrossRef]
- Bicknell, M. A primer for the Fibonacci numbers VII. Fibonacci Q. 1970, 8, 407–420. [Google Scholar]
- Horzum, T.; Kocer, E.G. On some properties of Horadam polynomials. Int. Math. Forum 2009, 25, 1243–1252. [Google Scholar]
- Hoggatt, V.E., Jr.; Bicknell, M. Roots of Fibonacci polynomials. Fibonacci Q. 1973, 11, 271–274. [Google Scholar]
- Catarino, P. The h(x)-Fibonacci quaternion polynomials: Some combinatorial properties. Adv. Appl. Clifford Algebras 2016, 26, 71–79. [Google Scholar] [CrossRef]
- Özkan, E.; Altun, İ. Generalized Lucas polynomials and relationships between the Fibonacci polynomials and Lucas polynomials. Commun. Algebra 2019, 47, 4020–4030. [Google Scholar] [CrossRef]
- Liana, M.; Szynal-Liana, A.; Wloch, I. On Pell hybrinomials. Miskolc Math. Notes 2019, 20, 1051–1062. [Google Scholar] [CrossRef]
- Szynal-Liana, A.; Włoch, I. Introduction to Fibonacci and Lucas hybrinomials. Complex Var. Elliptic Equ. 2020, 65, 1736–1747. [Google Scholar] [CrossRef]
- Petroudi, S.H.J.; Pirouz, M. On Some Properties and Identities of Van Der Laan Hybrinomail Sequence, Preprint. In Proceedings of the 5th International Conference on Combinatorics, Cryptography, Computer Science and Computing, Tehran, Iran, 17–18 November 2021. [Google Scholar]
- Petroudi, S.H.J.; Pirouz, M.; Ozkoc, A. The Narayana Polynomial and Narayana Hybrinomial Sequences. Konuralp J. Math. 2021, 9, 90–99. [Google Scholar]
- Kizilateş, C. A Note on Horadam Hybrinomials. Preprints 2020. [Google Scholar] [CrossRef] [Green Version]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2021 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 (https://creativecommons.org/licenses/by/4.0/).