In this paper, we provide asymptotic upper bounds on the complexity in two (closely related) situations. We confirm for the total doubling coverings and not only for the chains the expected bounds of the form ?() = K1 log 1 dK2. This is done in a rather general setting, i.e. for the d-complement of a polynomial zero-level hypersurface Y0 and for the regular level hypersurfaces Yc themselves with no assumptions on the singularities of P. The coefficient K2 is the ambient dimension n in the first case and n - 1 in the second case. However, the question of a uniform behavior of the coefficient K1 remains open. As a second theme, we confirm in arbitrary dimension the upper bound for the number of a-charts covering a real semi-algebraic set X of dimension m away from the d-neighborhood of a lower dimensional set S, with bound of the form ?(d) = C log 1 dm holding uniformly in the complexity of X. We also show an analogue for level sets with parameter away from the d-neighborhood of a low dimensional set. More generally, the bounds are obtained also for real subanalytic and real power-subanalytic sets.
All Science Journal Classification (ASJC) codes
- Applied Mathematics