Metraipolis › archive › dc_2ce7aab2c506
Sharp Degree Bounds for Putinar Certificates in Terms of the Positivity Margin via Analytic Sums of Squares — arXiv:2610.26976
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.26976
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-21T07:08:45.446Z
- SHA-256 of the archived text
cdd83e2eba2e7b15a6b9d67982b34d5579ab5d169f604ee2f3a13e873a25df1f- Stable URL of this page
https://metraipolis.com/documento/dc_2ce7aab2c506
How to cite
Sharp Degree Bounds for Putinar Certificates in Terms of the Positivity Margin via Analytic Sums of Squares — arXiv:2610.26976 — arXiv (en), https://arxiv.org/abs/2610.26976 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2ce7aab2c506 (Metraipolis archive dc_2ce7aab2c506, sha256 cdd83e2eba2e7b15a6b9d67982b34d5579ab5d169f604ee2f3a13e873a25df1f)
BibTeX
@misc{dc2ce7aab2c506,
title = {Sharp Degree Bounds for Putinar Certificates in Terms of the Positivity Margin via Analytic Sums of Squares — arXiv:2610.26976},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.26976},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2ce7aab2c506; sha256 cdd83e2eba2e7b15a6b9d67982b34d5579ab5d169f604ee2f3a13e873a25df1f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.26976. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We establish sharp degree bounds for Putinar sum-of-squares (SOS) certificates in terms of the positivity margin $\delta$. For any fixed Archimedean quadratic module with prescribed generators and any fixed bound on the degree of the objective, we prove a uniform certificate-degree upper bound of $O(\delta^{-1/2}\log^2(2/\delta))$ for normalized polynomial objectives. We show that this bound is sharp by constructing a matching lower-bound example in three variables, thereby establishing that the dependence on $\delta$ is optimal. These matching bounds also yield sharp worst-case convergence rates for the Lasserre hierarchy.
Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.CL, nuovi lavori del giorno).
Categorie arXiv: Computation and Language (cs.CL).
Pagina del lavoro: https://arxiv.org/abs/2610.26976 — 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-21T07:05:58.092Z dalla pagina https://arxiv.org/list/cs.CL/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).