Related papers: When $D$-companion matrix meets incomplete polynom…

Laguerre's theorem regarding the number of non-real zeros of a polynomial and its image under certain linear operators is generalized. This generalization is then used to (1) exhibit a number of previously undiscovered complex zero…

Here I present a method how intersections of a certain density matrix of rank two with the zero-polytope can be calculated exactly. This is a purely geometrical procedure which thereby is applicable to obtaining the zeros of SL- and…

Majorization inequalities for symmetric polynomials have interested mathematicians for centuries, from the AM-GM inequality for two variables going back at least to Euclid, through classical results of Newton, Muirhead and Gantmacher, to…

Let $p_n(x)$ be orthogonal polynomials associated to a measure $d\mu$ of compact support in $R$. If $E\not\in supp(d\mu)$, we show there is a $\delta>0$ so that for all $n$, either $p_n$ or $p_{n+1}$ has no zeros in $(E-\delta, E+\delta)$.…

We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…

We introduce the concept of piecewise interlacing zeros for studying the relation of root distribution of two polynomials. The concept is pregnant with an idea of confirming the real-rootedness of polynomials in a sequence. Roughly…

We prove an equidistribution result for the zeros of polynomials with integer coefficients and simple zeros. Specifically, we show that the normalized zero measures associated with a sequence of such polynomials, having small height…

In the present note we obtain new results on two conjectures by Csordas et al. regarding the interlacing property of zeros of special polynomials. These polynomials came from the Jacobi tau methods for the Sturm-Liouville eigenvalue…

Suppose X is the complex zero set of a finite collection of polynomials in Z[x_1,...,x_n]. We show that deciding whether X contains a point all of whose coordinates are d_th roots of unity can be done within NP^NP (relative to the sparse…

We present a zero decomposition theorem and an algorithm based on Wu's method, which computes a zero decomposition with multiplicity for a given zero-dimensional polynomial system. If the system satisfies some condition, the zero…

In this paper we consider images of (ordinary) noncommutative polynomials on matrix algebras endowed with a graded structure. We give necessary and sufficient conditions to verify that some multilinear polynomial is a central polynomial, or…

Let $\mathcal{N} \neq \{0\}$ be a fixed set of integers, closed under multiplication, closed under negation, or containing $\{\pm 1\}$. We prove that any zero of a polynomial in $\mathbf{Z}[X]$ whose coefficients lie in $\mathcal{N}$ can be…

In this paper we investigate bounds for the zeros of a bicomplex polynomial using matrix method. In particular, we find analogue of Gershgorin disk theorem, Cauchy Theorem, theorem of Fujiwara, Walsh and other theorems concerning to zeros…

We investigate interlacing properties of zeros of Laguerre polynomials $ L_{n}^{(\alpha)}(x)$ and $ L_{n+1}^{(\alpha +k)}(x),$ $ \alpha > -1, $ where $ n \in \mathbb{N}$ and $ k \in {\{ 1,2 }\}$. We prove that, in general, the zeros of…

We give asymptotic approximations of the zeros of certain high degree polynomials. The zeros can be used to compute the filter coefficients in the dilation equations which define the compactly supported orthogonal Daubechies wavelets.…

It is proved that the roots of the derivative of a polynomial with quaternionic coefficients belong to the union of the intersections of sets defined in terms of certain projections of a polynomial. The result strengthens the quaternion…

By using the squared slack variables technique, we demonstrate that the solution set of a general polynomial complementarity problem is the image, under a specific projection, of the set of real zeroes of a system of polynomials. This paper…

We define an extension of the toric (middle perversity intersection homology) $g$-vector of a convex polytope $X$. The extended $g(X)$ encodes the whole of the flag vector $f(X)$ of $X$, and so is called complete. We find that for many…

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…

The zeros of complex Gaussian random polynomials, with coefficients such that the density in the underlying complex space is uniform, are known to have the same statistical properties as the zeros of the coherent state representation of…