Related papers: Virtual Roots of Real Polynomials

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…

Univariate polynomial root-finding is a classical subject, still 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…

We describe a new incomplete but terminating method for real root finding for large multivariate polynomials. We take an abstract view of the polynomial as the set of exponent vectors associated with sign information on the coefficients.…

We consider real univariate polynomials with all roots real. Such a polynomial with $c$ sign changes and $p$ sign preservations in the sequence of its coefficients has $c$ positive and $p$ negative roots counted with multiplicity. Suppose…

Student appreciation of a function is enhanced by understanding the graphical representation of that function. From the real graph of a polynomial, students can identify real-valued solutions to polynomial equations that correspond to the…

We present six Theorems on the univariate real Polynomial, using which we develop a new algorithm for deciding the existence of atleast one real root for univariate integer Polynomials. Our algorithm outputs that no positive real root…

We seek complex roots of a univariate polynomial $P$ with real or complex coefficients. We address this problem based on recent algorithms that use subdivision and have a nearly optimal complexity. They are particularly efficient when only…

We raise a question on the existence of continuous roots of families of monic polynomials (by the root of a family of polynomials we mean a function of the coefficients of polynomials of a given family that maps each tuple of coefficients…

In this paper, by the generalized Bell umbra and Rolle's theorem, we give some results on the real rootedness of polynomials. Some applications on partition polynomials and the sigma polynomials of graphs are given.

Let $c_1(x),c_2(x),f_1(x),f_2(x)$ be polynomials with rational coefficients. With obvious exceptions, there can be at most finitely many roots of unity among the zeros of the polynomials $c_1(x)f_1(x)^n+c_2(x)f_2(x)^n$ with $n=1,2\ldots$.…

We consider univariate real polynomials with all roots real and with two sign changes in the sequence of their coefficients which are all non-vanishing. One of the changes is between the linear and the constant term. By Descartes' rule of…

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…

This is a straightforward introduction to the properties of polynomials in many variables that do not vanish in the open upper half plane. Such polynomials generalize many of the well-known properties of polynomials with all real roots.

The paper studies the question of existence of polynomials with given roots over associative non-commutative rings with identity. It is shown that in the case of an associative division ring for arbitrary n elements of this ring there…

Diagrams as a graphic expresion of derivatives is proposed for calculation of derivatives for composed function. The concret diagram is understood as a virtual derivative in contrast of concret derivative. In polynomial expression of…

We consider the set of monic real univariate polynomials of a given degree $d$ with non-vanishing coefficients, with given signs of the coefficients and with given quantities $pos$ of their positive and $neg$ of their negative roots (all…

The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…

We prove that a bivariate polynomial f with exactly t non-zero terms, restricted to a real line {y=ax+b}, either has at most 6t-4 zeroes or vanishes over the whole line. As a consequence, we derive an alternative algorithm to decide whether…

We consider the set $\Pi ^*_d$ of monic polynomials $Q_d=x^d+\sum _{j=0}^{d-1}a_jx^j$, $x\in \mathbb{R}$, $a_j\in \mathbb{R}^*$, having $d$ distinct real roots, and its subsets defined by fixing the signs of the coefficients $a_j$. We show…

Graph polynomials are polynomials assigned to graphs. Interestingly, they also arise in many areas outside graph theory as well. Many properties of graph polynomials have been widely studied. In this paper, we survey some results on the…