相关论文: Polynomials, roots, and interlacing

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.

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…

This paper is devoted to several new results concerning (standard) octonion polynomials. The first is the determination of the roots of all right scalar multiples of octonion polynomials. The roots of left multiples are also discussed,…

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,…

In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials

For real polynomials with (sparse) exponents in some fixed set, \[ \Psi(t)=x+y_1t^{k_1}+\ldots +y_L t^{k_L}, \] we analyse the types of root structures that might occur as the coefficients vary. We first establish a stratification of roots…

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…

Some cubic polynomials over the integers have three distinct real roots with continued fractions that all have the same common tail. We characterize the polynomials for which this happens, and then investigate the situation for other…

Univariate polynomials with only real roots -- while special -- do occur often enough that their properties can lead to interesting conclusions in diverse areas. Due mainly to the recent work of two young mathematicians, Julius Borcea and…

We extend the algorithms of Robinson, Smyth, and McKee--Smyth to enumerate all real-rooted integer polynomials of a fixed degree, where the first few (at least three) leading coefficients are specified. Additionally, we introduce new linear…

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…

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…

We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…

Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…

We provide a unified, elementary, topological approach to the classical results stating the continuity of the complex roots of a polynomial with respect to its coefficients, and the continuity of the coefficients with respect to the roots.…

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…

This article is divided in two parts. In the first part we review some recent results concerning the expected number of real roots of random system of polynomial equations. In the second part we deal with a different problem, namely, the…

Polynomials whose zeros are symmetric either to the real line or to the unit circle are very important in mathematics and physics. We can classify them into three main classes: the self-conjugate polynomials, whose zeros are symmetric to…

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…

Techniques for the evaluation of complex polynomials with one and two variables are introduced. Polynomials arise in may areas such as control systems, image and signal processing, coding theory, electrical networks, etc., and their…