English

On the precise form of the inverse Markov factor for convex sets

Classical Analysis and ODEs 2025-05-20 v1

Abstract

Let KCK\subset \mathbb{C} be a convex compact set, and let Πn(K)\Pi_n(K) be the class of polynomials of exact degree nn, all of whose zeros lie in KK. The Tur\'an type inverse Markov factor is defined by Mn(K)=infPΠn(K)(PC(K)/PC(K))M_n(K)=\inf_{P\in \Pi_n(K)} \left(\|P'\|_{C(K)}/\|P\|_{C(K)}\right). A combination of two well-known results due to Levenberg and Poletsky (2002) and R\'ev\'esz (2006) provides the lower bound Mn(K)c(wn/d2+n/d)M_n(K)\ge c\left(wn/d^2+\sqrt{n}/d\right), c:=0.00015c:=0.00015, where d>0d>0 is the diameter of KK and w0w\ge 0 is the minimal width (the smallest distance between two parallel lines between which KK lies). We prove that this bound is essentially sharp, namely, Mn(K)28(wn/d2+n/d)M_n(K)\le 28\left(wn/d^2+\sqrt{n}/d\right) for all n,w,dn,w,d.

Keywords

Cite

@article{arxiv.2505.13285,
  title  = {On the precise form of the inverse Markov factor for convex sets},
  author = {Mikhail A. Komarov},
  journal= {arXiv preprint arXiv:2505.13285},
  year   = {2025}
}