Next Article in Journal
Note on Iterations of Nonlinear Rational Functions
Previous Article in Journal
A Well-Posed Evolutionary Inclusion in Mechanics
Previous Article in Special Issue
Notes on Semiprime Ideals with Symmetric Bi-Derivation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Generalized Pauli Fibonacci Polynomial Quaternions

by
Bahadır Yılmaz
*,
Nazmiye Gönül Bilgin
and
Yüksel Soykan
Department of Mathematics, Art and Science Faculty, Zonguldak Bülent Ecevit University, 67100 Zonguldak, Turkey
*
Author to whom correspondence should be addressed.
Axioms 2025, 14(6), 449; https://doi.org/10.3390/axioms14060449
Submission received: 13 April 2025 / Revised: 21 May 2025 / Accepted: 30 May 2025 / Published: 6 June 2025
(This article belongs to the Special Issue Advances in Applied Algebra and Related Topics)

Abstract

:
Since Hamilton proposed quaternions as a system of numbers that does not satisfy the ordinary commutative rule of multiplication, quaternion algebras have played an important role in many mathematical and physical studies. This paper introduces the generalized notion of Pauli Fibonacci polynomial quaternions, a definition that incorporates the advantages of the Fibonacci number system augmented by the Pauli matrix structure. With the concept presented in the study, it aims to provide material that can be used in a more in-depth understanding of the principles of coding theory and quantum physics, which contribute to the confidentiality needed by the digital world, with the help of quaternions. In this study, an approach has been developed by integrating the advantageous and consistent structure of quaternions used to solve the problem of system lock-up and unresponsiveness during rotational movements in robot programming, the mathematically compact and functional form of Pauli matrices, and a generalized version of the Fibonacci sequence, which is an application of aesthetic patterns in nature.

1. Introduction

