Metraipolis › archive › dc_ff8a323a12af

Vanishing Ideals and the Computational Tractability of Sum-of-Squares over Boolean Domains — arXiv:2609.37929

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.37929
License (as archived)
CC0-1.0
Archived
2026-10-07T19:19:02.198Z
SHA-256 of the archived text
6c2f62b634ddbf4289e8ad6a68108c097287d30798650931f0587a16d8287371
Stable URL of this page
https://metraipolis.com/documento/dc_ff8a323a12af

How to cite

Vanishing Ideals and the Computational Tractability of Sum-of-Squares over Boolean Domains — arXiv:2609.37929 — arXiv (en), https://arxiv.org/abs/2609.37929 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ff8a323a12af (Metraipolis archive dc_ff8a323a12af, sha256 6c2f62b634ddbf4289e8ad6a68108c097287d30798650931f0587a16d8287371)
BibTeX
@misc{dcff8a323a12af,
  title = {Vanishing Ideals and the Computational Tractability of Sum-of-Squares over Boolean Domains — arXiv:2609.37929},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.37929},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ff8a323a12af; sha256 6c2f62b634ddbf4289e8ad6a68108c097287d30798650931f0587a16d8287371},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.37929. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Building on the bit-complexity framework of Raghavendra-Weitz and the moment-SOS criteria of Gribling-Polak-Slot, we study the effective use of truncated vanishing identities over Boolean polynomial systems. A complete, constructible identity space gives an augmented moment SDP that can be optimized with exact rational feasibility and arbitrary additive accuracy. We give a self-contained geometric implementation: an explicit affine reduction and a simplex of Boolean evaluations supply the radius bounds required by rational ellipsoids. The identity space can be constructed directly or extracted from a supplied graded Groebner basis, including one supplied at a higher truncation degree. An explicit transfer theorem connects this augmented formulation to the original system. Two-sided SoS derivations eliminate the added equality axioms from certificates, with controlled degree and coefficient growth, and imply containment of a projected higher-level moment relaxation in the augmented body. Together with spectral coefficient bounds, this gives polynomial-time search for rational proofs with an additive perturbation. For Min-closed linear systems, propagation constructs the identity space in polynomial time at fixed degree and gives degree-(4t+4) certificates for both signs of each degree-t basis element. Consequently, a rational degree-(8d+4) proof of f + epsilon >= 0 can be found in polynomial time for fixed d whenever f >= 0 has a degree-2d proof. The augmented degree-2d moment SDP can be optimized in polynomial time with exact rational feasibility and a comparison to the original degree-(8d+4) relaxation. Boolean complementation gives the same results for Max-closed systems, including generalized packing and covering. Min-closed systems thus provide a concrete application of the general criteria. All complexity bounds are in the Turing model.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-30 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.37929 — 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-07T18:45:07.090Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).