Metraipolis › archive › dc_1fa65ac6355a
The Cone Generated by Positive Semidefinite Mean Polynomials — arXiv:2608.22739
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.22739
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T08:25:43.725Z
- SHA-256 of the archived text
295522225d1a76f18f526db7a93772036b976ff1a5b11a57406c0c6765bf190e- Stable URL of this page
https://metraipolis.com/documento/dc_1fa65ac6355a
How to cite
The Cone Generated by Positive Semidefinite Mean Polynomials — arXiv:2608.22739 — arXiv (en), https://arxiv.org/abs/2608.22739 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1fa65ac6355a (Metraipolis archive dc_1fa65ac6355a, sha256 295522225d1a76f18f526db7a93772036b976ff1a5b11a57406c0c6765bf190e)
BibTeX
@misc{dc1fa65ac6355a,
title = {The Cone Generated by Positive Semidefinite Mean Polynomials — arXiv:2608.22739},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.22739},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1fa65ac6355a; sha256 295522225d1a76f18f526db7a93772036b976ff1a5b11a57406c0c6765bf190e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.22739. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the cone $\mathcal{M}_{n,2d}$ of nonnegative mean polynomials---real $n$-variate forms of degree $2d$ that can be expressed as weighted power means $M_{q,p}(Y,w)$ with $q>p$. This cone simultaneously generalises the cone of sums of squares $\Sigma_{n,2d}$ and the cone of sums of nonnegative circuit polynomials $\mathcal{C}_{n,2d}$. We prove that every square of an arbitrary polynomial belongs to the mean polynomial preprime $T_{\mathrm{mean}}$, that $T_{\mathrm{mean}}$ is strongly generating, and consequently that every polynomial strictly positive on a compact semialgebraic set admits a representation with mean polynomial certificates. We exhibit the Robinson form $\hat{R}$ as a separating example that lies in $\mathcal{M}_{4,4}$ but outside $\mathrm{SOSONC}_{4,4}$. Finally, we outline a convergent hierarchy of lower bounds for polynomial optimization based on the mean polynomial cone and discuss tractable depth-truncated approximations via signomial programming.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-25 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2608.22739 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T08:18:05.700Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).