Principal submatrices, restricted invertibility, and a quantitative Gauss-Lucas theorem

DOI10.1093/IMRN/RNY163MaRDI QIDQ5015582zbMATH OpenOpenAlexWikidataFDO

Authors Mohan Ravichandran

Publication date 9 December 2021

Published in IMRN. International Mathematics Research Notices (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1609.04187

zbMATH Keywords

complex polynomialsdecompositionGauss-Lucas theoremprincipal submatricesrestricted invertibility

Mathematics Subject Classification ID

Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Theory of matrix inversion and generalized inverses (15A09) Applications of generalized inverses (15A10) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General (adjoints, conjugates, products, inverses, domains, ranges, etc.) (47A05)

Abstract: 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 well conditioned column submatrices all the way upto the so called modified stable rank. All constructions are algorithmic. A byproduct of these results is an interesting quantitative version of the classical Gauss-Lucas theorem on the critical points of complex polynomials. We show that for any degree $n$ polynomial $p$ and any $cgeqfrac12$, the area of the convex hull of the roots of $p^{(cn)}$ is at most $4(c-c^2)$ that of the area of the convex hull of the roots of $p$.

Recommendations

• Leaky roots and stable Gauss-Lucas theorems
• A quantitative Gauss-Lucas theorem
• Interlacing families. III: Sharper restricted invertibility estimates
• Inverse spectral problem for normal matrices and the Gauss-Lucas theorem
• A stability version of the Gauss-Lucas theorem and applications

Cited in

(11)

• Some recent results on the geometry of complex polynomials: the Gauss-Lucas theorem, polynomial lemniscates, shape analysis, and conformal equivalence
• Critical points of polynomials
• Interlacing families. III: Sharper restricted invertibility estimates
• The flow of polynomial roots under differentiation
• Mixed determinants and the Kadison-Singer problem
• Leaky roots and stable Gauss-Lucas theorems
• A nonlocal transport equation describing roots of polynomials under differentiation
• A nonlocal transport equation modeling complex roots of polynomials under differentiation
• Free Convolution Powers Via Roots of Polynomials
• Repeated differentiation and free unitary Poisson process
• Interlacing polynomial method for matrix approximation via generalized column and row selection

This page was built for publication: Principal submatrices, restricted invertibility, and a quantitative Gauss-Lucas theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015582)