Related papers: A unified approach to polynomial sequences with on…
We investigate the zeros of polynomial solutions to the differential-difference equation \[ P_{n+1}(x)=A_{n}(x)P_{n}^{\prime}(x)+B_{n}(x)P_{n}(x), n=0,1,... \] where $A_{n}$ and $B_{n}$ are polynomials of degree at most 2 and 1…
Let $f$ and $F$ be two polynomials satisfying $F(x)=u(x)f(x)+v(x)f'(x)$. We characterize the relation between the location and multiplicity of the real zeros of $f$ and $F$, which generalizes and unifies many known results, including the…
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…
Following a systematic analysis of existing results, we investigate when complete interlacing between the zeros of distinct polynomial sequences, $\{\mathcal{P}_n\}$ and $\{\mathcal{G}_n\}$ can be achieved by using a naturally arising extra…
We investigate completed interlacing of zeros for pairs of polynomial sequences that fail to interlace by exactly two points. Using a general mixed recurrence relation, we identify a quadratic polynomial whose zeros serve as the two extra…
Let $f(x)$ and $g(x)$ be two real polynomials whose leading coefficients have the same sign. Suppose that $f(x)$ and $g(x)$ have only real zeros and that $g$ interlaces $f$ or $g$ alternates left of $f$. We show that if $ad\ge bc$ then the…
The binomial Eulerian polynomials, introduced by Postnikov, Reiner, and Williams, are $\gamma$-positive polynomials and can be interpreted as $h$-polynomials of certain flag simplicial polytopes. Recently, Athanasiadis studied analogs of…
We describe a wide class of polynomials, which is a natural generalization of Hurwitz stable polynomials. We also give a detailed account of so-called self-interlacing polynomials, which are dual to Hurwitz stable polynomials but have only…
In this paper, we develop a new deflation technique for refining or verifying the isolated singular zeros of polynomial systems. Starting from a polynomial system with an isolated singular zero, by computing the derivatives of the input…
Given a sequence of orthogonal polynomials $(p_n)_n$ with respect to a positive measure in the real line, we study the real zeros of finite combinations of $K+1$ consecutive orthogonal polynomials of the form $$…
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…
In this paper, pursuing the same line of ideas in the proof of an old longstanding open conjecture of \emph{Kadison-Singer} , we introduce a key lemma which we call it the interlacing lemma which indicates a necessary condition for having a…
In this paper we consider interlacing of the zeros of polynomials from different sequences $\{p_n\}$ and $\{g_n\}$. In our main result we consider a mixed recurrence equation necessary for existence of a linear term $(x-A)$ so that the…
We determine all graphs whose matching polynomials have at most five distinct zeros. As a consequence, we find new families of graphs which are determined by their matching polynomial.
In this paper, we prove several theorems on systems of polynomials with at least one positive real zero based on the theory of conceive polynomials. These theorems provide sufficient conditions for systems of multivariate polynomials…
A remarkable identity involving the Eulerian polynomials of type D was obtained by Stembridge (Adv. Math. 106 (1994), p. 280, Lemma 9.1). In this paper we explore an equivalent form of this identity. We prove Brenti's real-rootedness…
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…
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…
In the present study, we propose necessary and sufficient assumptions on the coefficients in order to only get distinct real roots of polynomials.
Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…