SOS锥边界上的严格正多项式
Strictly positive polynomials in the boundary of the SOS cone
AI总结:
该研究聚焦SOS锥中对应严格正多项式的非共享边界,结合理论与计算方法证明了现有关于SOS分解多项式最大数量和Gram谱体矩阵最大秩的界对所有次数、变量数均最优,还给出了相关问题的实例。
摘要:
我们研究可分解为实多项式平方和(sum of squares, SOS)的实多项式构成的锥的边界。该锥包含于非负多项式锥中,且两个锥共享部分边界,这部分边界对应至少在一个点处取零值的多项式。我们聚焦于两者不共享的边界部分,即对应严格正多项式的边界。\n 对于3变量6次多项式和4变量4次多项式的情形,G. Blekherman已完全刻画了这类边界。对于变量更多或次数更高的情形,G. Blekherman、R. Sinn、M. Velasco及其他学者基于一般猜想得到的结果,给出了SOS分解中可出现的多项式最大数量,以及Gram谱体中矩阵最大秩的界。结合理论结果与计算技术,我们计算了若干实例,得以证明这些界对所有次数和变量数都是最优的。此外,我们还给出了以下问题的实例:锥边界上可表示为少于$n$个平方和且具有公共复根的多项式实例,以及边界上长度大于维度预期值的多项式实例。
英文摘要:
We study the boundary of the cone of real polynomials that can be decomposed as a sum of squares (SOS) of real polynomials. This cone is included in the cone of nonnegative polynomials and both cones share a part of their boundary, which corresponds to polynomials that vanish at at least one point. We focus on the part of the boundary which is not shared, corresponding to strictly positive polynomials. For the cases of polynomials of degree 6 in 3 variables and degree 4 in 4 variables, this boundary has been completely characterized by G. Blekherman. For the cases of more variables or higher degree, results by G. Blekherman, R. Sinn and M. Velasco and other authors based on general conjectures give bounds for the maximum number of polynomials that can appear in a SOS decomposition and the maximum rank of the matrices in the Gram spectrahedron. Combining theoretical results and computational techniques, we compute examples that allow us to prove the optimality of the bounds for all degrees and number of variables. Additionally, we give examples for the following problems: examples in the boundary of the cone that are the sum of less than $n$ squares and have common complex roots, and examples of polynomials in the boundary with length larger than the expected from the dimension.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。