首页> 外文期刊>Selecta mathematica >On the equivariant Betti numbers of symmetric definable sets: vanishing, bounds and algorithms
【24h】

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

机译:关于对称可定义集的等价贝蒂数:消失,界限和算法

获取原文
获取原文并翻译 | 示例
           

摘要

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 R-k 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)) S-d k(left perpendiculard/2right)( perpendicular-1) on the equivariant Betti numbers of closed symmetric semi-algebraic subsets of R-k 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.
机译:让R是一个真正的封闭领域。我们证明,对于任何固定的D,由DY界定的多项式的R-K定义的闭合对称半代数亚组的等级合理的合理组织组在尺寸下变得d和更大。这种消失的结果很紧。使用新的几何方法,我们还证明了由量程定义的闭合对称半代数群的闭合对称半代数亚组的等数贝蒂数的D(o(d))sdk(左侧Perpendiculard / 2right)(垂直-1)的上限自由公式,涉及受D界限的偏向度的S对称多项式,其中1℃。 d&& s,k。这一界限直到一个因子而不是一个因素。这些结果显着改善了先前在Basu和Riener获得的那些(ADV MATH 305:803-855,2017)使用不同的技术证明。我们的新方法是相当一般的,并且还在r的特殊类别的对称可定组集中的等级特殊类别的等级贝蒂数量的界限(通过在固定程度的对称多项式地图下拉回),在R的任意O最小结构中。最后,我们利用我们的新方法来获得具有用于计算这些等值贝蒂数的多项式有界复杂度的算法。相反,计算(不一定对称)半代数集的普通贝蒂数量的问题被认为是一个难得的问题,并且该问题的所有已知算法具有双指数复杂性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号