On constrained Markov-Nikolskii type inequality for k-absolutely monotone polynomials
Abstract
We consider the classical problem of estimating norms of higher order derivatives of algebraic polynomial via the norms of polynomial itself. The corresponding extremal problem for general polynomials in uniform norm was solved by A. A. Markov. In 1926, Bernstein found the exact constant in the Markov inequality for monotone polynomials. T. Erdelyi showed that the order of the constants in constrained Markov-Nikolskii inequality for k- absolutely monotone polynomials is the same as in the classical one in case 0<p q∞. In this paper, we find the exact order for all values of 0<p,q∞. It turned out that for the case q<p constrained Markov-Nikolskii inequality can be significantly improved.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.