Related papers: Algorithmic and topological aspects of semi-algebr…

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)…

Real algebraic geometry is the study of semi-algebraic sets, subsets of $\R^k$ defined by Boolean combinations of polynomial equalities and inequalities. The focus of this thesis is to study quantitative results in real algebraic geometry,…

A semi-algebraic set is a subset of $\mathbb{R}^n$ defined by a finite collection of polynomial equations and inequalities. In this paper, we investigate the problem of determining whether two points in such a set belong to the same…

We give a survey of algorithms for computing topological invariants of semi-algebraic sets with special emphasis on the more recent developments in designing algorithms for computing the Betti numbers of semi-algebraic sets. Aside from…

Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…

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)…

Let $\mathrm{R}$ be a real closed field. The problem of obtaining tight bounds on the Betti numbers of semi-algebraic subsets of $\mathrm{R}^k$ in terms of the number and degrees of the defining polynomials has been an important problem in…

For any $\ell > 0$, we present an algorithm which takes as input a semi-algebraic set, $S$, defined by $P_1 \leq 0,...,P_s \leq 0$, where each $P_i \in \R[X_1,...,X_k]$ has degree $\leq 2,$ and computes the top $\ell$ Betti numbers of $S$,…

Connected components of real algebraic sets are semi-algebraic, i.e. they are described by a boolean formula whose atoms are polynomial constraints with real coefficients. Computing such descriptions finds topical applications in optical…

A semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities having real coefficients and is a union of finitely many maximally connected components. We consider the problem of deciding whether two…

Let $\mathrm{R}$ be a real closed field and $\mathrm{C}$ the algebraic closure of $\mathrm{R}$. We give an algorithm for computing a semi-algebraic basis for the first homology group, $\mathrm{H}_1(S,\mathbb{F})$, with coefficients in a…

Let $\mathrm{R}$ be a real closed field and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We give an algorithm that takes as input a polynomial $Q \in \mathrm{D}[X_1,\ldots,X_k]$, and computes a description of a roadmap of the set of…

We prove new bounds on the Betti numbers of real varieties and semi-algebraic sets that have a more refined dependence on the degrees of the polynomials defining them than results known before. Our method also unifies several different…

Let $\mathrm{R}$ be a real closed field. We prove that for any fixed $d$, the equivariant rational cohomology groups of closed symmetric semi-algebraic subsets of $\mathrm{R}^k$ defined by polynomials of degrees bounded by $d$ vanishes in…

Let $S \subset \R^{k + m}$ be a compact semi-algebraic set defined by a system of $\ell$ polynomial inequalities of degree at most 2. $ Let $\pi$ denote the standard projection from $\R^{k + m}$ onto $\R^m$. We prove that for any $q >0$,…

In this paper we consider the problem of bounding the Betti numbers, $b_i(S)$, of a semi-algebraic set $S \subset \R^k$ defined by polynomial inequalities $P_1 \geq 0,...,P_s \geq 0$, where $P_i \in \R[X_1,...,X_k]$ and $\deg(P_i) \leq 2$,…

We prove a nearly optimal bound on the number of stable homotopy types occurring in a k-parameter semi-algebraic family of sets in $\R^\ell$, each defined in terms of m quadratic inequalities. Our bound is exponential in k and m, but…

Given a polynomial $f$ and a semi-algebraic set $S$, we provide a symbolic algorithm to find the equations and inequalities defining a semi-algebraic set $Q$ which is identical to the closure of the image of $S$ under $f$, i.e.,…

This paper concerns a method for finding the minimum of a polynomial on a semialgebraic set, i.e., a set in $\re^m$ defined by finitely many polynomial equations and inequalities, using the Karush-Kuhn-Tucker (KKT) system and sum of squares…

We prove a complexity lower bound on deciding membership in a semialgebraic set for arithmetic networks in terms of the sum of Betti numbers with respect to "ordinary" (singular) homology. This result complements a similar lower bound by…