Lower bounds for real solutions to sparse polynomial systems (Q2496714): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Changed an Item
Property / describes a project that uses
 
Property / describes a project that uses: SINGULAR / rank
 
Normal rank

Revision as of 06:22, 28 February 2024

scientific article
Language Label Description Also known as
English
Lower bounds for real solutions to sparse polynomial systems
scientific article

    Statements

    Lower bounds for real solutions to sparse polynomial systems (English)
    0 references
    20 July 2006
    0 references
    The authors represent a system of real polynomial equations with the same Newton polytope as a linear projection from a toric variety to a projective space. Then the number of solutions, i.e., the capacity of a fiber, is estimated from below by the topological degree of the lift of the above linear projection up to a map from an oriented double cover of the toric variety to a sphere. This degree is computed by using degenerations of double covers of toric varieties into the union of coordinate spheres. As example, the authors consider Wronski map on Grassmannians, showing that the Wronski map turns into a linear projection as the Grassmannian degenerates to toric varieties, and in this way the authors recover the result of \textit{A. Eremenko} and \textit{A. Gabrielov} [Discrete Comput. Geom. 28 (3), 331--347 (2002; Zbl 1004.14011)], who computed the topological degrees of real Wronski maps.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    sparse polynomial systems
    0 references
    Schubert calculus
    0 references
    toric varieties
    0 references
    order polytope of a poset
    0 references
    0 references
    0 references