Bounding the Betti numbers and computing the Euler-Poincar\'e characteristic of semi-algebraic sets defined by partly quadratic systems of polynomials
Abstract
Let be a real closed field, Q ⊂ [Y1,...,Y,X1,...,Xk], with Y(Q) ≤ 2, X(Q) ≤ d, Q ∈ Q, #( Q)=m, and P ⊂ [X1,...,Xk] with X(P) ≤ d, P ∈ P, #( P)=s, and S ⊂ +k a semi-algebraic set defined by a Boolean formula without negations, with atoms P=0, P ≥ 0, P ≤ 0, P ∈ P Q. We prove that the sum of the Betti numbers of S is bounded by \[ 2 (O(s++m) 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 d and 2, respectively. We also describe an algorithm for computing the Euler-Poincar\'e characteristic of such sets, generalizing similar algorithms known before. The complexity of the algorithm is bounded by ( s m d)O(m(m+k)).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.