Related papers: Quadratic formulas for split quaternions
In this paper, we give several matrix representations for the Horadam quaternions. We derive several identities related to these quaternions by using the matrix method. Since quaternion multiplication is not commutative, some of our results…
Let $L$ be a separable quadratic extension of either $\mathbb{Q}$ or $\mathbb{F}_q(t)$. We propose efficient algorithms for finding isomorphisms between quaternion algebras over $L$. Our techniques are based on computing maximal one-sided…
The relationship between a polynomial's zeros and factors is well known. If a is a zero of f(x) then (x-a) is a factor of f(x). In this paper, we generalize this idea to polynomials of two variables and with real coefficients. We consider…
We present a closed-form solution to Wahba's problem in the quaternion domain for the special case of two vector observations. Existing approaches, including Davenport's $q$-method, QUEST, Horn's method, and ESOQ algorithms, recover the…
When the Euclidean algorithm produces a symmetric sequence of quotients, we give explicit formulas for the remainders that allow the analysis of two families of quadratic forms in the remainders.
The quadratic algebras Q_n are associated with pseudo-roots of noncommutative polynomials. We compute the Hilbert series of the algebras Q_n and of the dual quadratic algebras Q_n^!
I considered definition and properties of polynomial in no-commutative algebra. There exists polynomial which has finite, infinite or empty set of roots. For instance, the polynomial $$p_1(x)=ix-xi-1$$ have no root and the polynomial…
Inspired by the relation between the algebra of complex numbers and plane geometry, William Rowan Hamilton sought an algebra of triples for application to three dimensional geometry. Unable to multiply and divide triples, he invented a…
The paper proposes a polynomial formula for solution quadratic congruences in $\mathbb{Z}_p$. This formula gives the correct answer for quadratic residue and zeroes for quadratic nonresidue. The general form of the formula for $p=3…
We give an asymptotic formula for the divisor sum $\sum_{c<n\leq N}\tau\left((n-b)(n-c)\right)$ for integers $b<c$ of the same parity. Interestingly, the coefficient of the main term does not depend on the discriminant as long as it is a…
In this paper, a linear univariate representation for the roots of a zero-dimensional polynomial equation system is presented, where the roots of the equation system are represented as linear combinations of roots of several univariate…
The conditions for cubic equations, to have 3 real roots and 2 of the roots lie in the closed interval $[-1, 1]$ are given. These conditions are visualized. This question arises in physics in e.g. the theory of tops.
The subject matter of this work is quadratic and cubic polynomial functions with integer coefficients;and all of whose roots are integers. The material of this work is directed primarily at educators,students,and teachers of…
We prove a Poisson summation formula for the zero locus of a quadratic form in an even number of variables with no assumption on the support of the functions involved. The key novelty in the formula is that all ``boundary terms'' are given…
We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…
In this paper, we shall present an interesting and significant refinement of a classical result of Cauchy about the moduli of the zeros of a quaternionic polynomial. As an application of this result we shall obtain zero-free regions of…
The literature on quaternionic polynomials and, in particular, on methods for determining and classifying their zero-sets, is fast developing and reveals a growing interest on this subject. In contrast, polynomials defined over the algebra…
A novel development is given of the theory of Gaussian quadrature, not relying on the theory of orthogonal polynomials. A method is given for computing the nodes and weights that is manifestly independent of choice of basis in the space of…
We describe a method for calculating the roots of special functions satisfying second order linear ordinary differential equations. It exploits the recent observation that the solutions of a large class of such equations can be represented…
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…