Related papers: Gale duality bounds for roots of polynomials with …

We consider multivariable polynomials over a fixed number field, linear in some of the variables. For a system of such polynomials satisfying certain technical conditions we prove the existence of search bounds for simultaneous zeros with…

Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very…

The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size, and its roots are called {\em independence roots}. We investigate the stability of such polynomials, that is, conditions…

We introduce a new method for showing that the roots of the characteristic polynomial of certain finite lattices are all nonnegative integers. This method is based on the notion of a quotient of a poset which will be developed to explain…

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.

Expansive polynomials (whose roots are greater than 1 in modulus) often arise in dynamical systems and other computational problems. This paper examines the expansivity gap (the gap between 1 and the smallest modulus of the roots) of these…

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 derive inclusion regions for the eigenvalues of matrix polynomials expressed in a general polynomial basis, which can lead to significantly better results than traditional bounds. We present several applications to engineering problems.

In this paper, we exhibit new monotonicity properties of roots of families of orthogonal polynomials $P_n^{(z)}(x)$ depending polynomially on a parameter (Laguerre and Gegenbauer). By establishing that $P_n^{(z)}(x)$ are realrooted in $z$…

Motivated by an observation of Dehornoy, we study the roots of Alexander polynomials of knots and links that are closures of positive 3-strand braids. We give experimental data on random such braids and find that the roots exhibit marked…

We review some known inclusion results for the roots of a polynomial, and adapt them to a conjecture recently presented by S. A. Vavasis. In particular, we provide strict upper and lower bounds to the distance of the closest root of a…

We describe an alternative approach to some results of Vassiliev on spaces of polynomials, by using the scanning method which was used by Segal in his investigation of spaces of rational functions. We explain how these two approaches are…

We consider symmetric partial exclusion and inclusion processes in a general graph in contact with reservoirs, where we allow both for edge disorder and well-chosen site disorder. We extend the classical dualities to this context and then…

We consider the problem of complex root classification, i.e., finding the conditions on the coefficients of a univariate polynomial for all possible multiplicity structures on its complex roots. It is well known that such conditions can be…

We show that a monic univariate polynomial over a field of characteristic zero, with $k$ distinct non-zero known roots, is determined by its $k$ proper leading coefficients by providing an explicit algorithm for computing the multiplicities…

Polynomial algebra offers a standard approach to handle several problems in geometric modeling. A key tool is the discriminant of a univariate polynomial, or of a well-constrained system of polynomial equations, which expresses the…

We study the regularity of densities of distributions that are polynomial images of the standard Gaussian measure on $\mathbb{R}^n$. We assume that the degree of a polynomial is fixed and that each variable enters to a power bounded by…

If $p:\mathbb{C} \to \mathbb{C}$ is a non-constant polynomial, the Gauss--Lucas theorem asserts that its critical points are contained in the convex hull of its roots. We consider the case when $p$ is a random polynomial of degree $n$ with…

We describe the algebraic boundaries of the regions of real binary forms with fixed typical rank and of degree at most eight, showing that they are dual varieties of suitable coincident root loci.

For univariate polynomials over arbitrary field the degree gives an upper bound on the number of roots (factor theorem) and as a related result for any finite point-set one can construct a polynomial of degree equal to the cardinality…