Next Article in Journal
Spatio-Functional Nadaraya–Watson Estimator of the Expectile Shortfall Regression
Next Article in Special Issue
Generalization of the Fuzzy Fejér–Hadamard Inequalities for Non-Convex Functions over a Rectangle Plane
Previous Article in Journal
Algebraic and Geometric Methods for Construction of Topological Quantum Codes from Lattices
Previous Article in Special Issue
A New Contribution in Fractional Integral Calculus and Inequalities over the Coordinated Fuzzy Codomain
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

New Properties and Matrix Representations on Higher-Order Generalized Fibonacci Quaternions with q-Integer Components

1
Department of Mathematics, Faculty of Science, Zonguldak Bülent Ecevit University, Zonguldak 67100, Türkiye
2
Department of Mathematics, National Kaohsiung Normal University, Kaohsiung 824004, Taiwan
*
Author to whom correspondence should be addressed.
Axioms 2024, 13(10), 677; https://doi.org/10.3390/axioms13100677
Submission received: 16 August 2024 / Revised: 25 September 2024 / Accepted: 27 September 2024 / Published: 30 September 2024
(This article belongs to the Special Issue Theory and Application of Integral Inequalities)

Abstract

:
In this paper, by using q-integers and higher-order generalized Fibonacci numbers, we define the higher-order generalized Fibonacci quaternions with q-integer components. We give some special cases of these newly established quaternions. This article examines q-calculus and quaternions together. We obtain a Binet-like formula, some new identities, a generating function, a recurrence relation, an exponential generating function, and sum properties of quaternions with quantum integer coefficients. In addition, we obtain some new identities for these types of quaternions by using three new special matrices.

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
p = p 0 + p 1 i + p 2 j + p 3 k ,
where p 0 , p 1 , p 2 , p 3 are real numbers, and 1 ,   i ,   j ,   k are the standard orthonormal basis in R 4 which satisfy the quaternion multiplication rules as follows:
i 2 = j 2 = k 2 = ijk = 1 ,
ij = k = ji , jk = i = kj , ki = j = ik .
The norm of a quaternion p as in Equation (1) is defined by
p 2 = p 0 2 + p 1 2 + p 2 2 + p 3 2 .
If we write p = p 0 + u , where u = p 1 i + p 2 j + p 3 k , then the conjugate of the quaternion p is denoted by p ¯ = p 0 p 1 i p 2 j p 3 k . 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
Q F n = F n + F n + 1 i + F n + 2 j + F n + 3 k ,
where F n is the n-th Fibonacci number defined by
F n = F n 1 + F n 2 ,
for n 2 , with the initial values F 0 = 0 , F 1 = 1 . The Binet formula for the Fibonacci sequence is
F n = α n β n 5 ,
where α = 1 + 5 2 and β = 1 5 2 . Also, the Binet formula of the Q F n is as follows:
Q F n = α ̲ α n β ̲ β n 5 ,
where
α ̲ = 1 + α i + α 2 j + α 3 k , β ̲ = 1 + β i + β 2 j + β k .
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 F s , are defined for any integer s 1 as follows:
F n s = F n s F s = ( α s ) n ( β s ) n α s β s .
Considering the divisibility of F n s by F s , it can be inferred that the ratio F n s F s is an integer. Consequently, all higher-order Fibonacci numbers, specifically F n s , are integer. When s = 1 , the higher-order Fibonacci number F n 1 becomes an ordinary Fibonacci number. The initial few values of the higher-order Fibonacci numbers F n s are
  • 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 , .
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 ( q 1 ) , and is defined as the following:
n q = 1 q n 1 q = 1 + q + q 2 + + q n 1
for n N and q R 1 . Certain properties of q-numbers, including the q-addition formula, the q-subtraction formula, and the q-product formula are as follows:
n q = q n n q ,
n + m q = m q + q m n q ,
n m q = n q q n m m q ,
and
n m q = n q m m q .
where n q m = 1 q m n 1 q m . By using the definition of the q-integer, the following identity holds:
n + 2 q s = 1 + q s n + 1 q s q s n q s .
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 q -Integer Components

