Copositivity, discriminants and nonseparable signed supports
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914189925154816 |
|---|---|
| author | Feliu, Elisenda Ferrer, Joan Telek, Máté L. |
| author_facet | Feliu, Elisenda Ferrer, Joan Telek, Máté L. |
| contents | In this work we establish a connection between copositivity, that is, nonnegativity on the positive orthant, of sparse real Laurent polynomials and discriminants. Specifically, we consider Laurent polynomials in the positive orthant with fixed support and fixed coefficient signs. We provide a criterion to decide whether a given polynomial is copositive that is based in determining the intersection points of the signed discriminant and a path going through the coefficients of the polynomial. If the signed support satisfies a combinatorial condition termed nonseparability, we show additionally that this intersection consists of one point, and that tracking one path in homotopy continuation methods suffices to decide upon copositivity.
Building on these results, we show that any copositive polynomial with nonseparable signed support can be decomposed into a sum of nonnegative circuit polynomials, generalising thereby previously known supports having this property. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_07373 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Copositivity, discriminants and nonseparable signed supports Feliu, Elisenda Ferrer, Joan Telek, Máté L. Algebraic Geometry Combinatorics Optimization and Control 12D10, 14P10, 52C45 In this work we establish a connection between copositivity, that is, nonnegativity on the positive orthant, of sparse real Laurent polynomials and discriminants. Specifically, we consider Laurent polynomials in the positive orthant with fixed support and fixed coefficient signs. We provide a criterion to decide whether a given polynomial is copositive that is based in determining the intersection points of the signed discriminant and a path going through the coefficients of the polynomial. If the signed support satisfies a combinatorial condition termed nonseparability, we show additionally that this intersection consists of one point, and that tracking one path in homotopy continuation methods suffices to decide upon copositivity. Building on these results, we show that any copositive polynomial with nonseparable signed support can be decomposed into a sum of nonnegative circuit polynomials, generalising thereby previously known supports having this property. |
| title | Copositivity, discriminants and nonseparable signed supports |
| topic | Algebraic Geometry Combinatorics Optimization and Control 12D10, 14P10, 52C45 |
| url | https://arxiv.org/abs/2512.07373 |