December 13, 2018
Similar papers 2
April 28, 2017
The Kuramoto model describes synchronization behavior among coupled oscillators and enjoys successful application in a wide variety of fields. Many of these applications seek phase-coherent solutions, i.e., equilibria of the model. Historically, research has focused on situations where the number of oscillators, $n$, is extremely large and can be treated as being infinite. More recently, however, applications have arisen in areas such as electrical engineering with more modes...
April 8, 2005
The main results of this paper interpret mixed volumes of lattice polytopes as mixed multiplicities of ideals and mixed multiplicities of ideals as Samuel's multiplicities. In particular, we can give a purely algebraic proof of Bernstein's theorem which asserts that the number of common zeros of a system of Laurent polynomial equations in the torus is bounded above by the mixed volume of their Newton polytopes.
October 31, 1996
This brief note corrects some errors in the paper quoted in the title, highlights a combinatorial result which may have been overlooked, and points to further improvements in recent literature.
June 14, 2018
In this book we describe an approach through toric geometry to the following problem: "estimate the number (counted with appropriate multiplicity) of isolated solutions of n polynomial equations in n variables over an algebraically closed field k." The outcome of this approach is the number of solutions for "generic" systems in terms of their "Newton polytopes," and an explicit characterization of what makes a system "generic." The pioneering work in this field was done in th...
August 7, 2020
In this review article, we report on some recent advances on the computational aspects of cohomology intersection numbers of GKZ systems developed in \cite{GM}, \cite{MH}, \cite{MT} and \cite{MT2}. We also discuss the relation between intersection theory and evaluation of an integral of a product of powers of absolute values of polynomials.
August 15, 2023
In this paper we study a broad class of polynomial optimization problems whose constraints and objective functions exhibit sparsity patterns. We give two characterizations of the number of critical points to these problems, one as a mixed volume and one as an intersection product on a toric variety. As a corollary, we obtain a convex geometric interpretation of polar degrees, a classical invariant of algebraic varieties as well as Euclidean distance degrees. Furthermore, we p...
October 11, 2003
The Gelfond-Khovanskii residue formula computes the sum of the values of any Laurent polynomial over solutions of a system of Laurent polynomial equations whose Newton polytopes have sufficiently general relative position. We discuss two important consequences of this result: an explicit elimination algorithm for such systems and a new formula for the mixed volume. The integer coefficients that appear in the Gelfond-Khovanskii residue formula are geometric invariants that dep...
December 1, 2014
The mixed volume counts the roots of generic sparse polynomial systems. Mixed cells are used to provide starting systems for homotopy algorithms that can find all those roots, and track no unnecessary path. Up to now, algorithms for that task were of enumerative type, with no general non- exponential complexity bound. A geometric algorithm is introduced in this paper. Its complexity is bounded in the average and probability-one settings in terms of some geometric invariants: ...
May 22, 2021
The BKK theorem states that the mixed volume of the Newton polytopes of a system of polynomial equations upper bounds the number of isolated torus solutions of the system. Homotopy continuation solvers make use of this fact to pick efficient start systems. For systems where the mixed volume bound is not attained, such methods are still tracking more paths than necessary. We propose a strategy of improvement by lifting a system to an equivalent system with a strictly lower mix...
June 27, 1996
Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate hyperplanes, these formulae are also the tightest possible upper bounds on the number of isolated roots. We also characterize, in terms of sparse resultants, precisely when these upper bounds are attained. Finally, we reformulate and extend...