{"paper":{"title":"RealCertify: a Maple package for certifying non-negativity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.SC","authors_text":"Mohab Safey El Din, Victor Magron","submitted_at":"2018-05-06T12:31:55Z","abstract_excerpt":"Let $\\mathbb{Q}$ (resp. $\\mathbb{R}$) be the field of rational (resp. real) numbers and $X = (X_1, \\ldots, X_n)$ be variables. Deciding the non-negativity of polynomials in $\\mathbb{Q}[X]$ over $\\mathbb{R}^n$ or over semi-algebraic domains defined by polynomial constraints in $\\mathbb{Q}[X]$ is a classical algorithmic problem for symbolic computation.\n  The Maple package \\textsc{RealCertify} tackles this decision problem by computing sum of squares certificates of non-negativity for inputs where such certificates hold over the rational numbers. It can be applied to numerous problems coming fro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02201","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}