Related papers: Factoring Octonion Polynomials
In this paper, we provide a new method to find all zeros of polynomials with quaternionic coefficients located on only one side of the powers of the variable (these polynomials are called simple polynomials). This method is much more…
A step 2 branching decomposition of spaces of homogeneous Hermitian monogenic polynomials in C^n is established with explicit embedding factors in terms of the generalized Jacobi polynomials, which allows for an inductive construction of an…
This paper presents an alternative proof of the Fundamental Theorem of Algebra that has several distinct advantages. The proof is based on simple ideas involving continuity and differentiation. Visual software demonstrations can be used to…
We present two algorithms for computing what we call the absolute factorization of a difference operator. We also give an algorithm to solve third order difference equations in terms of second order equations, together with applications to…
The $N$th power of a polynomial matrix of fixed size and degree can be computed by binary powering as fast as multiplying two polynomials of linear degree in~$N$. When Fast Fourier Transform (FFT) is available, the resulting complexity is…
We report an ongoing work on clustering algorithms for complex roots of a univariate polynomial $p$ of degree $d$ with real or complex coefficients. As in their previous best subdivision algorithms our root-finders are robust even for…
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…
Let $\mathbb{F}_q$ be a finite field with $q$ elements, $f \in \mathbb{F}_q[x_1, \dots, x_n]$ a polynomial in $n$ variables and let us denote by $N(f)$ the number of roots of $f$ in $\mathbb{F}_q^n$. %Many authors, such as Wei Cao and Kung…
We show a new algorithm and its implementation for multiplying bit-polynomials of large degrees. The algorithm is based on evaluating polynomials at a specific set comprising a natural set for evaluation with additive FFT and a high order…
This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…
A polynomial $f(t)$ in an Ore extension $K[t;S,D]$ over a division ring $K$ is a Wedderburn polynomial if $f(t)$ is monic and is the minimal polynomial of an algebraic subset of $K$. These polynomials have been studied in "Wedderburn…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much…
Factorization of polynomials arises in numerous areas in symbolic computation. It is an important capability in many symbolic and algebraic computation. There are two type of factorization of polynomials. One is convention polynomial…
Given an arbitrary monic polynomial $f$ over a field $F$ of characteristic 0, we use companion matrices to construct a polynomial $M_f\in F[X]$ of minimum degree such that for each root $\alpha$ of $f$ in the algebraic closure of $F$,…
In this article we use a method of finding the index of a complex-valued function by determined number of arithmetic operations to describe an algorithm of localization of roots of square-free polynomials. We give an estimation of the…
We give a concise direct proof of the orthogonality of interpolation Macdonald polynomials with respect to the Fourier pairing and briefly discuss some immediate applications of this orthogonality, such as the symmetry of the Fourier…
We study the roots of a random polynomial over the field of p-adic numbers. For a random monic polynomial with coefficients in $\mathbb{Z}_p$, we obtain an asymptotic formula for the factorial moments of the number of roots of this…
Algebraic and analytic aspects of self-adjoint operators of order four or more with polynomial coefficients are investigated. As a consequence, a systematic way of constructing such operators is given. The procedure is applied to obtain…
We present a FFT-based algorithm for the computation of a polynomial's coefficients from its roots, and apply it to obtain the coefficients of interpolation polynomials, to invert Vandermondians and to evaluate the symmetric functions of a…