The fundamental blossoming inequality in Chebyshev spaces. I: Applications to Schur functions (Q1704816)

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 6849390
Language Label Description Also known as
default for all languages
No label defined
    English
    The fundamental blossoming inequality in Chebyshev spaces. I: Applications to Schur functions
    scientific article; zbMATH DE number 6849390

      Statements

      The fundamental blossoming inequality in Chebyshev spaces. I: Applications to Schur functions (English)
      0 references
      0 references
      0 references
      13 March 2018
      0 references
      The classical Chebyshev theorem says how to obtain the minimum and maximum values of a symmetric multiaffine function of \(n\) variables with a prescribed sum. It is shown that, given two functions in an extended Chebyshev space good for design, a similar result can be stated for the minimum and maximum values of the blossom of the first function with a prescribed value for the blossom of the second one. Moreover, a simple geometric condition on the control polygon of the planar parametric curve defined by the pair of functions ensuring the uniqueness of the solution to the corresponding optimization problem is given. This provides a fundamental blossoming inequality associated with each extended Chebyshev space good for design. This inequality proves to be a tool to derive some new inequalities involving Schur functions which generalize the classical MacLaurin's and Newton's inequalities.
      0 references
      extended Chebyshev spaces
      0 references
      Chebyshevian blossoming
      0 references
      MacLaurin's inequalities
      0 references
      Newton's inequalities
      0 references
      Müntz spaces
      0 references
      normalized Schur functions
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers