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

关于拟齐次系统计算格罗布纳基的复杂性

On the Complexity of Computing Gröbner Bases for Quasi-homogeneous Systems

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

摘要:

设$\K$是一个域,而$(f_1, \ldots, f_n)\subset \K[X_1, \ldots, X_n]$是一个关于权系统$(w_{1},\dots,w_{n})$的相应加权次数$(d_1, \ldots, d_n)$的拟齐次多项式序列。这样的系统可能会出现在很多应用中,包括物理学或密码学。我们设计的策略,计算格罗布纳基的准齐次系统,通过调整现有的算法,齐次系统的准齐次的情况。总体而言,在一般性假设下,我们表明,对于一个通用的零维准齐次系统,在加权Bézout界$\prod_{i=1}^{n}d_{i} / \prod_{i=1}^{n}w_{i}$的完整的战略的复杂性是多项式。我们提供了一些实验结果的基础上通用系统以及系统所产生的密码学问题。他们表明,利用系统的准均匀结构,使我们能够解决系统,否则是遥不可及的。

英文摘要:

Let $\K$ be a field and $(f_1, \ldots, f_n)\subset \K[X_1, \ldots, X_n]$ be a sequence of quasi-homogeneous polynomials of respective weighted degrees $(d_1, \ldots, d_n)$ w.r.t a system of weights $(w_{1},\dots,w_{n})$. Such systems are likely to arise from a lot of applications, including physics or cryptography. We design strategies for computing Gröbner bases for quasi-homogeneous systems by adapting existing algorithms for homogeneous systems to the quasi-homogeneous case. Overall, under genericity assumptions, we show that for a generic zero-dimensional quasi-homogeneous system, the complexity of the full strategy is polynomial in the weighted Bézout bound $\prod_{i=1}^{n}d_{i} / \prod_{i=1}^{n}w_{i}$. We provide some experimental results based on generic systems as well as systems arising from a cryptography problem. They show that taking advantage of the quasi-homogeneous structure of the systems allow us to solve systems that were out of reach otherwise.

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

↑