求解参数相关的半代数系统
Solving parameter-dependent semi-algebraic systems
AI总结:
针对参数相关的半代数系统,提出首个单指数复杂度的实根分类算法,输出行列式结构公式,实验验证能处理先前无法解决的实例。
摘要:
我们考虑在$\mathbb{Q}[\boldsymbol{y}][\boldsymbol{x}]$中的多项式方程与不等式系统,其中$\boldsymbol{x} = (x_1, \ldots, x_n)$,$\boldsymbol{y} = (y_1, \ldots,y_t)$。将$\boldsymbol{y}$不定元视为参数,并假设当它们被一般性地特殊化时,所得到方程的公共复数解集是有限的。我们考虑这类参数相关问题的实根分类问题,即识别依赖于参数值的可能实根数目,并计算参数空间中实根数目保持不变的区域的描述。我们设计了一个算法来解决此问题。其输出的公式具有行列式结构。在一般性假设下,我们证明其算术复杂度关于输入不等式的最大次数$d$和数量$s$是多项式的,关于$nt+t^2$是指数的。输出公式由次数不超过$(2s+n)d^{n+1}$的多项式组成。这是第一个具有这种单指数复杂度的算法。我们报告了实际实验,表明该算法的首个实现可以处理以前无法解决的例子。
英文摘要:
We consider systems of polynomial equations and inequalities in $\mathbb{Q}[\boldsymbol{y}][\boldsymbol{x}]$ where $\boldsymbol{x} = (x_1, \ldots, x_n)$ and $\boldsymbol{y} = (y_1, \ldots,y_t)$. The $\boldsymbol{y}$ indeterminates are considered as parameters and we assume that when specialising them generically, the set of common complex solutions, to the obtained equations, is finite. We consider the problem of real root classification for such parameter-dependent problems, i.e. identifying the possible number of real solutions depending on the values of the parameters and computing a description of the regions of the space of parameters over which the number of real roots remains invariant. We design an algorithm for solving this problem. The formulas it outputs enjoy a determinantal structure. Under genericity assumptions, we show that its arithmetic complexity is polynomial in both the maximum degree $d$ and the number $s$ of the input inequalities and exponential in $nt+t^2$. The output formulas consist of polynomials of degree bounded by $(2s+n)d^{n+1}$. This is the first algorithm with such a singly exponential complexity. We report on practical experiments showing that a first implementation of this algorithm can tackle examples which were previously out of reach.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。