Particle physics, sometimes called high energy physics, is the area of natural science that investigates the ultrastructure of matter. This research deals with two issues: The first is the search for elementary particles, the ultimate constituents of matter at its smallest scales. The second is to explain what interactions take place between them to create matter as we view it [1]. While knowledge about electricity goes back much further, the fact that the electron is a particle has been proven more recently. In this sense, the first experimental evidence for the existence of the electron as a charged particle dates back to Thomas Alva Edison’s experiments in the 1880s [2]. For the development of the elementary particle, the dates in [1] will be taken as a basis, as given below: After years in which the fundamental particle was considered to be the atom, J. J. Thomson brought a different perspective to the situation when he extracted electrons from matter in the form of cathode rays in 1897 [3]. In 1932, Chadwick discovered that the nucleus, the core of the atom, is composed of protons and neutrons [4]. In 1934, Fermi established the theory of weak interactions [5]. In 1935, Yukawa developed the meson theory to explain the nuclear force acting between them [6]. Thus protons and neutrons, two of the three grains of baryons, were considered fundamental particles until the 1960s. Quarks and leptons are now recognized as the essential components of matter [1].
Currently, we are dealing with spin, which is of great importance for the physics of elementary particles and is also a complex concept. Eliot Leader has beautifully summarized the place of the concept of spin in the field with an analogy: Spin acts a dramatic Jekyll and Hyde role in the theater of elementary particle physics, at times heralding the collapse of an existing theory and at other times serving as a strong device in confirming another theory [7].
Spin, which requires a deep understanding of quantum mechanics to understand how it actually arises, first appeared when Paul Andrew Maurice Dirac derived the Dirac Equation, the cornerstone of relativistic quantum mechanics. Richard Feynman wrote the following explanation about the concept of spin [8]: “It appears to be one of the few places in physics where there is a rule which can be stated very simply, but for which no one has found a simple and easy explanation [9]”. In their classic textbook on quantum mechanics, Landau and Lifshitz wrote the following about the spin property [8]: “The spin property of elementary particles is peculiar to quantum theory… It has no classical interpretation… It would be wholly meaningless to imagine the ‘intrinsic’ angular momentum of an elementary particle as being the result of its rotation about its own axis [10]”. In [7], it is stated that Dirac’s (1927) work demonstrated that spin arises automatically in a relativistic theory and can no more be considered as an autonomous additional degree of independence. Particles with full spin satisfy the Bose–Einstein statistics, and particles with half spin comply with the Fermi–Dirac statistics [11].
The concept of spin appears in quantum mechanics books through an idealized Stern–Gerlach experiment in which a non-relativistic ray of silver atoms crosses an inhomogeneous magnetic field [7]. In non-relativistic quantum mechanics, Bargmann showed that it is possible to describe the particle spin by performing the central extension of the Galilei group [12]. The spin of a particle in non-relativistic quantum mechanics is given as an additional rotational degree of freedom [7].
There is also an approach that does not accept the Stern–Gerlach experiment, which is considered the first measurement of spin, as a measurement of electron spin. Bohr and Pauli are researchers who claimed that it is impossible to measure the spin of an electron. Despite this idea, spin has played a major role in the development of modern science both theoretically and technologically. In the last 30 years, studies that have gained great momentum have been carried out after the characterization of some metals using electron spin resonance, and studies have been carried out to detect radio frequency spin signals with scanning tunneling microscopy, and thus a new class of studies has emerged by taking advantage of the chemical sensitivity of spin resonance methods below the nanometer scale [13].
Spinors are theoretically used to model particles with half-integer spin, such as the massive electron and the massive or massless neutrino [14]. In fact, the spinor theory was developed independently by physicists and mathematicians. As a result, there is no single definition of the spinor concept in the literature [15]. According to Figueiredo et al., spinors have three different definitions, each showing a different perspective [15,16]. First is the covariant definition [17,18], the second is the algebraic definition [19,20,21], and, finally, the third is the operatorial definition [22]. Spinors have performed an essential role in physics and mathematics for the past eighty years [2]. In theoretical physics, one of the long-enduring problems is the combination of space–time and internal symmetries. The space–time symmetries produced by the Poincare group (including the space reversal P, time reversal T, and their combination PT) are treated as completely certain transformations of the space–time continuum. The first transformation, charge conjugation C, which is associated intimately with a complex conjugation of Lorentz group representations but is not a space–time symmetry, can be treated as an internal symmetry. There are also a wide variety of internal symmetries that come from quark phenomenology from SU ( N ) -theories [23].
As is well known, elementary particles might be grouped into multiplets satisfying nonreducible representations of the so-called algebras of internal symmetries (e.g., the multiplet of the isospin algebra su ( 2 ) or the multiplet of the algebra su ( 3 ) ) [23]. Gell-Mann [24] and Ne’eman [25] argue that the charge multiplicities of the group SU ( 2 ) can be combined into a larger group, such as the group SU ( 3 ) . Thus the isospin group SU ( 2 ) is considered as a subgroup of SU ( 3 ) such that SU ( 2 ) SU ( 3 ) [23].
Looking back on the nineteenth century, there was a need for a mathematical theory in which physical laws could be described and their universality checked. The conditions were in place for the construction of such a theory. The two leading names in developing this theory were Hamilton and Grassmann. Although Hamilton is thought to have done this work to find a suitable mathematical tool to apply Newtonian mechanics to various aspects of astronomy and physics, Grassmann’s real intention was to develop a theoretical algebraic structure on which the geometry of any number of dimensions could be based. From a purely mathematical point of view, Hamilton perhaps wanted to introduce a binary operation that could be physically interpreted in terms of a rotation in space [26].
The algebra of two-component spinors and Pauli matrices, part of the S U ( 2 ) group, enables a more compact and elegant formalism for defining classical rotations in real three-dimensional space. While the spinor representation is normally related with quantum mechanics, it is very intimately associated with quaternions, which were used a century ago by Hamilton to describe the inner degree of freedom of the electron, recognized as spin [27,28].
Quaternions were defined by Hamilton in 1843 [29]. Hamilton expressed the quaternion by means of a certain quadruple, which he called the real part of the first term and the imaginary part of the structure formed by the other three terms, and some equalities regarding the squares and products of the symbols in the imaginary part are valid [15]. Hamilton introduced a non-commutative binary algebra based on four basic units, such as ( 1 , i , j , k ) , in which many aspects of mechanics could be treated. James C. Maxwell argued that quaternions could be valuable in the theoretical advancement of electricity and magnetism. The theory of quaternions did not survive in its original form, despite the numerous applications Hamilton pointed out and the insistence of many researchers, including the Scottish mathematician Tait [26].
Despite the great value of Grassmann’s work, the importance of neither the original nor the extended work has been adequately recognized. The work needed to bring formal clarity and simplicity to the subject, and to demonstrate its important contributions, has been done by subsequent researchers instead of Hamilton and Grassmann. John Willard Gibbs, one of the most important mathematical physicists, was highly influential in developing the form of vector analysis. His need for a simpler mathematical framework for topics such as electromagnetics and thermodynamics was satisfied by selecting those aspects of the subject that could best be applied to theoretical physics, thanks to his insight into the work of Hamilton and Grassmann [26]. Quaternions found application especially in physics in the late 19th and early 20th centuries [30].
In robotics and computer-aided design, it is very important to be capable of defining geometric relationships clearly and unambiguously. This is done through coordinate systems and geometric transformations in the form of translation, scaling, symmetry, and rotation [31]. Euler angles were often used to formulate the rotational motion of objects. One of the disadvantages of utilizing Euler angles to simulate rotation is a condition known as gimbal lock [32]. Gimbal lock has been a highly visible problem in spacecraft control after the Apollo mission suffered from it [33]. In systems using three separate rotations, gimbal lock is a situation where two rotation axes align at certain angles, resulting in the loss of control of one axis. With quaternions, which eliminate this limitation and have many other advantages, research on a wide range of applications, especially in 3D space, is still ongoing. Programs such as Python SciPy 1.2.0 a popular language for robot programming, have added commands to their libraries to convert from Euler angles to quaternions [31].
In 1927, Pauli introduced the idea that the wave function of the electron could be described by a vector with two complex components; this vector is a spinor in three-dimensional Euclidean space. A year later, Dirac, in line with the needs of the relativistic equation, defined a wave function for the electron represented by a vector with four complex components, a spinor of four-dimensional pre-Euclidean space–time. In fact, physicists had unwittingly rediscovered the mathematical objects created by Cartan in 1913 while studying linear representations of groups. Moreover, the spinors studied by Cartan are examples of spinors that can be defined in a very general way, starting only from certain axioms. Additionally, vector spaces whose elements are spinors are related to the general theory of Clifford spaces introduced by Clifford in 1876 [34].
The term spin was first used by physicists to describe certain properties of quantum particles that emerged during various experiments. To quantify these properties, some new mathematical concepts called spinors were defined. These are vectors of a space whose transformations are related in a certain way to rotations in physical space. The analysis of the geometrical characteristics of spinors is necessary to better reveal the relationship between rotations in the space of spinors and rotations in three-dimensional physical space [34].
Pauli matrices, also referred to as Pauli spin matrices, are mathematical instruments of quantum mechanics. They took this name from the famous physicist Wolfgang Pauli, who made great advances in physics. Pauli matrices can be represented by using complex numbers as follows: σ 1 = 0 1 1 0 ,   σ 2 = 0 i i 0 ,   σ 3 = 1 0 0 1 .
Together with these three matrices, the identity matrix I = 1 0 0 1 is also included as a fourth element in order to represent observables. The state of an electron’s spin along orthogonal axes can be represented using the corresponding σ 1 , σ 2 , σ 3 . One of the interesting properties of Pauli matrices is that these three matrices form a basis for the space of 2 × 2 matrices. That is, any 2 × 2 matrix can be written as a linear combination of σ 1 , σ 2 , σ 3 and the identity matrix. The Pauli matrices are orthogonal. Also, Pauli matrices are Hermitian. That is, these matrices are equal to their conjugate transpose. The traces of Pauli matrices are equal to zero. That is, the sum of the elements on the principal diagonal of σ 1 , σ 2 , σ 3 is zero. On the other hand, the determinant of σ 1 , σ 2 , σ 3 is one. This property means that Pauli matrices represent rotations in the quantum analogue of the phase space of classical mechanics.
Let the unit matrix be denoted by σ 0 . Some important properties of Pauli matrices can be given as follows [34] ( σ 0 is obtained by taking the squares of the Pauli matrices):
For m n and m , n { 1 , 2 , 3 } ,   σ m σ n = σ n σ m . Also,
σ 1 σ 2 = i σ 3 , σ 2 σ 3 = i σ 1 and σ 3 σ 1 = i σ 2 .
The following relations are valid for Pauli matrices:
σ 1 σ 2 σ 2 σ 1 = 2 i σ 3 , σ 2 σ 3 σ 3 σ 2 = 2 i σ 1 and σ 3 σ 1 σ 1 σ 3 = 2 i σ 2 .
Using the linearly independent of unit matrix σ 0 and Pauli matrices, the following relation is written:
λ 0 σ 0 + λ 1 σ 1 + λ 2 σ 2 + λ 3 σ 3 = 0 .
For m { 0 , 1 , 2 , 3 } , σ m matrices are a base of the vector space of 2 × 2 matrices over real or complex numbers. Also, each matrix A = a b c d can be expressed as
A = α σ 0 + β σ 1 + γ σ 2 + δ σ 3 = 0
where
α = 1 2 ( a + d ) , β = 1 2 ( b + c ) , γ = 1 2 i ( b c ) , δ = 1 2 ( a d ) .
The Pauli matrices used to describe the behavior of quantum bits (qubits) can play important roles in quantum computers and artificial intelligence processes that are still under development.
Pauli matrices are introduced into the theory of spinors in the following way:
x = ψ ϕ * + ψ * ϕ , y = i ( ψ ϕ * ψ * ϕ ) , z = ψ ψ * ϕ ϕ * .
The quaternion can be represented using the complex numbers ψ and ϕ , with the associated spinor components ( ψ , ϕ ) and ( ϕ * , ψ * ) expressed in matrix form. With this information, take χ = ψ ϕ and χ = ψ * ϕ * using Pauli matrices, the x , y , z components of the vector can be written as follows: x = χ σ 1 ζ , y = χ σ 2 χ and z = χ σ 3 χ .
Every matrix corresponds to a component along one of the axes of the reference trihedron. These are infinitesimal rotation matrices around the axes O x , O y , O z multiplied by a factor [34].
Pauli used spinors, thought to be elements of C 2 , to reveal the behavior of an electron by taking the spin of the electron into account in quantum mechanics. In physics, spinors arose as a product of Pauli’s theory of non-relativistic quantum mechanics (1926) and Dirac’s theory of relativistic quantum mechanics (1928) [35,36]. These matrices, which appear in the Pauli equation, which takes into account the interaction of a particle’s spin with an external electromagnetic field, are named after the physicist Wolfgang Pauli (1928) [36]. These matrices have a very important place in nuclear physics studies. Dirac gave important formulas about Pauli matrices [35]. Less than two years after the 1926 discovery of the Schrödinger equation, Dirac derived a first-order wave equation for a four-component spinor field describing relativistic spin-1/2 particles such as electrons [35]. For detailed information on this subject, reference [37] can be reviewed. Vivarelli [38] was involved in this area from the geometrical aspect. He showed an injective and linear correspondence between spinors and quaternions, and, in three-dimensional Euclidean space, he gave spinor representations of rotations. Thus, a more concise and simpler depiction of quaternions can be reached by the concept of spinors. Quaternions, being applied to the fields of mathematics, physics, robotics, engineering, and chemistry, can be worked through spinors with the help of the correspondence given by Vivarelli [38].
We will now examine in more detail the quaternions mentioned above, which Hamilton constructed using the three symbols i , j , k to generalize the concept of complex numbers, with the following properties:
i 2 = j 2 = k 2 = 1 , i j = j i = k , j k = k j = i , k i = i k = j .
If q is written using these three components and 1 ,
q = u 1 + x i + y j + z k
q formed by this method are called quaternions and they form a four-dimensional vector space over real numbers. The structure shown by H represents the quaternion algebra. The moment he discovered these equations, Hamilton carved them into a bridge. He spent the rest of his life working on quaternions, which is why this algebra is now represented by H , after him [39]. Also, the quaternion algebra is a Clifford algebra and the generating elements are e 1 = i ,   e 2 = j and for i j e i e j = e j e i ,   e j 2 = 1 . Here, e 3 = e 1 e 2 = i j = k .
A matrix representation of the quaternions is then the following:
q = u σ 0 + x i σ 1 + y i σ 2 + z i σ 3 .
With the help of the generating symbols of quaternions, an isomorphism can be established between the quaternion algebra and other four-dimensional algebras. A classical representation of quaternions is given by the following generator elements and their outputs [34]:
e 1 = 0 1 1 0 , e 2 = 0 i i 0 , e 1 e 2 = e 3 = i 0 0 1 .
Therefore, we get for the matrix representation of a quaternion
q = u 1 + x e 1 + y e 2 + z e 3 ,
where 1 = 1 0 0 1 .
A generalized non-commutative quaternion q is a vector in 4-dimensional vector space of the form q = u 1 + x e 1 + y e 2 + z e 3 , where quaternionic units e 1 ,   e 2 ,   e 3 satisfy the next equalities for c 1 ,   c 2 R .
e 1 2 = c 1 , e 2 2 = c 2 , e 3 2 = c 1 c 2 , e 1 e 2 = e 2 e 1 = e 3 , e 2 e 3 = e 3 e 2 = c 2 e 1 and e 3 e 1 = e 1 e 3 = c 1 e 2 .
For special values of c 1 and c 2 , we obtain well-known subclasses of non-commutative quaternions. Specific choices of c 1 and c 2 yield well-established types of non-commutative quaternions:
c 1 = c 2 = 1 , real quaternions,
c 1 = 1 ,   c 2 = 1 , split quaternions,
c 1 = 1 ,   c 2 = 0 , semi quaternions,
c 1 = 0 ,   c 2 = 0 1 4 quaternions [40].
A generalized commutative quaternion q is a vector in 4-dimensional vector space of the form q = u 1 + x e 1 + y e 2 + z e 3 , where quaternionic units e 1 ,   e 2 ,   e 3 satisfy the next equalities for c 1 , c 2 R .
e 1 2 = c 1 , e 2 2 = c 2 , e 3 2 = c 1 c 2 , e 1 e 2 = e 2 e 1 = e 3 , e 2 e 3 = e 3 e 2 = c 2 e 1 and e 3 e 1 = e 1 e 3 = c 1 e 2 .
For special values of c 1 and c 2 we obtain well-known subclasses of non-commutative quaternions. Specific choices of c 1 and c 2 yield well-established types of non-commutative quaternions:
c 1 < 0 ,   c 2 = 1 , elliptic quaternions,
c 1 = 0 ,   c 2 = 1 , parabolic quaternions,
c 1 > 0 ,   c 2 = 1 , hyperbolic quaternions [41].
The real linear span of { I , σ 1 , σ 2 , σ 3 } is isomorphic to the real algebra of H quaternions, and the Pauli quaternions are defined by this basis [42]. A Pauli quaternion is given as
p = x 0 1 + x 1 σ 1 + x 2 σ 2 + x 3 σ 3
and a set of Pauli quaternions is denoted by H p . The conjugate of a Pauli quaternion, represented by p * , in [43], is shown as
p * = x 0 1 x 1 σ 1 x 2 σ 2 x 3 σ 3 .
Isomorphism from H to this set is given by the following transformation, which has the opposite sign for Pauli matrices: 1 I ,   i i σ , 1 , j i σ 2 , k i σ 3 [44]. Optionally, the isomorphism may be realized by a transformation that uses the Pauli matrices in inverse order, such that 1 I , i i σ 3 , j i σ 2 , k i σ 1 [42].
For any Pauli quaternion, the product is defined as follows:
x 0 x 1 x 2 x 3 x 1 x 0 i x 3 i x 2 x 2 i x 3 x 0 i x 1 x 3 i x 2 i x 1 x 0 y 0 y 1 y 2 y 3 .
For all p , q H p Pauli quaternion product is given by
p q = ( x 0 y 0 + x 1 y 1 + x 2 y 2 + x 3 y 3 ) 1 + ( ( x 0 y 1 + x 1 y 0 ) + i ( x 2 y 3 x 3 y 2 ) ) σ 1 + ( ( x 0 y 2 + x 2 y 0 ) + i ( x 3 y 1 x 1 y 3 ) ) σ 2 + ( ( x 0 y 3 + x 3 y 0 ) + i ( x 1 y 2 x 2 y 1 ) ) σ 2 .
Then, p p * = p * p = ( x 0 2 x 1 2 x 2 2 x 3 2 ) 1 [45].
Another concept that is important for our study is Fibonacci numbers. The literature on Fibonacci numbers, which has been analyzed in many remarkable ways for quite some time, is extensive. Fibonacci numbers are numbers that originated when Leonardo Pisano, who introduced Hindu-Arabic numerals to Europe in the early 1200s, presented a problem involving the increase in the rabbit population in his book Liber Abaci, which later led Pisano to be known as Fibonacci. These numbers go on as 0 ,   1 ,   1 ,   1 ,   2 ,   3 ,   5 ,   8 ,   13 , and are called the Fibonacci sequence and are expressed by the following recurrence relation: For n 0 , F n = F n 1 + F n 2 , here F n is the nth Fibonacci number, F 0 = 0 ,   F 1 = 1 .
After Horadam ’s study of a generalized version of the Fibonacci sequence in [46], many different generalizations were made about these fascinating numbers, and their mathematical properties and practical applications were studied.
One of the most popular generalizations of Fibonacci numbers is the sequence of Fibonacci polynomials: F n ( x ) = F n 1 ( x ) + F n 2 ( x ) for n 2 , with F 0 ( x ) = 0 ,   F 1 ( x ) = 1 .
Some cryptographic algorithms use complex sequences of numbers and polynomials. With the idea that a structure more general than Fibonacci polynomials can provide certain advantages in key generation and encryption methods, the following generalizations, which will be employed in this study, are summarized below.
Since quantum theory can be formulated using Hilbert spaces on any of the three relational normed division algebras, namely real numbers, complex numbers, and quaternions [39], we will now briefly talk about Fibonacci polynomials in our study on the combination of quaternions, which we have touched upon in detail, with number sequences, which are important topics in the mathematical field. The generalized Fibonacci polynomials, W n x are given as follows [47]:
W n x = r x W n 1 x + s x W n 2 x , W 0 x = a x , W 1 x = b x , n 2 .
Binet’s formula of generalized Fibonacci polynomials can be calculated using the characteristic equation, which is given as
t 2 r x t s x = 0 .
The roots of the characteristic equation are
a x = a = r x + r 2 x + 4 s x 2 , β x = β = r x r 2 x + 4 s x 2 .
These equalities are consistent with the formulas provided in [48].
Note: For the sake of simplicity throughout the rest of the paper, we use
W n , r , s , W 0 , W 1 , α , β , G n , H n , G 0 , G 1 , H 0 , H 1
instead of
W n ( x ) , r ( x ) , s ( x ) , W 0 ( x ) , W 1 ( x ) , α ( x ) , β ( x ) , G n ( x ) , H n ( x ) , G 0 ( x ) , G 1 ( x ) , H 0 ( x ) , H 1 ( x ) .
In the next theorem, we recall Binet’s formula of generalized Fibonacci polynomials.
Theorem 1.
(a) 
(Distinct Roots Case: α β ) Binet’s formula of generalized Fibonacci (Horadam) polynomials is
W n = p 1 α n p 2 β n α β
where
p 1 = W 1 β W 0 , p 2 = W 1 α W 0 .
(b) 
(Single Root Case: α = β ) Binet’s formula of generalized Fibonacci (Horadam) polynomials is
W n = ( D 1 + D 2 n ) α n
where
D 1 = W 0 , D 2 = 1 α W 1 α W 0 .
For more detail, see Soykan [47].
There are some studies in the literature that bring together the classical Fibonacci sequence, which is a special case of a more general concept employed in this study, and the concept of quaternions, which are integrated with the Pauli matrix structure. There are not enough studies covering all these concepts. The fundamental studies of Fibonacci quaternions are [45,49,50]. A few important works inspired by these studies in the following periods are as follows. In [51], Fibonacci quaternions were generalized to define higher order Fibonacci quaternions. In [52], which establishes a relationship between spinors and Fibonacci polynomials, a new sequence family of Generalized Fibonacci polynomial spinors is introduced; the matrix structure of the sequences related to these defined polynomials and some special relations are given. Fibonacci type quaternions with evaluations from different perspectives can be found in [53,54,55,56,57,58]. Generalized commutative quaternions of the Fibonacci type were defined in [41]. When it comes to studies that associate the concept of Pauli quaternion with number sequences, we can say that the first of these studies is [59]. Azak studied [60] the Gaussian version of Torunbalci’s work. In [61], Pauli–Leonardo quaternions are introduced and various equalities are obtained. İşbilir and others are working on incomplete generalized (p, q, r)-Tribonacci Pauli quaternion polynomials [62].
A Fibonacci quaternion is generally defined in [50] as
Q n = F n + i F n + 1 + j F n + 2 + k F n + 3
where Q n is the nth Fibonacci quaternion, F n denotes the nth Fibonacci number, and i , j , k are the classical quaternion units.
In [49], the author, by defining Q n = F n + u , for u = F n + i F n + 1 + j F n + 2 + k F n + 3 , presented the following properties regarding to the isomorphic structure of Fibonacci quaternions. For
H = { Q n : Q n = ( F n , F n + 1 , F n + 2 , F n + 3 ) }
and
H = { P n : P n = w z z ¯ w ¯ , w , z C } ,
there exists an isomorphism between H and H .
Q n = ( F n , F n + 1 , F n + 2 , F n + 3 ) P n = F n + i F n + 1 F n + 2 i F n + 3 F n + 2 i F n + 3 F n i F n + 1 .
Also,
P n = F n + F n + 1 E + F n + 2 I + F n + 3 K
where E = 1 0 0 1 ,   I = i 0 0 i ,   J = 0 1 1 0 ,   K = 0 i i 0 .
In this paper, we introduce a notion based on Pauli matrices in the framework of quaternions using the structure of generalized Fibonacci polynomials given in [47]: Generalized Pauli Fibonacci polynomial quaternions. Important equalities have been obtained with the help of Pauli (r, s) Fibonacci polynomial quaternion and Lucas versions of these polynomials. Also, the relation of the defined concept with matrices is given. Thus, the defined concept will be carried to the broad axis of matrix theory. The main idea behind the development of generalized Pauli Fibonacci polynomial quaternions is, first of all, to provide a transition from the usual Euler approach, which has disadvantages especially for rapidly changing angles in robotic coding and 3D animation system in the developing digital world, to a more useful quaternion-based structure, and then to take advantage of the Fibonacci sequence and polynomials associated with the balance and aesthetic approach in nature (golden ratio).
Previous studies on Fibonacci quaternions [39,45,63] and spinors [51] have established a foundational understanding of algebraic structures involving Fibonacci numbers and quaternionic representations. These works mainly focused on the properties and identities of Fibonacci quaternions and their connections to spinorial objects in classical settings. In contrast, the present study introduces a novel generalization by incorporating Pauli matrices into the structure of generalized Pauli Fibonacci polynomial quaternions (GPFPQs). This integration enriches the algebraic framework by combining the recursive nature of Fibonacci polynomials with the intrinsic non-commutative and anti-commutative properties of Pauli matrices. As a result, the proposed structure is better suited to modeling quantum mechanical systems, particularly in areas involving spin dynamics, entanglement, and unitary transformations.
Moreover, the Pauli-based extension of Fibonacci quaternions opens potential applications in both quantum information theory (e.g., quantum state representation and encoding) and classical cryptography, where matrix-based operations and structural complexity are desirable features. This approach not only generalizes existing quaternion models but also establishes a bridge between number theory, operator theory, and quantum computation, offering a richer mathematical toolset for future research.
The incorporation of Pauli matrices brings several novel aspects that were not explored in the prior quaternion models:
  • Non-commutative Structure Enhancement:
Pauli matrices inherently possess non-commutative and anti-commutative properties, which, when combined with Fibonacci polynomials, yield richer algebraic structures than those presented in classical Fibonacci quaternion models. This allows for a more nuanced representation of quantum mechanical symmetries and transformations.
  • Quantum Mechanical Relevance:
Pauli matrices play a foundational role in quantum mechanics, particularly in spin and quantum state representations. By embedding these matrices into the GPFPQ framework, our approach creates a bridge between number-theoretic constructs (Fibonacci polynomials) and quantum operators, facilitating more natural modeling of quantum systems, such as entanglement, quantum rotations, and spin states.
  • Potential for Quantum and Classical Applications:
The new structure opens up applications not just in theoretical algebra, but also in quantum information (e.g., state encoding) and cryptographic schemes where Pauli-based operations are commonly used in quantum error correction and secure communications.
  • Analytical Generalization:
