An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions

From MaRDI portal
Publication:987564

DOI10.1007/S00493-009-2357-XzbMATH Open1212.14005arXivmath/0603256OpenAlexW2058434068WikidataQ57253833 ScholiaQ57253833MaRDI QIDQ987564FDOQ987564


Authors: Saugata Basu, Richard Pollack, Marie-Françoise Roy Edit this on Wikidata


Publication date: 13 August 2010

Published in: Combinatorica (Search for Journal in Brave)

Abstract: We prove an asymptotically tight bound (asymptotic with respect to the number of polynomials for fixed degrees and number of variables) on the number of semi-algebraically connected components of the realizations of all realizable sign conditions of a family of real polynomials. More precisely, we prove that the number of semi-algebraically connected components of the realizations of all realizable sign conditions of a family of s polynomials in R[X1,...,Xk] whose degrees are at most d is bounded by [ frac{(2d)^k}{k!}s^k + O(s^{k-1}). ] This improves the best upper bound known previously which was [ {1/2}frac{(8d)^k}{k!}s^k + O(s^{k-1}). ] The new bound matches asymptotically the lower bound obtained for families of polynomials each of which is a product of generic polynomials of degree one.


Full work available at URL: https://arxiv.org/abs/math/0603256




Recommendations




Cites Work


Cited In (8)





This page was built for publication: An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987564)