On the equivariant Betti numbers of symmetric definable sets: vanishing, bounds and algorithms

• Saugata Basu ^[1] ; Cordian Riener ^[2]
  1. [1] Purdue University

     Purdue University

     Township of Wabash, Estados Unidos

     
  2. [2] The Arctic University of Norway

     The Arctic University of Norway

     Noruega

     
• Localización: Selecta Mathematica, New Series, ISSN 1022-1824, Vol. 24, Nº. 4, 2018, págs. 3241-3281
• Idioma: inglés
• DOI: 10.1007/s00029-018-0401-7
• Enlaces
  • Texto completo (pdf)
• Resumen

  • Let R be a real closed field. We prove that for any fixed d, the equivariant rational cohomology groups of closed symmetric semi-algebraic subsets of Rk defined by polynomials of degrees bounded by d vanishes in dimensions d and larger. This vanishing result is tight. Using a new geometric approach we also prove an upper bound of d O(d) sd kd/2−1 on the equivariant Betti numbers of closed symmetric semialgebraic subsets of Rk defined by quantifier-free formulas involving s symmetric polynomials of degrees bounded by d, where 1 < d  s, k. This bound is tight up to a factor depending only on d. These results significantly improve upon those obtained previously in Basu and Riener (Adv Math 305:803–855, 2017) which were proved using different techniques. Our new methods are quite general, and also yield bounds on the equivariant Betti numbers of certain special classes of symmetric definable sets (definable sets symmetrized by pulling back under symmetric polynomial maps of fixed degree) in arbitrary o-minimal structures over R. Finally, we utilize our new approach to obtain an algorithm with polynomially bounded complexity for computing these equivariant Betti numbers. In contrast, the problem of computing the ordinary Betti numbers of (not necessarily symmetric) semi-algebraic sets is considered to be an intractable problem, and all known algorithms for this problem have doubly exponential complexity.