On Bicomplex ( p,q )-Fibonacci Quaternions

: Here, we describe the bicomplex ( p , q ) -Fibonacci numbers and the bicomplex ( p , q ) - Fibonacci quaternions based on these numbers to show that bicomplex numbers are not defined the same as bicomplex quaternions. Then, we give some of their equations, including the Binet formula, generating function, Catalan, Cassini, and d’Ocagne’s identities, and summation formulas for both. We also create a matrix for bicomplex ( p , q ) -Fibonacci quaternions, and we obtain the determinant of a special matrix that gives the terms of that quaternion. With this study, we get a general form of the second-order bicomplex number sequences and the second-order bicomplex quaternions. In addition, we show that these two concepts, defined as the same in many studies, are different.


Introduction
The number sequences are a subject of study that has been popular for centuries.The sequence that has the most significant role in the emergence of each of these sequences is the Fibonacci sequence.This sequence is shown with F n and described as, for n ≥ 2, F n = F n−1 + F n−2 with F 0 = 0, F 1 = 1 where n is an integer [1].A generalization of the Fibonacci sequences is the (p, q)-Fibonacci sequence.Suvarnamani and Tatong [2] defined the (p, q)-Fibonacci sequence, {F n (p, q)} ∞ n=0 , that has initial terms 0 and 1, and for n ≥ 0, holds the following recurrence relation: where p and q are nonzero real numbers such that p 2 + 4q > 0.
The characteristic equation of ( 1) is: Binet's formula for the F n (p, q) is as follows: where β and θ are roots of (2) [2].
A popular subject of study by researchers, especially in recent years, is quaternions.In 1843, Hamilton [3] introduced quaternions that extended complex numbers.In addition, a set of quaternions is defined by Hamilton as follows: H = {h = 1h 0 + e 1 h 1 + e 2 h 2 + e 3 h 3 : h 0 , h 1 , h 2 , h 3 ∈ R} where R is the set of real numbers, (4) The quaternions can be thought of as four-dimensional vectors, just as complex numbers can be considered two-dimensional vectors [3] because the quaternions are extensions of complex numbers into a four-dimensional space.
In addition, new quaternions can be defined by combining quaternions and different number sequences.For example, nth (p, q)-Fibonacci quaternions [4] are defined as follows: QF n (p, q) = F n (p, q) + e 1 F n+1 (p, q) + e 2 F n+2 (p, q) + e 3 F n+3 (p, q), ( where the F n (p, q) is the nth (p, q)-Fibonacci number.Also, the imaginary quaternion units e 1 , e 2 , and e 3 have the rules in (4).
There are many more works on quaternions in the literature.Some of these are as follows: In [5], Horadam defined Fibonacci quaternions.In [6], the authors described generalized Fibonacci quaternions and Narayana quaternions; in [7], split Fibonacci quaternions; and in [8], Halıcı defined complex Fibonacci quaternions.Moreover, she gave some matrix applications.In [9,10], the authors explained new generalizations of Fibonacci quaternions, and in [11], Cerda-Morales introduced a generalization for Tribonacci quaternions.In [12], the authors gave some properties of (p, q)-Fibonacci and (p, q)-Lucas quaternions, and in [13], Yagmur described hyperbolic (p, q)-Fibonacci quaternions and cited some properties.
Another famous number sequence is the bicomplex number sequence.In 1892, Segre [14] defined bicomplex numbers by four base elements (1, i, j, ij), where In that case, any bicomplex number b c can be written as follows: ′ 3 be two bicomplex numbers.Then, the addition, subtraction, and multiplication of the bicomplex numbers are written in the following form: Moreover, there are three different conjugations of the bicomplex numbers, as follows: Many studies have been done on bicomplex numbers.For example, in [15], the authors introduced the algebraic properties of bicomplex numbers.In [16], the authors obtained the elementary functions of bicomplex numbers.In [17], the authors explained the bicomplex Fibonacci and Lucas numbers and gave their properties.In [18], Halıcı described bicomplex Fibonacci numbers; in [19], Ya gmur introduced bicomplex k-Fibonacci numbers and gave some generalizations of them.
There are also studies in which bicomplex numbers and quaternion sequences are used together.In [20], Torunbalcı defined bicomplex Fibonacci quaternions.In [21], the authors introduced bicomplex generalized k-Horadam quaternions, and in [22], Gül described bicomplex Horadam quaternions and obtained some equations regarding them.In [23], the authors introduced new bicomplex generalized Tribonacci quaternions, obtained the Binet formula, generating function, and summation formulas, and gave some matrix applications.
Inspired by the articles above, in this study, we first aim to obtain a new generalization of second-order bicomplex numbers and bicomplex quaternion sequences and show that these two concepts are different, despite being defined as the same in many studies.Also, we provide some of their equations, including the Binet formula, generating function, Catalan, Cassini, d'Ocagne's identities, and summation formulas for bicomplex (p, q)-Fibonacci numbers and bicomplex (p, q)-Fibonacci quaternions.Then, we show that the bicomplex (p, q)-Fibonacci quaternion can also be expressed with a new matrix of type 4 × 4, whose elements consist of bicomplex (p, q)-Fibonacci numbers.Finally, we aim to create a special matrix for bicomplex (p, q)-Fibonacci quaternions to obtain some equations about the matrix and the determinant of a special matrix that gives the terms of that quaternion.

Bicomplex (p, q)-Fibonacci Numbers
Here, we obtain a new generalization of the second-order bicomplex numbers.To do this, we describe the bicomplex (p, q)-Fibonacci numbers.We give some equations and summation formulas about the bicomplex (p, q)-Fibonacci number sequence.In addition, we obtain the generating function, Binet's formula, and Catalan, Cassini, and d'Ocagne's identities for these number sequences.Definition 1.The bicomplex (p, q)-Fibonacci numbers are introduced by where F u is the uth (p, q)-Fibonacci number and i, j are bicomplex units that provide (6).
For u ≥ 2, it is given the following identity with a simple calculation: Thus, the characteristic equation of ( 8) is: For any non-negative integers u, v, let BF u (p, q) = F u + iF u+1 + jF u+2 + ijF u+3 and BF v (p, q) = F v + iF v+1 + jF v+2 + ijF v+3 be two bicomplex (p, q)-Fibonacci numbers.The addition, subtraction, and multiplication for them are written as follows: The multiplication of a bicomplex (p, q)-Fibonacci number by the real scalar µ is described as the following: Furthermore, bicomplex (p, q)-Fibonacci numbers have three different conjugations, which can be written as follows: Theorem 1.Let BF u and BF v be two bicomplex (p, q)-Fibonacci numbers.There hold: Proof.By using ( 10)-( 12), these identities can be obtained with simple mathematical calculations.□ Theorem 2. Binet's formula for the bicomplex (p, q)-Fibonacci numbers {BF u (p, q)} is given in the following equation for u ≥ 0 (u is any integer), where τ and ω are roots of (9).
Proof.By using ( 7) and (3), we have the following equation: Thus, Binet's formula for the bicomplex (p, q)-Fibonacci numbers is easily given with some simple computation.□ In the remainder of the study, BF u will be considered the uth bicomplex (p, q)- Fibonacci number.

Theorem 3. The generating function of the bicomplex
Proof.To find the generating function of {BF u }, we will first use the following equation: Using (8) and initial conditions, we have Proof.To find the exponential generating function of {BF u }, we first use the following equation: Using ( 14) and e t = ∑ ∞ u=0 t u u! , the exponential generating function of BF u is obtained: □ Theorem 5.For u ≥ v, the Catalan identity for bicomplex (p, q)-Fibonacci numbers is as follows: where u and v are non-negative integers. Proof.

□
Now, we give some identities about summations of terms in the bicomplex (p, q)- Fibonacci numbers.
Theorem 7.For k, l as natural numbers, the summation formula of bicomplex (p, q)-Fibonacci numbers is Proof.Firstly, we assume that p + q ̸ = 1.In this situation, In addition, we know from ( 13) in [24] that With simple calculations, we obtain Thus, Now, let p + q = 1.We obtain from (13) in [24] that ∑ l k=1 F k = qF l +(l−1)+F 1 1+q . Moreover, we have . Thus, Proof.According to the lemma in [25] for (p, q)-Fibonacci numbers, we know that Using ( 7) and ( 15), Here, we obtain a new generalization of the second-order bicomplex quaternions.To do this, we describe the bicomplex (p, q)-Fibonacci quaternions.We obtain some equations and summation formulas about the bicomplex (p, q)-Fibonacci quaternion sequence.In addition, we give the generating function, Binet's formula, and Catalan, Cassini, and d'Ocagne's identities for these quaternions.
Let BCQF u = K 0 + KandBCQF v = L 0 + L be two bicomplex (p, q)-Fibonacci quater- nions.The addition and subtraction of them are The multiplication of a bicomplex (p, q)-Fibonacci quaternion by the real scalar λ is described as follows: The product of any two bicomplex (p, q)-Fibonacci quaternions BCQF u and BCQF v , such as where K • L and K × L represent the dot product (scalar product) and the cross product (vector product) of K and L, respectively.The conjugate operation in H BCF (p,q) is whereas the bicomplex conjugates are (BF u+2 (p, q)) i e 2 + (BF u+3 (p, q)) i e 3 (BCQF u ) j = S BCQF u j + V BCQF u j = (BF u (p, q)) j + (BF u+1 (p, q)) j e 1 + (BF u+2 (p, q)) j e 2 + (BF u+3 (p, q)) j e 3 The features of quaternion algebra are adapted to bicomplex quaternions as well as to complex quaternions.In this situation, some key properties of bicomplex quaternions change.Because the norm of a real quaternion h = (h 0 , h 1 , h 2 , h 3 ) is defined by ∥h∥ = h , the norm is positive, definite, and real.But when we consider the complex quaternion, the norm is described according to the inner product of the complex quaternion with itself.That is, for a complex quaternion ch = (ch 0 , ch 1 , ch 2 , ch 3 ), the norm of ch can be written as ∥ch∥ Since the components of ch are complex numbers, the norm of ch has a complex value.In [8], a complex Fibonacci quaternion (QCF) is defined, and the norm of a complex Fibonacci quaternion is given as follows: where C n is a complex Fibonacci number.
In addition, we describe the norm of any bicomplex quaternion in terms of the inner product of a bicomplex quaternion with itself, as in the definition of a complex quaternion.Then, for any bicomplex quaternion bch = (bch 0 , bch 1 , bch 2 , bch 3 ), the norm of bch can be written as ∥bch∥ = bch 0 2 + bch 1 2 + bch 2 2 + bch 3 2 .In this situation, the norm of a bicomplex (p, q)-Fibonacci quaternion can be given as follows: Also, we show that there are four different conjugates of the bicomplex (p, q)-Fibonacci quaternion, whereas there are three different conjugates of the bicomplex (p, q)-Fibonacci numbers.Furthermore, we get the following inequalities about four different conjugations of the bicomplex (p, q)-Fibonacci quaternion: Theorem 9. Let BCQF u and BCQF v be two bicomplex (p, q)-Fibonacci quaternions.In that case, we obtain the following inequalities about the four conjugates of them: Proof.Using conjugate operations in H BCQF and ( 16), the above identities can be easily proved.□ The following equation for the elements of BCQF is easily obtained using ( 16): Thus, the characteristic equation of ( 18) is Theorem 10.Binet's formula for the bicomplex (p, q)-Fibonacci quaternions {BCQF u } is given by the following equation for u ≥ 0: δ − ρ where δ and ρ are roots of ( 19) and Proof.By using ( 13) and ( 17), we have the following equation: Thus, Binet's formula for the bicomplex (p, q)-Fibonacci quaternion is easily found with some simple computation.□ Theorem 11.The generating function of the bicomplex (p, q)-Fibonacci quaternions {BCQF u } is determined by Proof.To obtain the generating function of {BCQF u } ∞ u=0 , we use the power series representation of {BCQF u }.
Using (18) and initial conditions, we have The exponential generating function of the bicomplex (p, q)-Fibonacci quater- nions {BCQF u } is Proof.To obtain the exponential generating function of {BCQF u } ∞ u=0 , we use the power series representation of {BCQF u }.
Using ( 20) and e t = ∑ ∞ u=0 t u u! , we have □ Theorem 13.For u ≥ v, the Catalan identity for bicomplex (p, q)-Fibonacci quaternions is as follows: where u and v are positive integers. Proof.

□
If v = 1 in the Catalan identity, the Cassini identity is obtained as follows: Corollary 2. For u ≥ 1, the Cassini identity for bicomplex (p, q)-Fibonacci quaternions is as follows: where u is an integer.
Theorem 14. D'ocagne's identity of bicomplex (p, q)-Fibonacci quaternions for u ≥ v is as follows: . □ Now, we give some identities about summations of terms in the bicomplex (p, q)- Fibonacci quaternions.

□
Theorem 16.For u, v ≥ 0, Proof.Using (15), And, using (17), Matrix Representation of Bicomplex (p, q)-Fibonacci Quaternions and an Application in This Representation for Them Firstly, we will use the matrix that generates {F u (p, q)}, which we define to obtain the N-matrix, which is similar to the definition of the S-matrix defined in [11].We know that By using ( 21), the N-matrix is defined as where F −2 = −p q 2 and F −1 = 1 q .Here, we will define the BCQF N -matrix that we call the bicomplex (p, q)-Fibonacci quaternion matrix as follows: where Using the matrices α, Γ, and ζ, we obtain E 0 2 = I 4 and E 1 2 = E 2 2 = E 3 2 = −I 4 , where I 4 is the 4 × 4 identity matrix.Furthermore, it satisfies the following equations: The bicomplex (p, q)-Fibonacci quaternion BCQF is also expressed by the 4 × 4 matrix with these new matrices.By using the bicomplex (p, q)-Fibonacci number, we can write Theorem 19.For u ≥ 0, the uth term of the bicomplex (p, q)-Fibonacci quaternion sequence with the determinant of a special matrix can be obtained as follows: Proof.For the proof, we use the induction method on u.It is clear that equality holds for u = 0, and 1.Now suppose that equality is true for 2 ≤ k ≤ u.Then, we can verify it for u + 1 as follows: = pBCQF u + q(−1) 2u+2 Thus, the proof is completed.□

Conclusions
Here, we describe the bicomplex (p, q)-Fibonacci numbers and the bicomplex (p, q)- Fibonacci quaternions based on these numbers to show that bicomplex numbers are not defined as bicomplex quaternions.Furthermore, we obtain some of their equations, including the Binet formula, generating function, Catalan, Cassini, and d'Ocagne's identities, and summation formulas for both.
In addition, we describe a matrix that we call an N-matrix of type 4 × 4 for bicomplex (p, q)-Fibonacci quaternions whose terms are bicomplex (p, q)-Fibonacci numbers.Then, we show that the bicomplex (p, q)-Fibonacci quaternions can be expressed as 8 × 8 real matrices.With the help of the new four matrices we define in 4 × 4 type, we obtain { E 0 , E 1 , E 2 , E 3 }, which is used as the basic elements of real quaternions {1, e 1 , e 2 , e 3 }.Also, we show that the bicomplex (p, q)-Fibonacci quaternion can be expressed with a new matrix of type 4 × 4, whose elements consist of bicomplex (p, q)-Fibonacci numbers.Finally, we create a matrix for bicomplex (p, q)-Fibonacci quaternions, and we obtain the determinant of a special matrix that gives the terms of that quaternion.
Consequently, in this study, we present a general form of the second-order bicomplex number sequences and the second-order bicomplex quaternions.We show that these two concepts, defined as the same in many studies, are different.