Next Article in Journal
Analyzing Primary Sector Selection for Economic Activity in Romania: An Interval-Valued Fuzzy Multi-Criteria Approach
Previous Article in Journal
A Bidirectional Arabic Sign Language Framework Using Deep Learning and Fuzzy Matching Score
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Higher-Order Generalized Fibonacci Hybrinomials: New Properties, Recurrence Relations and Matrix Representations

1
Department of Mathematics, Faculty of Science, Zonguldak Bülent Ecevit University, Zonguldak 67100, Turkey
2
Department of Mathematics, National Kaohsiung Normal University, Kaohsiung 82444, Taiwan
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(8), 1156; https://doi.org/10.3390/math12081156
Submission received: 25 March 2024 / Revised: 8 April 2024 / Accepted: 9 April 2024 / Published: 11 April 2024
(This article belongs to the Section Mathematics and Computer Science)

Abstract

:
This paper presents a comprehensive survey of the generalization of hybrid numbers and hybrid polynomials, particularly in the fields of mathematics and physics. In this paper, by using higher-order generalized Fibonacci polynomials, we introduce higher-order generalized Fibonacci hybrid polynomials called higher-order generalized Fibonacci hybrinomials. We obtain some special cases and algebraic properties of the higher-order generalized Fibonacci hybrinomials, such as the recurrence relation, generating function, exponential generating function, Binet formula, Vajda’s identity, Catalan’s identity, Cassini’s identity and d’Ocagne’s identity. We also present three different matrices whose components are higher-order generalized Fibonacci hybrinomials, higher-order generalized Fibonacci polynomials and Lucas polynomials. By using these matrices, we obtain some identities related to these newly established hybrinomials.

1. Introduction

The importance of certain integer sequences extends beyond the boundaries of pure and applied mathematics, permeating various scientific disciplines such as physics and engineering. One of the best known integer sequences is the Fibonacci sequence, named after the famous Italian mathematician Leonardo Pisano, more commonly known as Fibonacci. The Fibonacci sequence has many applications in various fields, including mathematics, physics and engineering. This has made it a subject of interest to many researchers [1,2]. The study of Fibonacci and Lucas numbers has been the subject of extensive research by mathematicians in the literature. The Fibonacci sequence { F n } and Lucas sequence { L n } are, respectively, defined by the following recurrence relations: for n N { 0 } (here, N is the set of positive integers),
F n + 2 = F n + 1 + F n
and
L n + 2 = L n + 1 + L n ,
where F 0 = 0 , F 1 = 1 , L 0 = 2 and L 1 = 1 . The Binet formulas for the Fibonacci numbers and Lucas numbers are
F n = α n β n α β
and
L n = α n + β n ,
where α and β are the roots of the characteristic equation x 2 x 1 = 0 . One such generalization is the Fibonacci divisor, also known as higher-order Fibonacci numbers, which were studied by Pashaev and Özvatan (see, for details, [3,4]). Higher-order Fibonacci numbers (or Fibonacci divisor, conjugate to F s ) are defined for s 1 integers as follows:
F n s = F n s F s = ( α s ) n ( β s ) n α s β s .
As F n s is divisible by F s , the ratio F n s F s is an integer. Therefore, all higher-order Fibonacci numbers, namely, F n s , are integers. For s = 1 , the higher-order Fibonacci number F n 1 becomes an ordinary Fibonacci number. For s = 1 ,   2 ,   3 ,   4 ,   5 and n N , the first few numbers of the higher-order Fibonacci numbers F n s are as follows:
  • For s = 1 , F n 1 = F n = 1 ,   1 ,   2 ,   3 ,   ;
  • For s = 2 , F n 2 = F 2 n = 1 ,   3 ,   8 ,   21 ,   ;
  • For s = 3 , F n 3 = 1 2 F 3 n = 1 ,   4 ,   17 ,   72 ,   ;
  • For s = 4 , F n 4 = 1 3 F 4 n = 1 ,   7 ,   48 ,   329 ,   ;
  • For s = 5 , F n 5 = 1 5 F 5 n = 1 ,   11 ,   122 ,   1353 ,   .
Pashaev [4] presented the critical characteristics of higher-order Fibonacci numbers and simultaneously demonstrated their application in various physical examples.
In [5], Horadam defined the general polynomial sequence of second order as
w n ( γ ) = p ( γ ) w n 1 ( γ ) + q ( γ ) w n 2 ( γ ) ,
where
w 0 ( γ ) = c 0 , w 1 ( γ ) = c 1 γ d , p ( γ ) = c 2 γ d , q ( γ ) = c 3 γ d
in which c 0 ,   c 1 ,   c 2 ,   c 3 are constants and d = 0 or 1 . Lee and Asci [6] defined and studied p , q -Fibonacci and p , q -Lucas polynomials extensively. These polynomials are also called generalized Fibonacci and Lucas polynomials. For n 2 , the genaralized Fibonacci and Lucas polynomials are defined by
U n + 2 γ = p γ U n + 1 γ q γ U n γ ,
V n + 2 γ = p γ V n + 1 γ q γ V n γ ,
where U 0 γ = 0 , U 1 γ = 1 , V 0 γ = 2 , and V 1 γ = p γ . The generalized Fibonacci and Lucas polynomials can be expressed by
U n γ = η n γ θ n γ η γ θ γ ,
V n γ = η n γ + θ n γ ,
where η γ and θ γ are the roots of the characteristic equation t 2 p γ t + q γ = 0 with p 2 γ 4 q γ 0 .
Similar to Equation (1), one can present the higher-order generalized Fibonacci polynomial for s N as
U n ( s ) γ = U n s γ U s γ = η s n γ θ s n γ η s γ θ s γ ,
where U 0 ( s ) γ = 0 and U 1 ( s ) γ = 1 . For γ = 1 , the higher-order generalized Fibonacci polynomial U n ( s ) γ becomes the higher-order generalized Fibonacci numbers studied by Kızılateş and Kibar [7]. These polynomials have the following algebraic properties as follows:
  • For n N , the recurrence relation for higher-order generalized Fibonacci polynomials is as follows:
    U n + 1 ( s ) γ = V s γ U n ( s ) γ q s γ U n 1 ( s ) γ ,
    where V s γ are the generalized Lucas polynomials.
  • The following identities hold for:
    U n ( s ) γ = q s n γ U n ( s ) γ ,
    U n ( s ) γ = q s γ U n ( s ) γ
    and
    U n ( s ) γ = q s ( 1 n ) γ U n ( s ) γ .
  • The generating function of higher-order generalized Fibonacci polynomials is
    n = 0 U n ( s ) γ t n = t 1 V s γ t + q s γ t 2 .