Our approach also generalizes previous models by defining an extended algebra that encompasses both classical quaternion identities and matrix-based operations, thus allowing for further exploration in operator theory, matrix representation, and coding theory.
The concept, which we have defined with the help of general polynomials used in the context of Pauli matrices and quaternions, is presented for the evaluation of researchers, considering that it will be used together with the below studies in the literature.
In article [64], a cryptographic framework is proposed that employs Pauli spin-1/2 matrices in conjunction with finite state machines to encrypt data streams, aiming to enhance the robustness and security of data transmission processes. In [65], a secure cryptosystem is presented based on the braiding and entanglement of Pauli 3/2 matrices, aiming to ensure the secure transmission of sensitive information over the Internet. A solution for maximal dense coding with symmetric quantum states, based on unitary operators derived from the Pauli group, is proposed in [66], where quantum communication and coding theory are integrated. In [67], a fast construction of quantum codes based on the residues of Pauli block matrices is explored, with significant discussions on quantum error correction and stabilizer codes. In [68], the authors propose an approach to quantum fully homomorphic encryption (FHE) by integrating Pauli one-time pad encryption with quaternion algebra. The integration of these two techniques enables fully homomorphic operations on encrypted quantum data without compromising privacy.
We can list the contributions that the concept of “Generalized Pauli Fibonacci Polynomial Quaternions” can provide to the literature and its features that may attract the attention of researchers looking for a study topic in different fields as follows:
  • By combining the time-dependent growth properties of Fibonacci polynomials with quantum transformations of Pauli matrices, more flexible and accurate modeling of temporally evolving quantum systems can be achieved.
  • With the help of Fibonacci polynomial-based quaternion structure, more accurate modeling of systems such as biological signals and financial fluctuations involving nonlinear dynamics can be achieved.
  • Pauli matrices are already fundamental components in quantum error-correcting codes (see [69]). Non-commutative Pauli Fibonacci quaternions could inspire new code systems with pattern-based coding logic to design error-correcting and corruption-tolerant systems in quantum information theory.
  • After the encryption systems based on Fibonacci numbers, which have been previously investigated in classical cryptography (see [70]), quaternions and non-commutative structures can offer potential solutions for post-quantum cryptography. Combining the recurrence property of Fibonacci sequences and the orientation structure of quaternions, the presented concept can help to develop a new generation of secure algorithms with asymmetric and quantum-resistant encryption methods.
The structure of the sections in the manuscript is as follows: The introduction presents a comprehensive overview of Fibonacci quaternions and explores their connection to Pauli matrices through the quaternion–spinor relationship. Furthermore, the discussion highlights the theoretical significance and practical applicability of these mathematical constructs in addressing complex and evolving problems in various fields, including physics, engineering, and computational sciences.
In the second section, the mathematical structure of the generalized Pauli Fibonacci polynomial quaternions is formally introduced. To support practical implementation and demonstrate the applicability of the proposed formulation, detailed tables are presented for both positive and negative indices, providing insight into the behavior and numerical characteristics of the quaternion components across varying index values. Moreover, the (r, s)-Fibonacci and Lucas extensions of the definition are presented to illustrate the algebraic flexibility and generalization capacity of the proposed structure. These formulations not only expand the classical Fibonacci and Lucas sequences within a quaternionic framework, but also demonstrate that the study aligns with the expected generalization procedures in the literature, thereby reinforcing its theoretical soundness and potential for broader algebraic applications. Furthermore, by deriving the Binet formula and the corresponding generating function for the generalized Pauli Fibonacci polynomial quaternions, the study provides readers with a closed-form expression and a systematic computational tool. These formulations not only facilitate the efficient calculation of higher-order terms but also align with standard methodologies in the literature aimed at revealing the analytical structure and recurrence behavior of generalized number sequences within algebraic systems.
In Section 3, the concepts of Pauli ( r , s )-Fibonacci polynomial quaternions and their Lucas versions are further extended through the derivation of important summation formulas. These formulas are obtained using recurrence relations that are commonly employed to generate polynomial sequences, thereby providing closed-form expressions for the sums of the defined polynomials. Through this approach, the study aims to establish the necessary theoretical framework to support further algebraic exploration and computational application of these generalized quaternionic structures.
In Section 4, several findings are presented to demonstrate that the matrix-based methodological framework, which is widely used in the literature for generalized Fibonacci polynomials, can be successfully extended to the newly defined structure that integrates Pauli matrix properties with quaternionic algebra. These results emphasize the adaptability of classical recursive techniques to more complex algebraic systems.
The final section of the manuscript is dedicated to presenting the conclusions drawn from the study, along with a set of recommendations for future research and potential applications.

2. Main Results

