Let $X\_1,\ldots X\_k$ be irreducible(may be singular) affine real algebraic hypersurfaces in $R^n$ with $x\_1,\ldots, x\_k$ connected components, respectively.


Let $G\_1,\ldots, G\_l$ be their intersections of dimension $n-2$, with $g\_1,\ldots, g\_l$ connected components, respectively.


How we can estimate an upper bound for the number of connected components of $R^n\setminus (X\_1\cup\ldots\cup X\_k)$?


For example, such an estimate for $n=2$, and that(together with Harnack and Bezout theorems) [leads us](https://mathoverflow.net/questions/68954/maximal-number-of-connected-components-of-complement-to-an-affine-plane-real-alge) to an exact upper bound for a number of connected components of a complement to a real plane algebraic curve.


Of course, due to unsolvedness of Harnack problem in general case we cannot think of an exact upper bound in that case and the result of Bihan(Asymptotic behaviour of Betti numbers of real algebraic surfaces, Comm.Math.Helv. 78 (2003), 227-244) contradicts it's obvious generalization. (He gave an asymptotics for number of connected components of an irreducible variety in the case of surfaces as $dq^3$, where $q$ is the degree of surface and $d\in [\frac{13}{36},\frac{5}{12}]$, while obvious generalization give us $\frac{q^3+5q+6}{6}$ components of complement to a reducible -- that is a number of parts generated by planes in general position). But, of course, some upper bounds could be obtained using Comessati-Petrovsky-Oleinik inequality.



Number of connected components of complement to a reducible real algebraic hypersurface.[EDITED]
One possible upper bound could be found in a paper by Hugh E. Warren Lower Bounds for approximation by nonlinear manifolds//Transactions of the AMS. 1968. Vol.133 P.~167--178.


He gives the following bound:


Let $p\_1,\ldots, p\_m$ be real polynomials in $n$ variables, each of degree $d$ or less. Let $N(p\_i)$ be a set of zeros of $p\_i$.


The number of topological components of the set $R^n\setminus\cup\_iN(p\_i)$ does not exceed $\sum\_{k=0}^n2(2d)^n2^kC\_{m,k}$, where $C\_{m,k}$ is the usual binomial coefficient, except that $C\_{m,k}=0$ for $m< k$


