arXivDaily arXiv每日学术速递 周一至周五更新
稍安勿躁,官方尚未更新
arXiv 2011.02162math.AGcs.SC
收藏

Connectivity in Semi-Algebraic Sets I

Hoon Hong, James Rohal, Mohab Safey El Din, Eric Schost

英文摘要:

A semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities having real coefficients and is a union of finitely many maximally connected components. We consider the problem of deciding whether two given points in a semi-algebraic set are connected; that is, whether the two points lie in the same connected component. In particular, we consider the semi-algebraic set defined by f <> 0 where f is a given polynomial with integer coefficients. The motivation comes from the observation that many important or non-trivial problems in science and engineering can be often reduced to that of connectivity. Due to its importance, there has been intense research effort on the problem. We will describe a symbolic-numeric method based on gradient ascent. The method will be described in two papers. The first paper (the present one) will describe the symbolic part and the forthcoming second paper will describe the numeric part. In the present paper, we give proofs of correctness and termination for the symbolic part and illustrate the efficacy of the method using several non-trivial examples.

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

↑