In this section, we introduce the concept of higher-order generalized Fibonacci quaternions with q-integer components.
Definition 1.
Let n , s Z (the set of integers), p R , and q R 1 . The higher-order generalized Fibonacci quaternions with q-integer components are defined by
G n s p , q = p s n 1 n s q s q + p s n n + 1 s q s q i + p s n + 1 n + 2 s q s q j + p s n + 2 n + 3 s q s q k
or simply,
G n s p , q = p s n 1 n q s + p s n n + 1 q s i + p s n + 1 n + 2 q s j + p s n + 2 n + 3 q s k .
In fact, G n s p , q contains many important quaternions as special cases:
1.
For s = 1 , Equation (10) becomes the q-Fibonacci-type quaternion [22].
2.
For p = k + k 2 + 4 2 , q = 1 p 2 , Equation (10) becomes the higher-order k-Fibonacci quaternion.
3.
For p = 1 + 5 2 , q = 1 p 2 , Equation (10) becomes the higher-order Fibonacci quaternion [14].
4.
For p = 1 + 5 2 , q = 1 p 2 , s = 1 , Equation (10) becomes the Fibonacci quaternion [5].
5.
For p = k + k 2 + 8 2 , q = 2 p 2 , Equation (10) becomes the higher-order k-Jacobsthal quaternion.
6.
For p = 2 , q = 1 2 , Equation (10) becomes the higher-order Jacobsthal quaternion [23].
7.
For p = 2 , q = 1 2 , s = 1 , Equation (10) becomes the Jacobsthal quaternion.
8.
For p = 1 + 1 + k , q = k p 2 , Equation (10) becomes the higher-order k-Pell quaternion.
9.
For p = 1 + 2 , q = 1 p 2 , Equation (10) becomes the higher-order Pell quaternion [24].
10.
For p = 1 + 2 , q = 1 p 2 , s = 1 , Equation (10) becomes the Pell quaternion [25].
We note that the following identities hold:
G n s p , q + G n s p , q ¯ = 2 p s n 1 n q s
and
G n s p , q 2 = G n s p , q G n s p , q ¯ + 2 p s n 1 n q s G n s p , q .
Theorem 1.
For n , s Z , p R , and q R 1 . The Binet-like formula of G n s p , q can be expressed by
G n s p , q = p s n 1 Θ q s n Υ 1 q s ,
where
Θ = 1 + p s i + p 2 s j + p 3 s k
and
Υ = 1 + p q s i + p q 2 s j + p q 3 s k .
Proof. 
By using Equation (10), we obtain
G n s p , q = p s n 1 n q s + p s n n + 1 q s i + p s n + 1 n + 2 q s j + p s n + 2 n + 3 q s k = p s n 1 1 q s 1 q s n + p s 1 q s n + 1 i + p 2 s 1 q s n + 2 j + p 3 s 1 q s n + 3 k = p s n 1 1 q s 1 + p s i + p 2 s j + p 3 s k q s n p s q s n + 1 i p 2 s q s n + 2 j p 3 s q s n + 3 k = p s n 1 1 q s 1 + p s i + p 2 s j + p 3 s k q s n 1 + p q s i + p q 2 s j + p q 3 s k = p s n 1 Θ q s n Υ 1 q s .
The proof is completed. □
Applying the Binet-like formula of G n s p , q (i.e., Theorem 1), we obtain the following result.
Proposition 1.
The following new equalities for G n s p , q hold true:
(1) 
G n s p , q = p 2 q s G n s p , q ,
(2) 
G n s p , q = p 2 s n 1 q s Θ q s n Υ Θ q s n Υ G n s p , q ,
(3) 
G n s p , q = p 2 s n Θ q s n Υ Θ q s n Υ G n s p , q .
Proof. 
Applying Theorem 1, we have
p 2 s q s G n s p , q = p 2 s q s p s n 1 Θ q s n Υ 1 q s = p 2 s q s p s n 1 Θ q s n Υ q s 1 q s = p s n + 1 Θ q s n Υ 1 q s = p s n 1 Θ q s n Υ 1 q s = G n s p , q .
Hence, (1) is proved. Applying Theorem 1, we have
G n s p , q G n s p , q = p s n 1 Θ q s n Υ 1 q s p s n 1 Θ q s n Υ 1 q s = p 2 s n 1 Θ q s n Υ 1 q s 1 q s Θ q s n Υ = p 2 s n 1 q s Θ q s n Υ Θ q s n Υ ,
which implies the assertion (2). Finally, let us verify Equation (3). Applying Theorem 1, we have
G n s p , q G n s p , q = p s n 1 Θ q s n Υ 1 q s p s n 1 Θ q s n Υ 1 q s = p 2 s n Θ q s n Υ Θ q s n Υ .
The proof is completed. □
Theorem 2.
For m , s Z , n N { 0 } , p R and q R 1 , the generating function of G m + n s p , q is
n = 0 G m + n s p , q t n = p s m 1 1 q s Θ q s m Υ ( p q ) s Θ q s ( m 1 ) Υ t 1 p s 1 + q s t + p 2 q s t 2 .
Proof. 
Employing Theorem 1, we obtain
n = 0 G m + n s p , q t n = n = 0 p s m + n 1 Θ q s m + n Υ 1 q s t n = p s m 1 1 q s Θ n = 0 p s t n q s m Υ n = 0 p q s t n = p s m 1 1 q s Θ 1 1 p s t q s m Υ 1 1 p q s t = p s m 1 1 q s Θ Θ p q s t q s m Υ + q s m Υ p s t 1 p s t 1 p q s t = p s m 1 1 q s Θ q s m Υ ( p q ) s Θ q s ( m 1 ) Υ t 1 p s 1 + q s t + p 2 q s t 2 .
The required proof is completed. □
When taking m = 0 in Equation (12), we can derive the following conclusion immediately.
Corollary 1.
For n N { 0 } , s Z , p R and q R 1 , the generating function of G n s p , q is
n = 0 G n s p , q t n = 1 p s 1 q s Θ Υ p s q s Θ Υ t 1 p s 1 + q s t + p 2 q s t 2 .
Theorem 3.
For n N { 0 } , s Z , p R and q R 1 , the exponential generating function of G n s p , q is
n = 0 G n s p , q t n n ! = Θ e p s t Υ e p q s t p s 1 q s .
Proof. 
Thanks to Equation (11), we obtain
n = 0 G n s p , q t n n ! = n = 0 p s n 1 Θ q s n Υ 1 q s t n n ! = 1 p s 1 q s Θ n = 0 p s n t n n ! Υ n = 0 p s n q s n t n n ! = Θ e p s t Υ e p q s t p s 1 q s .
The proof is completed. □
Theorem 4.
For n , s Z , p R and q R 1 , the recurrence relation for G n s p , q is as follows:
G n + 1 s p , q = p s 1 + q s G n s p , q p 2 q s G n 1 s p , q .
Proof. 
Utilizing Theorem 1 leads to
G n + 1 s p , q = p s n Θ q s n + 1 Υ 1 q s = p s n 1 p s Θ q s n Υ + q s n Υ q s n + 1 Υ 1 q s = p s p s n 1 Θ q s n Υ 1 q s + p s n 1 p s q s n Υ q s n + 1 Υ 1 q s = p s G n s p , q + p s n 2 p 2 s q s Θ q s n + 1 Υ q s Θ + q s q s n 1 Υ 1 q s = p s G n s p , q + p s n 2 p s q s Θ q s n Υ Θ + q s n 1 Υ 1 q s = p s G n s p , q + q s p s n 1 Θ q s n Υ 1 q s p s q s p s n 2 Θ q s n 1 Υ 1 q s = p s 1 + q s G n s p , q p 2 q s G n 1 s p , q .
The proof of Theorem 4 is thus completed. □
We now establish the following identities for G n s p , q .
Theorem 5.
For k , n , r , s Z , p R and q R 1 , we have
G n + r s p , q G n + k s p , q G n s p , q G n + r + k s p , q = p s 2 n + r + k q s r 1 q s n p 2 s 1 q s 2 q s k Θ Υ Υ Θ .
Proof. 
By using Theorem 1, we obtain
G n + r s p , q G n + k s p , q G n s p , q G n + r + k s p , q = p s n + r 1 Θ q s n + r Υ 1 q s p s n + k 1 Θ q s n + k Υ 1 q s p s n 1 Θ q s n Υ 1 q s p s n + r + k 1 Θ q s n + r + k Υ 1 q s = 1 1 q s 2 p s 2 n + r + k 2 Θ q s n + r Υ Θ q s n + k Υ p s 2 n + r + k 2 Θ q s n Υ Θ q s n + r + k Υ = p s 2 n + r + k 2 1 q s 2 Θ 2 Θ q s n + k Υ q s n + r Υ Θ + q s n + r Υ q s n + k Υ Θ 2 + Θ q s n + r + k Υ + q s n Υ Θ q s n Υ q s n + r + k Υ = p s 2 n + r + k 2 1 q s 2 q s n + r + k q s n + k Θ Υ + q s n q s n + r Υ Θ = p s 2 n + r + k 2 q s r 1 q s n 1 q s 2 q s k Θ Υ Υ Θ .
The proof is completed. □
Remark 1.
As applications of Theorem 5, we have the following results:
(1) 
When taking k r in Equation (13), we obtain
G n + r s p , q G n r s p , q G n s p , q 2 = p 2 s n q s r 1 q s n p 2 s 1 q s 2 q s r Θ Υ Υ Θ .
(2) 
When taking k 1 and r 1 in Equation (13), we have
G n + 1 s p , q G n 1 s p , q G n s p , q 2 = p 2 s n q s 1 q s n p 2 s 1 q s 2 q s Θ Υ Υ Θ .
(3) 
When taking k 1 and n + r m in Equation (13), we obtain
G m s p , q G n + 1 s p , q G n s p , q G m + 1 s p , q = p s n + m + 1 q s m n 1 q s n p 2 s 1 q s 2 q s Θ Υ Υ Θ .
Theorem 6.
For m , n , s Z , p R and q R 1 , we have
G n s p , q G m s p , q + G n + 1 s p , q G m + 1 s p , q = p s n + m 1 q s 2 1 + p 2 s Θ 2 + q n + m p 2 s + q 2 s Υ 2 q s + p 2 s q s m Θ Υ + q s n Υ Θ .
Proof. 
By virtue of Theorem 1, we conclude
G n s p , q G m s p , q + G n + 1 s p , q G m + 1 s p , q = p s n 1 Θ q s n Υ 1 q s p s m 1 Θ q s m Υ 1 q s + p s n Θ q s n + 1 Υ 1 q s p s m Θ q s m + 1 Υ 1 q s = 1 1 q s 2 p s n + m 2 Θ 2 Θ q s m Υ q s n Υ Θ + q s n Υ q s m Υ + p s n + m Θ 2 Θ q s m + 1 Υ q s n + 1 Υ Θ + q s n + 1 Υ q s m + 1 Υ = p s n + m 1 q s 2 1 + p 2 s Θ 2 q s m q s + p 2 s Θ Υ q s n q s + p 2 s Υ Θ + q n + m p 2 s + q 2 s Υ 2 = p s n + m 1 q s 2 1 + p 2 s Θ 2 + q n + m p 2 s + q 2 s Υ 2 q s + p 2 s q s m Θ Υ + q s n Υ Θ .
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 p = k + k 2 + 4 2 , q = 1 p 2 and s = 1 in Equation (14), we obtain
Q F k , n r Q F k , n + r Q F k , n 2 = 1 n r + 1 2 F k , r Q F k , r k 2 + 2 F k , 2 r k ,
where n r 1 .
Example 2 
([27]). When taking p = 1 + 5 2 , q = 1 p 2 , and s = 1 in Equation (15), we obtain
Q F n 1 Q F n + 1 Q F n 2 = 1 n 2 Q F 1 3 k .
Theorem 7.
Let n , s Z , p R and q R 1 . If p 2 q = t , then the linearization of G n s p , q can be represented as
p s G n s p , q + t s G n 1 s p , q = p s n Θ .
Proof. 
Applying Theorem 1 yields
G n s p , q p q s G n 1 s p , q = p s n 1 Θ q s n Υ 1 q s p q s p s n 2 Θ q s n 1 Υ 1 q s = p s n 1 Θ p s n 1 q s n Υ p s n 1 q s Θ + p s n 1 q s n Υ 1 q s = p s n 1 Θ .
Multiplying both sides of the above equation by p s , we obtain the linearization of G n s p , q as
p s G n s p , q p 2 q s G n 1 s p , q = p s n Θ ,
or equivalence
p s G n s p , q t s G n 1 s p , q = p s n Θ .
The proof is completed. □
Here, we give an example illustrating Theorem 7.
Example 3.
Let p = k + k 2 + 4 2 .
(1) 
For q : = 1 p 2 , we have p 2 q = 1 . Making use of Theorem 7 yields
p s G n s p , p 2 + 1 s + 1 G n 1 s p , p 2 = p s n Θ .
(2) 
For q : = 2 p 2 , we have p 2 q = 2 . Making use of Theorem 7 yields
p s G n s p , 2 p 2 2 s G n 1 s p , 2 p 2 = p s n Θ .
Theorem 8.
The following summation formulas for G n s p , q hold true:
n = 1 m G n s p , q = 1 1 q s Θ 1 p m 1 p q s Υ 1 p q m 1 p q ,
n = 1 m G 2 n s p , q = p s 1 q s Θ 1 p 2 s m 1 p 2 s q 2 s Υ 1 p q 2 s m 1 p q 2 s ,
n = 1 m G 2 n 1 s p , q = 1 1 q s Θ 1 p 2 s m 1 p 2 s q s Υ 1 p q 2 s m 1 p q 2 s .
Proof. 
Applying Theorem 1, we have
n = 1 m G n s p , q = n = 1 m p s n 1 Θ q s n Υ 1 q s = 1 1 q s Θ q s Υ + p s Θ q 2 s Υ + p 2 s Θ q 3 s Υ + + p s m 2 Θ q s m 1 Υ + p s m 1 Θ q s m Υ = 1 1 q s Θ 1 + p s + p 2 s + + p s m 2 + p s m 1 q s Υ 1 + p q s + p q 2 s + + p q s m 2 + p q s m 1 = 1 1 q s Θ 1 p m 1 p q s Υ 1 p q m 1 p q .
This shows Equation (17). Equations (18) and (19) can be proved similarly. □
Theorem 9.
Let k , l , m N , p R , q R 1 and χ = p s 1 q s .
(1) 
If m is even, then
l = 0 m m l p 2 s q s m l G 2 l + k s p , q = G k + m s p , q χ m .
(2) 
If m is odd, then
l = 0 m m l p 2 s q s m l G 2 l + k s p , q = p s m + k χ m 1 Θ + q s k + m Υ .
Proof. 
Applying Theorem 1, we derive
l = 0 m m l p 2 s q s m l G 2 l + k s p , q = l = 0 m m l p 2 s q s m l p s 2 l + k 1 Θ q s 2 l + k Υ 1 q s = 1 1 q s Θ l = 0 m m l p 2 s q s m l p s 2 l + k 1 Υ l = 0 m m l p 2 s q s m l p s 2 l + k 1 q s 2 l + k = p s k 1 1 q s Θ l = 0 m m l p 2 s q s m l p 2 s l q s k Υ l = 0 m m l p 2 s q s m l p 2 s q 2 s l = p s k 1 1 q s Θ p 2 s p 2 s q s m q s k Υ p 2 s q 2 s p 2 s q s m = p s 2 m + k 1 1 q s Θ 1 q s m q s k + m Υ q s 1 m .
(1) If m is even, then
l = 0 m m l p 2 s q s m l G 2 l + k s p , q = p s 2 m + k 1 1 q s Θ 1 q s m q s k + m Υ 1 q s m = p s 2 m + k 1 1 q s m 1 q s Θ q s k + m Υ = p s m + k 1 Θ q s k + m Υ 1 q s p s m 1 q s m = G k + m s p , q χ m .
(2) If m is odd, then
l = 0 m m l p 2 s q s m l G 2 l + k s p , q = p s 2 m + k 1 1 q s Θ 1 q s m + q s k + m Υ 1 q s m = p s 2 m + k 1 1 q s m 1 Θ + q s k + m Υ = p s m + k χ m 1 Θ + q s k + m Υ .
The proof is thus completed. □
Theorem 10.
Let k , l , m N , p R and q R 1 . Then, we have
l = 0 m m l 1 l p 2 s q s m l G 2 l + k s p , q = G k + m s p , q p s 1 + q s m
and
l = 0 m m l p s 1 + q s l p 2 s q s m l G l s p , q = G 2 m s p , q .
Proof. 
Thanks to Theorem 1, we deduce
l = 0 m m l 1 l p 2 s q s m l G 2 l + k s p , q = l = 0 m m l 1 l p 2 s q s m l p s 2 l + k 1 Θ q s 2 l + k Υ 1 q s = p s k 1 1 q s Θ l = 0 m m l p 2 s q s m l p 2 s l q s k Υ l = 0 m m l p 2 s q s m l p 2 s q 2 s l = p s k 1 1 q s Θ p 2 s p 2 s q s m q s k Υ p 2 s q 2 s p 2 s q s m = p s k 1 1 q s Θ p 2 s 1 + q s m q s k Υ p 2 s q s q s + 1 m = p s k 1 1 q s Θ q s k + m Υ p s m p s 1 + q s m = p s k + m 1 1 q s Θ q s k + m Υ p s 1 + q s m = G k + m s p , q p s 1 + q s m .
This shows Equation (22). Similarly, by Theorem 1 again, we obtain
l = 0 m m l p s 1 + q s l p 2 s q s m l G l s p , q = l = 0 m m l p s 1 + q s l p 2 s q s m l p s l 1 Θ q s l Υ 1 q s = 1 1 q s Θ l = 0 m m l p s 1 + q s l p 2 s q s m l p s l 1 Υ l = 0 m m l p s 1 + q s l p 2 s q s m l p s l 1 q s l = p s 1 q s Θ l = 0 m m l p 2 s 1 + q s l p 2 s q s m l Υ l = 0 m m l p 2 s q s 1 + q s l p 2 s q s m l = p s 1 q s Θ p 2 s 1 + q s p 2 s q s m Υ p 2 s q s 1 + q s p 2 s q s m = p s 2 m 1 1 q s Θ Υ q 2 s m = G 2 m s p , q .
Hence, Equation (23) holds. The proof is completed. □
Theorem 11.
Let k , l , m N , p R , q R 1 and χ = p s 1 q s .
(1) 
If m is even, then
l = 0 m m 2 l p 2 s q s m l G 4 l s p , q = G m s p , q 2 χ m + p s 1 + q s m .
(2) 
If m is odd, then
l = 0 m m 2 l p 2 s q s m l G 4 l s p , q = 1 2 p s m χ m 1 Θ + q s m Υ G m s p , q p s 1 + q s m .
Proof. 
By using Theorem 1, we obtain
l = 0 m m 2 l p 2 s q s m l G 4 l s p , q = 1 2 l = 0 m m l 1 + 1 l p 2 s q s m l G 2 l s p , q = 1 2 l = 0 m m l p 2 s q s m l G 2 l s p , q + l = 0 m m l 1 l p 2 s q s m l G 2 l s p , q .
(1)
If m is even, then, from (20) and (22), we obtain
l = 0 m m 2 l p 2 s q s m l G 4 l s p , q = 1 2 G m s p , q χ m + G m s p , q p s 1 + q s m
= G m s p , q 2 χ m + p s 1 + q s m .
(2)
If m is odd, then a direct calculation provides
l = 0 m m 2 l p 2 s q s m l G 4 l s p , q = 1 2 p s m χ m 1 Θ + q s m Υ G m s p , q p s 1 + q s m .
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 k , l , m N , p R , q R 1 , and χ = p s 1 q s .
(1) 
If m is even, then
l = 0 m m 2 l p 2 s q s m l G 4 l + 1 s p , q = G m + 1 s p , q 2 χ m + p s 1 + q s m .
(2) 
If m is odd, then
l = 0 m m 2 l p 2 s q s m l G 4 l + 1 s p , q = 1 2 p s m + 1 χ m 1 Θ + q s 1 + m Υ G m + 1 s p , q p s 1 + q s m .

