2000 character limit reached
Inequalities for Lorentz polynomials (1406.2843v1)
Published 11 Jun 2014 in math.CA
Abstract: We prove a few interesting inequalities for Lorentz polynomials including Nikolskii-type inequalities. A highlight of the paper is a sharp Markov-type inequality for polynomials of degree at most n with real coefficients and with derivative not vanishing in the open unit disk. The result may be compared with Erdos's classical Markov-type inequality (1940) for polynomials of degree at most n having only real zeros outside the interval (-1,1).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.