Processing math: 100%
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Polyhedral homotopies in Cox coordinates

    https://doi.org/10.1142/S0219498824500737Cited by:0 (Source: Crossref)

    We introduce the Cox homotopy algorithm for solving a sparse system of polynomial equations on a compact toric variety XΣ. The algorithm lends its name from a construction, described by Cox, of XΣ as a GIT quotient XΣ=(kZ)//G of a quasi-affine variety by the action of a reductive group. Our algorithm tracks paths in the total coordinate space k of XΣ and can be seen as a homogeneous version of the standard polyhedral homotopy, which works on the dense torus of XΣ. It furthermore generalizes the commonly used path tracking algorithms in (multi)projective spaces in that it tracks a set of homogeneous coordinates contained in the G-orbit corresponding to each solution. The Cox homotopy combines the advantages of polyhedral homotopies and (multi)homogeneous homotopies, tracking only mixed volume many solutions and providing an elegant way to deal with solutions on or near the special divisors of XΣ. In addition, the strategy may help to understand the deficiency of the root count for certain families of systems with respect to the BKK bound.

    Communicated by J. D. Hauenstein

    AMSC: 13P15, 14M25, 68W30