1. Introduction
Integer sequences possess a significance that transcends the realm of pure and applied mathematics, infiltrating diverse scientific domains such as physics and engineering. Among these sequences, the Fibonacci sequence stands out as particularly noteworthy, deriving its name from the esteemed Italian mathematician Leonardo Pisano, widely recognized as Fibonacci. This sequence demonstrates remarkable versatility, finding extensive applications across multiple disciplines, including mathematics, physics, and engineering. The symmetry properties of Fibonacci numbers are deeply intertwined with their mathematical structure and have far-reaching implications in number theory. One notable symmetry is that the ratio of consecutive Fibonacci numbers converges to the golden ratio, which is a fundamental constant in mathematics and nature. The subject matter has elicited considerable scholarly interest, prompting extensive investigation by diverse researchers [
1,
2]. The Fibonacci and Lucas sequences are defined by the following recurrence relations for
:
and
with initial conditions
,
and
, respectively. The Binet formulas for the Fibonacci numbers and Lucas numbers are given as follows:
and
where
and
are the zeros of the characteristic equation
The concept of Fibonacci divisors, also referred to in the scholarly literature as higher-order Fibonacci numbers, was initially explored by Pashaev and Nalci (for further details, see [
3] and also [
4]). These higher-order Fibonacci numbers, or Fibonacci divisors, which are conjugate to
, are defined for integer values of
as follows:
Since
is divisible by
, the ratio of
is always an integer. Thus, all higher-order Fibonacci numbers
are integers and
. In [
5], Pashaev elucidated the essential properties of higher-order Fibonacci numbers and concurrently illustrated their application through various physical examples.
The ring
of hybrid numbers is defined by
where the hybrid units
,
,
satisfy the relations
. This is introduced by Özdemir [
6]. This number system is a general form of complex, hyperbolic, and dual number systems. Here,
is complex unit,
is dual unit, and
is hyperbolic unit. These units are called hybrid units. In recent years, researchers from a variety of disciplines have studied this number system and used it in various fields of applied and computational science. For some applications of hybrid numbers, see [
7,
8] and references therein.
The conjugate of a hybrid number
is expressed by
From the definition of hybrid numbers, the multiplication table of the hybrid units is given in the following table (
Table 1):
As can be seen from the table above, the multiplication of hybrid numbers is not commutative. Let and be two hybrid numbers. Some arithmetic operations related to hybrid numbers are as follows:
if and only if, (equality).
(addition).
(subtraction).
(multiplication by scalar ).
The multiplication of hybrid numbers
h and
k is given by
Hybrid sequences whose components are terms of various integer sequences have been studied by many researchers. For instance, in [
9], Szynal-Liana and Wloch examined the Fibonacci hybrid numbers and obtained some combinatorial properties of these numbers. In [
10], Cerda-Morales introduced generalized hybrid Fibonacci numbers and obtained some of their properties. In [
11], Kızılateş examined the
q-Fibonacci and the
q-Lucas hybrid numbers and obtained some combinatorial properties of these numbers. Kızılateş [
12] also introduced and studied the Horadam hybrid polynomials called Horadam hybrinomials. In [
13], with the help of the Fibonacci divisor numbers, Kızılateş and Kone introduced and examined the Fibonacci divisor hybrid numbers. By using higher-order generalized Fibonacci polynomials, Kızılateş et al. [
14] studied the higher-order generalized Fibonacci hybrid polynomials called higher-order generalized Fibonacci hybrinomials and obtained some special cases and algebraic properties of the higher-order generalized Fibonacci hybrinomials. The
q-integer [
15] is expressed as
for
and
. Some properties of
q-numbers are as follows:
where
For more detailed information, interested readers should consult the remarkable monograph cited in [
16]. Pashaev elucidated critical aspects of higher-order Fibonacci numbers while demonstrating their applicability in various physical contexts. For instance, in [
5], through the utilization of quantum calculus, the infinite hierarchy of Golden quantum oscillators with the integer spectrum determined by Fibonacci divisors, the hierarchy of Golden coherent states, and associated Fock–Bargman representations in the space of complex analytic functions were derived.
The main aim of this paper is to extend the results obtained by Kızılateş [
11] for hybrid numbers to higher-order generalized Fibonacci hybrid numbers with quantum integer components by considering a parameter
According to this definition, several families of hybrid numbers can be derived, which may or may not be documented in the existing literature. The structure of this paper is as follows: The second section introduces
q-integer higher-order generalized hybrid numbers, presenting a Binet-like formula for these numbers and exploring numerous algebraic properties derived from this formula. Additionally, numerical examples are provided to validate the results, utilizing Maple for demonstration. The third section examines significant properties of these numbers through the application of two previously defined special matrices. The final section and Remark include the Maple code for the product of two hybrid numbers, as obtained from the examples, and offers suggestions for future research.
2. The Higher-Order Generalized Fibonacci Hybrid Numbers with Quantum Integer Components
In this section, we will first define the higher-order generalized Fibonacci hybrid numbers with quantum integer components and provide a large number of results involving them.
Definition 1. Let , , , and , and let , ε, and be units of . Then, we define higher-order generalized Fibonacci hybrid numbers with quantum integer components as follows: The aforementioned definition is notably comprehensive, encompassing the variables s, , and q, and generalizing to various hybrid numbers documented in the literature. Several examples of these are enumerated below.
For
Equation (
3) becomes the
q-Fibonacci-type hybrid number [
11].
For
,
, Equation (
3) becomes the higher-order Fibonacci hybrid number [
13].
For
,
, and
, Equation (
3) becomes the Fibonacci hybrid number [
9].
For
and
, Equation (
3) becomes the higher-order Jacobsthal hybrid number.
For
,
, and
, Equation (
3) becomes the Jacobsthal hybrid number [
17].
For
and
, Equation (
3) becomes the higher-order Pell hybrid number.
For
,
, and
Equation (
3) becomes the Pell hybrid number [
18].
We note that the following identity holds:
Now, we present the Binet-like formula for these types of newly established hybrid number sequences. Note that the Binet-like formula will play a key role in some of the results obtained in this section.
Theorem 1. For a, , , and the Binet-like formula of is expressed as follows:where and . Proof. From the definition of
, we obtain
Thus, our claim is proved. □
Example 1. Substituting , , , and in (3), we have a second higher-order Fibonacci hybrid number as follows:On the other hand, by virtue of the Binet-like formula, we haveFrom the right-side of Equation (4), we find thatHence, Equality (4) is satisfied. Theorem 2. For a, , , and , the following equation holds: Proof. By the aid of (
4), we have
The proof is completed. □
Theorem 3. For a, , , and , the following equation holds: Proof. Using (
4), we obtain
The proof is completed. □
Theorem 4. For a, , , and , the following equation holds: Proof. By virtue of the Equation (
4), we obtain
The proof is completed. □
This section will present the generating function of the hybrid sequence under consideration. It is widely recognized that the concept of generating functions constitutes a powerful analytical tool in combinatorial mathematics.
Theorem 5. For a, , , , and , the generating function of is given as Proof. Applying Equation (
4) and using the series expansion yields
which gives (
6). □
We can easily obtain the following conclusion if we take
in (
6).
Corollary 1. For , , , and , the generating function of is expressed by Theorem 6. For , , , and , the exponential generating function of is given as follows: Proof. By virtue of the Equation (
4), we have
So, the conclusion is proved. □
Theorem 7. For , , and , satisfies the following recurrence relation: Proof. Making use of the Binet-like formula of the
, direct computation gives
Thus, the proof is completed. □
Example 2. From definition of the , we obtain the hybrid numbers as follows:Setting , , , and in (7) and using the above hybrid numbers, we verify the following equation: The Binet-like formula, Vajda-like identity, Catalan-like identity, Cassini-like identity, and d’Ocagne-like identity are recognized as having significant importance in the study of special numbers. The computation of these identities provides valuable information about the sequences under investigation. For further details, readers are directed to [
1,
19]. Among the most notable identities encountered in the examination of number sequences is Vajda’s identity, which has been the subject of scholarly investigation since 1901 [
20]. We will now give the Vajda’s identity for
.
Theorem 8. For c, d, , , and , the Vajda’s identity for is as follows: Proof. Using the Binet-like formula and direct computation yields
Therefore, we obtain Formula (
9). □
Example 3. Letting , , and in (9) and using Table 1 and Equations (2) and (8), we obtainOn the other hand, for the right-hand side, by using the (5), we haveThen, we obtainHence, the equality is satisfied. Corollary 2. The following formulas hold:
Proof. - (i)
Formula (
10) can be shown by taking
in (
9).
- (ii)
Formula (
11) can be verified by taking
in (
9).
- (iii)
Formula (
12) can be proved by taking
,
and
in (
9).
□
Example 4. Letting and in (10), we havewhere , . Example 5. Letting in (10), we have Example 6. Letting and in (12), we havewhere , . Theorem 9. For a, b, , , and , the Honsberger Identity for is expressed by Proof. Applying the Binet-like formula given in (
4), we obtain
The proof is completed. □
Theorem 10. For a, b, , , and , following equation is true: Proof. By using the Equation (
4), we obtain
The proof is completed. □
Example 7. Using the hybrid numbers in (8), we haveOn the other hand, from the right-hand side of Equation (13), we haveTherefore, our results are verified. Theorem 11. For a, b, , , and , the following equation is satisfied: Proof. By using Equation (
4), we have
The proof is completed. □
Example 8. Using the hybrid numbers in (8), we haveOn the other hand, from the right side of Equation (16), we haveSo, our result is verified. Theorem 12. For b, , , and , the following equation holds: Proof. Applying Equation (
4), we obtain
The proof is completed. □
Example 9. Using the hybrid numbers in (8), we haveand from the right-hand side of Equation (17), we haveTherefore, our results are verified.