arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1402.4199math.AGmath.OC
收藏

超立方体上的平方和

Sums of Squares on the Hypercube

Grigoriy Blekherman, João Gouveia, James Pfeiffer

摘要:

设X是R^n中的一个有限集。X上的多项式p非负可以写成有理函数模消失理想I(X)的平方和。从应用的角度来看,如多项式优化,我们感兴趣的是小次数的有理函数表示。我们得到了一个一般的上界的希尔伯特函数的X,我们表明,这个上界是紧的情况下,二次函数的超立方体C={0,1}^n,一个非常好的研究情况下,在组合优化。利用C的下界,我们构造了一族全局非负的四次多项式,它们不是小次数有理函数的平方和。据我们所知,这是第一次建设希尔伯特的第17个问题的一个家庭的多项式的有界程度,需要增加的程度,在有理函数表示的数量n的变量趋于无穷大。我们注意到,对称群S_n的表示论在我们的下界证明中起着至关重要的作用。

英文摘要:

Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we are interested in rational function representations of small degree. We derive a general upper bound in terms of the Hilbert function of X, and we show that this upper bound is tight for the case of quadratic functions on the hypercube C={0,1}^n, a very well studied case in combinatorial optimization. Using the lower bounds for C we construct a family of globally nonnegative quartic polynomials, which are not sums of squares of rational functions of small degree. To our knowledge this is the first construction for Hilbert's 17th problem of a family of polynomials of bounded degree which need increasing degrees in rational function representations as the number of variables n goes to infinity. We note that representation theory of the symmetric group S_n play a crucial role in our proofs of the lower bounds.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