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

Abstract

Let K⊂ C be a convex compact set, and let 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 Mn(K)=∈fP∈ n(K) (\|P'\|C(K)/\|P\|C(K)). 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), c:=0.00015, where d>0 is the diameter of K and w 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, Mn(K) 28(wn/d2+n/d) for all n,w,d.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…