{"paper":{"title":"Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.GT","authors_text":"Dmitrii V. Pasechnik, Marie-Fran\\c{c}oise Roy, Saugata Basu","submitted_at":"2008-06-24T14:54:07Z","abstract_excerpt":"Let $\\R$ be a real closed field, $ {\\mathcal Q} \\subset \\R[Y_1,...,Y_\\ell,X_1,...,X_k], $ with $ \\deg_{Y}(Q) \\leq 2, \\deg_{X}(Q) \\leq d, Q \\in {\\mathcal Q}, #({\\mathcal Q})=m$, and $ {\\mathcal P} \\subset \\R[X_1,...,X_k] $ with $\\deg_{X}(P) \\leq d, P \\in {\\mathcal P}, #({\\mathcal P})=s$. Let $S \\subset \\R^{\\ell+k}$ be a semi-algebraic set defined by a Boolean formula without negations, with atoms $P=0, P \\geq 0, P \\leq 0, P \\in {\\mathcal P} \\cup {\\mathcal Q}$. We describe an algorithm for computing the the Betti numbers of $S$. The complexity of the algorithm is bounded by $(\\ell s m d)^{2^{O(m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.3911","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"}