arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.00847cs.SC
收藏

不变代数系统临界点的计算

Computing critical points for invariant algebraic systems

Jean-Charles Faugère, George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu

摘要:

设$\mathbf{K}$是一个域,而$\mathbf{K}[x_1, \dots, x_n]$中的$ϕ$,$\mathbf{f} = (f_1, \ldots, f_s)$是在$\mathcal{S}_n$作用下不变的多元多项式(带有$s < n$),$\mathcal{S}_n$是$\{1, \dots, n\}$的置换群。我们考虑的问题,计算点$\mathbf{f}$消失和相关的$\mathbf{f}, ϕ$的雅可比矩阵是秩亏的,这一套是有限的。我们利用输入的不变性,根据$\mathcal{S}_n$的轨道来分裂解空间。这使我们能够设计一种算法,它给出了一个三角形的描述的解决方案空间,并运行在时间多项式在$d^s$,${{n+d}\choose{d}}$和$\binom{n}{s+1}$,其中$d$是最大程度的输入多项式。当$d,s$固定时,这是$n$中的多项式,而当$s$固定且$d \simeq n$固定时,这相对于通常的多项式系统求解算法产生指数加速。

英文摘要:

Let $\mathbf{K}$ be a field and $ϕ$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots, n\}$. We consider the problem of computing the points at which $\mathbf{f}$ vanish and the Jacobian matrix associated to $\mathbf{f}, ϕ$ is rank deficient provided that this set is finite. We exploit the invariance properties of the input to split the solution space according to the orbits of $\mathcal{S}_n$. This allows us to design an algorithm which gives a triangular description of the solution space and which runs in time polynomial in $d^s$, ${{n+d}\choose{d}}$ and $\binom{n}{s+1}$ where $d$ is the maximum degree of the input polynomials. When $d,s$ are fixed, this is polynomial in $n$ while when $s$ is fixed and $d \simeq n$ this yields an exponential speed-up with respect to the usual polynomial system solving algorithms.

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

↑