This section is devoted to the exploration of various mathematical properties and identities associated with generalized Pauli Fibonacci polynomial quaternions. We begin by presenting the structure and definition of the Pauli ( r , s ) -Fibonacci polynomial quaternion, followed by a detailed version of Binet’s formula adapted to this generalized framework. Additionally, we examine several classical identities in the context of these quaternions, including Catalan’s identity, the Simpson formula, and the Cassini identity, each of which provides deeper insight into the algebraic and analytical nature of these constructs. The results obtained not only extend well-known Fibonacci-related identities to a broader setting but also offer new perspectives relevant to both pure mathematics and theoretical physics.
The generalized Pauli Fibonacci polynomial quaternions can be defined by the basis 1 , i σ 1 , i σ 2 , i σ 3 where i σ s = 1 , 2 , 3 satisfy the conditions as follows:
Q p W n = W n 1 + W n + 1 σ 1 + W n + 2 σ 2 + W n + 3 σ 3 .
Note that the identity (4) can be written as
Q p W n = W n + W n + 3 W n + 1 i W n + 2 W n + 1 + i W n + 2 W n W n + 3 .
The transformation defined as
( W n 1 , W n + 1 σ 1 , W n + 2 σ 2 , W n + 3 σ 3 ) Q p W n = W n + W n + 3 W n + 1 i W n + 2 W n + 1 + i W n + 2 W n W n + 3
is a linear isomorphism.
Lemma 1.
For nonnegative integer n, the generalized Pauli Fibonacci polynomial quaternions sequence Q p W n are defined by second order recurrence relation as follows:
Q p W n + 2 = r Q p W n + 1 + s Q p W n
with the initial conditions Q p W 0 and Q p W 1 .
Proof. 
Using (4) and recurrence relation W n = r W n 1 + s W n 2 , we obtain
Q p W n + 2 = W n + 2 1 + W n + 3 σ 1 + W n + 4 σ 2 + W n + 5 σ 3 = ( r W n + 1 + s W n ) 1 + ( r W n + 2 + s W n + 1 ) σ 1 + ( r W n + 3 + s W n + 2 ) σ 2 + ( r W n + 4 + s W n + 3 ) σ 3 = r ( W n + 1 1 + W n + 2 σ 1 + W n + 3 σ 2 + W n + 4 σ 3 ) +   s ( W n 1 + W n + 1 σ 1 + W n + 2 σ 2 + W n + 3 σ 3 )
Lemma 2.
For negative integers n, we have the following identity:
Q p W n 2 = r s Q p W n 1 + 1 s Q p W n .
Proof. 
From (6), we obtain
Q p W n = r Q p W n 1 + s Q p W n 2
Hence, we have
Q p W n 2 = r s Q p W n 1 + 1 s Q p W n
Following this, Table 1 presents the first few generalized Pauli Fibonacci polynomial quaternions with positive subscripts.
As a special case of Q p W n , taking r = 2 and s = 1 , we have the following table (Table 2).
Next, the first few generalized Pauli Fibonacci polynomial quaternions with negative subscripts are presented in Table 3.
As a special case of Q p W n , taking r = 2 and s = 1 , we have the following table (Table 4).
Now, we define two special cases of the generalized Pauli Fibonacci polynomial quaternions Q p W n , denoted by Pauli ( r , s ) Fibonacci polynomial quaternion Q p G n and Pauli ( r , s ) -Lucas polynomial quaternion Q p H n .
For all integers n, the nth Pauli ( r , s ) -Fibonacci polynomial quaternions Q p G n are defined by
Q p G n = G n 1 + G n + 1 σ 1 + G n + 2 σ 2 + G n + 3 σ 3
with Q p G 0 = G 0 1 + G 1 σ 1 + G 2 σ 2 + G 3 σ 3 and Q p G 1 = G 1 1 + G 2 σ 1 + G 3 σ 2 + G 4 σ 3 , and the Pauli ( r , s ) -Lucas polynomial quaternions Q p H n are defined by
Q p H n = H n 1 + H n + 1 σ 1 + H n + 2 σ 2 + H n + 3 σ 3
with Q p H 0 = H 0 1 + H 1 σ 1 + H 2 σ 2 + H 3 σ 3 and Q p H 1 = H 1 1 + H 2 σ 1 + H 3 σ 2 + H 4 σ 3 .
Lemma 3.
For all integers n, we have the following identities:
(a) 
Q p G n + 2 = r Q p G n + 1 + s Q p G n
with
Q p G 0 = σ 1 + r σ 2 + ( s + r 2 ) σ 3 , Q p G 1 = 1 + r σ 1 + ( s + r 2 ) σ 2 + r ( 2 s + r 2 ) σ 3 .
(b) 
Q p H n + 2 = r Q p H n + 1 + s Q p H n
with
Q p H 0 = 2 . 1 + r σ 1 + ( 2 s + r 2 ) σ 2 + r ( 3 s + r 2 ) σ 3 , Q p H 1 = r 1 + ( 2 s + r 2 ) σ 1 + r ( 3 s + r 2 ) σ 2 + ( 4 r 2 s + r 4 + 2 s 2 ) σ 3 .
Proof. 
Taking Q p W n = Q p G n and Q p W n = Q p H n in Lemma 1, (a) and (b) follow. □
In the next tables below (Table 5, Table 6, Table 7, Table 8, Table 9, Table 10, Table 11 and Table 12), we give some terms of the Pauli ( r , s ) -Fibonacci polynomial quaternion Q p G n and Pauli ( r , s ) -Lucas polynomial quaternion Q p H n with negative and positive subscripts.
As a special case of Q p G n , taking r = 2 and s = 1 , we have the following tables (Table 6).
As a special case of Q p H n , taking r = 2 and s = 1 , we have the following tables (Table 8).
As a special case of Q p G n , taking r = 2 and s = 1 , we have the following tables (Table 10).
As a special case of Q p H n , taking r = 2 and s = 1 , we have the following table (Table 12).
The addition, subtraction, and multiplication by real scalars of two generalized Pauli Fibonacci polynomial quaternions gives the generalized Pauli Fibonacci polynomial quaternions. Then, the addition and subtraction of two generalized Pauli Fibonacci polynomial quaternions are defined by
Q p W n ± Q p W m = ( W n ± W m ) 1 + ( W n + 1 ± W m + 1 ) σ 1 + ( W n + 2 ± W m + 2 ) σ 2 + ( W n + 3 ± W m + 3 ) σ 3 .
The multiplication of a generalized Pauli Fibonacci polynomial quaternions by a real scalar λ is defined as follows:
λ Q p W n = λ W n 1 + λ W n + 1 σ 1 + λ W n + 2 σ 2 + λ W n + 3 σ 3 .
By using (1), multiplication of two generalized Pauli Fibonacci polynomial quaternions is formulated as
Q p W n × Q p W m = ( W n 1 + W n + 1 σ 1 + W n + 2 σ 2 + W n + 3 σ 3 ) × ( W m 1 + W m + 1 σ 1 + W m + 2 σ 2 + W m + 3 σ 3 ) = W n 1 W m 1 + W n 1 W m + 1 σ 1 + W n 1 W m + 2 σ 2 + W n 1 W m + 3 σ 3 + W n + 1 σ 1 W m 1 + W n + 1 σ 1 W m + 1 σ 1 + W n + 1 σ 1 W m + 2 σ 2 + W n + 1 σ 1 W m + 3 σ 3 + W n + 2 σ 2 W m 1 + W n + 2 σ 2 W m + 1 σ 1 + W n + 2 σ 2 W m + 2 σ 2 + W n + 2 σ 2 W m + 3 σ 3 + W n + 3 σ 3 W m 1 + W n + 3 σ 3 W m + 1 σ 1 + W n + 3 σ 3 W m + 2 σ 2 + W n + 3 σ 3 W m + 3 σ 3 . = W n W m 1 + W n W m + 1 σ 1 + W n W m + 2 σ 2 + W n W m + 3 σ 3 + W n + 1 W m σ 1 + W n + 1 W m + 1 1 + W n + 1 W m + 2 i σ 3 + W n + 1 W m + 3 ( i ) σ 2 + W n + 2 W m σ 2 + W n + 2 W m + 1 ( i ) σ 3 + W n + 2 W m + 2 1 + W n + 2 W m + 3 i σ 1 + W n + 3 W m σ 3 + W n + 3 W m + 1 i σ 2 + W n + 3 W m + 2 ( i ) σ 1 + W n + 3 W m + 3 1 . = ( W n W m + W n + 1 W m + 1 + W n + 2 W m + 2 + W n + 3 W m + 3 ) 1 + ( W n W m + 1 + W n + 1 W m + W n + 2 W m + 3 i W n + 3 W m + 2 i ) σ 1 + ( W n W m + 2 + W n + 2 W m + W n + 3 W m + 1 i W n + 1 W m + 3 i ) σ 2 + ( W n W m + 3 + W n + 3 W m + W n + 1 W m + 2 i W n + 2 W m + 1 i ) σ 3 .
The scalar and vector parts of Q p W n , which are the nth term of the generalized Pauli Fibonacci polynomial quaternions with ( Q p W n ), are denoted by
S Q p W n = W n 1 and V Q p W n = W n + 1 σ 1 + W n + 2 σ 2 + W n + 3 σ 3 .
Thus, the generalized Pauli Fibonacci polynomial quaternions Q p W n is given by
Q p W n = S Q p W n + V Q p W n .
Then, the multiplication of two generalized Pauli Fibonacci polynomial quaternions is defined by
Q p W n × Q p W m = S Q p W n S Q p W m + V Q p W n , V Q p W m + S Q p W n . V Q p W m + S Q q W n . V Q p W m + V Q p W n Λ V Q p W m .
For more details, see Jafarı and Yaylı [40].
Also, the generalized Pauli Fibonacci polynomial quaternions product may be obtained as follows:
Q p W n × Q p W m = W n W n + 1 W n + 2 W n + 3 W n + 1 W n i W n + 3 i W n + 2 W n + 2 i W n + 3 W n i W n + 1 W n + 3 i W n + 2 i W n + 1 W n W m W m + 1 W m + 2 W m + 3 .
The conjugate of generalized Pauli Fibonacci polynomial quaternions Q p W n is denoted by Q p W n ¯ , and it is
Q p W n ¯ = W n 1 W n + 1 σ 1 W n + 2 σ 2 W n + 3 σ 3 .
The norm of Q p W n is defined as follows:
Q p W n 2 = Q p W n Q p W n ¯ = W n 2 W n + 1 2 W n + 2 2 W n + 3 2 .
Now, using (10), we introduce Binet’s formula for generalized Pauli Fibonacci polynomial quaternions Q p W n .
Binet’s formula for generalized Pauli Fibonacci polynomial quaternions can be calculated using its characteristic equation, which is given as
t 2 r t s = 0
where the roots of this equation are
α = r + r 2 + 4 s 2 , β = r r 2 + 4 s 2 .
In the next Theorem, we present Binet’s formula for the Pauli generalized Fibonacci polynomial quaternions.
Theorem 2.
For all integers n, we have the following formulas:
(a) 
(Distinct Roots Case α β ) Binet’s formula of generalized Pauli Fibonacci polynomial quaternions is
Q p W n = p ^ 1 α n p ^ 2 β n α β
= p ˜ 1 α n p ˜ 2 β n α β ,
where
p ^ 1 = Q p W 1 β Q p W 0 , p ^ 2 = Q p W 1 α Q p W 0 , p ˜ 1 = p 1 1 + p 1 α σ 1 + p 1 α 2 σ 2 + p 1 α 3 σ 3 , p ˜ 2 = p 2 1 + p 2 β σ 1 + p 2 β 2 σ 2 + p 2 β 3 σ 3 .
Note that p 1 and p 2 are as stated in Theorem 1.
(b) 
(Single Root Case α = β ) Binet’s formula for generalized Pauli Fibonacci polynomial quaternions is
Q p W n = ( d ^ 1 + d ^ 2 n ) α n
= ( d ˜ 1 + d ˜ 2 n ) α n ,
where
d ^ 1 = Q p W 0 , d ^ 2 = 1 α ( Q p W 1 α Q p W 0 ) , d ˜ 1 = D 1 1 + ( D 1 + D 2 ) α σ 1 + ( D 1 + 2 D 2 ) α 2 σ 2 + ( D 1 + 3 D 2 ) α 3 σ 3 , d ˜ 2 = D 2 1 + D 2 α σ 1 + D 2 α 2 σ 2 + D 2 α 3 σ 3 .
Note that D 1 and D 2 are as stated in Theorem 1.
Proof. 
(a)
If the roots of (11) are distinct, then Binet’s formula of Q p W n is given below:
Q p W n = C 1 α n + C 2 β n .
Taking n = 0 and n = 1 , respectively, we have the following system of linear equations:
Q p W 0 = C 1 + C 2 Q p W 1 = C 1 α + C 2 β .
Hence, solving these two equations, we obtain
C 1 = Q p W 1 β Q p W 0 α β , C 2 = Q p W 1 α Q p W 0 α β .
Then, (13) can be proved by (4).
(b)
If the roots of (11) are equal, then Binet’s formula for Q p W n is given below:
Q p W n = ( d ^ 1 + d ^ 2 n ) α n .
Taking n = 0 and n = 1 , respectively, we have the following system of linear equations:
Q p W 0 = ( d ^ 1 + d ^ 2 0 ) α 0 Q p W 1 = ( d ^ 1 + d ^ 2 1 ) α 1 .
Hence, solving these two equations, we obtain
d ^ 1 = Q p W 0 , d ^ 2 = 1 α ( Q p W 1 α Q p W 0 ) .
Then, (15) can be proved easily by (4).
Theorem 2 gives us the following results as particular examples of Binet’s formula for the Pauli ( r , s ) -Fibonacci polynomial quaternion Q p G n and Binet’s formula for the Pauli ( r , s ) -Lucas polynomial quaternion Q p H n .
Corollary 1.
For all integers n, we have the following formulas:
(a) 
(Distinct Roots Case α β ) Binet’s formula for the Pauli ( r , s ) -Fibonacci polynomial quaternion Q p G n is
Q p G n = p ^ 1 α n p ^ 2 β n α β ,
where
p ^ 1 = 1 + ( r β ) σ 1 + ( r 2 + s β r ) σ 2 + r 3 + 2 s r β ( r 2 + s ) σ 3 , p ^ 2 = 1 + ( r α ) σ 1 + ( r 2 + s α r ) σ 2 + r 3 + 2 s r α ( r 2 + s ) σ 3 .
(b) 
(Distinct Roots Case α β ) Binet’s formula for the Pauli ( r , s ) -Lucas polynomial quaternion Q p H n is
Q p H n = p ^ 1 α n p ^ 2 β n α β ,
where
p ^ 1 = ( r 2 β ) 1 + ( r 2 + 2 s β r ) σ 1 + ( r 3 + 3 r s β ( 2 s + r 2 ) ) σ 2 + r 4 + 4 r 2 s + 2 s 2 β ( r 3 + 3 r s ) σ 3 ,
p ^ 2 = ( r 2 α ) 1 + ( r 2 + 2 s α r ) σ 1 + ( r 3 + 3 r s α ( 2 s + r 2 ) ) σ 2 + r 4 + 4 r 2 s + 2 s 2 α ( r 3 + 3 r s ) σ 3 .
(c) 
(Distinct Roots Case α = β ) Binet’s formula for the Pauli ( r , s ) -Fibonacci polynomial quaternion Q p G n is
Q p G n = ( d ^ 1 + d ^ 2 n ) α n
where
d ^ 1 = σ 1 + σ 2 r + σ 3 ( r 2 + s ) ,
d ^ 2 = 1 α + r α α σ 1 + r 2 + s α r α σ 2 + r 3 + 2 s r α ( r 2 + s ) α σ 3 .
(d) 
(Distinct Roots Case α = β ) Binet’s formula for the Pauli ( r , s ) -Lucas polynomial quaternion Q p H n is
Q p H n = ( d ^ 1 + d ^ 2 n ) α n
where
d ^ 1 = 2 . 1 + r σ 1 + σ 2 ( 2 s + r 2 ) + σ 3 ( r 3 + 3 r s ) ,
d ^ 2 = r 2 α α + r 2 + 2 s α r α σ 1 + r 3 + 3 r s α ( 2 s + r 2 ) α σ 2 + r 4 + 4 r 2 s + 2 s 2 α ( r 3 + 3 r s ) α σ 3 .
Proof. 
(a)
Taking Q p W n = Q p G n in Theorem 2 (a), we obtain
Q p G n = p ^ 1 α n p ^ 2 β n α β
where
p ^ 1 = Q p G 1 β Q p G 0 = 1 + r σ 1 + σ 2 r 2 + s + σ 3 r 3 + 2 s r β ( σ 1 + σ 2 r + σ 3 ( r 2 + s ) ) = 1 + ( r β ) σ 1 + ( r 2 + s β r ) σ 2 + r 3 + 2 s r β ( r 2 + s ) σ 3 ,
p ^ 2 = Q p G 1 α Q p G 0 = 1 + r σ 1 + σ 2 r 2 + s + σ 3 r 3 + 2 s r α ( σ 1 + σ 2 r + σ 3 ( r 2 + s ) ) = 1 + ( r α ) σ 1 + ( r 2 + s α r ) σ 2 + r 3 + 2 s r α ( r 2 + s ) σ 3 .
(b)
Taking Q p W n = Q p H n in Theorem 2 (a), we obtain
Q p H n = p ^ 1 α n p ^ 2 β n α β
where
p ^ 1 = Q p H 1 β Q p H 0 = r . 1 + σ 1 ( r 2 + 2 s ) + σ 2 ( r 3 + 3 r s ) + σ 3 ( r 4 + 4 r 2 s + 2 s 2 ) β ( 2 . 1 + r σ 1 + σ 2 ( 2 s + r 2 ) + σ 3 ( r 3 + 3 r s ) ) = ( r 2 β ) 1 + ( r 2 + 2 s β r ) σ 1 + ( r 3 + 3 r s β ( 2 s + r 2 ) ) σ 2 + r 4 + 4 r 2 s + 2 s 2 β ( r 3 + 3 r s ) σ 3 ,
p ^ 2 = Q p H 1 α Q p H 0 = r . 1 + σ 1 ( r 2 + 2 s ) + σ 2 ( r 3 + 3 r s ) + σ 3 ( r 4 + 4 r 2 s + 2 s 2 ) α ( 2 . 1 + r σ 1 + σ 2 ( 2 s + r 2 ) + σ 3 ( r 3 + 3 r s ) ) = ( r 2 α ) 1 + ( r 2 + 2 s α r ) σ 1 + ( r 3 + 3 r s α ( 2 s + r 2 ) ) σ 2 + r 4 + 4 r 2 s + 2 s 2 α ( r 3 + 3 r s ) σ 3 .
(c)
Taking Q p W n = Q p G n in Theorem 2 (b), we obtain
Q p G n = ( d ^ 1 + d ^ 2 n ) α n
where
d ^ 1 = Q p G 0 = σ 1 + σ 2 r + σ 3 ( r 2 + s ) ,
d ^ 2 = 1 α ( Q p G 1 α Q p G 0 ) = 1 α ( 1 + r σ 1 + σ 2 r 2 + s + σ 3 r 3 + 2 s r α ( σ 1 + σ 2 r + σ 3 ( r 2 + s ) ) ) = 1 α + r α α σ 1 + r 2 + s α r α σ 2 + r 3 + 2 s r α ( r 2 + s ) α σ 3 .
(d)
Taking Q p W n = Q p H n in Theorem 2 (b), we obtain
Q p H n = ( d ^ 1 + d ^ 2 n ) α n
where
d ^ 1 = Q p H 0 = 2 . 1 + r σ 1 + σ 2 ( 2 s + r 2 ) + σ 3 ( r 3 + 3 r s ) ,
d ^ 2 = 1 α ( Q p H 1 α Q p H 0 ) = 1 α ( r . 1 + σ 1 ( r 2 + 2 s ) + σ 2 ( r 3 + 3 r s ) + σ 3 ( r 4 + 4 r 2 s + 2 s 2 ) α ( 2 . 1 + r σ 1 + σ 2 ( 2 s + r 2 ) + σ 3 ( r 3 + 3 r s ) ) ) ) = r 2 α α + r 2 + 2 s α r α σ 1 + r 3 + 3 r s α ( 2 s + r 2 ) α σ 2 + r 4 + 4 r 2 s + 2 s 2 α ( r 3 + 3 r s ) α σ 3 .
As a different method, Binet’s formula of generalized Fibonacci polynomial quaternions formula can also be expressed as given in the theorem below.
Theorem 3.
For all integers n, we have the following formulas:
(a) 
(Distinct Roots Case α β ) Binet’s formula for generalized Pauli Fibonacci polynomial quaternions is
Q p W n = 1 α β α n p 1 β n p 2 + α n + 3 p 1 β n + 3 p 2 α n + 1 p 1 β n + 1 p 2 i α n + 2 p 1 + i β n + 2 p 2 α n + 1 p 1 β n + 1 p 2 + i α n + 2 p 1 i β n + 2 p 2 α n p 1 β n p 2 α n + 3 p 1 + β n + 3 p 2
(b) 
(Single Root Case α = β ) Binet’s formula for generalized Pauli Fibonacci polynomial quaternions is
Q p W n = α n D 1 + D 2 n + D 1 α 3 + D 2 n α 3 D 1 α + D 2 n α i D 1 α 2 D 2 n α 2 D 1 α + D 2 n α + i D 1 α 2 + D 2 n α 2 D 1 + D 2 n D 1 α 3 D 2 n α 3
where p 1 , p 2 , D 1 ,and D 2 are as stated in the Theorem 1.
Proof. 
(a)
Using Binet’s formula for the Generalized Fibonacci (Horadam) polynomial given in Theorem 1 (a) together with identity (5), we obtain
Q p W n = W n + W n + 3 W n + 1 i W n + 2 W n + 1 + i W n + 2 W n W n + 3 = p 1 α n p 2 β n α β + p 1 α n + 3 p 2 β n + 3 α β p 1 α n + 1 p 2 β n + 1 α β i ( p 1 α n + 2 p 2 β n + 2 α β ) p 1 α n + 1 p 2 β n + 1 α β + i ( p 1 α n + 2 p 2 β n + 2 α β ) p 1 α n p 2 β n α β p 1 α n + 3 p 2 β n + 3 α β = 1 α β α n p 1 β n p 2 + α n + 3 p 1 β n + 3 p 2 α n + 1 p 1 β n + 1 p 2 i α n + 2 p 1 + i β n + 2 p 2 α n + 1 p 1 β n + 1 p 2 + i α n + 2 p 1 i β n + 2 p 2 α n p 1 β n p 2 α n + 3 p 1 + β n + 3 p 2 .
(b)
From Theorem1 (b), which provides Binet’s formula for the generalized Fibonacci (Horadam) polynomial, and using identity (5), we obtain
Q p W n = W n + W n + 3 W n + 1 i W n + 2 W n + 1 + i W n + 2 W n W n + 3 = ( D 1 + D 2 n ) α n + ( D 1 + D 2 n ) α n + 3 ( D 1 + D 2 n ) α n + 1 i ( D 1 + D 2 n ) α n + 2 ( D 1 + D 2 n ) α n + 1 + i ( D 1 + D 2 n ) α n + 2 ( D 1 + D 2 n ) α n ( D 1 + D 2 n ) α n + 3 = α n D 1 + D 2 n + D 1 α 3 + D 2 n α 3 D 1 α + D 2 n α i D 1 α 2 D 2 n α 2 D 1 α + D 2 n α + i D 1 α 2 + D 2 n α 2 D 1 + D 2 n D 1 α 3 D 2 n α 3 .
Next, we give the ordinary generating function n = 0 z n Q p W n of the sequence of generalized Pauli Fibonacci polynomial quaternions.
Theorem 4.
Suppose that f Q p W n ( z ) = n = 0 z n Q p W n is the ordinary generating function of the sequence of generalized Pauli Fibonacci polynomial quaternions. Then n = 0 z n Q p W n is given by
n = 0 z n Q p W n = Q p W 0 + z ( Q p W 1 s Q p W 0 ) ( 1 r z s z 2 ) .
Proof. 
Using the definition of the generalized Pauli Fibonacci polynomial quaternions and subtracting r z n = 0 z n Q p W n and s z 2 n = 0 z n Q p W n from n = 0 z n Q p W n , we obtain
( 1 r z s z 2 ) n = 0 z n Q p W n = n = 0 z n Q p W n r z n = 0 z n Q p W n s z 2 n = 0 z n Q p W n = n = 0 z n Q p W n r n = 0 z n + 1 Q p W n s n = 0 z n + 2 Q p W n = n = 0 z n Q p W n r n = 1 z n Q p W n 1 s n = 2 z n Q p W n 2 = ( Q p W 0 + z Q p W 1 ) s z Q p W 0 + n = 2 ( Q p W n r Q p W n 1 s Q p W n 2 ) = Q p W 0 + z ( Q p W 1 s Q p W 0 )
By rearranging the above equation, we obtain (16). □
From Theorem 4, we have the following corollary.
Corollary 2.
For all integers n, we have the following formulas:
(a) 
The generating function of the Pauli ( r , s ) -Fibonacci polynomial quaternion Q p G n is
n = 0 z n Q p G n = 1 ( 1 r z s z 2 ) ( σ 1 + σ 2 r + σ 3 ( r 2 + s ) + z ( 1 + ( r s ) σ 1 + ( r 2 + s r s ) σ 2 + ( r 3 + 2 r s s r 2 s 2 ) σ 3 ) ) .
(b) 
The generating function of the Pauli ( r , s ) -Lucas polynomial quaternion Q p H n is
n = 0 z n Q p H n = 1 ( 1 r z s z 2 ) ( 2 . 1 + r σ 1 + σ 2 ( 2 s + r 2 ) + σ 3 ( r 3 + 3 r s ) + z ( ( r 2 s ) . 1 + ( r 2 + 2 s r s ) σ 1 + σ 2 ( r 3 + 3 r s 2 s 2 s r 2 ) + σ 3 ( r 4 + 4 r 2 s + 2 s 2 s r 3 3 r s 2 ) ) ) .
Proof. 
By taking Q p W n = Q p G n and Q p W n = Q p H n in Theorem 4, parts (a) and (b) follow directly. □
Next, we present a theorem concerning Q p W n and G n .
Theorem 5.
For all integers m , n , we have the following formulas:
Q p W n + m = Q p W n G m + 1 + s Q p W n 1 G m ,
i.e.,
Q p W n + m = Q p W m G n 1 + s Q p W m 1 G n .
Proof. 
The proof can be carried out by induction on m . First, we assume that m 1 .
If m = 1 , then Equation (17) holds. Since
Q p W n + 1 = r Q p W n + s Q p W n 1 = Q p W n G 2 + s Q p W n 1 G 1
where G 2 = r and G 1 = 1 . For m = 2 , (17) is true. As
Q p W n + 2 = r Q p W n + 1 + s Q p W n = r ( r Q p W n + s Q p W n 1 ) + s Q p W n = ( r 2 + s ) Q p W n + s Q p W n 1 = Q p W n G 3 + s Q p W n 1 G 2 .
Now, we assume that the equation holds for all m with 1 m k + 1 . Thus, by our assumption, for m = k and m = k + 1 , respectively, we have
Q p W n + k = Q p W n G k + 1 + s Q p W n 1 G k ,
Q p W n + k + 1 = Q p W n G k + 2 + s Q p W n 1 G k + 1 .
By using (6), (18) and (19), we have
Q p W n + k + 2 = r Q p W n + k + 1 + s Q p W n + k = r ( Q p W n G k + 2 + s Q p W n 1 G k + 1 ) + s ( Q p W n G k + 1 + s Q p W n 1 G k ) = Q p W n ( r G k + 2 + s G k + 1 ) + s Q p W n 1 ( r G k + 1 + s G k ) = Q p W n G k + 3 + s Q p W n 1 G k + 2
That means the equations hold for m = k + 2 .
Next, we assume that m 0 ; this implies m = m = v . For v = 0 , i.e., m = 0 , Equation (17) is true. Since
Q p W n = Q p W n G 1 + s Q p W n 1 G 0 ,
where G 0 = 0 and G 1 = 1 . For v = 1 , i.e., m = 1 , Equation (17) is true:
Q p W n 1 = Q p W n G 0 + s Q p W n 1 G 1 ,
where G 0 = 0 and G 1 = 1 s . Let Equation (17) hold for all m = m = v with 0 v k + 1 . Thus, by our assumption, for v = k and v = k + 1 , respectively, we have
Q p W n k = Q p W n G k + 1 + s Q p W n 1 G k ,
Q p W n k 1 = Q p W n G k + s Q p W n 1 G k 1 .
By using (7), (20) and (21), we have
Q p W n k 2 = r s Q p W n k 1 + 1 s Q p W n k = r s ( Q p W n G k + s Q p W n 1 G k 1 ) + 1 s ( Q p W n G k + 1 + s Q p W n 1 G k ) = Q p W n ( r s G k + 1 s G k + 1 ) + s Q p W n 1 ( r s G k 1 + 1 s G k ) = Q p W n G k 1 + s Q p W n 1 G k 2 .
So means Equation (17) holds for v = m = k + 2 .
Note that, if we take n = 1 and m = n 1 in Theorem 5, we have the following identity:
Q p W n = Q p W 1 G n + s Q p W 0 G n 1 .
Next, we give a theorem that provides some identities related to the Pauli ( r , s ) -Fibonacci polynomial quaternion Q p G n and the Pauli ( r , s ) -Lucas polynomial quaternion Q p H n .
Theorem 6.
For any integer n, the following equalities are true:
s 3 Q p H n = ( 3 r s + r 3 ) Q p G n + 4 + ( 4 r 2 s + r 4 + 2 s 2 ) Q p G n + 3 , s 2 Q p H n = ( 2 s + r 2 ) Q p G n + 3 ( 3 r s + r 3 ) Q p G n + 2 , s Q p H n = r Q p G n + 2 + ( 2 s + r 2 ) Q p G n + 1 , Q p H n = 2 Q p G n + 1 r Q p G n , Q p H n = r Q p G n + 2 s Q p G n 1 , ( r 2 s 3 + 4 s 4 ) Q p G n = ( 3 r s + r 3 ) Q p H n + 4 + ( 4 r 2 s + r 4 + 2 s 2 ) Q p H n + 3 , ( r 2 s 2 + 4 s 3 ) Q p G n = ( 2 s + r 2 ) Q p H n + 3 ( 3 r s + r 3 ) Q p H n + 2 , ( r 2 s + 4 s 2 ) Q p G n = r Q p H n + 2 + ( 2 s + r 2 ) Q p H n + 1 , ( r 2 + 4 s ) Q p G n = 2 Q p H n + 1 r Q p H n , ( r 2 + 4 s ) Q p G n = r Q p H n + 2 s Q p H n 1 .
Proof. 
Using (8) and (9), and s 3 H n = ( 3 r s + r 3 ) G n + 4 + ( 4 r 2 s + r 4 + 2 s 2 ) G n + 3 (for the proof, see Lemma 9 in [47], we have
s 3 Q p H n = s 3 H n 1 + s 3 H n + 1 σ 1 + s 3 H n + 2 σ 2 + s 3 H n + 3 σ 3 = ( ( 3 r s + r 3 ) G n + 4 + ( 4 r 2 s + r 4 + 2 s 2 ) G n + 3 ) 1 + ( ( 3 r s + r 3 ) G n + 5 + ( 4 r 2 s + r 4 + 2 s 2 ) G n + 4 ) σ 1 + ( ( 3 r s + r 3 ) G n + 6 + ( 4 r 2 s + r 4 + 2 s 2 ) G n + 5 ) σ 2 + ( ( 3 r s + r 3 ) G n + 6 + ( 4 r 2 s + r 4 + 2 s 2 ) G n + 6 ) σ 3 = ( 3 r s + r 3 ) ( G n + 4 1 + G n + 5 σ 1 + G n + 6 σ 2 + G n + 7 σ 3 ) + ( 4 r 2 s + r 4 + 2 s 2 ) ( ( G n + 3 1 + G n + 4 σ 1 + G n + 5 σ 2 + G n + 6 σ 3 ) ) = ( 3 r s + r 3 ) Q p G n + 4 + ( 4 r 2 s + r 4 + 2 s 2 ) Q p G n + 3 .
The other cases of the theorem can be proved using (8) and (9), and the equalities that are given in Lemma 9 in [47]. □
Theorem 7.
For all integers n, we have the following identity:
Q p W n Q p W n + 1 σ 1 Q p W n + 2 σ 2 Q p W n + 3 σ 3 = ( W n W n + 2 W n + 4 W n + 6 ) 1
Proof. 
Using (1) and (4), we obtain
Q p W n Q p W n + 1 σ 1 Q p W n + 2 σ 2 Q p W n + 3 σ 3 = W n 1 + W n + 1 σ 1 + W n + 2 σ 2 + W n + 3 σ 3 ( Q p W n + 1 Q p W n + 2 σ 1 Q p W n + 3 σ 2 Q p W n + 4 σ 3 ) σ 1 ( Q p W n + 2 Q p W n + 3 σ 1 Q p W n + 4 σ 2 Q p W n + 5 σ 3 ) σ 2 ( Q p W n + 3 Q p W n + 4 σ 1 Q p W n + 5 σ 2 Q p W n + 6 σ 3 ) σ 3 = W n 1 + W n + 1 σ 1 + W n + 2 σ 2 + W n + 3 σ 3 σ 1 Q p W n + 1 + σ 1 2 Q p W n + 2 + σ 2 σ 1 Q p W n + 3 + σ 3 σ 1 Q p W n + 4 σ 2 Q p W n + 2 + σ 2 2 Q p W n + 4 + σ 1 σ 2 Q p W n + 3 + σ 3 σ 2 Q p W n + 5 σ 3 Q p W n + 3 + σ 1 σ 3 Q p W n + 4 + σ 2 σ 3 Q p W n + 5 + σ 3 2 Q p W n + 6 = ( W n W n + 2 W n + 4 W n + 6 ) 1
Now, we give the Catalan’s identity for the generalized Pauli Fibonacci polynomial quaternions Q p W n .
Theorem 8
(Catalan’s identity). For all integer n, we have the following formula:
Q p W n + m Q p W n m Q p W n Q p W n = ( s ) n ( Q p W m Q p W m Q p W 0 Q p W 0 ) .
Proof. 
For the proof, we use Binet’s formula of the Q p W n and (5). We know that there are two cases for Binet’s formula of the generalized Pauli Fibonacci polynomial quaternions Q p W n . Therefore, we investigate the distinct roots case α β , using Theorem 3 (a); we have
Q p W n + m Q p W n m Q p W n Q p W n = ( α β ) n m p 1 p 2 α m β m α β 2 A 11 A 12 A 21 A 22 ,
where
A 11 = ( α m β m α β m + 1 + α m + 1 β + i α β m + 2 i α m + 2 β α 3 β m + α m β 3 + α m + 3 β m + 3 i α 2 β m + 1 + i α m + 1 β 2 α 2 β m + 2 + α m + 2 β 2 α 3 β m + 3 + α m + 3 β 3 ) ,
A 12 = ( α β m + 3 α m + 3 β i α 2 β m + i α m β 2 α m + 1 + i α m + 2 + β m + 1 i β m + 2 α 3 β m + 1 + α m + 1 β 3 i α 2 β m + 3 + i α 3 β m + 2 i α m + 2 β 3 + i α m + 3 β 2 + α β m α m β ) ,
A 21 = ( α β m + 3 α m + 3 β i α 2 β m + i α m β 2 + α m + 1 + i α m + 2 β m + 1 i β m + 2 α 3 β m + 1 + α m + 1 β 3 + i α 2 β m + 3 i α 3 β m + 2 + i α m + 2 β 3 i α m + 3 β 2 α β m + α m β ) ,
A 22 = ( α m β m α β m + 1 + α m + 1 β i α β m + 2 + i α m + 2 β + α 3 β m α m β 3 α m + 3 + β m + 3 + i α 2 β m + 1 i α m + 1 β 2 α 2 β m + 2 + α m + 2 β 2 α 3 β m + 3 + α m + 3 β 3 ) .
Similarly, we have
Q p W m Q p W m Q p W 0 Q p W 0 = ( α β ) m p 1 p 2 α m β m α β 2 A 11 A 12 A 21 A 22 .
Note that p 1 , p 2 are as stated in Theorem 1. Therefore, we have the result that we need. (Note that, using (11), we have α β = s . )
Now, we investigate the other root case. For the single root case α = β , using Theorem 3 (b), we have
Q p W n + m Q p W n m Q p W n Q p W n = α 2 n m D 2 2 B 11 B 12 B 21 B 22 ,
where
B 11 = m 2 i α 3 + m α 2 + 2 m α 3 + m α 4 + m α 6 ,
B 12 = 2 α i α 4 + 2 α 3 i m α + m ,
B 21 = 2 α i α 4 2 α 3 + i m α + m ,
B 22 = m + 2 i α 3 + m α 2 2 m α 3 + m α 4 + m α 6 .
Similarly, we have
Q p W m Q p W m Q p W 0 Q p W 0 = m D 2 2 B 11 B 12 B 21 B 22 ,
where D 1 , D 2 are as stated in Theorem 1. Therefore, we get the result that we need. (Note that, using (11), we have α 2 = s . ) □
This equality is non-commutative, meaning that the order in which the operations are performed affects the result. In other words, the terms involved in the equation do not commute, and switching the order of operations will generally lead to a different outcome. This non-commutativity arises due to the properties of the quaternionic operations and the specific structure of the generalized Pauli Fibonacci polynomials involved in the identity.
Next, we give the Cassani’s identity for the generalized Pauli Fibonacci polynomial quaternions Q p W n .
Theorem 9
(Cassini’s identity). For all integers n, we have the following formula:
Q p W n + 1 Q p W n 1 Q p W n Q p W n = ( s ) n ( Q p W 1 Q p W 1 Q p W 0 Q p W 0 ) .
Proof. 
Taking m = 1 in Theorem 8, the proof can be completed. □
Next, we present the Simpson formula for the generalized Pauli Fibonacci polynomial quaternions Q p W n .
Theorem 10
(Simpson Formula). For all integer n, we have the following formula:
Q p W n + 1 Q p W n Q p W n Q p W n 1 = s 2 n Q p W 1 Q p W 0 Q p W 0 Q p W 1
Proof. 
Using Theorem 9, and properties of the 2 × 2 block matrix, we have
Q p W n + 1 Q p W n Q p W n Q p W n 1 = det ( Q p W n + 1 Q p W n 1 Q p W n Q p W n ) = det ( ( s ) n ( Q p W 1 Q p W 1 Q p W 0 Q p W 0 ) ) = s 2 n det ( ( Q p W 1 Q p W 1 Q p W 0 Q p W 0 ) ) = s 2 n Q p W 1 Q p W 0 Q p W 0 Q p W 1 .

3. Linear Sum Formulas

In this section, we present some sum formulas related to the generalized Pauli Fibonacci polynomial quaternions Q p W n . The following theorem presents some summation formulas of generalized Pauli Fibonacci polynomial quaternions Q p W n with positive subscripts.
Theorem 11.
Let x be a complex number. For n 0 , we have the following formulas:
(a) 
If s x 2 + r x 1 0 then
k = 0 n x k Q p W k = x n + 2 Q p W n + 2 + x n + 1 ( 1 r x ) Q p W n + 1 x Q p W 1 + ( r x 1 ) Q p W 0 s x 2 + r x 1 .
(b) 
If r 2 x s 2 x 2 + 2 s x 1 0 then
k = 0 n x k Q p W 2 k = x n + 1 s x 1 Q p W 2 n + 2 + r s x n + 2 Q p W 2 n + 1 r x Q p W 1 + ( r 2 x + s x 1 ) Q p W 0 r 2 x s 2 x 2 + 2 s x 1 .
(c) 
If r 2 x s 2 x 2 + 2 s x 1 0 then
k = 0 n x k Q p W 2 k + 1 = r x n + 1 Q p W 2 n + 2 s x n + 1 s x 1 Q p W 2 n + 1 + ( s x 1 ) Q p W 1 r s x Q p W 0 r 2 x s 2 x 2 + 2 s x 1 .
Proof. 
(a) Using the recurrence relation
Q p W n = r Q p W n 1 + s Q p W n 2 ,
i.e.,
s Q p W n 2 = Q p W n r Q p W n 1 ,
we obtain
s x 1 Q p W 1 = x 1 Q p W 3 r x 1 Q p W 2 s x 2 Q p W 2 = x 2 Q p W 4 r x 2 Q p W 3 s x n 1 Q p W n 1 = x n 1 Q p W n + 1 r x n 1 Q p W n s x n Q p W n = x n Q p W n + 2 r x n Q p W n + 1 .
By adding the equations side by side, we obtain
k = 0 n x k Q p W k = x n + 2 Q p W n + 2 + x n + 1 ( 1 r x ) Q p W n + 1 x Q p W 1 + ( r x 1 ) Q p W 0 s x 2 + r x 1 .
(b) and (c) Using the recurrence relation
Q p W n = r Q p W n 1 + s Q p W n 2
i.e.,
r Q p W n 1 = Q p W n s Q p W n 2
we obtain
r x 1 Q p W 3 = x 1 Q p W 4 s x 1 Q p W 2 r x 2 Q p W 5 = x 2 Q p W 6 s x 2 Q p W 4 r x 3 Q p W 7 = x 3 Q p W 8 s x 3 Q p W 6 r x n 1 Q p W 2 n 1 = x n 1 Q p W 2 n s x n 1 Q p W 2 n 2 r x n Q p W 2 n + 1 = x n Q p W 2 n + 2 s x n Q p W 2 n .
Now, if we add the above equations side by side, we get
r ( Q p W 1 + k = 0 n x k Q p W 2 k + 1 ) = ( x n Q p W 2 n + 2 Q p W 2 x 1 Q p W 0 + k = 0 n x k 1 Q p W 2 k ) s ( Q p W 0 + k = 0 n x k Q p W 2 k ) .
Similarly, using the recurrence relation
Q p W n = r Q p W n 1 + s Q p W n 2
i.e.,
r Q p W n 1 = Q p W n s Q p W n 2
we write the following clear equations:
r x 1 Q p W 2 = x 1 Q p W 3 s x 1 Q p W 1 , r x 2 Q p W 4 = x 2 Q p W 5 s x 2 Q p W 3 , r x 3 Q p W 6 = x 3 Q p W 7 s x 3 Q p W 5 , r x n 1 Q p W 2 n 2 = x n 1 Q p W 2 n 1 s x n 1 Q p W 2 n 3 , r x n Q p W 2 n = x n Q p W 2 n + 1 s x n Q p W 2 n 1 .
Now, if we add the above equations side by side, we obtain
r ( Q p W 0 + k = 0 n x k Q p W 2 k ) = ( Q p W 1 + k = 0 n x k Q p W 2 k + 1 ) s ( x n + 1 Q p W 2 n + 1 + k = 0 n x k + 1 Q p W 2 k + 1 ) .
Then, solving system (24) and (25), the required result of (b) and (c) follow. □
The following corollary gives the sum formulas related to the Pauli ( r , s ) -Fibonacci polynomial quaternion Q p G n and the Pauli ( r , s ) -Lucas polynomial quaternion Q p H n .
Corollary 3.
The following sum formulas are given:
(a) 
If s x 2 + r x 1 0 , then we have the following sum formula for the Pauli ( r , s ) -Fibonacci polynomial quaternion Q p G n :
(1) 
k = 0 n x k Q p G k = 1 s x 2 + r x 1 ( x n + 2 Q p G n + 2 + x n + 1 ( 1 r x ) Q p G n + 1 x 1 σ 1 + ( r s x ) σ 2 s + r 2 + r s x σ 3 ) .
(2) 
k = 0 n x k Q p G 2 k = 1 r 2 x s 2 x 2 + 2 s x 1 ( x n + 1 s x 1 Q p G 2 n + 2 + r s x n + 2 Q p G 2 n + 1 r x 1 + ( s x 1 ) σ 1 r σ 2 s s 2 x + r 2 σ 3 ) .
(3) 
k = 0 n x k Q p G 2 k + 1 = 1 r 2 x s 2 x 2 + 2 s x 1 ( r x n + 1 Q p G 2 n + 2 s x n + 1 s x 1 Q p G 2 n + 1 + ( s x 1 ) 1 r σ 1 s s 2 x + r 2 σ 2 r 2 s s 2 x + r 2 σ 3 ) .
(b) 
If s x 2 + r x 1 0 , then we have the following sum formula for the Pauli ( r , s ) -Lucas polynomial quaternion Q p H n :
(1) 
k = 0 n x k Q p H k = 1 s x 2 + r x 1 ( x n + 2 Q p H n + 2 + x n + 1 ( 1 r x ) Q p H n + 1 + ( r x 2 ) 1 r + 2 s x σ 1 2 s + r 2 + r s x σ 2 2 s 2 x + 3 r s + r 3 + r 2 s x σ 3 ) .
(2) 
k = 0 n x k Q p H 2 k = 1 r 2 x s 2 x 2 + 2 s x 1 ( x n + 1 s x 1 Q p H 2 n + 2 + r s x n + 2 Q p H 2 n + 1 + ( r 2 x + 2 s x 2 ) 1 r s x + 1 σ 1 2 s 2 s 2 x + r 2 σ 2 r 3 s s 2 x + r 2 σ 3 ) .
(3) 
k = 0 n x k Q p H 2 k + 1 = 1 r 2 x s 2 x 2 + 2 s x 1 ( r x n + 1 Q p H 2 n + 2 s x n + 1 s x 1 Q p H 2 n + 1 r ( 1 + s x ) 1 2 s 2 s 2 x + r 2 σ 1 r 3 s s 2 x + r 2 σ 2 4 r 2 s 2 s 3 x + r 4 + 2 s 2 r 2 s 2 x σ 3 ) .
Proof. 
(a) and (b) Taking Q p W n = Q p G n and Q p W n = Q p H n in Theorem 11, the proof is completed. □

The Case x = 1

In this subsection, we investigate the case x = 1 , r = 1 , s = 2 , i.e., r 2 x s 2 x 2 + 2 s x 1 = 0 .
Observe that setting x = 1 , r = 1 , s = 2 (i.e., for the generalized Pauli Jacobsthal quaternion that can be denoted the Q p J n case) in Theorem 11 (b) and (c) makes the right-hand side of the sum formulas to be an indeterminate form. Application of L’Hospital rule, however, provides the evaluation of the sum formulas. If r = 1 , s = 2 , then we have the following theorem.
Theorem 12.
If r = 1 , s = 2 , then for n 0 , we have the following formulas:
(a) 
k = 0 n Q p J k = 1 2 ( Q p J n + 2 Q p J 1 ) .
(b) 
k = 0 n Q p J 2 k = 1 3 ( n + 3 Q p J 2 n + 2 2 n + 2 Q p J 2 n + 1 + Q p J 1 3 Q p J 0 ) .
(c) 
k = 0 n Q p J 2 k + 1 = 1 3 ( n + 1 Q p J 2 n + 2 + 2 n + 3 Q p J 2 n + 1 2 Q p J 1 + 2 Q p J 0 ) .
Proof. 
(a)
Taking x = 1 , r = 1 , s = 2 in Theorem 11 (a), we obtain the desired identity.
(b)
The proof of this part is carried out using Theorem 11 (b). Setting r = 1 , s = 2 in Theorem 11 (b), we obtain
k = 0 n x k Q p J 2 k = x n + 1 2 x 1 Q p J 2 n + 2 + 2 x n + 2 Q p J 2 n + 1 x Q p J 1 + 3 x 1 Q p J 0 4 x 2 + 5 x 1 .
For x = 1 , the right-hand side of the above summation formulas becomes an indeterminate form. Now, we apply L’Hospital rule. Then, we get
k = 0 n Q p J 2 k = d d x ( x n + 1 2 x 1 Q p J 2 n + 2 + 2 x n + 2 Q p J 2 n + 1 x Q p J 1 + 3 x 1 Q p J 0 ) d d x ( 4 x 2 + 5 x 1 ) x = 1 = 1 3 ( n + 3 Q p J 2 n + 2 2 n + 2 Q p J 2 n + 1 + Q p J 1 3 Q p J 0 ) .
(c)
We apply Theorem 11 (c). From Theorem 11 (c), with r = 1 , s = 2 , it follows that
k = 0 n x k Q p J 2 k + 1 = x n + 1 Q p J 2 n + 2 2 x n + 1 2 x 1 Q p J 2 n + 1 + 2 x 1 Q p J 1 2 x Q p J 0 4 x 2 + 5 x 1 .
For x = 1 , the right-hand side of the above summation formulas results in an indeterminate form. Now, we can employ L’Hospital rule. Consequently, we obtain
k = 0 n Q p J 2 k + 1 = d d x ( x n + 1 Q p J 2 n + 2 2 x n + 1 2 x 1 Q p J 2 n + 1 + 2 x 1 Q p J 1 2 x Q p J 0 ) d d x ( 4 x 2 + 5 x 1 ) x = 1 = 1 3 ( n + 1 Q p J 2 n + 2 + 2 n + 3 Q p J 2 n + 1 2 Q p J 1 + 2 Q p J 0 ) .

4. Matrices Associated with Generalized Pauli Fibonacci Polynomial Quaternions Q p W n

In this part of our study, we give some identities on some matrices linked to the Generalized Pauli Fibonacci polynomial quaternions Q p W n . First, we assume that A = r s 1 0 and N Q p W n = Q p W 2 Q p W 1 Q p W 1 Q p W 0 . Hence, we have the following identity:
A n = G n + 1 s G n G n s G n 1 .
For the proof, see Soykan [47].
Therefore, we obtain the following theorem associated with the matrix A and N Q p W n .
Theorem 13.
For all integer n, we have the following identity:
A n N Q p W n = Q p W n + 2 Q p W n + 1 Q p W n + 1 Q p W n .
Proof. 
Using identity (22) and properties of Generalized Pauli Fibonacci polynomial quaternions Q p W n , we obtain
A n N Q p W n = G n + 1 s G n G n s G n 1 Q p W 2 Q p W 1 Q p W 1 Q p W 0 = W 2 Q p G n + 1 + s Q p W 1 G n Q p W 1 G n + 1 + s Q p W 0 G n Q p W 2 G n + s Q p W 1 G n 1 Q p W 1 G n + s Q p W 0 G n 1 = Q p W n + 2 Q p W n + 1 Q p W n + 1 Q p W n .
Remark 1.
By taking the Generalized Pauli Fibonacci polynomial quaternions Q p W n as the Pauli ( r , s ) -Fibonacci polynomial quaternion Q p G n and the Pauli ( r , s ) -Lucas polynomial quaternion Q p H n , respectively, we obtain matrices N Q p G n , N Q p H n as follows:
N Q p G n = Q p G 2 Q p G 1 Q p G 1 Q p G 0 .
N Q p H n = Q p H 2 Q p H 1 Q p H 1 Q p H 0 .
From Theorem 13, we have the following corollary.
Corollary 4.
For all integer n, we have the following results:
(a) 
A n N Q p G n = Q p G n + 2 Q p G n + 1 Q p G n + 1 Q p G n
(b) 
A n N Q p H n = Q p H n + 2 Q p H n + 1 Q p H n + 1 Q p H n
Proof. 
Taking Q p W n = Q p G n and Q p W n = Q p H n in Theorem 13, (a) and (b) follow.
Based on our theoretical perspective, we considered that the terms of the matrix we defined, being related to
Q p W n = W n 1 + W n + 1 σ 1 + W n + 2 σ 2 + W n + 3 σ 3 ,
correspond to the Hamiltonian of a spin-1/2 particle in a magnetic field. In this context, if generalized Fibonacci polynomials, or more specifically Fibonacci numbers, are used in the following equation,
H n = W n 1 + i = 1 3 W n + i σ i .
The terms W n + i σ i may be interpreted as components of a magnetic field that vary with time or state, while the term W n 1 can be viewed as a scalar contribution shifting the total energy. □

5. Conclusions

In this paper, a modification of generalized Fibonacci polynomials is established by combining the concepts of quaternion and Pauli matrix. It is expected that this study will attract the attention of experts who will conduct research in both physics and mathematics. The generalized Fibonacci properties and polynomials containing elements in the sense of Pauli matrix and quaternion introduced in this paper can be evaluated in terms of investigating the suitability of quaternion structures for studies in physics, such as the reformulation of Dirac and Maxwell equations. The (r,s)-extensions of the Fibonacci and Lucas sequences presented in this study were introduced to demonstrate the algebraic flexibility and generalization capacity of the proposed structure. These formulations not only extend the classical Fibonacci and Lucas sequences within a quaternionic framework but also align with established generalization procedures in the literature. In doing so, they reinforce the theoretical soundness of the approach and highlight its potential for broader algebraic applications. In conclusion, this study introduces a novel generalization by incorporating Pauli matrices into the framework of Generalized Pauli Fibonacci Polynomial Quaternions (GPFPQs). This integration enriches the algebraic structure by merging the recursive nature of Fibonacci polynomials with the non-commutative and anti-commutative properties of Pauli matrices. As a result, the proposed structure is particularly effective in modeling quantum mechanical systems, especially in the fields of spin dynamics, entanglement, and unitary transformations. Moreover, the Pauli-based extension opens up new potential applications in quantum information theory, such as quantum state representation and encoding, as well as in classical cryptography where matrix-based operations and structural complexity are highly valued. This approach not only generalizes existing quaternion models but also establishes a connection between number theory, operator theory, and quantum computation, providing a more comprehensive mathematical toolset for future research. In future work, one can try to relate matrix polynomials to the concept we have presented, and try to relate it to structures such as the pseudo Hermitian operator representation using [71].

Author Contributions

Supervision, Y.S.; Validation, Y.S. and N.G.B.; Methodology, Y.S. and N.G.B.; Investigation, Y.S., B.Y. and N.G.B.; Conceptualization, Y.S. and N.G.B.; Formal analysis Y.S. and B.Y.; Writing—review and editing, B.Y. and N.G.B.; Writing—original draft, B.Y.; Data curation, B.Y.; Software B.Y.; Resources, N.G.B. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

All data generated or analyzed during this study are included in this published article.

Acknowledgments

Authors would like to express their gratitude to the Editor and Associate Editor for their meticulous and insightful suggestions and comments, which significantly improved the quality of the research.

Conflicts of Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

References

  1. Nagashima, Y. Elementary Particle Physics: Quantum Field Theory and Particles; John Wiley & Sons: New York, NY, USA, 2011; Volume 1, p. 3. [Google Scholar]
  2. Dunlap, R.A. Particle Physics; Morgan & Claypool Publishers: San Rafael, CA, USA, 2018; pp. 1–3. [Google Scholar]
  3. Thomson, J.J. On the Nature of the Electron. Philos. Mag. 1987, 44, 293. [Google Scholar] [CrossRef]
  4. Chadwick, J. The Discovery of the Neutron. Proc. R. Soc. Lond. A 1932, 136, 692. [Google Scholar]
  5. Fermi, E. Versuch einer Theorie der β-Strahlen. Z. Phys. 1934, 88, 161–177. [Google Scholar] [CrossRef]
  6. Yukawa, H. On the Interaction of Elementary Particles I. Proc. Phys. Math. Soc. Jpn. 1935, 17, 48–57. [Google Scholar]
  7. Leader, E. Spin in Particle Physics; Cambridge University Press: Cambridge, UK, 2001; p. xiv–8. [Google Scholar]
  8. Bandyopadhyay, S.; Cahay, M. Introduction to Spintronics; CRC Press: Boca Raton, FL, USA, 2008; pp. 1–2. [Google Scholar]
  9. Feynman, R.P.; Leighton, R.B.; Sands, M. The Feynman Lectures on Physics; Addison-Wesley: Reading, MA, USA, 1965; Volume 3, pp. 4–5. [Google Scholar]
  10. Landau, L.D.; Lifshitz, E.M. Quantum Mechanics (Non-Relativistic Theory), 3rd ed.; Pergamon: New York, NY, USA, 2013; p. 198. [Google Scholar]
  11. Griffiths, D.J. Introduction to Quantum Mechanics; Prentice Hall: Upper Saddle River, NJ, USA, 1995; p. 179. [Google Scholar]
  12. Fushchich, W.I.; Nikitin, A.G.; Salogub, V.A. On the Equations of Motion for Particles with Arbitrary Spin in Non-relativistic Mechanics. Lett. Nuovo Cimento 1975, 14, 483–488. [Google Scholar] [CrossRef]
  13. Morrison, M. Spin: All Is Not What It Seems. Stud. Hist. Philos. Sci. Part B 2007, 38, 529–557. [Google Scholar] [CrossRef]
  14. Boehmer, C.G.; Burnett, J.; Mota, D.F.; Shaw, D.J. Dark Spinor Models in Gravitation and Cosmology. J. High Energy Phys. 2010, 2010, 1–43. [Google Scholar] [CrossRef]
  15. Vaz, J., Jr.; da Rocha, R., Jr. An Introduction to Clifford Algebras and Spinors; Oxford University Press: Oxford, UK, 2016. [Google Scholar]
  16. Figueiredo, V.L.; Capelas de Oliveira, E.; Rodrigues, W.A. Covariant, Algebraic, and Operator Spinors. Int. J. Theor. Phys. 1990, 29, 371–395. [Google Scholar] [CrossRef]
  17. Brauer, R.; Weyl, H. Spinors in n Dimensions. Am. J. Math. 1935, 57, 425. [Google Scholar] [CrossRef]
  18. Cartan, E. Theory of Spinors; Dover: New York, NY, USA, 1966. [Google Scholar]
  19. Chevalley, C. The Algebraic Theory of Spinors; Columbia University Press: New York, NY, USA, 1954. [Google Scholar]
  20. Graf, W. Differential Forms as Spinors. Ann. Inst. Henri Poincaré 1978, 29, 85. [Google Scholar]
  21. Riesz, M. Clifford Numbers and Spinors; Lecture Notes No. 38; Institute for Fluid Mechanics and Applied Mathematics, University of Maryland: College Park, MD, USA, 1958. [Google Scholar]
  22. Hestenes, D.; Sobezyk, G. Clifford Algebra to Geometrical Calculus; D. Reidel: Dordrecht, The Netherlands, 1984. [Google Scholar]
  23. Varlamov, V.V. Spinor Structure and Internal Symmetries. Int. J. Theor. Phys. 2015, 54, 3533–3576. [Google Scholar] [CrossRef]
  24. Gell-Mann, M. Symmetries of Baryons and Mesons. Phys. Rev. 1962, 125, 1067–1084. [Google Scholar] [CrossRef]
  25. Ne’eman, Y. Derivation of Strong Interactions from a Gauge Invariance. Nucl. Phys. 1961, 26, 222–229. [Google Scholar] [CrossRef]
  26. Wrede, R.C. Introduction to Vector and Tensor Analysis; Courier Corporation: New York, NY, USA, 2013. [Google Scholar]
  27. Corben, H.C.; Stehle, P. Classical Mechanics, 2nd ed.; John Wiley & Sons: New York, NY, USA, 1960. [Google Scholar]
  28. Montague, B.W. An Introduction to Spinor Algebra for Polarized Beams; CLRN/ISR-TH/80-02; CERN: Geneva, Switzerland, 1981. [Google Scholar]
  29. Hamilton, W.R. On a New Species of Imaginary Quantities Connected with a Theory of Quaternions. Proc. R. Ir. Acad. 1843, 2, 424–434. [Google Scholar]
  30. Tait, P.G.; Kelland, P. Introduction to Quaternions with Numerous Examples; Macmillan and Co., Ltd.: Frankfurt, Germany, 2024. [Google Scholar]
  31. Herath, D.; St-Onge, D. Foundations of Robotics: A Multidisciplinary Approach with Python and ROS; Springer Nature: Cham, Switzerland, 2022; p. 543. [Google Scholar]
  32. Perumal, L. Representing Rotation in Simulink Using Quaternion. Appl. Math. 2014, 8, 267–272. [Google Scholar] [CrossRef]
  33. Eric, M.J.; Paul, F. Apollo Lunar Surface Journal: Gimbal Angles, Gimbal Lock, and a Fourth Gimbal for Christmas. Available online: http://www.hq.nasa.gov/alsj/gimbals.html (accessed on 5 May 2025).
  34. Hladik, J. Spinors in Physics; Springer Science & Business Media: Berlin/Heidelberg, Germany, 1999; pp. 1–183. [Google Scholar]
  35. Dirac, P.A.M. The Quantum Theory of the Electron. Proc. R. Soc. Lond. A 1928, 117, 610–624. [Google Scholar]
  36. Pauli, W. Zur Quantenmechanik des magnetischen Elektrons. Z. Phys. 1927, 43, 601–623. [Google Scholar] [CrossRef]
  37. Barley, K.; Vega-Guzmán, J.; Ruñg, A.; Suslov, S.K. Discovery of the Relativistic Schrödinger Equation. Phys. Uspekhi 2022, 65, 90. [Google Scholar] [CrossRef]
  38. Vivarelli, M.D. Development of Spinor Descriptions of Rotational Mechanics from Euler’s Rigid Body Displacement Theorem. Celest. Mech. 1984, 32, 193–207. [Google Scholar] [CrossRef]
  39. Baez, J.C. Division Algebras and Quantum Theory. Found. Phys. 2012, 42, 819–855. [Google Scholar] [CrossRef]
  40. Jafari, M.; Yaylı, Y. Generalized Quaternions and Their Algebraic Properties. Commun. Fac. Sci. Univ. Ank. Ser. A1 2015, 64, 15–27. [Google Scholar]
  41. Szynal-Liana, A.; Włoch, I. Generalized Commutative Quaternions of the Fibonacci Type. Bol. Soc. Mat. Mex. 2022, 28, 1. [Google Scholar] [CrossRef]
  42. Kim, J.E. A Representation of de Moivre’s Formula over Pauli-Quaternions. Fibonacci Q. 2017, 9, 145–151. [Google Scholar]
  43. Longe, P. The Properties of the Pauli Matrices A, B, C and the Conjugation of Charge. Physica 1966, 32, 603–610. [Google Scholar] [CrossRef]
  44. Arfken, G. Mathematical Methods for Physicists; Academic Press: Orlando, FL, USA, 1985; pp. 98–116. [Google Scholar]
  45. Iyer, M.R. A Note on Fibonacci Quaternions. Fibonacci Q. 1969, 7, 225–229. [Google Scholar] [CrossRef]
  46. Horadam, A.F. A Generalized Fibonacci Sequence. Am. Math. Mon. 1961, 68, 455–459. [Google Scholar] [CrossRef]
  47. Soykan, Y. On Generalized Fibonacci Polynomials: Horadam Polynomials. Earthline J. Math. Sci. 2023, 11, 23–114. [Google Scholar] [CrossRef]
  48. Soykan, Y. On Generalized (r, s)-numbers. Int. J. Adv. Appl. Math. Mech. 2020, 8, 1–14. [Google Scholar]
  49. Halici, S. On Fibonacci Quaternions. Adv. Appl. Clifford Algebras 2012, 22, 321–327. [Google Scholar] [CrossRef]
  50. Horadam, A.F. Complex Fibonacci Numbers and Fibonacci Quaternions. Am. Math. Mon. 1963, 70, 289–291. [Google Scholar] [CrossRef]
  51. Kizilates, C.; Kone, T. On Fibonacci quaternions. J. Anal. 2021, 29, 1071–1082. [Google Scholar] [CrossRef]
  52. Çolak, E.G.; Gönül Bilgin, N.; Soykan, Y. On Generalized Fibospinomials: Generalized Fibonacci Polynomial Spinors. Symmetry 2024, 16, 694. [Google Scholar] [CrossRef]
  53. Akyigit, M.; Koksal, H.H.; Tosun, M. Fibonacci Generalized Quaternions. Adv. Appl. Clifford Algebras 2014, 24, 631–641. [Google Scholar] [CrossRef]
  54. Tan, E.; Yilmaz, S.; Sahin, M. On a New Generalization of Fibonacci Quaternions. Chaos Solitons Fractals 2016, 82, 1–4. [Google Scholar] [CrossRef]
  55. Polatli, E. A Generalization of Fibonacci and Lucas Quaternions. Adv. Appl. Clifford Algebras 2016, 26, 719–730. [Google Scholar] [CrossRef]
  56. Halici, S. On a Generalization for Quaternion Sequences. arXiv 2016, arXiv:1611.07660. [Google Scholar]
  57. Prasad, K.; Kumari, M.; Kızılteş, C. Some Properties and Identities of Hyperbolic Generalized k-Horadam Quaternions and Octonions. Commun. Combin. Optim. 2024, 9, 707–724. [Google Scholar]
  58. Yılmaz, F.; Özkan, M. On the Generalized Gaussian Fibonacci Numbers and Horadam Hybrid Numbers: A Unified Approach. Axioms 2022, 11, 255. [Google Scholar] [CrossRef]
  59. Aydın, F.T. Pauli–Fibonacci Quaternions. Notes Number Theory Discret. Math. 2021, 27, 184–193. [Google Scholar] [CrossRef]
  60. Azak, A.Z. Pauli Gaussian Fibonacci and Pauli Gaussian Lucas Quaternions. Mathematics 2022, 10, 4655. [Google Scholar] [CrossRef]
  61. İsbilir, Z.; Akyiğit, M.; Tosun, M. Pauli–Leonardo Quaternions. Notes Number Theory Discret. Math. 2023, 29, 1–16. [Google Scholar] [CrossRef]
  62. İsbilir, Z.; Yazıcı, B.D.; Tosun, M. Incomplete Generalized (p, q, r)-Tribonacci Pauli Quaternion Polynomials. 2023. Available online: https://www.researchgate.net/profile/Zehra-Isbilir/publication/373019532 (accessed on 3 June 2025).
  63. Horadam, A.F. Quaternion Recurrence Relations. Ulam Q. 1993, 2, 23–33. [Google Scholar]
  64. Gandhi, B.K.; Sekhar, A.C.; Srilakshmi, S. Encryption of Data Streams Using Pauli Spin 12 Matrices and Finite State Machine. Int. J. Comput. Appl. 2012, 37, 8–12. [Google Scholar]
  65. Kumar, D.S.; Sirisha, P.; Suneetha, C. Secure Cryptosystem Based on Braiding/Entanglement of Pauli 3/2 Matrices. Int. J. Comput. Appl. 2016, 143, 37–42. [Google Scholar]
  66. Liu, W.; Chen, J.; Yu, W.; Liu, Z.; Chen, H. A Unitary Operator Construction Solution Based on Pauli Group for Maximal Dense Coding with a Class of Symmetric States. Quantum Inf. Process. 2020, 19, 231. [Google Scholar] [CrossRef]
  67. Guo, Y.; Zeng, G.; Lee, M. Fast Constructions of Quantum Codes Based on Residues Pauli Block Matrices. Adv. Math. Phys. 2010, 2010, 469124. [Google Scholar] [CrossRef]
  68. Ma, G.; Li, H. Quantum Fully Homomorphic Encryption by Integrating Pauli One-Time Pad with Quaternions. Quantum 2022, 6, 866. [Google Scholar] [CrossRef]
  69. Chamberland, C.; Iyer, P.; Poulin, D. Fault-Tolerant Quantum Computing in the Pauli or Clifford Frame with Slow Error Diagnostics. Quantum 2018, 2, 43. [Google Scholar] [CrossRef]
  70. Asci, M.; Aydinyuz, S. k-Order Fibonacci Polynomials on AES-Like Cryptology. CMES–Comput. Model. Eng. Sci. 2022, 131, 277–293. [Google Scholar] [CrossRef]
  71. Abraham, S.; Bhagwat, A.A. PT-Symmetry in 2 × 2 Matrix Polynomials Formed by Pauli Matrices. arXiv 2024, arXiv:2412.04022. [Google Scholar]
Table 1. The first few generalized Pauli Fibonacci polynomial quaternions with positive subscripts.
Table 1. The first few generalized Pauli Fibonacci polynomial quaternions with positive subscripts.
n Q p W n
0 W 0 1 + s σ 2 + r s σ 3 + W 1 σ 1 + r σ 2 + s σ 3 + r 2 σ 3
1 s W 0 σ 1 + r σ 2 + ( s + r 2 ) σ 3 + W 1 1 + r σ 1 + ( s + r 2 ) σ 2 + ( r 3 + 2 r s ) σ 3
2 s W 0 1 + r σ 1 + ( s + r 2 ) σ 2 + ( r 3 + 2 r s ) σ 3 + W 1 r 1 + ( s + r 2 ) σ 1 + ( r 3 + 2 r s ) σ 2 + ( r 4 + s 2 + 3 r 2 s ) σ 3
3 s W 0 r 1 + ( s + r 2 ) σ 1 + ( r 3 + 2 r s ) σ 2 + ( r 4 + s 2 + 3 r 2 s ) σ 3 + W 1 ( s + r 2 ) 1 + ( r 3 + 2 r s ) σ 1 + ( r 4 + 3 r 2 s + s 2 ) σ 2 + ( r 5 + 3 r s 2 + 4 r 3 s ) σ 3
4 s W 0 ( s + r 2 ) 1 + ( r 3 + 2 r s ) σ 1 + ( r 4 + s 2 + 3 r 2 s ) σ 2 + ( r 5 + 3 r s 2 + 4 r 3 s ) σ 3 + W 1 ( r 3 + 2 r s ) 1 + ( r 4 + s 2 + 3 r 2 s ) σ 1 + ( r 5 + 3 r s 2 + 4 r 3 s ) σ 2 + ( s 3 + r 6 + 6 r 2 s 2 + 5 r 4 s ) σ 3
5 s W 0 ( r 3 + 2 r s ) 1 + ( r 4 + s 2 + 3 r 2 s ) σ 1 + ( r 5 + 3 r s 2 + 4 r 3 s ) σ 2 + ( s 3 + r 6 + 6 r 2 s 2 + 5 r 4 s ) σ 3 + W 1 ( ( r 4 + s 2 + 3 r 2 s ) 1 + ( 3 r s 2 + r 5 + 4 r 3 s ) σ 1 + ( s 3 + r 6 + 6 r 2 s 2 + 5 r 4 s ) σ 2 + ( r 7 + 10 r 3 s 2 + 4 r s 3 + 6 r 5 s ) σ 3 )
Table 2. The first few generalized Pauli Fibonacci polynomial quaternions with positive subscripts for the case r = 2 and s = 1 .
Table 2. The first few generalized Pauli Fibonacci polynomial quaternions with positive subscripts for the case r = 2 and s = 1 .
n Q p W n
0 W 0 1 + σ 2 + 2 σ 3 + W 1 σ 1 + 2 σ 2 + σ 3 + 4 σ 3
1 W 0 σ 1 + 2 σ 2 + 5 σ 3 + W 1 1 + 2 σ 1 + 5 σ 2 + 12 σ 3
2 W 0 1 + 2 σ 1 + 5 σ 2 + 12 σ 3 + W 1 2 . 1 + 5 σ 1 + 12 σ 2 + 29 σ 3
3 W 0 2 . 1 + 5 σ 1 + 12 σ 2 + 29 σ 3 + W 1 ( 5 . 1 + 12 σ 1 + 29 σ 2 + ( r 5 + 3 r s 2 + 4 r 3 s ) σ 3
4 W 0 5 . 1 + 12 σ 1 + 29 σ 2 + 70 σ 3 + W 1 12 . 1 + 29 σ 1 + 70 σ 2 + 169 σ 3
5 W 0 12 . 1 + 29 σ 1 + 70 σ 2 + 169 σ 3 + W 1 ( 29 . 1 + 70 σ 1 + 169 σ 2 + 408 σ 3 )
Table 3. The first few generalized Pauli Fibonacci polynomial quaternions Q p W n with negative subscripts.
Table 3. The first few generalized Pauli Fibonacci polynomial quaternions Q p W n with negative subscripts.
n Q p W n
0 W 0 1 + s σ 2 + r s σ 3 + W 1 σ 1 + r σ 2 + s σ 3 + r 2 σ 3
1 ( r s 1 + σ 1 + s σ 3 ) W 0 + ( 1 s 1 + σ 2 + r σ 3 ) W 1
2 ( ( 1 s + r 2 s 2 ) 1 r s σ 1 + σ 2 ) W 0 + ( r s 2 1 + 1 s σ 1 + σ 3 ) W 1
3 ( ( r 3 s 3 2 r s 2 ) 1 + ( 1 s + r 2 s 2 ) σ 1 r s σ 2 + σ 3 ) W 0 + ( ( 1 s 2 + r 2 s 3 ) 1 r s 2 σ 1 + 1 s σ 2 ) W 1
4 ( ( 3 r 2 s 3 + r 4 s 4 + 1 s 2 ) 1 + ( r 3 s 3 2 r s 2 ) σ 1 + ( 1 s + r 2 s 2 ) σ 2 r s σ 3 ) W 0 + ( ( r 3 s 4 2 r s 3 ) 1 + ( 1 s 2 + r 2 s 3 ) σ 1 r s 2 σ 2 + 1 s σ 3 ) W 1
5 ( ( 4 r 3 s 4 r 5 s 5 3 r s 3 ) 1 + ( 1 s 2 + 3 r 2 s 3 + r 4 s 4 ) σ 1 + ( r 3 s 3 2 r s 2 ) σ 2 + ( 1 s + r 2 s 2 ) σ 3 ) W 0 + ( ( 1 s 3 + 3 r 2 s 4 + r 4 s 5 ) 1 + ( r 3 s 4 2 r s 3 ) σ 1 + ( 1 s 2 + r 2 s 3 ) σ 2 + ( r s 2 ) σ 3 ) W 1
Table 4. The first few generalized Pauli Fibonacci polynomial quaternions Q p W n with negative subscripts for the case r = 2 and s = 1 .
Table 4. The first few generalized Pauli Fibonacci polynomial quaternions Q p W n with negative subscripts for the case r = 2 and s = 1 .
n Q p W n
0 W 0 1 + σ 2 + 2 σ 3 + W 1 σ 1 + r σ 2 + s σ 3 + r 2 σ 3
1 ( 2 . 1 + σ 1 + σ 3 ) W 0 + ( 1 + σ 2 + 2 σ 3 ) W 1
2 ( 5 . 1 2 σ 1 + σ 2 ) W 0 + ( 2 . 1 + σ 1 + σ 3 ) W 1
3 ( 12 . 1 + 5 σ 1 2 σ 2 + σ 3 ) W 0 + ( 5 . 1 2 σ 1 + σ 2 ) W 1
4 ( 29 . 1 + 12 σ 1 + 5 σ 2 2 σ 3 ) W 0 + ( 12 . 1 + 5 σ 1 2 σ 2 + σ 3 ) W 1
5 ( 70 . 1 + 29 σ 1 12 σ 2 + 5 σ 3 ) W 0 + ( 29 . 1 12 σ 1 + 5 σ 2 2 σ 3 ) W 1
Table 5. The first few Pauli ( r , s ) -Fibonacci polynomial quaternions Q p G n with positive subscripts.
Table 5. The first few Pauli ( r , s ) -Fibonacci polynomial quaternions Q p G n with positive subscripts.
n Q p G n
0 σ 1 + σ 2 r + σ 3 ( r 2 + s )
1 1 + r σ 1 + σ 2 r 2 + s + σ 3 r 3 + 2 s r
2 r 1 + σ 1 r 2 + s + σ 2 r 3 + 2 s r + σ 3 r 4 + 3 r 2 s + s 2
3 r 2 + s 1 + σ 1 r 3 + 2 s r + σ 2 r 4 + 3 r 2 s + s 2 + σ 3 r 5 + 4 r 3 s + 3 r s 2
4 r 3 + 2 s r 1 + σ 1 r 4 + 3 r 2 s + s 2 + σ 2 r 5 + 4 r 3 s + 3 r s 2 + σ 3 r 6 + 5 r 4 s + 6 r 2 s 2 + s 3
5 r 4 + 3 r 2 s + s 2 1 + σ 2 r 6 + 5 r 4 s + 6 r 2 s 2 + s 3 + σ 1 r 5 + 4 r 3 s + 3 r s 2 + σ 3 r 7 + 6 r 5 s + 10 r 3 s 2 + 4 r s 3
Table 6. The first few Pauli ( r , s ) -Fibonacci polynomial quaternions Q p G n with positive subscripts for the case r = 2 and s = 1 .
Table 6. The first few Pauli ( r , s ) -Fibonacci polynomial quaternions Q p G n with positive subscripts for the case r = 2 and s = 1 .
n Q p G n
0 σ 1 + 2 σ 2 + 5 σ 3
1 1 + 2 σ 1 + 5 σ 2 + 12 σ 3
2 2 . 1 + 5 σ 1 + 12 σ 2 + 29 σ 3
3 5 . 1 + 12 σ 1 + 29 σ 2 + 70 σ 3
4 12 . 1 + 29 σ 1 + 70 σ 2 + 169 σ 3
5 29 . 1 + 70 σ 1 + 169 σ 2 + 408 σ 3
Table 7. The first few Pauli ( r , s ) -Lucas polynomial quaternions Q p H n with positive subscripts.
Table 7. The first few Pauli ( r , s ) -Lucas polynomial quaternions Q p H n with positive subscripts.
n Q p H n
0 2 . 1 + r σ 1 + σ 2 ( 2 s + r 2 ) + σ 3 ( r 3 + 3 r s )
1 r . 1 + σ 1 ( r 2 + 2 s ) + σ 2 ( r 3 + 3 r s ) + σ 3 ( r 4 + 4 r 2 s + 2 s 2 )
2 r . 1 + σ 1 r 2 + s + σ 2 r 3 + 2 s r + σ 3 r 4 + 3 r 2 s + s 2
3 ( 2 r + r 3 + r s ) . 1 + σ 1 ( 2 r 2 + r 4 + 2 s + 2 r 2 s ) + σ 2 ( 2 r 3 + r 5 + r s 2 + 3 r 3 s + 4 r s ) + σ 3 6 r 2 s + 4 r 4 s + 3 r 2 s 2 + 2 r 4 + 2 s 2 + r 6
4 ( r 4 + 4 r 2 s + 2 s 2 ) . 1 + σ 1 ( r 5 + 5 r 3 s + 5 r s 2 ) + σ 2 ( 9 r 2 s 2 + 2 s 3 + 6 r 4 s + r 6 ) + σ 3 ( r 7 + 7 r 5 s + 14 r 3 s 2 + 7 r s 3 )
5 ( r 5 + 5 r 3 s + 5 r s 2 ) . 1 + σ 1 ( r 6 + 6 r 4 s + 9 r 2 s 2 + 2 s 3 ) + σ 2 ( r 7 + 7 r 5 s + 14 r 3 s 2 + 7 r s 3 ) + σ 3 ( r 8 + 8 r 6 s + 20 r 4 s 2 + 16 r 2 s 3 + 2 s 4 )
Table 8. The first few Pauli ( r , s ) -Fibonacci polynomial quaternions Q p H n with positive subscripts for the case r = 2 and s = 1 .
Table 8. The first few Pauli ( r , s ) -Fibonacci polynomial quaternions Q p H n with positive subscripts for the case r = 2 and s = 1 .
n Q p H n
0 2 . 1 + 2 σ 1 + 6 σ 2 + 14 σ 3
1 r . 1 + 6 σ 1 + 14 σ 2 + 34 σ 3
2 r . 1 + 5 σ 1 + 12 σ 2 + 29 σ 3
3 14 . 1 + 34 σ 1 + 82 σ 2 + 198 σ 3
4 34 . 1 + 82 σ 1 + 198 σ 2 + 478 σ 3
5 82 . 1 + 198 σ 1 + 478 σ 2 + 1154 σ 3
Table 9. The first few generalized Pauli ( r , s ) -Fibonacci polynomial quaternions Q p G n with negative subscripts.
Table 9. The first few generalized Pauli ( r , s ) -Fibonacci polynomial quaternions Q p G n with negative subscripts.
n Q p G n
0 σ 1 + σ 2 r + σ 3 ( r 2 + s )
1 1 s . 1 + σ 2 + r σ 3
2 r s 2 . 1 + 1 s σ 1 + σ 3
3 ( 1 s 2 + r 2 s 3 ) . 1 r s 2 σ 1 + 1 s σ 2
4 ( r 3 s 4 2 r s 3 ) . 1 + ( 1 s 2 + r 2 s 3 ) σ 1 r s 2 σ 2 + 1 s σ 3
5 ( 1 s 3 + 3 r 2 s 4 + r 4 s 5 ) . 1 + ( r 3 s 4 2 r s 3 ) σ 1 + ( 1 s 2 + r 2 s 3 ) σ 2 + ( r s 2 ) σ 3
Table 10. The first few generalized Pauli ( r , s ) -Fibonacci polynomial quaternions Q p G n with negative subscripts for the case r = 2 and s = 1 .
Table 10. The first few generalized Pauli ( r , s ) -Fibonacci polynomial quaternions Q p G n with negative subscripts for the case r = 2 and s = 1 .
n Q p G n
0 σ 1 + 2 σ 2 + 5 σ 3
1 1 . 1 + σ 2 + 2 σ 3
2 2 . 1 + σ 1 + σ 3
3 5 . 1 2 σ 1 + σ 2
4 12 . 1 + 5 σ 1 2 σ 2 + σ 3
5 29 . 1 12 σ 1 + 5 σ 2 2 σ 3
Table 11. The first few Pauli ( r , s ) -Lucas polynomial quaternions Q p H n with negative subscripts.
Table 11. The first few Pauli ( r , s ) -Lucas polynomial quaternions Q p H n with negative subscripts.
n Q p H n
0 2 . 1 + r σ 1 + σ 2 ( 2 s + r 2 ) + σ 3 ( r 3 + 3 r s )
1 r s 1 + 2 σ 1 + r σ 2 + σ 3 ( 2 s + r 2 )
2 ( 2 s + r 2 s 2 ) . 1 r s σ 1 + 2 σ 2 + r σ 3
3 ( r 3 s 3 3 r s 2 ) . 1 + σ 1 ( 2 s + r 2 s 2 ) r s σ 2 + 2 σ 3
4 ( 4 r 2 s 3 + r 4 s 4 + 2 s 2 ) . 1 + 2 s σ 2 + σ 1 ( r 3 s 3 3 r s 2 ) + r 2 s 2 σ 2 r s σ 3
5 ( 5 r 3 s 4 r 5 s 5 5 r s 3 ) . 1 + σ 1 ( 2 s 2 + 4 r 2 s 3 + r 4 s 4 ) + σ 2 ( r 3 s 3 3 r s 2 ) + σ 3 ( 2 s + r 2 s 2 )
Table 12. The first few Pauli ( r , s ) -Lucas polynomial quaternions Q p H n with negative subscripts for the case r = 2 and s = 1 .
Table 12. The first few Pauli ( r , s ) -Lucas polynomial quaternions Q p H n with negative subscripts for the case r = 2 and s = 1 .
n Q p H n
0 2 . 1 + 2 σ 1 + 6 σ 2 + 14 σ 3
1 2 1 + 2 σ 1 + 2 σ 2 + 6 σ 3
2 6 . 1 2 σ 1 + 2 σ 2 + 2 σ 3
3 14 . 1 + 6 σ 1 2 σ 2 + 2 σ 3
4 34 . 1 14 σ 1 + 6 σ 2 2 σ 3
5 82 . 1 + 34 σ 1 14 σ 2 + 6 σ 3
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

Yılmaz, B.; Gönül Bilgin, N.; Soykan, Y. Generalized Pauli Fibonacci Polynomial Quaternions. Axioms 2025, 14, 449. https://doi.org/10.3390/axioms14060449

AMA Style

Yılmaz B, Gönül Bilgin N, Soykan Y. Generalized Pauli Fibonacci Polynomial Quaternions. Axioms. 2025; 14(6):449. https://doi.org/10.3390/axioms14060449

Chicago/Turabian Style

Yılmaz, Bahadır, Nazmiye Gönül Bilgin, and Yüksel Soykan. 2025. "Generalized Pauli Fibonacci Polynomial Quaternions" Axioms 14, no. 6: 449. https://doi.org/10.3390/axioms14060449

APA Style

Yılmaz, B., Gönül Bilgin, N., & Soykan, Y. (2025). Generalized Pauli Fibonacci Polynomial Quaternions. Axioms, 14(6), 449. https://doi.org/10.3390/axioms14060449

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