arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0403008cs.SCcs.CGmath.AG
收藏

二次映射上的多项式时间计算I:实代数集中的采样

Polynomial-time computing over quadratic maps I: sampling in real algebraic sets

Dima Grigoriev, Dmitrii V. Pasechnik

摘要:

给定定义在实闭域K的可计算子环D上的二次映射Q:K^n -> K^k和多项式p(Y_1,.,Y_k),我们考虑多项式p(Q(X_1,..,..的零点集Z=Z(p(Q(X)),K^n),X_n))。我们给出了一个过程,在D中的(dn)^O(k)个算术运算中,计算K^n中与Z的每个连通分量非平凡相交的采样点(的实单变量表示)的集合S。只要k=o(n),这就比复杂度都对n有指数依赖的标准方法快。特别是,我们的程序是多项式时间常数k。相比之下,先前已知的最好的过程(由于A.Barvinok)只能在n^O(k^2)次运算中判定集合Z在p(Y)=sum_i Y_i^2和齐次Q的情况下的非空性(而不是构造采样点)。我们的过程的一个副产品是Z的连通分支数的界(dn)^O(k)。该程序由D中的精确符号计算和代数数的输出向量组成。它涉及扩展K的无穷小和随后的限制计算的一个新的程序,利用知识的一个明确的同构之间的真正的代数集。

英文摘要:

Given a quadratic map Q : K^n -> K^k defined over a computable subring D of a real closed field K, and a polynomial p(Y_1,...,Y_k) of degree d, we consider the zero set Z=Z(p(Q(X)),K^n) of the polynomial p(Q(X_1,...,X_n)). We present a procedure that computes, in (dn)^O(k) arithmetic operations in D, a set S of (real univariate representations of) sampling points in K^n that intersects nontrivially each connected component of Z. As soon as k=o(n), this is faster than the standard methods that all have exponential dependence on n in the complexity. In particular, our procedure is polynomial-time for constant k. In contrast, the best previously known procedure (due to A.Barvinok) is only capable of deciding in n^O(k^2) operations the nonemptiness (rather than constructing sampling points) of the set Z in the case of p(Y)=sum_i Y_i^2 and homogeneous Q. A by-product of our procedure is a bound (dn)^O(k) on the number of connected components of Z. The procedure consists of exact symbolic computations in D and outputs vectors of algebraic numbers. It involves extending K by infinitesimals and subsequent limit computation by a novel procedure that utilizes knowledge of an explicit isomorphism between real algebraic sets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