Complex, hyperbolic and dual numbers are well-known two-dimensional number systems that have been extensively studied in geometric, mathematical and physical applications by numerous researchers. Özdemir [8] was the first to define the set of hybrid numbers, denoted by K , which includes both complex and dual numbers, as well as hyberbolic numbers. He also provided various theorems, properties and matrix forms related to hybrid numbers. A hybrid number is defined as
K = u + v i + w ϵ + r h : u , v , w , r R , i 2 = 1 , ϵ 2 = 0 , h 2 = 1 , ih = hi = ϵ + i ,
where R is the set of real numbers. With the hybrid numbers, we can perform some properties and operations. Namely, taking two hybrid numbers Z 1 = u 1 + v 1 i + w 1 ϵ + r 1 h and Z 2 = u 2 + v 2 i + w 2 ϵ + r 2 h , we get
(a).
Z 1 = Z 2 if and only if u 1 = u 2 , v 1 = v 2 , w 1 = w 2 , r 1 = r 2 (equality);
(b).
Z 1 + Z 2 = u 1 + u 2 + v 1 + v 2 i + w 1 + w 2 ϵ + r 1 + r 2 h (addition);
(c).
Z 1 Z 2 = u 1 u 2 + v 1 v 2 i + w 1 w 2 ϵ + r 1 r 2 h (subtraction);
(d).
k Z 1 = k u 1 + k v 1 i + k w 1 ϵ + k r 1 h (multiplication by scalar k R ).
The hybrid product is obtained by distributing the terms to the right while preserving the order of unit multiplication. Then, the values of the following are written, substituting each product of units with the corresponding equalities: i 2 = 1 , ϵ 2 = 0 , h 2 = 1 , ih = hi = ϵ + i . From these equalities, we can obtain the product of any two hybrid units. Table 1 shows the multiplication table for the basis of hybrid numbers.
Let Z = u + v i + w ϵ + r h be any hybrid number. The conjugate of Z is defined by
Z ¯ = u v i w ϵ r h .
The real number
C Z = Z Z ¯ = Z ¯ Z = u 2 + v w 2 w 2 r 2 = u 2 + v 2 2 v w r 2 ,
is called the character of the hybrid number Z . Hybrid numbers are classified as space-like, time-like, or light-like based on the character of Z . Specifically, a hybrid number is space-like if C Z is less than zero, time-like if C Z is greater than zero and light-like if C Z equals zero. It is important to note that hybrid number multiplication is not commutative, but it does have the property of associativity. The set of hybrid numbers forms a non-commutative ring under addition and multiplication (please see [8]).
After Özdemir’s paper, hybrid numbers, whose components are defined by the homogeneous recurrence relation with constant coefficients, have been studied by a large number of researchers since 2018 (please see [9,10,11,12,13,14,15]). In [16], Kızılateş and Kone introduced Fibonacci divisor hybrid numbers that generalize the Fibonacci hybrid numbers defined by Szynal-Liana and Wloch [9]. The Fibonacci divisor hybrid numbers (or higher-order Fibonacci hybrid numbers) are defined by
F H n ( s ) = F n s + F n + 1 s i + F n + 2 s ϵ + F n + 3 s h .
They also gave some properties of these numbers. Szynal-Liana and Wloch [17] defined and studied a family of special polynomials and special numbers related to the Fibonacci and Lucas hybrid polynomials, namely Fibonacci and Lucas hybrinomials. In [18], Szynal-Liana et al. defined the Pell hybrinomials and gave some properties of them. Then, Kızılateş [19] defined and studied Horadam hybrinomials which are a generalization of Fibonacci and Lucas hybrinomials. The Horadam hybrinomials are defined by
H n ( x ) = h n ( x ) + h n + 1 ( x ) i + h n + 2 ( x ) ϵ + h n + 3 ( x ) h .
where h n ( x ) = h n ( x ; a , b ; p , q ) are the Horadam polynomials [5] defined by
h n ( x ) = p x h n 1 ( x ) + q h n 2 ( x ) , n 3
with the initial values h 1 ( x ) = a and h 2 ( x ) = b x . For some other papers, please see [20,21,22,23].
Motivated by the above papers, especially articles [17,18,19], in this paper, we define higher-order generalized Fibonacci hybrinomials. Our definition includes not only Fibonacci and Fibonacci-type hybrinomials existing in the literature, but also new hybrid polynomials and numbers depending on the parameter s that generalize these numbers and polynomials. We give the recurrence relation, the generating functions, and the Binet-like formula of higher-order Fibonacci hybrid polynomials. We also give some identities such as Vajda’s identity and its special cases. In the third part, we define some matrices whose elements are higher-order generalized Fibonacci hybrinomials and higher-order generalized Fibonacci and Lucas polynomials. We give the relations between these matrices. We also use these relations to obtain some identities for the newly defined family of hybrid polynomials and numbers.

2. Higher-Order Generalized Fibonacci Hybrinomials

In this paper, we define higher-order generalized Fibonacci hybrinomials as follows.
Definition 1.
For n N { 0 } , the n th higher-order generalized Fibonacci hybrinomials are defined by
KU n s γ = U n s γ + U n + 1 s γ i + U n + 2 s γ ϵ + U n + 3 s γ h .
In fact, higher-order generalized Fibonacci hybrinomials contain several important hybrinomials and hybrid numbers as special cases. We give the following to illustrate the facts:
  • For p γ = γ and q γ = 1 , the higher-order generalized Fibonacci hybrinomials KU n s γ become the higher-order Fibonacci hybrinomials KF n s γ ;
  • For p γ = 2 γ and q γ = 1 , the higher-order generalized Fibonacci hybrinomials KU n s γ become the higher-order Pell hybrinomials KP n s γ ;
  • For p γ = 1 and q γ = 1 , the higher-order generalized Fibonacci hybrinomials KU n s become the higher-order Fibonacci hybrid numbers KF n s [16];
  • For p γ = 2 and q γ = 1 , the higher-order generalized Fibonacci hybrinomials KU n s become the higher-order Pell hybrid numbers KP n s ;
  • For p γ = 1 and q γ = 2 γ , the higher-order generalized Fibonacci hybrinomials KU n s become the higher-order Jacobsthal hybrinomials KJ n s γ ;
  • For p γ = 1 and q γ = 2 , the higher-order generalized Fibonacci hybrinomials KU n s become the higher-order Jacobsthal hybrid numbers KJ n s .
