无界光滑实代数集中的路线图计算II:算法与复杂度
Computing roadmaps in unbounded smooth real algebraic sets II: algorithm and complexity
AI总结:
该研究将此前的连通性结果有效化,提出一种Monte Carlo算法计算无界光滑实代数集的关联路线图,去掉了既有近最优算法的有界性假设,复杂度为关于$(nD)^{n\log d}$的多项式,优于此前已知结果。
摘要:
由有理数域$\mathbb{Q}$上系数的多项式定义的代数集$V$的路线图,是包含于$V$的一条代数曲线,它与$V\cap\mathbb{R}^{n}$的所有连通分支的交集均为连通。这类由Canny提出的对象可用于解答$V\cap\mathbb{R}^{n}$上的连通性查询,前提是路线图需要包含有限查询点集$\mathcal{P}\subset V$;此时我们称该路线图与$(V, \mathcal{P})$相关联。\n 在本文中,我们将此前证明的一个连通性结果加以有效化,设计了一种Monte Carlo算法,该算法以(i)定义$V$(且满足某些正则性假设)的有限多项式序列,以及(ii)$V$中有限个查询点$\mathcal{P}$的代数表示为输入,计算得到$(V, \mathcal{P})$对应的路线图。该算法推广了由最后两位作者提出的近最优算法,去掉了对$V$的实迹的有界性假设。\n 我们的算法的输出规模和运行时间均为关于$(nD)^{n\log d}$的多项式,其中$D$是输入方程的最高次数,$d$是$V$的维数。据我们所知,此前处理这类集合的最优已知算法的输出规模和运行时间分别为关于$(n^{\log{n}}D)^{n\log n}$和$(n^{\log{n}}D)^{n\log^2 n}$的多项式。
英文摘要:
A roadmap for an algebraic set $V$ defined by polynomials with coefficients in the field $\mathbb{Q}$ of rational numbers is an algebraic curve contained in $V$ whose intersection with all connected components of $V\cap\mathbb{R}^{n}$ is connected. These objects, introduced by Canny, can be used to answer connectivity queries over $V\cap \mathbb{R}^{n}$ provided that they are required to contain the finite set of query points $\mathcal{P}\subset V$; in this case, we say that the roadmap is associated to $(V, \mathcal{P})$. In this paper, we make effective a connectivity result we previously proved, to design a Monte Carlo algorithm which, on input (i) a finite sequence of polynomials defining $V$ (and satisfying some regularity assumptions) and (ii) an algebraic representation of finitely many query points $\mathcal{P}$ in $V$, computes a roadmap for $(V, \mathcal{P})$. This algorithm generalizes the nearly optimal one introduced by the last two authors by dropping a boundedness assumption on the real trace of $V$. The output size and running times of our algorithm are both polynomial in $(nD)^{n\log d}$, where $D$ is the maximal degree of the input equations and $d$ is the dimension of $V$. As far as we know, the best previously known algorithm dealing with such sets has an output size and running time respectively polynomial in $(n^{\log{n}}D)^{n\log n}$ and $(n^{\log{n}}D)^{n\log^2 n}$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。