Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 19 May 2025 in math.CA | (2505.13285v1)

Abstract: Let $K\subset \mathbb{C}$ be a convex compact set, and let $\Pi_n(K)$ be the class of polynomials of exact degree $n$, all of whose zeros lie in $K$. The Tur\'an type inverse Markov factor is defined by $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 $M_n(K)\ge c\left(wn/d2+\sqrt{n}/d\right)$, $c:=0.00015$, where $d>0$ is the diameter of $K$ and $w\ge 0$ is the minimal width (the smallest distance between two parallel lines between which $K$ lies). We prove that this bound is essentially sharp, namely, $M_n(K)\le 28\left(wn/d2+\sqrt{n}/d\right)$ for all $n,w,d$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.