Related papers: A quaternion-based approach to construct quaternar…
In this paper, we derive explicit formulas for computing the roots of $ax^{2}+bx+c=0$ with $a$ being not invertible in split quaternion algebra. We also imitate the approach developed by Opfer, Janovska and Falcao etc. to verify our results…
For quadratic spaces which represent 1 there is a characterization of hermitian compositions in the language of algebras-with-involutions using the even Clifford algebra. We extend this notion to define a generalized composition based on…
We propose a geometric explanation for the observation that generic quadratic polynomials over split quaternions may have up to six different factorizations while generic polynomials over Hamiltonian quaternions only have two. Split…
Sequences with low auto-correlation property have been applied in code-division multiple access communication systems, radar and cryptography. Using the inverse Gray mapping, a quaternary sequence of even length $N$ can be obtained from two…
To construct ternary "quaternions" following Hamilton we must introduce two "imaginary "units, $q_1$ and $q_2$ with propeties $q_1^n=1$ and $q_2^m=1$. The general is enough difficult, and we consider the $m=n=3$. This case gives us the…
We construct two families of orthogonal polynomials associated with the universal central extensions of the superelliptic Lie algebras. These polynomials satisfy certain fourth order linear differential equations, and one of the families is…
We show that 2D periodic operators with local and perpendicular defects form an algebra. We provide an algorithm of finding spectrum for such operators. While the continuous spectral components can be computed by simple algebraic operations…
The pairing hierarchy of perfect pairing (PP), perfect quadruples (PQ) and perfect hextuples (PH) are sparsified coupled cluster models that are exact in a pairing active space for 2, 4, and 6 electron clusters, respectively. We describe…
We consider statistical procedures for hypothesis testing of real valued functionals of matched pairs with missing values. In order to improve the accuracy of existing methods, we propose a novel multiplication combination procedure.…
Let S be a complete star-omega semiring and Sigma be an alphabet. For a weighted omega-pushdown automaton P with stateset 1...n, n greater or equal to 1, we show that there exists a mixed algebraic system over a complete semiring-semimodule…
Let $\mathbb{H}$ be the real quaternion algebra and $\mathbb{H}^{m\times n}$ denote the set of all $m\times n$ matrices over $\mathbb{H}$. Let $\mathbf{i},\mathbf{j},\mathbf{k}$ be the imaginary quaternion units. For…
We introduce the notions of alternating roots of polynomials and alternating polynomials over a Cayley-Dickson algebra, and prove a connection between the alternating roots of a given polynomial and the roots of the corresponding…
Given a parity-check matrix $H_m$ of a $q$-ary Hamming code, we consider a partition of the columns into two subsets. Then, we consider the two codes that have these submatrices as parity-check matrices. We say that anyone of these two…
We study the subfields of quaternion algebras that are quadratic extensions of their center in characteristic 2. We provide examples of the following: two non-isomorphic quaternion algebras that share all their quadratic subfields, two…
The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…
We describe a way to complete a correlation matrix that is not fully specified. Such matrices often arise in financial applications when the number of stochastic variables becomes large or when several smaller models are combined in a…
There are many different algebraic, geometric and combinatorial objects that one can attach to a complex polynomial with distinct roots. In this article we introduce a new object that encodes many of the existing objects that have…
We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear…
We apply a symbolic approach of the general quadratic decomposition of polynomial sequences - presented in a previous article referenced herein - to polynomial sequences fulfilling specific orthogonal conditions towards two given…
In this note it is worked out a new set of Laplace-Like equations for quaternions through Riemann-Cauchy hypercomplex relations otained earlier \cite{BorgesZeMarcio}. As in the theory of functions of a complex variable, it is expected that…