3. New Matrix Representations and Formulas for G n s p , q

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:
A n , p , q ( s ) = G n + 1 s p , q G n s p , q G n s p , q G n 1 s p , q ,
B p , q ( s ) = p s 1 + q s p 2 q s 1 0 ,
C n , p , q ( s ) = p s n n + 1 q s p s n 1 n q s p s n 1 n q s p s n 2 n 1 q s .
More precisely, we will study on A n , p , q ( s ) , B p , q ( s ) , C n , p , q ( s ) matrices whose entries are higher-order generalized Fibonacci quaternions with quantum integer components G n s p , q , coefficients of recurrence relation of G n s p , q and coefficients of the G n s p , q , respectively.
The following matrix formulas are crucial in this section.
Theorem 13.
For n N , we have
B p , q ( s ) n = p s n n + 1 q s p s n q s n q s p s ( n 1 ) n q s p s n 1 q s n 1 q s .
Proof. 
The proof will be by mathematical induction on n. Clearly, Equation (31) is true for n = 1 . Suppose that Equation (31) is true for n = k . By using Equation (8) and applying the induction hypothesis, we have
B p , q ( s ) k + 1 = p s 1 + q s p 2 q s 1 0 p s 1 + q s p 2 q s 1 0 k = p s 1 + q s p 2 q s 1 0 p s k k + 1 q s p s k q s k q s p s k 1 k q s p s k 1 q s k 1 q s = p s k + 1 1 + q s k + 1 q s q s k q s p s k + 1 q s 1 + q s k q s + q s k 1 q s p s k k + 1 q s p s k q s k q s = p s k + 1 k + 2 q s p s k + 1 q s k + 1 q s p s k k + 1 q s p s k q s k q s .
Therefore, (31) is also true for n = k + 1 . This completes the induction, and hence our conclusion is proved. □
Theorem 14.
Let n N . Then, the following formulas hold:
A n , p , q ( s ) = B p , q ( s ) A n 1 , p , q ( s )
and
C n , p , q ( s ) = B p , q ( s ) C n 1 , p , q ( s ) .
Moreover, we have
A n , p , q ( s ) = B p , q ( s ) n A 0 , p , q ( s )
and
C n , p , q ( s ) = B p , q ( s ) n C 0 , p , q ( s ) .
Proof. 
From Theorem 4, by using matrix multiplication, we obtain
B p , q ( s ) A n 1 , p , q ( s ) = p s 1 + q s p 2 q s 1 0 G n s p , q G n 1 s p , q G n 1 s p , q G n 2 s p , q = p s 1 + q s G n s p , q p 2 q s G n 1 s p , q p s 1 + q s G n 1 s p , q p 2 q s G n 2 s p , q G n s G n 1 s = G n + 1 s p , q G n s p , q G n s p , q G n 1 s p , q = A n , p , q ( s ) .
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 G n s p , q .
Theorem 15.
Let n N . Then, the following formulas hold:
G n + 1 s p , q G n 1 s p , q G n s p , q 2 = p 2 q s n p 2 s 1 q s 2 1 p 4 s Θ 2 + Υ 2 q s p 4 s Θ Υ q s p 4 s Υ Θ ,
G n 1 s p , q G n + 1 s p , q G n s p , q 2 = p 2 q s n p 2 s 1 q s 2 1 p 4 s Θ 2 + Υ 2 q s p 4 s Θ Υ q s p 4 s Υ Θ .
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
G n + 1 s p , q G n s p , q G n s p , q G n 1 s p , q = p s 1 + q s p 2 q s 1 0 n G 1 s p , q G 0 s p , q G 0 s p , q G 1 s p , q
We now show (36) holds. Since
p 2 q s n G 1 s p , q G 1 s p , q G 0 s p , q 2 = p 2 q s n 1 q s 2 p 0 Θ q s Υ p 2 s Θ q s Υ p s Θ q 0 Υ 2 = p 2 q s n 1 q s 2 p 2 s Θ q s Υ Θ q s Υ p 2 s Θ Υ 2 = p 2 q s n p 2 s 1 q s 2 Θ 2 q s Θ Υ q s Υ Θ + Υ 2 p 4 s Θ 2 + p 4 s Θ Υ + p 4 s Υ Θ p 4 s Υ 2 = p 2 q s n p 2 s 1 q s 2 Θ 2 p 4 s Θ 2 + Υ 2 p 4 s Υ 2 q s Θ Υ + p 4 s Θ Υ q s Υ Θ + p 4 s Υ Θ = p 2 q s n p 2 s 1 q s 2 1 p 4 s Θ 2 + 1 p 4 s Υ 2 q s p 4 s Θ Υ q s p 4 s Υ Θ = p 2 q s n p 2 s 1 q s 2 1 p 4 s Θ 2 + Υ 2 q s p 4 s Θ Υ q s p 4 s Υ Θ ,
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 m , n , r , t N . If m + n = r + t , then
p s m 1 m q s G n s p , q p s r 1 r q s G t s p , q = p s m 1 q s m 1 q s G n 1 s p , q p s r 1 q s r 1 q s G t 1 s p , q .
Proof. 
Based on Equations (32) and (34), we obtain
B p , q ( s ) m A n , p , q ( s ) = B p , q ( s ) m B p , q ( s ) n A 0 , p , q ( s ) = B p , q ( s ) m + n A 0 , p , q ( s ) = B p , q ( s ) r + t A 0 , p , q ( s ) = B p , q ( s ) r A t , p , q ( s ) .
By using the matrix multiplication, we conclude that B p , q ( s ) m A n , p , q ( s ) equals
p s m m + 1 q s G n + 1 s p , q q s m q s G n s p , q p s m m + 1 q s G n s p , q q s m q s G n 1 s p , q p s m 1 m q s G n + 1 s p , q q s m 1 q s G n s p , q p s m 1 m q s G n s p , q q s m 1 q s G n 1 s p , q .
Similarly, B p , q ( s ) r A t , p , q ( s ) equals
p s r r + 1 q s G t + 1 s p , q q s r q s G t s p , q p s r r + 1 q s G t s p , q q s r q s G t 1 s p , q p s r 1 r q s G t + 1 s p , q q s r 1 q s G t s p , q p s r 1 r q s G t s p , q q s r 1 q s G t 1 s p , q .
Since B p , q ( s ) m A n , p , q ( s ) = B p , q ( s ) r A t , p , q ( s ) , we acquire
p s m 1 m q s G n s p , q q s m 1 q s G n 1 s p , q = p s r 1 r q s G t s p , q q s r 1 q s G t 1 s p , q ,
which implies
p s m 1 m q s G n s p , q p s r 1 r q s G t s p , q = p s m 1 q s m 1 q s G n 1 s p , q p s r 1 q s r 1 q s G t 1 s p , q .
The proof is completed. □
Theorem 17.
For n , m N , we have
G n + m s p , q = p s n n + 1 q s G m s p , q p s n + 1 q s n q s G m 1 s p , q .
Proof. 
Thanks to Equations (34) and (35), we obtain
A n + m , p , q ( s ) = B p , q ( s ) n + m A 0 , p , q ( s ) = B p , q ( s ) n B p , q ( s ) m A 0 , p , q ( s ) = B p , q ( s ) n A m , p , q ( s )
and
B p , q ( s ) n = C n , p , q ( s ) C 0 , p , q ( s ) 1 .
By (28), we have
A n + m , p , q ( s ) = G n + m + 1 s p , q G n + m s p , q G n + m s p , q G n + m 1 s p , q .
On the other hand, we acquire
A n + m , p , q ( s ) = C n , p , q ( s ) C 0 , p , q ( s ) 1 A m , p , q ( s ) = C n , p , q ( s ) 1 q s p s 0 q s p s 0 q s p 2 s 1 q s 1 G m + 1 s p , q G m s p , q G m s p , q G m 1 s p , q = C n , p , q ( s ) 1 0 0 p 2 s q s G m + 1 s p , q G m s p , q G m s p , q G m 1 s p , q = p s n n + 1 q s p s n 1 n q s p s n 1 n q s p s n 2 n 1 q s G m + 1 s p , q G m s p , q p 2 s q s G m s p , q p 2 s q s G m 1 s p , q .
Comparing the above two formulas, we can conclude
G n + m s p , q = p s n n + 1 q s G m s p , q p s n + 1 q s n q s G m 1 s p , q .
The proof is completed. □

