On approximate Gauss-Lucas theorems

arXiv1706.05410MaRDI QIDQ6287948FDOQ6287948

Authors: Trevor Richards 

Publication date: 16 June 2017

Abstract: The Gauss--Lucas theorem states that any convex set $KsubsetmathbbC$ which contains all $n$ zeros of a degree $n$ polynomial $pinmathbbC[z]$ must also contain all $n-1$ critical points of $p$. In this paper we explore the following question: for which choices of positive integers $n$ and $k$, and positive real number $epsilon$, will it follow that for every degree $n$ polynomial $p$ with at least $k$ zeros lying in $K$, $p$ will have at least $k-1$ critical points lying in the $epsilon$-neighborhood of $K$. We supply an inequality relating $n$, $k$, and $epsilon$ which, when satisfied, guarantees a positive answer to the above question.

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15)

This page was built for publication: On approximate Gauss-Lucas theorems

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