show/hide this revision's text 5 edited title

Number of connected components of complement to a reducible real algebraic hypersurface.[EDITED]hypersurface.[EDITED]

show/hide this revision's text 4 deleted 31 characters in body; edited title

Number of connected components of complement to a reducible real algebraic hypersurface.hypersurface.[EDITED]]

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.

Can

How we take $x_1+\ldots +x_k + g_1 +\ldots g_l + 1$ as can estimate an upper bound for the number of connected components of $R^n\setminus (X_1\cup\ldots\cup X_k)$?

For example, this is true such an estimate for $n=2$, and that(together with Harnack and Bezout theorems) leads us 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.

show/hide this revision's text 3 deleted 8 characters in body

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.

Can we take $x_1+\ldots +x_k + g_1 +\ldots g_l + 1$ as an upper bound for the number of connected components of $R^n\setminus (X_1\cup\ldots\cup X_k)$?

For example, this is true for $n=2$, and that(together with Harnack and Bezout theorems) leads us 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) number 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.

show/hide this revision's text 2 added 194 characters in body
show/hide this revision's text 1