摘要翻译:
设$\r$为实闭域,${\mathcal Q}\subset\r[Y_1,...,y_\ell,X_1,...,x_k],$与$\deg_{Y}(Q)\leq2,\deg_{X}(Q)\leq d,Q\in{\mathcal Q},#({\mathcal Q},#({\mathcal Q})=m,$与${\mathcal P}\subset\r[X_1,...,x_k]$与$\deg_{X}(P)\leq d,P\in{\mathcal P},#({\mathcal K}$一个由布尔公式定义的无负数半代数集,原子$P=0,P\geq0,P\leq0,P\in{\mathcal P}\cup{\mathcal Q}$。我们证明了$S$的Betti数之和被\[\ell^2(O(S+\ell+m)\ellD)^{k+2m}有界。\\]这是前人关于分别由$d$和2次多项式定义的闭半代数集的Betti数有界结果的共同推广。我们也给出了计算这类集合的Euler-Poincar特征的一个算法,推广了以前的类似算法。该算法的复杂度以$(\ell s m d)^{O(m(m+k))}$为界。
---
英文标题:
《Bounding the Betti numbers and computing the Euler-Poincar\'e
characteristic of semi-algebraic sets defined by partly quadratic systems of
polynomials》
---
作者:
Saugata Basu, Dmitrii V. Pasechnik, Marie-Francoise Roy
---
最新提交年份:
2008
---
分类信息:
一级分类:Mathematics 数学
二级分类:Algebraic Geometry 代数几何
分类描述:Algebraic varieties, stacks, sheaves, schemes, moduli spaces, complex geometry, quantum cohomology
代数簇,叠,束,格式,模空间,复几何,量子上同调
--
一级分类:Computer Science 计算机科学
二级分类:Symbolic Computation 符号计算
分类描述:Roughly includes material in ACM Subject Class I.1.
大致包括ACM学科第一类1的材料。
--
一级分类:Mathematics 数学
二级分类:Algebraic Topology 代数拓扑
分类描述:Homotopy theory, homological algebra, algebraic treatments of manifolds
同伦理论,同调代数,流形的代数处理
--
一级分类:Mathematics 数学
二级分类:Geometric Topology 几何拓扑
分类描述:Manifolds, orbifolds, polyhedra, cell complexes, foliations, geometric structures
流形,轨道,多面体,细胞复合体,叶状,几何结构
--
---
英文摘要:
Let $\R$ be a real closed field, $ {\mathcal Q} \subset \R[Y_1,...,Y_\ell,X_1,...,X_k], $ with $ \deg_{Y}(Q) \leq 2, \deg_{X}(Q) \leq d, Q \in {\mathcal Q}, #({\mathcal Q})=m,$ and $ {\mathcal P} \subset \R[X_1,...,X_k] $ with $\deg_{X}(P) \leq d, P \in {\mathcal P}, #({\mathcal P})=s$, and $S \subset \R^{\ell+k}$ a semi-algebraic set defined by a Boolean formula without negations, with atoms $P=0, P \geq 0, P \leq 0, P \in {\mathcal P} \cup {\mathcal Q}$. We prove that the sum of the Betti numbers of $S$ is bounded by \[ \ell^2 (O(s+\ell+m)\ell d)^{k+2m}. \] This is a common generalization of previous results on bounding the Betti numbers of closed semi-algebraic sets defined by polynomials of degree $d$ and 2, respectively. We also describe an algorithm for computing the Euler-Poincar\'e characteristic of such sets, generalizing similar algorithms known before. The complexity of the algorithm is bounded by $(\ell s m d)^{O(m(m+k))}$.
---
PDF链接:
https://arxiv.org/pdf/0708.3522