Related papers: Leaky Roots and Stable Gauss-Lucas Theorems

Let $p:\mathbb{C} \rightarrow \mathbb{C}$ be a polynomial. The Gauss-Lucas theorem states that its critical points, $p'(z) = 0$, are contained in the convex hull of its roots. We prove a stability version whose simplest form is as follows:…

The Gauss-Lucas theorem says that for any complex polynomial $P$, the roots of the derivative $P'$ lie in the convex hull of the roots of $P$. In other words, the roots of $P'$ lie inside the smallest convex subset of the complex plane…

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…

In theory of one complex variable, Gauss-Lucas Theorem states that the critical points of a non constant polynomial belong to the convex hull of the set of zeros of the polynomial. The exact analogue of this result cannot hold, in general,…

The Gauss--Lucas theorem states that any convex set $K\subset\mathbb{C}$ which contains all $n$ zeros of a degree $n$ polynomial $p\in\mathbb{C}[z]$ must also contain all $n-1$ critical points of $p$. In this paper we explore the following…

According to the classical Gauss-Lucas theorem all zeros of the derivative of a complex non-constant polynomial p lie in the convex hull of the zeros of p. It is proved that for a polynomial p of degree four with four different zeros…

We apply the techniques developed by Marcus, Spielman and Srivastava, working with principal submatrices in place of rank $1$ decompositions to give an alternate proof of their results on restricted invertibility. We show that one can find…

Let $p(z)$ be a complex polynomial of degree $n\ge 2$. For each $c\in\mathbb{C}$, let $K_c$ denote the convex hull of the zeros of $p(z)+c$, and let $K'$ denote the convex hull of the zeros of $p'(z)$. We prove that…

The classical Gauss--Lucas theorem describes the location of the critical points of a polynomial. There is also a hyperbolic version, due to Walsh, in which the role of polynomials is played by finite Blaschke products on the unit disk. We…

In this note we extend the Gauss-Lucas theorem on the zeros of the derivative of a univariate polynomial to the case of sequences of univariate polynomials whose almost all zeros lie in a given convex bounded domain in C.

Let $S(\phi)= \{z:\;|\arg(z)|\geq \phi\}$ be a sector on the complex plane $\CC$. If $\phi\geq \pi/2$, then $S(\phi)$ is a convex set and, according to the Gauss-Lucas theorem, if a polynomial $p(z)$ has all its zeros on $S(\phi)$, then the…

We study the roots of polynomials over Cayley--Dickson algebras over an arbitrary field and of arbitrary dimension. For this purpose we generalize the concept of spherical roots from quaternion and octonion polynomials to this setting, and…

Given a real polynomial $p$, we study some properties of real critical points of its logarithmic derivative $Q[p]=(p'/p)'$ using the theory of Cauchy indices. As a by-product we improve the lower bound for the number these points.

In this paper, we provide a simple proof of a generalization of the Gauss-Lucas theorem. By using methods of D-companion matrix, we get the majorization relationship between the zeros of convex combinations of incomplete polynomials and an…

A multivariate Gauss-Lucas theorem is proved, sharpening and generalizing previous results on this topic. The theorem is stated in terms of a seemingly new notion of convexity. Applications to multivariate stable polynomials are given.

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 consider random polynomials $p_n(x)=\xi_0+\xi_1+\dots+\xi_n x^n$ whose coefficients are independent and identically distributed with zero mean, unit variance, and bounded $(2+\epsilon)^{th}$ moment (for some $\epsilon>0$), also known as…

Given a graph $G$, its genus polynomial is $\Gamma_G(x) = \sum_{k\geq 0} g_k(G)x^k$, where $g_k(G)$ is the number of 2-cell embeddings of $G$ in an orientable surface of genus $k$. The Log-Concavity Genus Distribution (LCGD) Conjecture…

It has been shown by Ibragimov and Zaporozhets [In Prokhorov and Contemporary Probability Theory (2013) Springer] that the complex roots of a random polynomial $G_n(z)=\sum_{k=0}^n\xi_kz^k$ with i.i.d. coefficients $\xi_0,\ldots,\xi_n$…

It is proved that the roots of the derivative of a polynomial with quaternionic coefficients belong to the union of the intersections of sets defined in terms of certain projections of a polynomial. The result strengthens the quaternion…