加载中…
Consider a system of random real polynomials in variables, where each has a prescribed set of exponent vectors described by a set of cardinality , whose convex hull is denoted . Assuming that the coefficients of the are independent standard Gaussian, we prove that the expected number of zeros of the random system in the positive orthant is at most . Here denotes the number of vertices of the Minkowski sum . However, this bound does not improve over the bound in Bürgisser et al. (SIAM J. Appl. Algebra Geom. 3(4), 2019) for the unmixed case, where all supports are equal. All arguments equally work for real exponent vectors.

生成讲解博客的中文版本

生成AI智能校验的中文版本