267 research outputs found
On Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-Algebraic Sets
In this paper we prove new bounds on the sum of the Betti numbers of closed semi-algebraic sets and also give the first single exponential time algorithm for computing the Euler characteristic of arbitrary closed semi-algebraic sets.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/42421/1/454-22-1-1_22n1p1.pd
Efficient algorithms for computing the Euler-Poincar\'e characteristic of symmetric semi-algebraic sets
Let be a real closed field and
an ordered domain. We consider the algorithmic problem of computing the
generalized Euler-Poincar\'e characteristic of real algebraic as well as
semi-algebraic subsets of , which are defined by symmetric
polynomials with coefficients in . We give algorithms for computing
the generalized Euler-Poincar\'e characteristic of such sets, whose
complexities measured by the number the number of arithmetic operations in
, are polynomially bounded in terms of and the number of
polynomials in the input, assuming that the degrees of the input polynomials
are bounded by a constant. This is in contrast to the best complexity of the
known algorithms for the same problems in the non-symmetric situation, which
are singly exponential. This singly exponential complexity for the latter
problem is unlikely to be improved because of hardness result
(-hardness) coming from discrete complexity theory.Comment: 29 pages, 1 Figure. arXiv admin note: substantial text overlap with
arXiv:1312.658
Bounding the number of stable homotopy types of a parametrized family of semi-algebraic sets defined by quadratic inequalities
We prove a nearly optimal bound on the number of stable homotopy types
occurring in a k-parameter semi-algebraic family of sets in , each
defined in terms of m quadratic inequalities. Our bound is exponential in k and
m, but polynomial in . More precisely, we prove the following. Let
be a real closed field and let with . Let be a
semi-algebraic set, defined by a Boolean formula without negations, whose atoms
are of the form, . Let be the projection on the last k co-ordinates. Then, the number of
stable homotopy types amongst the fibers S_{\x} = \pi^{-1}(\x) \cap S is
bounded by Comment: 27 pages, 1 figur
- β¦