arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1412.7547cs.SC
收藏

加权齐次系统计算格罗布纳基的复杂性

On the complexity of computing Gröbner bases for weighted homogeneous systems

Jean-Charles Faugère, Mohab Safey El Din, Thibaut Verron

摘要:

解决多项式系统所产生的应用程序往往是更容易的系统的结构。加权同质性(或准同质性)是这种结构的一个例子:给定权重系统$W=(w\_{1},\dots,w\_{n})$,$W$ -齐次多项式是关于加权次数$°\_{W}(X\_{1}^{α\_{1}},\dots,X\_{n}^{α\_{n}}) = \sum w\_{i}α\_{i}$是齐次的多项式。加权齐次系统的格罗布纳基可以通过将现有的齐次系统算法适应于加权齐次情况来计算。我们表明,在这种情况下,算法~ \F 5 $\left(\binom{n+\dmax-1}{\dmax}^ω\right)$的复杂性估计可以除以因子$\left(\prod w\_{i} \right)^ω$。对于零维系统,算法\FGLM $nD^ω$(其中$D$是系统的解的数目)的复杂性可以除以相同的因子$\left(\prod w\_{i} \right)^ω$。在一般性假设下,对于$W$ -度$(d\_{1},\dots,d\_{n})$的零维加权齐次系统,这些复杂性估计在加权Bézout界$\prod\_{i=1}^{n}d\_{i} / \prod\_{i=1}^{n}w\_{i}$内是多项式的。此外,在算法\F 5的运行中达到的最大程度由加权Macaulay界$\sum (d\_{i}-w\_{i}) + w\_{n}$界定,并且如果我们可以对权重进行排序,则该界是尖锐的,使得$w\_{n}=1$。对于超定半正则系统,齐次情形下的估计可以适用于加权情形。我们提供了一些实验结果的基础上所产生的密码学问题和多项式反演问题的系统。他们表明,利用加权均匀结构产生了显着的速度提升,并允许我们解决系统,否则遥不可及。

英文摘要:

Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights $W=(w\_{1},\dots,w\_{n})$, $W$-homogeneous polynomials are polynomials which are homogeneous w.r.t the weighted degree $°\_{W}(X\_{1}^{α\_{1}},\dots,X\_{n}^{α\_{n}}) = \sum w\_{i}α\_{i}$. Gröbner bases for weighted homogeneous systems can be computed by adapting existing algorithms for homogeneous systems to the weighted homogeneous case. We show that in this case, the complexity estimate for Algorithm~\F5 $\left(\binom{n+\dmax-1}{\dmax}^ω\right)$ can be divided by a factor $\left(\prod w\_{i} \right)^ω$. For zero-dimensional systems, the complexity of Algorithm~\FGLM $nD^ω$ (where $D$ is the number of solutions of the system) can be divided by the same factor $\left(\prod w\_{i} \right)^ω$. Under genericity assumptions, for zero-dimensional weighted homogeneous systems of $W$-degree $(d\_{1},\dots,d\_{n})$, these complexity estimates are polynomial in the weighted Bézout bound $\prod\_{i=1}^{n}d\_{i} / \prod\_{i=1}^{n}w\_{i}$. Furthermore, the maximum degree reached in a run of Algorithm \F5 is bounded by the weighted Macaulay bound $\sum (d\_{i}-w\_{i}) + w\_{n}$, and this bound is sharp if we can order the weights so that $w\_{n}=1$. For overdetermined semi-regular systems, estimates from the homogeneous case can be adapted to the weighted case. We provide some experimental results based on systems arising from a cryptography problem and from polynomial inversion problems. They show that taking advantage of the weighted homogeneous structure yields substantial speed-ups, and allows us to solve systems which were otherwise out of reach.

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

↑