Related papers: Virtual Roots of Real Polynomials

We consider systems of strict multivariate polynomial inequalities over the reals. All polynomial coefficients are parameters ranging over the reals, where for each coefficient we prescribe its sign. We are interested in the existence of…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a real coefficient polynomial. They can be approximated at a low computational cost if the…

For the general monic cubic and quartic with real coefficients, polynomial conditions on the coefficients are derived as directly and as simply as possible from the Sturm sequence that will determine the real and complex root multiplicities…

We characterize compatible families of real-rooted polynomials, allowing both positive and negative leading coefficients. Our characterization naturally generalizes the same-sign characterization used by Chudnovsky and Seymour in their…

We study real univariate polynomials with non-zero coefficients and with all roots real, out of which exactly two positive. The sequence of coefficients of such a polynomial begins with $m$ positive coefficients followed by $n$ negative…

We consider real univariate degree $d$ real-rooted polynomials with non-vanishing coefficients. Descartes' rule of signs implies that such a polynomial has $\tilde{c}$ positive and $\tilde{p}$ negative roots counted with multiplicity, where…

For the general monic quintic with real coefficients, polynomial conditions on the coefficients are derived as directly and as simply as possible from the Sturm sequence that will determine the real and complex root multiplicities together…

We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algebraic numbers. One motivation is to explain the method's good…

That the Perron root of a square nonnegative matrix A varies continuously with the entries in A is a corollary of theorems regarding continuity of eigenvalues or roots of polynomial equations, the proofs of which necessarily involve complex…

In this paper, we study the number of real roots of random trigonometric polynomials with iid coefficients. When the coefficients have zero mean, unit variance and some finite high moments, we show that the variance of the number of real…

We give a strongly polynomial time algorithm which determines whether or not a bivariate polynomial is real stable. As a corollary, this implies an algorithm for testing whether a given linear transformation on univariate polynomials…

We identify the scaling region of a width O(n^{-1}) in the vicinity of the accumulation points $t=\pm 1$ of the real roots of a random Kac-like polynomial of large degree n. We argue that the density of the real roots in this region tends…

Let P be an elementary closed semi-algebraic set in R^d, i.e., there exist real polynomials p_1,...,p_s such that P= \{x \in R^d : p_1(x) \ge 0, >..., p_s(x) \ge 0 \}; in this case p_1,...,p_s are said to represent P. Denote by $n$ the…

For a polynomial $f(t) = 1+f_0t+\cdots +f_{d-1}t^d$ with positive integer coefficients Bell and Skandera ask if real rootedness of f(t) implies that there is a simplicial complex with f-vector $(1,f_0 \ldots,f_{d-1})$. In this paper we…

We discuss several conjectures about the real-rootedness of polynomials whose coefficients are determinants of coefficients of a real-rooted polynomial. We also consider some questions about matrices generalizing totally positive matrices,…

Hyperbolic polynomials are real multivariate polynomials with only real roots along a fixed pencil of lines. Testing whether a given polynomial is hyperbolic is a difficult task in general. We examine different ways of translating…

Given n polynomials in n variables with a finite number of complex roots, for any of their roots there is a local residue operator assigning a complex number to any polynomial. This is an algebraic, but generally not rational, function of…

A real univariate polynomial is hyperbolic if all its roots are real. By Descartes' rule of signs a hyperbolic polynomial (HP) with all coefficients nonvanishing has exactly $c$ positive and exactly $p$ negative roots counted with…

In this paper we prove several theorems about abelian varieties over finite fields by studying the set of monic real polynomials of degree 2n all of whose roots lie on the unit circle. In particular, we consider a set V_n of vectors in R^n…

Newton's root finding method applied to a (transcendental) entire function f:C->C is the iteration of a meromorphic function N. It is well known that if for some starting value z, Newton's method converges to a point x in C, then f has a…