Markov-Bernstein type inequalities for constrained polynomials with real versus complex coefficients (Q1128164): Difference between revisions

In this paper the reader is guided through a long series of papers on Markov-Bernstein type inequalities for constrained univariate polynomials starting with that of Erdős from 1940. The author completes the list by establishing upper and lower bounds for \(M^c(n,k)=\sup\{| p'(x)|: p\in\mathcal P^c_{n,k}\), \(\| p\|_{[-1,1]}\leq 1\}\) (resp. \(M(n,k)=\sup\{| p'(x)|: p\in\mathcal P_{n.k}\), \(\| p\| _{[-1,1]}\leq 1\}\)), where \(\mathcal P^c_{n,k}\) (resp. \(\mathcal P_{n,k}\)) is the set of all polynomials of degree \(\leq n\) with complex (resp. real) coefficients and with at most \(k\) \((0\leq k\leq n)\) zeros in the open unit disk. His results also clear up a significant difference between the real and complex case when such inequalities are concerned.