Related papers: A quaternion-based approach to construct quaternar…
A sequence inverse relationship can be defined by a pair of infinite inverse matrices. If the pair of matrices are the same, they define a dual relationship. Here presented is a unified approach to construct dual relationships via…
Golay complementary sequences have been put a high value on the applications in orthogonal frequency-division multiplexing (OFDM) systems since its good peak-to-mean envelope power ratio(PMEPR) properties. However, with the increase of the…
Multidimensional quaternion arrays (often referred to as "quaternion tensors") and their decompositions have recently gained increasing attention in various fields such as color and polarimetric imaging or video processing. Despite this…
The roots of -1 in the set of biquaternions (quaternions with complex components, or complex numbers with quaternion real and imaginary parts) are studied and it is shown that there is an infinite number of non-trivial complexified…
We construct new families of completely regular codes by concatenation methods. By combining parity check matrices of cyclic Hamming codes, we obtain families of completely regular codes. In all cases, we compute the intersection array of…
We propose an approach to constructing iterative methods for finding polynomial roots simultaneously. One feature of this approach is using the fundamental theorem of symmetric polynomials. Within this framework, we reconstruct many of the…
Over the complex numbers, the complement of a collection of hyperplanes is a widely-studied object; the cohomology ring, in particular, is known to have a structure depending only on the combinatorial properties of the intersection of…
Fast algorithms for arithmetic on real or complex polynomials are well-known and have proven to be not only asymptotically efficient but also very practical. Based on Fast Fourier Transform (FFT), they for instance multiply two polynomials…
This work provides explicit characterizations and formulae for the minimal polynomials of a wide variety of structured $4\times 4$ matrices. These include symmetric, Hamiltonian and orthogonal matrices. Applications such as the complete…
As an expansion of complex numbers, the quaternions show close relations to numerous physically fundamental concepts. In spite of that, the didactic potential provided by quaternion interrelationships in formulating physical laws are hardly…
We investigate the problem of determining the zeros of quaternionic polynomials using matrix method. In a recent paper, Dar et al. \cite{RD} proved that the zeros of a quaternionic polynomial and the left eigenvalues of the corresponding…
We investigate completed interlacing of zeros for pairs of polynomial sequences that fail to interlace by exactly two points. Using a general mixed recurrence relation, we identify a quadratic polynomial whose zeros serve as the two extra…
This paper describes the passage of light through a system of waveplates mathematically in terms of quaternions, an extension of the complex numbers, instead of the more usual Jones vectors and Jones matrices. Both the light beam and the…
In the paper we first construct a new cotorsion pair, in the category of chain complexes, from two given cotorsion pairs in the category of modules, and then we consider completeness of such pairs under certain conditions.
The additive codes may have better parameters than linear codes. However, it is still a challenging problem to efficiently construct additive codes that outperform linear codes, especially those with greater distances than linear codes of…
Commutative hypercomplex algebras offer significant advantages over traditional quaternions due to their compatibility with linear algebra techniques and efficient computational implementation, which is crucial for broad applicability. This…
Classes of pairs of ternary quadratic forms parametrize quartic rings by a result of Bhargava. We give an algorithm for finding a pair of ternary quadratic forms that parametrize a given order of a quartic field. We examine a new technique,…
This paper is about producing a new kind of the pairs which we call it MS-pairs. To produce these pairs, we use an algorithm for dividing a natural number $x$ by two for two arbitrary numbers and consider their related graphs. We present…
Poisson superpair is a pair of Poisson superalgebra structures on a super commutative associative algebra, whose any linear combination is also a Poisson superalgebra structure. In this paper, we first construct certain linear and quadratic…
It is well known that, whenever $k$ divides $n$, the complete $k$-uniform hypergraph on $n$ vertices can be partitioned into disjoint perfect matchings. Equivalently, the set of $k$-subsets of an $n$-set can be partitioned into parallel…