Related papers: Zeros and factorizations of quaternion polynomials…
In this work, Some new inequalities for the numerical radius of block $n$-by-$n$ matrices are presented. As an application, bounding of zeros of polynomials using the Frobenius companion matrix partitioned by the Cartesian decomposition…
Quaternions, introduced by Hamilton in 1843 as a generalization of complex numbers, have found, in more recent years, a wealth of applications in a number of different areas which motivated the design of efficient methods for numerically…
We construct the quaternion algebra [10] "geometrically" by a three dimensional analogue of the classic two dimensional geometric description of the complex field. The algebraic description of the multiplication operation in three…
Some purely chiral fractional quantum Hall states are described by symmetric or anti-symmetric polynomials of infinite variables. In this article, we review a systematic construction and classification of those fractional quantum Hall…
Generalizing supertropical algebras, we present a "layered" structure, "sorted" by a semiring which permits varying ghost layers, and indicate how it is more amenable than the "standard" supertropical construction in factorizations of…
A skew polynomial ring $R=K[x;\sigma,\delta]$ is a ring of polynomials with non-commutative multiplication. This creates a difference between left and right divisibility, and thus a concept of left and right evaluations and roots. A…
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…
The component-by-component construction is the standard method of finding good lattice rules or polynomial lattice rules for numerical integration. Several authors have reported that in numerical experiments the generating vector sometimes…
In this paper we investigate distribution of zeros for only quasipolynom and obtain exactly lower-bound for their modulus.
In this paper we study the structure of polynomials of degree three and four that have high bias or high Gowers norm, over arbitrary prime fields. In particular we obtain the following results. 1. We give a canonical representation for…
A comprehensive analysis of the morphology of the solution space for a special type of quadratic quaternion equation is presented. This equation, which arises in a surface construction problem, incorporates linear terms in a quaternion…
In this paper, we are concerned with the problem of counting the multiplicities of a zero-dimensional regular set's zeros. We generalize the squarefree decomposition of univariate polynomials to the so-called pseudo squarefree decomposition…
We review known factorization results in quaternion matrices. Specifically, we derive the Jordan canonical form, polar decomposition, singular value decomposition, the QR factorization. We prove there is a Schur factorization for commuting…
This paper presents the concept of digit polynomials, which leads to a deterministic and unconditional integer factorization algorithm with the runtime complexity $\mathcal{O}(N^{1/4+\epsilon})$. Strassen's well known factoring approach is…
The authors present a unified method for calculating the zeros of the classical orthogonal polynomials based upon the electrostatic interpretation and its connection to the energy minimization problem. Examples are given with error…
Spinor polynomials are polynomials with coefficients in the even sub-algebra of conformal geometric algebra whose norm polynomial is real. They describe rational conformal motions. Factorizations of spinor polynomial corresponds to the…
An approach is proposed for bounding the number of zeros that solutions of linear differential systems with polynomial coefficients may have. A bound is obtained in a special case which improves upon currently existing.
In noncommutative and nondivision algebra, left spectrum of matrices are less known and is not easy to handle. Split quaternion algebra is a noncommutative and nondivision algebra. In this paper, by the formulas of solving the equations…
This survey describes work on the number of variables required to ensure that a system of r quadratic forms over the p-adics has a non-trivial common zero.
For an odd prime $p$, we say a polynomial $f\in \mathbb F_p[X]$ computes square roots if $f(a)^2=a$ for all nonzero, perfect squares $a\in \mathbb F_p$. When $p\equiv 3 \mod 4$, it is easy to see that $f(X)=X^{\frac{p+1}{4}}$ is the…