Newton polyhedra of discriminants of projections (Q977185): Difference between revisions

The author studies a system of polynomial equations \(F_0= \cdots =F_l =0,\) where \(F_0, \ldots , F_l\) are Laurent polynomials on the complex torus \((\mathbb{C} \backslash 0)^k.\) The coefficients of \(F_0, \ldots , F_l\), in their turn are assumed to be Laurent polynomials on \((\mathbb{C} \backslash 0)^n\) which is regarded as the parameter space. Let \(\Sigma\) be the subset in \((\mathbb{C} \backslash 0)^n\) made up by the values of the parameters for which the system \(F_0= \cdots =F_l =0\) defines a singular set in \((\mathbb{C} \backslash 0)^k.\) Usually the closure of \(\Sigma\) is a hypersurface; its defining equation is called the discriminant of the system. The author explicitly computes the Newton polyhedron of the discriminant in terms of the Newton polyhedra of the polynomial coefficients of \(F_0, \ldots , F_l\). The computation was not made before in such generality; it puts in a coherent context scattered results previously known: [\textit{I. M. Gelfand, M. M. Kapranov} and \textit{A. N. Zelevinsky}, Discriminants, resultants and multidimensional determinants. Mathematics: Theory \& Applications. Boston, MA: Birkhäuser. (1994; Zbl 0827.14036)]; \textit{B. Sturmfels} [J. Algebr. Comb. 3, No. 2, 207--236 (1994; Zbl 0798.05074)]; \textit{J. McDonald} [Discrete Comput. Geom. 27, No. 4, 501--529 (2002; Zbl 1067.52013)]; \textit{P. D. González Pérez} [Can. J. Math. 52, No. 2, 348--368 (2000; Zbl 0970.14027)]; \textit{A. Esterov} and \textit{A. Khovanskii} [Funct. Anal. Other Math. 2, No. 1, 45--71 (2008; Zbl 1192.14038)].