A sharp Remez inequality on the size of constrained polynomials (Q2276703)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4196624
Language Label Description Also known as
default for all languages
No label defined
    English
    A sharp Remez inequality on the size of constrained polynomials
    scientific article; zbMATH DE number 4196624

      Statements

      A sharp Remez inequality on the size of constrained polynomials (English)
      0 references
      0 references
      1990
      0 references
      The following Remez-type inequality for Lorentz class of polynomials \(P_ n(-1,1):=\{p(x)=\sum a_ j(1-x)^ j(1+x)^{n-j}\) with all \(a_ j\geq 0\) or all \(a_ j\leq 0\}\) is proved: If \(p\in P_ n(-1,1)\) and \(m(\{x\in [-1,1]:| p(x)| \leq 1\})\geq 2-s\) \((0<s<2)\), then \(\max_{-1\leq x\leq 1}| p(x)| \leq (1-s/2)^{-n}\) and the inequality holds only for the polynomials \(\pm (1\pm x)^ n/(2-s)^ n\).
      0 references
      Remez-type inequality
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references