Related papers: Matricial Proofs of Some Classical Results about C…

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…

The B\^{o}cher-Grace Theorem can be stated as follows: Let $p$ be a third degree complex polynomial. Then there is a unique inscribed ellipse interpolating the midpoints of the triangle formed from the roots of $p$, and the foci of the…

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

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…

We study critical points of holomorphic sections of $\ocal(m)$ on $\CP^n$. For quadrics, we give a complete discription of their critical points. When $n=1$, we prove a spherical Gauss-Lucas theorem. For general situation, we prove that a…

We give elementary proofs of some congruence criteria to compute binomial coefficients in modulo a prime. These criteria are analogues to the symmetry property of binomial coefficients. We give extended version of Lucas Theorem by using…

Using a result of Robertson \textit{[Proc. Edinburgh Math. Soc. (2), 1976]}, we introduce a notion of differentiation of maps on certain classes of unital commutative C*-algebras. We then derive C*-algebraic Gauss-Lucas theorem and…

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.

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…

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

Recently Guth and Katz \cite{GK2} invented, as a step in their nearly complete solution of Erd\H{o}s's distinct distances problem, a new method for partitioning finite point sets in $\R^d$, based on the Stone--Tukey polynomial ham-sandwich…

We summarize significant classical results on (in)determinacy of measures in terms of their finite positive integer order moments. Well-known is the role of the smallest eigenvalues of Hankel matrices, starting from Hamburger's results a…

In this paper I present a kind of proof for classical Euclidean geometric problems which relies on both synthetic and analytic geometry. Using the elementary tools of polynomial algebra and multivariate calculus we manage to reduce the…

The classic Gauss-Lucas Theorem for complex polynomials of degree $d\ge2$ has a natural reformulation over quaternions, obtained via rotation around the real axis. We prove that such a reformulation is true only for $d=2$. We present a new…

We consider powers of the absolute value of the characteristic polynomial of Haar distributed random orthogonal or symplectic matrices, as well as powers of the exponential of its argument, as a random measure on the unit circle minus small…

An analogue of the Gauss-Lucas theorem for polynomials over the algebraic closure $\mathbb C_p$ of the field of $p$-adic numbers is considered.

In this article, we survey the the recent literature surrounding the geometry of complex polynomials. Specific areas surveyed are i) Generalizations of the Gauss--Lucas Theorem, ii) Geometry of Polynomials Level Sets, and iii) Shape…

Let {f_t} be any algebraic family of rational maps of a fixed degree, with a marked critical point c(t). We first prove that the hypersurfaces of parameters for which c(t) is periodic converge as a sequence of positive closed (1,1) currents…

Let $p_n$ be the characteristic polynomial of an $n \times n$ random matrix drawn from one of the compact classical matrix groups. We show that the critical points of $p_n$ converge to the uniform distribution on the unit circle as $n$…

A general class of Newton algorithms on Gra{\ss}mann and Lagrange-Gra{\ss}mann manifolds is introduced, that depends on an arbitrary pair of local coordinates. Local quadratic convergence of the algorithm is shown under a suitable condition…