On Certain Mean Values of Polynomials on the Unit Interval

Authors: Dryanov D.; Lubinsky Q.D.I.S.

Source: Journal of Approximation Theory, Volume 101, Number 1, November 1999 , pp. 92-120(29)

Publisher: Academic Press

Buy & download fulltext article:

OR

Price: $52.63 plus tax (Refund Policy)

Abstract:

For any continuous function f: [-1, 1]mapCopf and any pisin(0, infin), let VerbarfVerbarpcolone(2-1 int1-1 |f(x)|p dx)1/p; in addition, let VerbarfVerbarinfincolonemax-1lesxles1 |f(x)|. It is known that if f is a polynomial of degree n, then for all p>0,VerbarfVerbarinfinlesCpn2/p VerbarfVerbarp,where Cp is a constant depending on p but not on n. In this result of Nikolskibreveinodot (1951), which was independently obtained by Szegö and Zygmund (1954), the order of magnitude of the bound is the best possible. We obtain a sharp version of this inequality for polynomials not vanishing in the open unit disk. As an application we prove the following result. If f is a real polynomial of degree n such that f(-1)=f(1)=0 and f(z)ne0 in the open unit disk, then for p>0 the quantity VerbarfprimeVerbarinfin/VerbarfVerbarp is maximized by polynomials of the form c(1+x)n-1 (1-x), c(1+x)(1-x)n-1, where cisinRopf\{0}. This extends an inequality of Erdodblacs (1940). Copyright 1999 Academic Press.

Language: English

Document Type: Research article

Affiliations: 1: Department of Mathematics and Computer Science, University of Sofia, James Boucher 5, Sofia, 1126, Bulgaria

Publication date: 1999-11-01

Related content

Tools

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page