The following Lemma is crucial to our main results.
Lemma 1.
Let η ˜ γ and θ ˜ γ be defined as follows:
η ˜ γ : = 1 + η s γ i + η 2 s γ ϵ + η 3 s γ h
and
θ ˜ γ : = 1 + θ s γ i + θ 2 s γ ϵ + θ 3 s γ h .
Then, we have
η ˜ γ θ ˜ γ = Φ Ω q s γ ω
and
θ ˜ γ η ˜ γ = Φ + Ω q s γ ω ,
where
Ω = η s γ θ s γ ,
Φ = 1 q s γ + q 3 s γ + q s γ V s γ + V s γ i + V 2 s γ ϵ + V 3 s γ h
and
ω = U 2 s γ i + U 2 s γ ϵ h .
Proof. 
We first prove (10). Due to Table 1, we can compute
η ˜ γ θ ˜ γ = 1 + η s γ i + η 2 s γ ϵ + η 3 s γ h 1 + θ s γ i + θ 2 s γ ϵ + θ 3 s γ h = 1 + θ s γ i + θ 2 s γ ϵ + θ 3 s γ h + η s γ i 1 + θ s γ i + θ 2 s γ ϵ + θ 3 s γ h + η 2 s γ ϵ 1 + θ s γ i + θ 2 s γ ϵ + θ 3 s γ h + η 3 s γ h 1 + θ s γ i + θ 2 s γ ϵ + θ 3 s γ h = 1 q s γ + η s γ θ s γ θ s γ + η s γ + q 3 s γ + V s γ + η s γ θ s γ θ 2 s γ η 2 s γ i + V 2 s γ + η s γ θ s γ θ 2 s γ η 2 s γ η 2 s γ θ 2 s γ θ s γ η s γ ϵ + V 3 s γ η s γ θ s γ θ s γ η s γ h = 1 q s γ + q s γ V s γ + q 3 s γ + V s γ q s γ η 2 s γ θ 2 s γ i + V 2 s γ q s γ η 2 s γ θ 2 s γ + q 2 s γ η s γ θ s γ ϵ + V 3 s γ + q s γ η s γ θ s γ h = 1 q s γ + q 3 s γ + q s γ V s γ + V s γ q s γ η 2 s γ θ 2 s γ η s γ θ s γ η s γ θ s γ i + V 2 s γ q s γ η 2 s γ θ 2 s γ η s γ θ s γ η s γ θ s γ + q 2 s γ η s γ θ s γ ϵ + V 3 s γ + q s γ η s γ θ s γ h .
Substituting
η s γ θ s γ Ω ,
1 q s γ + q 3 s γ + q s γ V s γ + V s γ i + V 2 s γ ϵ + V 3 s γ h Φ
and
U 2 s γ i + U 2 s γ q s γ ϵ h ω ,
in the last equation, we conclude
η ˜ γ θ ˜ γ = Φ Ω q s γ ω .
Following a similar argument as the proof of (10), one can verify (11). The proof of Lemma 1 is complete. □
Next, we give the Binet formula for higher-order generalized Fibonacci hybrinomials of parameter s. Using this formula, we derive some properties of these hybrinomials.
Theorem 1.
Let n N { 0 } . The Binet formula for the higher-order generalized Fibonacci hybrinomials KU n ( s ) γ is
KU n ( s ) γ = η ˜ γ ( η s γ ) n θ ˜ γ ( θ s γ ) n η s γ θ s γ .
Proof. 
By using (6), we obtain
KU n ( s ) = U n s γ + U n + 1 s γ i + U n + 2 s γ ϵ + U n + 3 s γ h = η s n γ θ s n γ η s γ θ s γ + η s n + 1 γ θ s n + 1 γ η s γ θ s γ i + η s n + 2 γ θ s n + 2 γ η s γ θ s γ ϵ + η s n + 3 γ θ s n + 3 γ η s γ θ s γ h = 1 η s γ θ s γ η s n γ 1 + η s γ i + η s γ 2 ϵ + η s γ 3 h θ s n γ 1 + θ s γ i + θ s γ 2 ϵ + θ s γ 3 h = η ˜ γ ( η s γ ) n θ ˜ γ ( θ s γ ) n η s γ θ s γ .
The proof is complete. □
Theorem 2.
The generating function for the higher-order generalized Fibonacci hybrinomials KU n ( s ) γ is
n = 0 KU n ( s ) γ t n = η ˜ γ θ ˜ γ t ( η ˜ γ θ s γ θ ˜ γ η s γ ) η s γ θ s γ 1 V s γ t + q s γ t 2 .
Proof. 
Using (12) and (5), we find that
n = 0 KU n ( s ) γ t n = n = 0 η ˜ γ η s n γ θ ˜ γ θ s n γ η s γ θ s γ t n = η ˜ γ η s γ θ s γ n = 0 η s n γ t n θ ˜ γ η s γ θ s γ n = 0 θ s n γ t n = 1 η s γ θ s γ η ˜ γ 1 η s γ t θ ˜ γ 1 θ s γ t = 1 η s γ θ s γ η ˜ γ η ˜ γ θ s γ t θ ˜ γ + θ ˜ γ η s γ t 1 η s γ t 1 θ s γ t = 1 η s γ θ s γ η ˜ γ θ ˜ γ t η ˜ γ θ s γ θ ˜ γ η s γ 1 θ s γ + η s γ t + η s γ θ s γ t 2 = η ˜ γ θ ˜ γ t ( η ˜ γ θ s γ θ ˜ γ η s γ ) η s γ θ s γ 1 V s γ t + q s γ t 2 .
The proof is complete. □
Theorem 3.
For m N and n N { 0 } , the generating function of the higher-order generalized Fibonacci hybrinomials KU n + m ( s ) γ is
n = 0 KU n + m ( s ) γ t n = KU m ( s ) γ KU m 1 ( s ) γ q s γ t 1 V s γ t + q s γ t 2 .
Proof. 
By virtue of (12) and after some calculations, we have
n = 0 KU n + m ( s ) γ t n = n = 0 η ˜ γ η s n + m γ θ ˜ γ θ s n + m γ η s γ θ s γ t n = 1 η s γ θ s γ n = 0 η ˜ γ η s n + m γ t n n = 0 θ ˜ γ θ s n + m γ t n = 1 η s γ θ s γ η ˜ γ η s m γ n = 0 η s n γ t n θ ˜ γ θ s m γ n = 0 θ s n γ t n = 1 η s γ θ s γ η ˜ γ η s m γ ( 1 θ s γ t ) θ ˜ γ θ s m γ ( 1 η s γ t ) ( 1 η s γ t ) ( 1 θ s γ t ) = η ˜ γ η s m γ θ ˜ γ θ s m γ η s γ θ s γ 1 1 V s γ t + q s γ t 2 η s γ θ s γ t η ˜ γ η s m 1 γ θ ˜ γ θ s m 1 γ η s γ θ s γ 1 V s γ t + q s γ t 2 = KU m ( s ) γ 1 V s γ t + q s γ t 2 η ˜ γ η s m 1 γ θ ˜ γ θ s m 1 γ η s γ θ s γ × q s γ t 1 V s γ t + q s γ t 2 = KU m ( s ) γ KU m 1 ( s ) γ q s γ t 1 V s γ t + q s γ t 2 .
The proof is complete. □
Theorem 4.
The exponential generating function for the higher-order generalized Fibonacci hybrinomials KU n ( s ) γ is
n = 0 KU n ( s ) γ t n n ! = η ˜ γ e η s γ t θ ˜ γ e θ s γ t η s γ θ s γ .
Proof. 
Using the Binet formula for the KU n ( s ) γ , we have
n = 0 KU n ( s ) γ t n n ! = n = 0 η ˜ γ η s n γ θ ˜ γ θ s n γ η s γ θ s γ t n n ! = 1 η s γ θ s γ η ˜ γ n = 0 η s n γ n ! t n θ ˜ γ n = 0 θ s n γ n ! t n = 1 η s γ θ s γ η ˜ γ e η s γ t θ ˜ γ e θ s γ t = η ˜ γ e η s γ t θ ˜ γ e θ s γ t η s γ θ s γ .
The proof is complete. □
Theorem 5.
For n N , the recurrence relation for the higher-order generalized Fibonacci hybrinomials KU n ( s ) γ is
KU n + 1 ( s ) γ = KU n ( s ) γ V s γ q s γ KU n 1 ( s ) γ .
Proof. 
Applying (12) and (5) gives
KU n + 1 ( s ) γ = η ˜ γ η s n + 1 γ θ ˜ γ θ s n + 1 γ η s γ θ s γ = 1 η s γ θ s γ η ˜ γ η s n γ η s γ θ ˜ γ θ s n γ θ s γ = 1 η s γ θ s γ η ˜ γ η s n γ η s γ θ ˜ γ θ s n γ η s γ + θ ˜ γ θ s n γ η s γ θ ˜ γ θ s n γ θ s γ = 1 η s γ θ s γ η ˜ γ η s n γ θ ˜ γ θ s n γ η s γ + 1 η s γ θ s γ θ ˜ γ θ s n γ η s γ θ ˜ γ θ s n γ θ s γ = KU n ( s ) γ η s γ + 1 η s γ θ s γ θ ˜ γ θ s n γ η s γ θ ˜ γ θ s n γ θ s γ = KU n ( s ) γ η s γ + θ s γ KU n ( s ) γ θ s γ + 1 η s γ θ s γ θ ˜ γ θ s n γ η s γ θ ˜ γ θ s n γ θ s γ = KU n ( s ) γ V s γ + 1 η s γ θ s γ θ ˜ γ θ s n γ θ s γ η ˜ γ η s n γ θ s γ + θ ˜ γ θ s n γ η s γ θ ˜ γ θ s n γ θ s γ = KU n ( s ) γ V s γ + 1 η s γ θ s γ η ˜ γ η s n γ θ s γ + θ ˜ γ θ s n γ η s γ = KU n ( s ) γ V s γ + η γ θ γ s η s γ θ s γ θ ˜ γ θ s n 1 γ η ˜ γ η s n 1 γ = KU n ( s ) γ V s γ q s γ η ˜ γ ( η s γ ) n 1 θ ˜ γ ( θ s γ ) n 1 η s γ θ s γ = KU n ( s ) γ V s γ q s γ KU n 1 ( s ) γ .
The required proof is complete. □
Table 1 shows us that the multiplication operation in the hybrid numbers is not commutative. Starting from this, we now give Vajda’s identity, which generalizes Catalan’s, Cassini’s, and d’Ocagne’s identities that are well known in the literature.
Theorem 6
(Vajda’s identity). For any integers n , m and r, we have
KU n + m ( s ) γ KU n + r ( s ) γ KU n ( s ) γ KU n + m + r ( s ) γ = q s n γ U m s γ Φ U r s γ + q s γ ω V s r γ .
Proof. 
Using Binet formula for the higher-order generalized Fibonacci hybrinomials, we have
KU n + m ( s ) γ KU n + r ( s ) γ KU n ( s ) γ KU n + m + r ( s ) γ = 1 η s γ θ s γ 2 η ˜ γ θ ˜ γ η s γ n + m θ s γ n + r θ ˜ γ η ˜ γ ( θ s γ ) n + m ( η s γ ) n + r + η ˜ γ θ ˜ γ ( η s γ ) n ( θ s γ ) n + m + r + θ ˜ γ η ˜ γ ( θ s γ ) n ( η s γ ) n + m + r = η s γ θ s γ n η s γ θ s γ 2 η ˜ γ θ ˜ γ η s m γ θ s r γ θ ˜ γ η ˜ γ θ s m γ η s r γ + η ˜ γ θ ˜ γ θ s m + r γ + θ ˜ γ η ˜ γ η s m + r γ = q s n γ η s γ θ s γ 2 η ˜ γ θ ˜ γ θ s r γ η s m γ θ s m γ + θ ˜ γ η ˜ γ η s r γ η s m γ θ s m γ = q s n γ η s γ θ s γ 2 η s m γ θ s m γ η ˜ γ θ ˜ γ θ s r γ + θ ˜ γ η ˜ γ η s r γ = q s n γ η s γ θ s γ 2 η s m γ θ s m γ Φ Ω q s γ ω θ s r γ + Φ + Ω q s γ ω η s r γ = q s n γ U m s γ η s γ θ s γ Φ θ s r γ + Ω q s γ ω θ s r γ + Φ η s r γ + Ω q s γ ω η s r γ = q s n γ U m s γ η s γ θ s γ Φ η s r γ θ s r γ + Ω q s γ ω θ s r γ + η s r γ = q s n γ U m s γ η s γ θ s γ Φ Ω U r s γ + Ω q s γ ω V s r γ = q s n γ U m s γ η s γ θ s γ Ω Φ U r s γ + q s γ ω V s r γ = q s n γ U m s γ Φ U r s γ + q s γ ω V s r γ .
The required proof is complete. □
Remark 1.
As applications of Theorem 6, we obtain the following results.
(i)
When taking m r , we derive Catalan’s identity for KU n ( s ) γ as follows:
KU n r ( s ) γ KU n + r ( s ) γ KU n ( s ) γ 2 = q s n γ U r s γ Φ U r s γ + q s γ ω V s r γ .
(ii)
When taking r = m = 1 , we obtain Cassini’s identity for KU n ( s ) γ as follows:
KU n 1 ( s ) γ KU n + 1 ( s ) γ KU n ( s ) γ 2 = q s n + s γ Φ + q s γ ω V s γ .
(iii)
When taking r j n , and m = 1 , we have d’Ocagne’s identity for KU n ( s ) γ as follows:
KU n + 1 ( s ) γ KU j ( s ) γ KU n ( s ) γ KU j + 1 ( s ) γ = q s n γ Φ U j n s γ + q s γ ω V s j n γ .
Remark 2.
For γ = 1 , higher-order generalized Fibonacci hybrid numbers have the following character:
C KU n ( s ) = U n ( s ) 2 + U n + 1 ( s ) 2 2 U n + 1 ( s ) U n + 2 ( s ) U n + 3 ( s ) 2 < U n ( s ) 2 + U n + 1 ( s ) 2 2 U n + 1 ( s ) 2 U n + 3 ( s ) 2 = U n ( s ) 2 U n + 1 ( s ) 2 U n + 3 ( s ) 2 < 0 .
Thus, from (17), the higher-order generalized Fibonacci hybrid numbers are space-like.

