Abstract:We establish a connection between discriminants and copositivity of sparse Laurent polynomials. More generally, we consider signomials, which are defined on the positive orthant by linear combinations of monomials with real exponents, and their signed support, consisting of the support of the signomial and the sign of the coefficients. We provide a criterion to determine whether a given signomial is copositive, that is, only attains nonnegative values, which relies on finding the first intersection point in coefficient space of a path and a signed discriminant: the path contains the coefficient vector of the signomial and preserves its signs, and the signed discriminant encodes the singular signomials with the given signed support. If the signed support satisfies a combinatorial condition termed nonseparability, we additionally show that this intersection consists of one point, and that tracking one path with homotopy continuation suffices to decide upon copositivity.
Building on these results, we show that copositive polynomials with nonseparable signed support can always be decomposed into a sum of nonnegative circuit polynomials, generalising thereby previously known supports having this property.
From: Joan Ferrer [view email]
[v1]
Mon, 8 Dec 2025 10:09:11 UTC (42 KB)
[v2]
Tue, 9 Dec 2025 16:25:38 UTC (42 KB)
[v3]
Fri, 3 Jul 2026 14:28:58 UTC (43 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。