4. Conclusions

In this paper, we have examined a different generalization of Fibonacci quaternions, which not only provides some already existing families of Fibonacci-type quaternions in the literature but also some new families of Fibonacci-type quaternions according to the values of parameters s, p, and q. In the last section, we have achieved some identities for higher-order generalized q-Fibonacci quaternions with integer components by using some matrices of special type. Therefore, our new results generalize and improve several results available in the corresponding literature and will assist us in obtaining novel new families of Fibonacci-type quaternions as well as their proof techniques in future research.

Author Contributions

Writing—original draft, C.K., W.-S.D., N.T. and R.-C.C.; writing—review and editing, C.K., W.-S.D., N.T. and R.-C.C. All authors contributed equally to the manuscript and read and approved the final version of the manuscript.

Funding

Wei-Shih Du is partially supported by Grant No. NSTC 113-2115-M-017-004 of the National Science and Technology Council of the Republic of China.

Data Availability Statement

Data sharing is not applicable to this article as no new data were created or analyzed in this study.

Acknowledgments

The authors wish to express their sincere thanks to the anonymous referees for their valuable suggestions and comments.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Hamilton, W.R. Elements of Quaternions; Longman, Green, & Company: London, UK, 1866. [Google Scholar]
  2. Rodman, L. Topics in Quaternion Linear Algebra; Princeton University Press: Princeton, NJ, USA, 2014. [Google Scholar]
  3. Vince, J. Quaternions for Computer Graphics; Springer: London, UK, 2011. [Google Scholar]
  4. Tan, E.; Leung, H.-H. Some results on Horadam quaternions. Chaos Solitons Fractals 2020, 138, 109961. [Google Scholar] [CrossRef]
  5. Horadam, A.F. Complex Fibonacci numbers and Fibonacci quaternions. Am. Math. Mon. 1963, 70, 289–291. [Google Scholar] [CrossRef]
  6. Halici, S. On Fibonacci quaternions. Adv. Appl. Clifford Algebr. 2012, 22, 321–327. [Google Scholar] [CrossRef]
  7. Halici, S. On complex Fibonacci quaternions. Adv. Appl. Clifford Algebr. 2013, 23, 105–112. [Google Scholar] [CrossRef]
  8. Horadam, A.F. Quaternion recurrence relations. Ulam Q. 1993, 2, 23–33. [Google Scholar]
  9. Iyer, M.R. A note on Fibonacci quaternions. Fibonacci Quart. 1969, 7, 225–229. [Google Scholar]
  10. Polatli, E.; Kesim, S. On quaternions with generalized Fibonacci and Lucas number components. Adv. Differ. Eq. 2015, 2015, 169. [Google Scholar] [CrossRef]
  11. Polatli, E. A generalization of Fibonacci and Lucas Quaternions. Adv. Appl. Clifford Algebr. 2016, 26, 719–730. [Google Scholar] [CrossRef]
  12. Halici, S.; Karataş, A. On a generalization for quaternion sequences. Chaos Solitons Fractals 2017, 98, 178–182. [Google Scholar] [CrossRef]
  13. Kizilates, C.; Kone, T. On higher order Fibonacci quaternions. J. Anal. 2021, 29, 1071–1082. [Google Scholar] [CrossRef]
  14. Kizilates, C.; Kone, T. On higher order Fibonacci hyper complex numbers. Chaos Solitons Fractals 2021, 148, 111044. [Google Scholar] [CrossRef]
  15. Kizilates, C. On quaternions with incomplete Fibonacci and Lucas Components. Util. Math. 2019, 110, 263–269. [Google Scholar]
  16. Terzioğlu, N.; Kızılateş, C.; Du, W.-S. New Properties and Identities for Fibonacci Finite Operator Quaternions. Mathematics 2022, 10, 1719. [Google Scholar] [CrossRef]
  17. Kızılateş, C.; Kibar, İ.Y. On 3-parameter quaternions with higher order generalized Fibonacci numbers components. J. Anal. 2024, 32, 1819–1832. [Google Scholar] [CrossRef]
  18. Özvatan, M. Generalized golden-Fibonacci Calculus and Applications. Master’s Thesis, Izmir Institute of Technology, Izmir, Türkiye, 2018. [Google Scholar]
  19. Pashaev, O.K. Quantum calculus of Fibonacci divisors and infinite hierarchy of bosonic-fermionic golden quantum oscillators. Internat. J. Geom. Methods Modern Phys. 2021, 18, 32. [Google Scholar] [CrossRef]
  20. Jackson, F.H. On q-functions and a certain difference operator. Earth Environ. Sci. Trans. Roy. Soc. Edin. 1909, 46, 253–281. [Google Scholar] [CrossRef]
  21. Kac, V.; Cheung, P. Quantum Calculus Universitext; Springer: New York, NY, USA, 2002. [Google Scholar]
  22. Akkus, I.; Kizilaslan, G. Quaternions: Quantum calculus approach with applications. Kuwait J. Sci. 2019, 46, 1–13. [Google Scholar]
  23. Özkan, E.; Uysal, M. On quaternions with higher order Jacobsthal numbers components. Gazi Univ. J. Sci. 2022, 36, 336–347. [Google Scholar] [CrossRef]
  24. Özimamoğlu, H. On hyper complex numbers with higher order Pell numbers components. J. Anal. 2023, 31, 2443–2457. [Google Scholar] [CrossRef]
  25. Çimen, C.B.; İpek, A. On Pell Quaternions and Pell-Lucas Quaternions. Adv. Appl. Clifford Algebras 2016, 26, 39–51. [Google Scholar] [CrossRef]
  26. Polatli, E.; Kesim, S. A note on Catalan’s identity for the k-Fibonacci Quaternions. J. Integer Seq. 2015, 18, 1–4. [Google Scholar]
  27. Iyer, M.R. Some results on Fibonacci quaternions. Fibonacci Quart. 1969, 7, 201–210. [Google Scholar]
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.; Chen, R.-C. New Properties and Matrix Representations on Higher-Order Generalized Fibonacci Quaternions with q-Integer Components. Axioms 2024, 13, 677. https://doi.org/10.3390/axioms13100677

AMA Style

Kızılateş C, Du W-S, Terzioğlu N, Chen R-C. New Properties and Matrix Representations on Higher-Order Generalized Fibonacci Quaternions with q-Integer Components. Axioms. 2024; 13(10):677. https://doi.org/10.3390/axioms13100677

Chicago/Turabian Style

Kızılateş, Can, Wei-Shih Du, Nazlıhan Terzioğlu, and Ren-Chuen Chen. 2024. "New Properties and Matrix Representations on Higher-Order Generalized Fibonacci Quaternions with q-Integer Components" Axioms 13, no. 10: 677. https://doi.org/10.3390/axioms13100677

APA Style

Kızılateş, C., Du, W. -S., Terzioğlu, N., & Chen, R. -C. (2024). New Properties and Matrix Representations on Higher-Order Generalized Fibonacci Quaternions with q-Integer Components. Axioms, 13(10), 677. https://doi.org/10.3390/axioms13100677

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