Related papers: Zeros and factorizations of quaternion polynomials…
Several recently discovered properties of multiple families of special polynomials (some orthogonal and some not) that satisfy certain differential, difference or q-difference equations are reviewed. A general method of construction of…
In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise…
Schur-Szego composition of polynomials of degree N introduces an interesting semigroup structure on polynomial spaces. In this note we show how it interacts with the stratification of polynomials according to the multiplicity of their zeros…
We study the vanishing sets of slice regular polynomials in several quaternionic variables. We obtain a geometric description of the vanishing sets in two variables, which leads to a new version of the Strong Hilbert Nullstellensatz in the…
In this paper some algorithms will be presented which can be used for the calculation of zeros of polynomials and eigenvalues of polynomial matrices with a multiplicity larger than one. The numerical values calculated with MATLAB are used…
There are several questions one may ask about polynomials $q_m(x)=q_m(x;t)=\sum_{n=0}^mt^mp_n(x)$ attached to a family of orthogonal polynomials $\{p_n(x)\}_{n\ge0}$. In this note we draw attention to the naturalness of this partial-sum…
Simply put, a sparse polynomial is one whose zero coefficients are not explicitly stored. Such objects are ubiquitous in exact computing, and so naturally we would like to have efficient algorithms to handle them. However, with this compact…
This paper investigates the location of the zeros of a sequence of polynomials generated by a rational function with a binomial-type denominator. We show that every member of a two-parameter family consisting of such generating functions…
In this paper, we prove several theorems on systems of polynomials with at least one positive real zero based on the theory of conceive polynomials. These theorems provide sufficient conditions for systems of multivariate polynomials…
We present a framework to decompose real multivariate polynomials while preserving invariance and positivity. This framework has been recently introduced for tensor decompositions, in particular for quantum many-body systems. Here we…
In~\cite{algorithmic} was given an algorithm that computes arithmetical structures on matrices. We use some of the ideas contained there to get an algorithm that computes arithmetical structures over dominated polynomials. A dominated…
Constructive algorithms, requiring no more than $2\times 2$ matrix manipulations, are provided for finding the entries of the positive definite factor in the polar decomposition of matrices in sixteen groups preserving a bilinear form in…
For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…
This paper gives the first algorithm for finding a set of natural $\epsilon$-clusters of complex zeros of a triangular system of polynomials within a given polybox in $\mathbb{C}^n$, for any given $\epsilon>0$. Our algorithm is based on a…
The biquaternion (complexified quaternion) algebra contains idempotents (elements whose square remains unchanged) and nilpotents (elements whose square vanishes). It also contains divisors of zero (elements with vanishing norm). The…
The article is devoted to the investigation of transformation groups of polynomials over Cayley-Dickson algebras and their manifolds of zeros. The problems about expressibility of zeros with the help of roots and decomposibility of…
We consider a problem of bounding the maximal possible multiplicity of a zero at of some expansions $\sum a_i F_i(x)$, at a certain point $c,$ depending on the chosen family $\{F_i \}$. The most important example is a polynomial with $c=1.$…
We present a new algorithm to decompose generic spinor polynomials into linear factors. Spinor polynomials are certain polynomials with coefficients in the geometric algebra of dimension three that parametrize rational conformal motions.…
We discuss existence of explicit search bounds for zeros of polynomials with coefficients in a number field. Our main result is a theorem about the existence of polynomial zeros of small height over the field of algebraic numbers outside of…
The usual methods for root finding of polynomials are based on the iteration of a numerical formula for improvement of successive estimations. The unpredictable nature of the iterations prevents to search roots inside a pre-specified region…