Skip Navigation


Journal of the London Mathematical Society Advance Access originally published online on May 10, 2009
Journal of the London Mathematical Society 2009 80(1):35-54; doi:10.1112/jlms/jdp006
This Article
Right arrow FREE Full Text (PDF) Freely available
Right arrow All Versions of this Article:
80/1/35    most recent
jdp006v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Gabrielov, A.
Right arrow Articles by Vorobjov, N.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2009 London Mathematical Society

Approximation of definable sets by compact families, and upper bounds on homotopy and homology

Andrei Gabrielov

Department of Mathematics
Purdue University
West Lafayette
IN 47907
USA
agabriel@math.purdue.edu

Nicolai Vorobjov

Department of Computer Science
University of Bath
Bath
BA2 7AY
United Kingdom

We prove new upper bounds on homotopy and homology groups of o-minimal sets in terms of their approximations by compact o-minimal sets. In particular, we improve the known upper bounds on Betti numbers of semialgebraic sets defined by quantifier-free formulae and obtain, for the first time, a singly exponential bound on Betti numbers of sub-Pfaffian sets.

2000 Mathematics Subject Classification 14P25 (primary), 14P15, 03C64 (secondary).

The first author was supported in part by NSF grant DMS-0801050.

Received October 18, 2007; revised October 15, 2008; published online May 10, 2009.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.