Efficient simplicial replacement of semialgebraic sets
Efficient simplicial replacement of semialgebraic sets
复制标题
半代数集的高效单纯替换
DOI:
10.1017/fms.2023.36
复制
发表时间:
2023
期刊:
影响因子:
--
通讯作者:
Karisani, Negin
中科院分区:
文献类型:
--
作者:
Basu, Saugata;Karisani, Negin
Designing an algorithm with a singly exponential complexity for computing semialgebraic triangulations of a given semialgebraic set has been a holy grail in algorithmic semialgebraic geometry. More precisely, given a description of a semialgebraic set by a first-order quantifier-free formula in the language of the reals, the goal is to output a simplicial complex , whose geometric realization, , is semialgebraically homeomorphic to S. In this paper, we consider a weaker version of this question. We prove that for any , there exists an algorithm which takes as input a description of a semialgebraic subset given by a quantifier-free first-order formula in the language of the reals and produces as output a simplicial complex , whose geometric realization, is -equivalent to S. The complexity of our algorithm is bounded by , where s is the number of polynomials appearing in the formula , and d a bound on their degrees. For fixed , this bound is singly exponential in k. In particular, since -equivalence implies that the homotopy groups up to dimension of are isomorphic to those of S, we obtain a reduction (having singly exponential complexity) of the problem of computing the first homotopy groups of S to the combinatorial problem of computing the first homotopy groups of a finite simplicial complex of size bounded by .
登录
查看更多内容
影响因子:
3
作者:
Peter Bürgisser;F. Cucker;Josué Tonelli
通讯作者:
Josué Tonelli
影响因子:
0.8
作者:
A. Markov;Champaign German;Rolf Herken
通讯作者:
Rolf Herken
影响因子:
3
作者:
S. Basu;R. Pollack;Marie
通讯作者:
Marie
DOI:
10.1145/3275242
发表时间:
2018
期刊:
Journal of the ACM (JACM)
影响因子:
--
作者:
P. Bürgisser;F. Cucker;P. Lairez
通讯作者:
P. Lairez
影响因子:
3
作者:
Peter Bürgisser;F. Cucker;Josué Tonelli
通讯作者:
Josué Tonelli