Related papers: Factorization and root-finding for polynomials ove…
Quantum algorithm is an algorithm for solving mathematical problems using quantum systems encoded as information, which is found to outperform classical algorithms in some specific cases. The objective of this study is to develop a quantum…
Consider a sparse polynomial in several variables given explicitly as a sum of non-zero terms with coefficients in an effective field. In this paper, we present several algorithms for factoring such polynomials and related tasks (such as…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
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…
Multiplicative relations between the roots of a polynomial in $\mathbb{Q}[x]$ have drawn much attention in the field of arithmetic and algebra, while the problem of computing these relations is interesting to researchers in many other…
The polynomials with quaternion coefficients have two kind of roots: isolated and spherical. A spherical root generates a class of roots which contains only one complex number $z$ and its conjugate $\bar{z}$, and this class can be…
Triangular factorizations are an important tool for solving integral equations and partial differential equations with hierarchical matrices ($\mathcal{H}$-matrices). Experiments show that using an $\mathcal{H}$-matrix LR factorization to…
Evaluating or finding the roots of a polynomial $f(z) = f_0 + \cdots + f_d z^d$ with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation of $f$ obtained with a careful use of the Newton polygon of…
We study the complexity of polynomial multiplication over arbitrary fields. We present a unified approach that generalizes all known asymptotically fastest algorithms for this problem. In particular, the well-known algorithm for…
We present a new algorithm for isolating the real roots of a system of multivariate polynomials, given in the monomial basis. It is inspired by existing subdivision methods in the Bernstein basis; it can be seen as generalization of the…
We study systems of quadratic forms over fields and their isotropy over 2-extensions. We apply this to obtain particular splitting fields for quaternion algebras defined over a finite field extension. As a consequence, we obtain that every…
We introduce the notion of maximal orders over quaternion algebras with orthogonal involution and give a classification over local fields, and a partial classification over algebraic number fields.
We give an algorithm for factoring quadratic polynomials over any UFD, Z in particular. We prove the correctness of this algorithm and give examples over Z and Z[i].
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…
Let $p_{1}, p_{2}$ be two distinct prime integers, let $n$ be a positive integer, $n$$\geq 3$ and let $\xi_{n} $ be a primitive root of order $n$ of the unity. In this paper we obtain a complete characterization for a quaternion algebra…
In this paper, we derive new bounds for the zeros of quaternionic polynomials by applying localization theorems, which includes Gershgorin-type theorems for the left eigenvalues of matrices of left monic quaternionic polynomials. These…
We present a few factorizations of polynomials over finite fields. These factorizations are related to traces, compositions of polynomials and binomial coefficients. As a corollary we obtain a description of all irreducible polynomials…
This article provides a gentle introduction for a general mathematical audience to the factorization theory of motion polynomials and its application in mechanism science. This theory connects in a rather unexpected way a seemingly abstract…
Let p and q be two positive primes. In this paper we obtain a complete characterization of quaternion division algebras H_K(p,q) over the composite K of n quadratic number fields. Also, in Section 6, we obtain a characterization of…
We describe a simple approach to factorize non-commutative (nc) polynomials, that is, elements in free associative algebras (over a commutative field), into atoms (irreducible elements) based on (a special form of) their minimal linear…