Bounding the Betti numbers and computing the Euler-Poincaré characteristic of semi-algebraic sets defined by partly quadratic systems of polynomials

preprint2008arXivOpen access

Abstract

Let R\R be a real closed field, Q⊂R[Y1,...,Yℓ,X1,...,Xk], {\mathcal Q} \subset \R[Y_1,...,Y_\ell,X_1,...,X_k], with $ °_{Y}(Q) \leq 2, °_{X}(Q) \leq d, Q \in {\mathcal Q}, #({\mathcal Q})=m,$ and P⊂R[X1,...,Xk] {\mathcal P} \subset \R[X_1,...,X_k] with $°_{X}(P) \leq d, P \in {\mathcal P}, #({\mathcal P})=s$, and S⊂Rℓ+kS \subset \R^{\ell+k} a semi-algebraic set defined by a Boolean formula without negations, with atoms P=0,P≥0,P≤0,P∈P∪QP=0, P \geq 0, P \leq 0, P \in {\mathcal P} \cup {\mathcal Q}. We prove that the sum of the Betti numbers of SS is bounded by ℓ2(O(s+ℓ+m)ℓd)k+2m. \ell^2 (O(s+\ell+m)\ell d)^{k+2m}. This is a common generalization of previous results on bounding the Betti numbers of closed semi-algebraic sets defined by polynomials of degree dd and 2, respectively. We also describe an algorithm for computing the Euler-Poincaré characteristic of such sets, generalizing similar algorithms known before. The complexity of the algorithm is bounded by (ℓsmd)O(m(m+k))(\ell s m d)^{O(m(m+k))}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.