• Login
    View Item 
    •   Home
    • Research
    • Articles
    • View Item
    •   Home
    • Research
    • Articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    The Fundamental Blossoming Inequality in Chebyshev Spaces—I: Applications to Schur Functions

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Article
    Authors
    Ait-Haddou, Rachid
    Mazure, Marie Laurence
    KAUST Department
    Visual Computing Center (VCC)
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Date
    2016-10-19
    Online Publication Date
    2016-10-19
    Print Publication Date
    2018-02
    Permanent link to this record
    http://hdl.handle.net/10754/622257
    
    Metadata
    Show full item record
    Abstract
    A classical theorem by Chebyshev says how to obtain the minimum and maximum values of a symmetric multiaffine function of n variables with a prescribed sum. We show 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. We give 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. This provides us with a fundamental blossoming inequality associated with each Extended Chebyshev space good for design. This inequality proves to be a very powerful tool to derive many classical or new interesting inequalities. For instance, applied to Müntz spaces and to rational Müntz spaces, it provides us with new inequalities involving Schur functions which generalize the classical MacLaurin’s and Newton’s inequalities. This work definitely demonstrates that, via blossoms, CAGD techniques can have important implications in other mathematical domains, e.g., combinatorics.
    Citation
    Ait-Haddou R, Mazure M-L (2016) The Fundamental Blossoming Inequality in Chebyshev Spaces—I: Applications to Schur Functions. Foundations of Computational Mathematics. Available: http://dx.doi.org/10.1007/s10208-016-9334-8.
    Publisher
    Springer Nature
    Journal
    Foundations of Computational Mathematics
    DOI
    10.1007/s10208-016-9334-8
    ae974a485f413a2113503eed53cd6c53
    10.1007/s10208-016-9334-8
    Scopus Count
    Collections
    Articles; Visual Computing Center (VCC); Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2023  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.