3. Matrix Representations for Higher-Order Generalized Fibonacci Hybrinomials

In this part of the our paper, we define three different matrices as follows: for n N ,
A n ( s ) = KU n + 1 ( s ) γ KU n ( s ) γ KU n ( s ) γ KU n 1 ( s ) γ ,
Q ( s ) = V s γ q s γ 1 0 ,
R n ( s ) = U n + 1 s γ U n s γ U n s γ U n 1 s γ ,
where KU n ( s ) γ , V s γ , and U n s γ are higher-order generalized Fibonacci hybrinomials, generalized Lucas polynomials, and higher-order generalized Fibonacci polynomials, respectively. Based on these matrices, we will obtain some identities for higher-order generalized Fibonacci hybrinomials.
Lemma 2.
Let n 1 be an integer. Then, we have
A n ( s ) = Q ( s ) A n 1 ( s ) .
Proof. 
Applying matrix multiplication and (15) yields
Q ( s ) A n 1 ( s ) = V s γ q s γ 1 0 KU n ( s ) γ KU n 1 ( s ) γ KU n 1 ( s ) γ KU n 2 ( s ) γ = V s γ KU n ( s ) γ q s γ KU n 1 ( s ) γ V s γ KU n 1 ( s ) γ q s γ KU n 2 ( s ) γ KU n ( s ) γ KU n 1 ( s ) γ = KU n + 1 ( s ) γ KU n ( s ) γ KU n ( s ) γ KU n 1 ( s ) γ = A n ( s ) .
The proof is complete. □
Lemma 3.
Let n 1 be an integer. Then, we have
R n ( s ) = Q ( s ) R n 1 ( s ) .
Proof. 
By using matrix multiplication and (7), we have
Q ( s ) R n 1 ( s ) = V s γ q s γ 1 0 U n s γ U n 1 s γ U n 1 s γ U n 2 s γ = V s γ U n s γ q s γ U n 1 s γ V s γ U n 1 s γ q s γ U n 2 s γ U n s γ U n 1 s γ = U n + 1 s γ U n s γ U n s γ U n 1 s γ = R n ( s ) .
The proof is complete. □
Lemma 4.
Let n 1 be an integer. Then, we have
A n ( s ) = Q ( s ) n A 0 ( s ) .
Proof. 
We will verify that (21) is true by induction on n. Since
Q ( s ) A 0 ( s ) = V s γ q s γ 1 0 KU 1 ( s ) γ KU 0 ( s ) γ KU 0 ( s ) γ KU 1 ( s ) γ = V s γ KU 1 ( s ) γ q s γ KU 0 ( s ) γ V s γ KU 0 ( s ) γ q s γ KU 1 ( s ) γ KU 1 ( s ) γ KU 0 ( s ) γ = KU 2 ( s ) γ KU 1 ( s ) γ KU 1 ( s ) γ KU 0 ( s ) γ ,
the equality (21) holds for n = 1 . Suppose that (21) is true for n. Then, by the inductive hypothesis, we have
Q ( s ) n + 1 A 0 ( s ) = V s γ q s γ 1 0 n + 1 KU 1 ( s ) γ KU 0 ( s ) γ KU 0 ( s ) γ KU 1 ( s ) γ = V s γ q s γ 1 0 V s γ q s γ 1 0 n KU 1 ( s ) γ KU 0 ( s ) γ KU 0 ( s ) γ KU 1 ( s ) γ = V s γ q s γ 1 0 KU n + 1 ( s ) γ KU n ( s ) γ KU n ( s ) γ KU n 1 ( s ) γ = V s γ KU n + 1 ( s ) γ q s γ KU n ( s ) γ V s γ KU n ( s ) γ q s γ KU n 1 ( s ) γ KU n + 1 ( s ) γ KU n ( s ) γ = KU n + 2 ( s ) γ KU n + 1 ( s ) γ KU n + 1 ( s ) γ KU n ( s ) γ = A n + 1 ( s ) ,
which shows that (21) is also true for n + 1 . Therefore, by the principle of mathematical induction, (21) is true for all n N . The proof is complete. □
Lemma 5.
Let n 1 be an integer. Then, we have
R n ( s ) = Q ( s ) n R 0 ( s ) .
Proof. 
We will prove that (22) is true by induction on n. Since
Q ( s ) R 0 ( s ) = V s γ q s γ 1 0 U 1 s γ U 0 s γ U 0 s γ U 1 s γ = V s γ U 1 s γ q s γ U 0 s γ V s γ U 0 s γ q s γ U 1 s γ U 1 s γ U 0 s γ = U 2 s γ U 1 s γ U 1 s γ U 0 s γ = R 1 ( s ) .
we know that (22) holds for n = 1 . Suppose that (22) is true for n. Then, by the inductive hypothesis, we get
Q ( s ) n + 1 R 0 ( s ) = V s γ q s γ 1 0 n + 1 U 1 s γ U 0 s γ U 0 s γ U 1 s γ = V s γ q s γ 1 0 V s γ q s γ 1 0 n U 1 s γ U 0 s γ U 0 s γ U 1 s γ = V s γ q s γ 1 0 U n + 1 s γ U n s γ U n s γ U n 1 s γ = V s γ U n + 1 s γ q s γ U n s γ V s γ U n s γ q s γ U n 1 s γ U n + 1 s γ U n s γ = U n + 2 s γ U n + 1 s γ U n + 1 s γ U n s γ = R n + 1 ( s ) ,
which means that (22) is also true for n + 1 . Therefore, by the principle of mathematical induction, (22) is true for all n N . The proof is complete. □
Lemma 6.
Let n 1 be an integer. Then, we have
Q ( s ) n = U n + 1 s γ q s γ U n s γ U n s γ q s γ U n 1 s γ .
Proof. 
We will show that (23) is true by induction on n. Clearly, from (19), the equality (23) holds for n = 1 . Assume that our assertion holds for n. Then, by the inductive hypothesis, we have
Q ( s ) n + 1 = V s γ q s γ 1 0 U n + 1 s γ q s γ U n s γ U n s γ q s γ U n 1 s γ = V s γ U n + 1 s γ q s γ U n s γ q s γ V s γ U n s γ q s γ U n 1 s γ U n + 1 s γ q s γ U n s γ = U n + 2 s γ q s γ U n + 1 s γ U n + 1 s γ q s γ U n s γ ,
which shows (23) is also true for n + 1 . Therefore, by the principle of mathematical induction, (23) is true for all n N . □
Theorem 7.
Let m , n N . Then,
KU n + m ( s ) γ = U n + 1 s γ KU m ( s ) γ q s γ U n s γ KU m 1 ( s ) γ .
Proof. 
From (18), we have
A n + m ( s ) = KU n + m + 1 ( s ) γ KU n + m ( s ) γ KU n + m ( s ) γ KU n + m 1 ( s ) γ .
By using Theorem 4 and Lemma 3, we have
A n + m ( s ) = Q ( s ) n + m A 0 ( s ) = Q ( s ) n Q ( s ) m A 0 ( s )
and
R n ( s ) = Q ( s ) n R 0 ( s ) Q ( s ) n = R n ( s ) R 0 ( s ) 1 .
Substituting (25) into (24), we get
A n + m ( s ) = Q ( s ) n Q ( s ) m A 0 ( s ) = R n ( s ) R 0 ( s ) 1 A m ( s ) .
Then, we have
A n + m ( s ) = U n + 1 s γ U n s γ U n s γ U n 2 s γ 1 U 1 s γ U 1 s γ U 0 s γ 2 U 1 s γ U 0 s γ U 0 s γ U 1 s γ × KU m + 1 ( s ) γ KU m ( s ) γ KU m ( s ) γ KU m 1 ( s ) γ = 1 U 1 s γ U 1 s γ U 0 s γ 2 U n + 1 s γ U n s γ U n s γ U n 2 s γ U 1 s γ U 0 s γ U 0 s γ U 1 s γ × KU m + 1 ( s ) γ KU m ( s ) γ KU m ( s ) γ KU m 1 ( s ) γ
Taking the first row’s and second column’s entry of each side from the above formula gives
KU n + m ( s ) γ = 1 U 1 s γ U 1 s γ U 0 s γ 2 U n + 1 s γ U 1 s γ U n s γ U 0 s γ KU m ( s ) γ + U n + 1 s γ U 0 s γ + U n s γ U 1 s γ KU m 1 ( s ) γ = 1 q s γ U 1 s γ 2 q s γ U n + 1 s γ U 1 s γ U n s γ U 0 s γ KU m ( s ) γ + U n + 1 s γ U 0 s γ + U n s γ U 1 s γ KU m 1 ( s ) γ = 1 q s γ q s γ U n + 1 s γ KU m ( s ) γ + U n s γ KU m 1 ( s ) γ = U n + 1 s γ KU m ( s ) γ q s γ U n s γ KU m 1 ( s ) γ .
The proof is complete. □
Theorem 8.
For any k, l, m, n integers for which k + l = m + n , we have
U k s γ KU l ( s ) γ U m s γ KU n ( s ) γ = q s γ U m 1 s γ KU n 1 ( s ) γ U k 1 s γ KU l 1 ( s ) γ .
Proof. 
From (21), we have
Q ( s ) k A l ( s ) = Q ( s ) k Q ( s ) l A 0 ( s ) = Q ( s ) k + l A 0 ( s ) = Q ( s ) m + n A 0 ( s ) = Q ( s ) m Q ( s ) n A 0 ( s ) = Q ( s ) m A n ( s ) .
Namely, we have
Q ( s ) k A l ( s ) = Q ( s ) m A n ( s ) .
Q ( s ) k A l ( s ) = V s γ q s γ 1 0 k KU l + 1 ( s ) γ KU l ( s ) γ KU l ( s ) γ KU l 1 ( s ) γ = U k + 1 s γ q s γ U k s γ U k s γ q s γ U k 1 s γ KU l + 1 ( s ) γ KU l ( s ) γ KU l ( s ) γ KU l 1 ( s ) γ .
Similarly, Q ( s ) m A n ( s ) is equal to
U m + 1 s γ KU n + 1 ( s ) γ q s γ U m s γ KU n ( s ) γ U m + 1 s γ KU n ( s ) γ q s γ U m s γ KU n 1 ( s ) γ U m s γ KU n + 1 ( s ) γ q s γ U m 1 s γ KU n ( s ) γ U m s γ KU n ( s ) γ q s γ U m 1 s γ KU n 1 ( s ) γ .
If we equate the second row and second column elements of matrices (27) and (28), we conclude that
U k s γ KU l ( s ) γ q s γ U k 1 s γ KU l 1 ( s ) γ = U m s γ KU n ( s ) γ q s γ U m 1 s γ KU n 1 ( s ) γ
and
U k s γ KU l ( s ) γ U m s γ KU n ( s ) γ = q s γ U m 1 s γ KU n 1 ( s ) γ U k 1 s γ KU l 1 ( s ) γ .
So, Equation (26) is obtained. □
Theorem 9.
Let n N . Then,
KU m + 1 ( s ) γ KU m 1 ( s ) γ KU m ( s ) γ 2 = q s n γ η s γ θ s γ 2 Φ V 2 s γ q s γ + Ω 2 ω V s γ + 2 Φ
and
KU m 1 ( s ) γ KU m + 1 ( s ) γ KU m ( s ) γ 2 = q s n γ η s γ θ s γ 2 Φ V 2 s γ q s γ Ω 2 ω V s γ + 2 Φ .
Proof. 
If we take the determinant of both sides of Equation (21) and use the multiplication from above to down below rule for the determinant A n ( s ) [24] (p. 141), we find that
q s n γ KU 1 ( s ) γ KU 1 ( s ) γ KU 0 ( s ) γ 2 = q s n γ η s γ θ s γ 2 η ˜ γ ( η s γ ) θ ˜ γ ( θ s γ ) η ˜ γ ( η s γ ) 1 θ ˜ γ ( θ s γ ) 1 η ˜ γ θ ˜ γ 2 = q s n γ η s γ θ s γ 2 η ˜ 2 γ + θ ˜ 2 γ η ˜ γ θ ˜ γ η s γ ( θ s γ ) 1 θ ˜ γ η ˜ γ θ s γ ( η s γ ) 1 η ˜ 2 γ + η ˜ γ θ ˜ γ + θ ˜ γ η ˜ γ θ ˜ 2 γ = q s n γ η s γ θ s γ 2 η ˜ γ θ ˜ γ η s γ ( θ s γ ) 1 θ ˜ γ η ˜ γ θ s γ ( η s γ ) 1 + η ˜ γ θ ˜ γ + θ ˜ γ η ˜ γ .
By virtue of (10) and (11), we deduce
= q s n γ η s γ θ s γ 2 η ˜ γ θ ˜ γ η s γ ( θ s γ ) 1 θ ˜ γ η ˜ γ θ s γ ( η s γ ) 1 + Φ Ω q s γ ω + Φ + Ω q s γ ω = q s n γ η s γ θ s γ 2 η ˜ γ θ ˜ γ η s γ θ s γ θ ˜ γ η ˜ γ θ s γ η s γ + 2 Φ = q s n γ η s γ θ s γ 2 Φ Ω q s γ ω η s γ θ s γ Φ + Ω q s γ ω θ s γ η s γ + 2 Φ = q s n γ η s γ θ s γ 2 Φ η s γ θ s γ Φ θ s γ η s γ + Ω q s γ ω η s γ θ s γ Ω q s γ ω θ s γ η s γ + 2 Φ = q s n γ η s γ θ s γ 2 Φ η 2 s γ + θ 2 s γ q s γ + Ω q s γ ω η 2 s γ θ 2 s γ q s γ + 2 Φ = q s n γ η s γ θ s γ 2 Φ η 2 s γ + θ 2 s γ q s γ + Ω ω η s γ θ s γ η s γ + θ s γ + 2 Φ = q s n γ η s γ θ s γ 2 Φ η 2 s γ + θ 2 s γ q s γ + Ω 2 ω V s γ + 2 Φ = q s n γ η s γ θ s γ 2 Φ V 2 s γ q s γ + Ω 2 ω V s γ + 2 Φ .
Hence, we show the assertion (29). Using the multiplication from down below to the above rule for the determinant A n ( s ) , (30) can be proved similarly. □

4. Conclusions and Discussion

In this paper, we have defined and studied a different generalization of Fibonacci hybrid numbers and polynomials, which resulted in not only some existing families of hybrid numbers and polynomials in the literature but also some new families of hybrid numbers and polynomials according to the values of the parameters. In the last section, we have obtained some identities for higher-order generalized Fibonacci hybrid polynomials by using some matrices of a special type. Therefore, our results generalize some previous papers [16,17,19]. For future research, in view of this paper, researchers can define many hypercomplex polynomials using other higher-order polynomial families.

Author Contributions

Writing—original draft, C.K., W.-S.D. and N.T.; writing—review and editing, C.K., W.-S.D. and N.T. All authors have read and agreed to the published version of the manuscript.

Funding

Wei-Shih Du was partially supported by Grant No. NSTC 112-2115-M-017-002 of the National Science and Technology Council of the Republic of China.

Data Availability Statement

No data were used to support this study.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Koshy, T. Fibonacci and Lucas Numbers with Applications; John Wiley & Sons: Hoboken, NJ, USA, 2019; Volume 2. [Google Scholar]
  2. Lyapin, A.P.; Akhtamova, S.S. Recurrence relations for the sections of the generating series of the solution to the multidimensional difference equation. Vestn. Udmurtsk. Univ. Mat. Mekh. 2021, 31, 414–423. [Google Scholar] [CrossRef]
  3. Özvatan, M. Generalized Golden-Fibonacci Calculus and Applications. Master’s Thesis, Izmir Institute of Technology, Urla, Turkey, 2018. [Google Scholar]
  4. Pashaev, O.K. Quantum calculus of Fibonacci divisors and infinite hierarchy of bosonic-fermionic golden quantum oscillators. Int. J. Geom. Methods Mod. Phys. 2021, 18, 32. [Google Scholar] [CrossRef]
  5. Horadam, A.F. Extension of a synthesis for a class of polynomial sequences. Fibonacci Q. 1996, 34, 68–74. [Google Scholar]
  6. Lee, G.; Asci, M. Some properties of the (p, q)-Fibonacci and (p, q)-Lucas polynomials. J. Appl. Math. 2012, 2012, 264842. [Google Scholar] [CrossRef]
  7. Kızılateş, C.; Kibar, I.Y. On 3-parameter quaternions with higher order generalized Fibonacci numbers components. J. Anal. 2024. [Google Scholar] [CrossRef]
  8. Özdemir, M. Introduction to hybrid numbers. Adv. Appl. Clifford Algebr. 2018, 28, 1–32. [Google Scholar] [CrossRef]
  9. Szynal-Liana, A.; Wloch, I. The Fibonacci hybrid numbers. Util. Math. 2019, 110, 3–10. [Google Scholar]
  10. Kızılateş, C. A new generalization of Fibonacci hybrid and Lucas hybrid numbers. Chaos Solitons Fractals 2020, 130, 1–5. [Google Scholar] [CrossRef]
  11. Sentürk, T.; Bilgici, G.; Daşdemir, A.; Ünal, Z. A study on Horadam hybrid numbers. Turk. J. Math. 2020, 44, 1212–1221. [Google Scholar] [CrossRef]
  12. Kocer, E.G.; Alsan, H. Generalized Hybrid Fibonacci and Lucas p-numbers. Indian J. Pure Appl. Math. 2022, 53, 948–955. [Google Scholar] [CrossRef]
  13. Polatlı, E. Hybrid Numbers with Fibonacci and Lucas Hybrid Number Coefficients. Univ. J. Math. Appl. 2023, 6, 106–113. [Google Scholar] [CrossRef]
  14. Polatlı, E. A note on ratios of Fibonacci hybrid and Lucas hybrid numbers. Notes Number Theory Discret. Math. 2021, 27, 73–78. [Google Scholar] [CrossRef]
  15. Tan, E.; Savin, D.; Yılmaz, S. A New Class of Leonardo Hybrid Numbers and Some Remarks on Leonardo Quaternions over Finite Fields. Mathematics 2023, 11, 4701. [Google Scholar] [CrossRef]
  16. Kızılateş, C.; Kone, T. On special spacelike hybrid numbers with Fibonacci divisor number components. Indian J. Pure Appl. Math. 2023, 54, 279–287. [Google Scholar] [CrossRef]
  17. Szynal-Liana, A.; Wloch, I. Introduction to Fibonacci and Lucas hybrinomials. Complex Var. Elliptic Equ. 2020, 65, 1736–1747. [Google Scholar] [CrossRef]
  18. Liana, M.; Szynal-Liana, A.; Wloch, I. On Pell hybrinomials. Miskolc Math. Notes 2019, 20, 1051–1062. [Google Scholar] [CrossRef]
  19. Kızılateş, C. A Note on Horadam Hybrinomials. Fundam. J. Math. Appl. 2022, 5, 1–9. [Google Scholar] [CrossRef]
  20. Ait-Amrane, N.R.; Belbachir, H.; Tan, E. On generalized Fibonacci and Lucas hybrid polynomials. Turk. J. Math. 2022, 46, 2069–2077. [Google Scholar] [CrossRef]
  21. Mersin, E.Ö.; Bahşi, M. Hyper-Fibonacci and Hyper-Lucas Hybrinomials. Konuralp J. Math. 2022, 10, 293–300. [Google Scholar]
  22. Köme, S.; Kumtas, Z. Generalized bivariate conditional Fibonacci and Lucas hybrinomials. Commun. Fac. Sci. Univ. Ank. Ser. A1 Math. Stat. 2024, 73, 37–63. [Google Scholar] [CrossRef]
  23. Kürüz, F.; Dağdeviren, A.; Catarino, P. On Leonardo Pisano Hybrinomials. Mathematics 2021, 9, 2923. [Google Scholar] [CrossRef]
  24. Morais, J.P.; Georgiev, S.; Sprößig, W. Quaternion Matrices. In Real Quaternionic Calculus Handbook; Birkhäuser: Basel, Switzerland, 2014. [Google Scholar]
Table 1. Multiplication table for K .
Table 1. Multiplication table for K .
1i ϵ h
1 1 i ϵ h
i i 1 1 h ϵ + i
ϵ ϵ h + 1 0 ϵ
h h ϵ i ϵ 1
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

Kızılateş, C.; Du, W.-S.; Terzioğlu, N. On Higher-Order Generalized Fibonacci Hybrinomials: New Properties, Recurrence Relations and Matrix Representations. Mathematics 2024, 12, 1156. https://doi.org/10.3390/math12081156

AMA Style

Kızılateş C, Du W-S, Terzioğlu N. On Higher-Order Generalized Fibonacci Hybrinomials: New Properties, Recurrence Relations and Matrix Representations. Mathematics. 2024; 12(8):1156. https://doi.org/10.3390/math12081156

Chicago/Turabian Style

Kızılateş, Can, Wei-Shih Du, and Nazlıhan Terzioğlu. 2024. "On Higher-Order Generalized Fibonacci Hybrinomials: New Properties, Recurrence Relations and Matrix Representations" Mathematics 12, no. 8: 1156. https://doi.org/10.3390/math12081156

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

Article Metrics

Back to TopTop