Approximation of definable sets by compact families, and upper bounds on homotopy and homology
From MaRDI portal
(Redirected from Publication:5323898)
Abstract: 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.
Recommendations
Cited in
(34)- On the number of topological types occurring in a parameterized family of arrangements
- Betti numbers of semi-Pfaffian sets
- Upper bounds on Betti numbers of tropical prevarieties
- Dicovering approximation spaces and definability
- Density of algebraic points on Noetherian varieties
- Multi-degree bounds on the Betti numbers of real varieties and semi-algebraic sets and applications
- Topology of definable Hausdorff limits
- On the equivariant Betti numbers of symmetric definable sets: vanishing, bounds and algorithms
- Semi-monotone sets
- Computing the homology of semialgebraic sets. II: General formulas
- Vandermonde varieties, mirrored spaces, and the cohomology of symmetric semi-algebraic sets
- On the Reeb spaces of definable maps
- On generalizing Descartes' rule of signs to hypersurfaces
- A complexity theory of constructible functions and sheaves
- Wilkie's conjecture for restricted elementary functions
- Topological lower bounds for arithmetic networks
- Helly numbers of acyclic families
- Bounding the equivariant Betti numbers of symmetric semi-algebraic sets
- Triangulations of monotone families. I: two-dimensional families
- BETTI NUMBERS OF SEMIALGEBRAIC AND SUB-PFAFFIAN SETS
- Lipschitz–Killing Invariants
- Bounds of Hausdorff measures of tame sets
- Combinatorial complexity in o-minimal geometry
- On topological lower bounds for algebraic computation trees
- On the number of homotopy types of fibres of a definable map
- Persistent Homology of Semialgebraic Sets
- Computing the homology functor on semi-algebraic maps and diagrams
- Improved effective Łojasiewicz inequality and applications
- On the computation of the homology of semialgebraic sets
- Partitioning theorems for sets of semi-Pfaffian sets, with applications
- Quantitative approximate definable choices
- Coarse nodal count and topological persistence
- Covering number of real algebraic varieties and beyond: improved bounds and applications
- Vanishing homology
This page was built for publication: Approximation of definable sets by compact families, and upper bounds on homotopy and homology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5323898)