1. Introduction and Preliminaries
The famous Irish mathematician William Rowan Hamilton was the inventor of quaternions, defined as a non-commutative number system that extends complex numbers in 1843 [
1]. He defined the set of quaternions as a four-dimensional real vector space and established a multiplicative operation on it. Recall that a quaternion
p is defined in the form
where
are real numbers, and
are the standard orthonormal basis in
which satisfy the quaternion multiplication rules as follows:
The norm of a quaternion
p as in Equation (
1) is defined by
If we write
, where
, then the conjugate of the quaternion
p is denoted by
Quaternions have proven to be highly beneficial for both theoretical and practical applications in research. A significant number of research articles on quaternions are frequently published in journals of mathematical physics and quantum mechanics, with quaternion analysis being considered part of mainstream physics. In engineering, quaternions are widely utilized in control systems, and in the field of computer science, they play a critical role in computer graphics. For a more comprehensive understanding of the advances in these areas, the monographs and papers [
2,
3,
4] are valuable resources for interested readers.
The utilization of quaternions by mathematicians extends to the domain of defining quaternions whose coefficients are characterized by special integer sequences or special polynomials, and subsequently examining the algebraic properties of these quaternion types. Horadam [
5] introduced the Fibonacci quaternions as
where
is the
n-th Fibonacci number defined by
for
with the initial values
,
The Binet formula for the Fibonacci sequence is
where
and
Also, the Binet formula of the
is as follows:
where
Previous research on this construction has been conducted by numerous mathematicians; see, for example, Refs. [
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
16,
17]. Additionally, Pashaev and Özvatan studied the Fibonacci divisor, also known as higher-order Fibonacci numbers (see [
18,
19] for details). These higher-order Fibonacci numbers, also known as the Fibonacci divisor or conjugate to
, are defined for any integer
as follows:
Considering the divisibility of by , it can be inferred that the ratio is an integer. Consequently, all higher-order Fibonacci numbers, specifically , are integer. When the higher-order Fibonacci number becomes an ordinary Fibonacci number. The initial few values of the higher-order Fibonacci numbers are
For , ;
For , ;
For , ;
For , ;
For , .
Quantum calculus (
q-calculus for short) was originally proposed by Jackson [
20] and is one of the most important extensions of ordinary calculus. The
q-integer is a generalization of traditional calculus
, and is defined as the following:
for
and
. Certain properties of
q-numbers, including the
q-addition formula, the
q-subtraction formula, and the
q-product formula are as follows:
and
where
By using the definition of the
q-integer, the following identity holds:
For more details, interested readers are encouraged to consult the remarkable monograph [
21]. Pashaev revealed crucial aspects of the higher-order Fibonacci numbers and concurrently exhibited their utility in numerous physical scenarios. For example, in [
19], by using the quantum calculus, the infinite hierarchy of Golden quantum oscillators with integer spectrum determined by Fibonacci divisors, the hierarchy of Golden coherent states, and related Fock–Bargman representations in space of complex analytic functions were derived.
In [
22], the authors defined quaternions with quantum coefficients, including Fibonacci and Lucas quaternions. The authors also provided some combinatorial properties and applications related to time evolution and rotation. The objective of this paper is to extend the quaternion family introduced by Akkus and Kizilaslan by considering a parameter
s. Furthermore, we aim to define quaternion families that may or may not have been previously published, by utilizing higher-order generalized Fibonacci numbers and
q-integers for arbitrary integer values of
s. The following is the outline of our paper: In the second section, we present the main definition. Subsequently, we obtain various properties of the new quaternion family, such as Binet-like formulas, generating functions, recurrence relations, linearization properties, sum formulas, and more. In the third part of our paper, we obtain new properties for these quaternions using the interrelations of the three matrices of the special type we have defined. The fourth section of the paper summarizes the obtained results and outlines future research directions.
2. The Higher-Order Generalized Fibonacci Quaternions with -Integer Components
In this section, we introduce the concept of higher-order generalized Fibonacci quaternions with q-integer components.
Definition 1. Let (the set of integers), , and . The higher-order generalized Fibonacci quaternions with q-integer components are defined byor simply, In fact, contains many important quaternions as special cases:
- 1.
For
, Equation (
10) becomes the
q-Fibonacci-type quaternion [
22].
- 2.
For
,
, Equation (
10) becomes the higher-order
k-Fibonacci quaternion.
- 3.
For
,
, Equation (
10) becomes the higher-order Fibonacci quaternion [
14].
- 4.
For
,
,
, Equation (
10) becomes the Fibonacci quaternion [
5].
- 5.
For
,
, Equation (
10) becomes the higher-order
k-Jacobsthal quaternion.
- 6.
For
,
, Equation (
10) becomes the higher-order Jacobsthal quaternion [
23].
- 7.
For
,
,
, Equation (
10) becomes the Jacobsthal quaternion.
- 8.
For
,
, Equation (
10) becomes the higher-order
k-Pell quaternion.
- 9.
For
,
, Equation (
10) becomes the higher-order Pell quaternion [
24].
- 10.
For
,
,
, Equation (
10) becomes the Pell quaternion [
25].
We note that the following identities hold:
and
Theorem 1. For , , and . The Binet-like formula of can be expressed bywhereand Proof. By using Equation (
10), we obtain
The proof is completed. □
Applying the Binet-like formula of (i.e., Theorem 1), we obtain the following result.
Proposition 1. The following new equalities for hold true:
- (1)
- (2)
- (3)
Proof. Applying Theorem 1, we have
Hence, (1) is proved. Applying Theorem 1, we have
which implies the assertion (
2). Finally, let us verify Equation (
3). Applying Theorem 1, we have
The proof is completed. □
Theorem 2. For , , and , the generating function of is Proof. Employing Theorem 1, we obtain
The required proof is completed. □
When taking in Equation (12), we can derive the following conclusion immediately.
Corollary 1. For , , and , the generating function of is Theorem 3. For , , and , the exponential generating function of is Proof. Thanks to Equation (11), we obtain
The proof is completed. □
Theorem 4. For , and , the recurrence relation for is as follows: Proof. Utilizing Theorem 1 leads to
The proof of Theorem 4 is thus completed. □
We now establish the following identities for .
Theorem 5. For , and , we have Proof. By using Theorem 1, we obtain
The proof is completed. □
Remark 1. As applications of Theorem 5, we have the following results:
- (1)
When taking in Equation (13), we obtain - (2)
When taking and in Equation (13), we have - (3)
When taking and in Equation (13), we obtain
Theorem 6. For , and , we have Proof. By virtue of Theorem 1, we conclude
The proof is completed. □
Remark 2. In Theorems 5 and 6 and also in Remark 1, we can obtain some identities for special cases of p, q, and s.
Example 1 ([
26]).
When taking , and in Equation (14), we obtainwhere Example 2 ([
27]).
When taking , , and in Equation (15), we obtain Theorem 7. Let , and . If , then the linearization of can be represented as Proof. Applying Theorem 1 yields
Multiplying both sides of the above equation by
, we obtain the linearization of
as
or equivalence
The proof is completed. □
Here, we give an example illustrating Theorem 7.
Example 3. Let .
- (1)
For , we have . Making use of Theorem 7 yields - (2)
For , we have . Making use of Theorem 7 yields
Theorem 8. The following summation formulas for hold true: Proof. Applying Theorem 1, we have
This shows Equation (
17). Equations (18) and (19) can be proved similarly. □
Theorem 9. Let , , and .
Proof. Applying Theorem 1, we derive
The proof is thus completed. □
Theorem 10. Let , and . Then, we haveand Proof. Thanks to Theorem 1, we deduce
This shows Equation (
22). Similarly, by Theorem 1 again, we obtain
Hence, Equation (
23) holds. The proof is completed. □
Theorem 11. Let , , and .
Proof. By using Theorem 1, we obtain
- (1)
If
m is even, then, from (20) and (22), we obtain
- (2)
If
m is odd, then a direct calculation provides
Now, we arrive at the result. □
Following a similar argument to that in the proof of Theorem 11, we can obtain the following result.
Theorem 12. Let , , , and .
3. New Matrix Representations and Formulas for
In this section, we will examine various properties of the higher-order generalized
q-Fibonacci quaternions with quantum integer components by using the matrices defined below:
More precisely, we will study on , , matrices whose entries are higher-order generalized Fibonacci quaternions with quantum integer components , coefficients of recurrence relation of and coefficients of the , respectively.
The following matrix formulas are crucial in this section.
Proof. The proof will be by mathematical induction on
n. Clearly, Equation (
31) is true for
. Suppose that Equation (
31) is true for
. By using Equation (
8) and applying the induction hypothesis, we have
Therefore, (
31) is also true for
. This completes the induction, and hence our conclusion is proved. □
Theorem 14. Let . Then, the following formulas hold:and Proof. From Theorem 4, by using matrix multiplication, we obtain
This shows Equation (
32). Following a similar argument to that above, we can prove (
33). Moreover, Formulas (
34) and (
35) can be obtained by repeatedly substituting Formulas (
32) and (
33) for a finite number of times, respectively. □
As applications of Theorems 13 and 14, we establish the following new formulas for .
Theorem 15. Let . Then, the following formulas hold: Proof. In our proofs, we use “multiplication from above to down below” and “multiplication from down below to above” rules, respectively, for determinant of Equation (
34). Note that
We now show (
36) holds. Since
combining this with Equation (
38), we can prove Equation (
36). Similarly, by using the rule “multiplication from down below to above”, Equation (
37) can be verified. The proof is completed. □
Theorem 16. Let . If , then Proof. Based on Equations (
32) and (
34), we obtain
By using the matrix multiplication, we conclude that
equals
Similarly,
equals
Since
, we acquire
which implies
The proof is completed. □
Proof. Thanks to Equations (
34) and (
35), we obtain
and
On the other hand, we acquire
Comparing the above two formulas, we can conclude
The proof is completed. □