Bounding the equivariant Betti numbers of symmetric semi-algebraic sets
From MaRDI portal
Publication:340423
DOI10.1016/J.AIM.2016.09.015zbMATH Open1423.14331arXiv1312.6582OpenAlexW2962904734MaRDI QIDQ340423FDOQ340423
Authors: Saugata Basu, Cordian Riener
Publication date: 14 November 2016
Published in: Advances in Mathematics (Search for Journal in Brave)
Abstract: Let be a real closed field. The problem of obtaining tight bounds on the Betti numbers of semi-algebraic subsets of in terms of the number and degrees of the defining polynomials has been an important problem in real algebraic geometry with the first results due to Ole{ui}nik and Petrovski{ui}, Thom and Milnor. These bounds are all exponential in the number of variables . Motivated by several applications in real algebraic geometry, as well as in theoretical computer science, where such bounds have found applications, we consider in this paper the problem of bounding the equivariant Betti numbers of symmetric algebraic and semi-algebraic subsets of . We obtain several asymptotically tight upper bounds. In particular, we prove that if is a semi-algebraic subset defined by a finite set of symmetric polynomials of degree at most , then the sum of the -equivariant Betti numbers of with coefficients in is bounded by . Unlike the classical bounds on the ordinary Betti numbers of real algebraic varieties and semi-algebraic sets, the above bound is polynomial in when the degrees of the defining polynomials are bounded by a constant. As an application we improve the best known bound on the ordinary Betti numbers of the projection of a compact algebraic set improving for any fixed degree the best previously known bound for this problem due to Gabrielov, Vorobjov and Zell.
Full work available at URL: https://arxiv.org/abs/1312.6582
Recommendations
- On the equivariant Betti numbers of symmetric definable sets: vanishing, bounds and algorithms
- A sharper estimate on the Betti numbers of sets defined by quadratic inequalities
- Different bounds on the different Betti numbers of semi-algebraic sets
- Multi-degree bounds on the Betti numbers of real varieties and semi-algebraic sets and applications
- Different bounds on the different Betti numbers of semi-algebraic sets
Cites Work
- Inequalities defining orbit spaces
- Title not available (Why is that?)
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Most Tensor Problems Are NP-Hard
- On the Betti numbers of semialgebraic sets defined by few quadratic inequalities
- On the positivity of symmetric polynomial functions. I: General results
- Betti numbers of random real hypersurfaces and determinants of random symmetric matrices
- On the degree and half-degree principle for symmetric polynomials
- Title not available (Why is that?)
- On the Betti Numbers of Real Varieties
- Algorithms in real algebraic geometry
- Bounding the Betti numbers and computing the Euler-Poincaré characteristic of semi-algebraic sets defined by partly quadratic systems of polynomials
- FI-modules and stability for representations of symmetric groups
- Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials
- Positive symmetric functions
- On the positivity of symmetric polynomial functions. II: Lattice general results and positivity criteria for degrees 4 and 5
- Lower bounds for arithmetic networks. II: Sum of Betti numbers
- Feasibility testing for systems of real quadratic equations
- A note on extrema of linear combinations of elementary symmetric functions
- Quotients of Coxeter complexes and 𝑃-partitions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear Decision Trees, Subspace Arrangements, and Mobius Functions
- BETTI NUMBERS OF SEMIALGEBRAIC AND SUB-PFAFFIAN SETS
- Betti number bounds, applications and algorithms
- Approximation of definable sets by compact families, and upper bounds on homotopy and homology
- On the positivity of symmetric polynomial functions. III: Extremal polynomials of degree 4
- Title not available (Why is that?)
- Decision tree complexity and Betti numbers
Cited In (9)
- Efficient algorithms for computing the Euler-Poincaré characteristic of symmetric semi-algebraic sets
- New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023
- Topology of real multi-affine hypersurfaces and a homological stability property
- Bounding the Betti numbers and computing the Euler-Poincaré characteristic of semi-algebraic sets defined by partly quadratic systems of polynomials
- Computing critical points for invariant algebraic systems
- On the equivariant Betti numbers of symmetric definable sets: vanishing, bounds and algorithms
- On the number of homotopy types of fibres of a definable map
- Faster real root decision algorithm for symmetric polynomials
- Different bounds on the different Betti numbers of semi-algebraic sets
This page was built for publication: Bounding the equivariant Betti numbers of symmetric semi-algebraic sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340423)