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

计算单式理想的不可约分解

Computing Irreducible Decomposition of Monomial Ideals

Shuhong Gao, Mingfu Zhu

摘要:

本文给出了求单项理想不可约分解的两个算法。第一个是递归的,由单项理想的阶梯结构导出。该算法对高度非泛型的单项式理想有很好的性能。第二个是增量算法,它通过每次增加一个生成元来计算理想的分解。我们的分析表明,第二个算法是更有效的比第一个一般的单项理想。此外,第二算法的时间复杂度至多为$O(n^2p\ell)$,其中$n$是变量的数目,$p$是最小生成元的数目,而$\ell$是不可约分量的数目。第二个算法的另一个新颖之处在于,对于一般单项式理想,中间存储总是由最终输出大小限制,该最终输出大小可以是输入大小的指数。

英文摘要:

The paper presents two algorithms for finding irreducible decomposition of monomial ideals. The first one is recursive, derived from staircase structures of monomial ideals. This algorithm has a good performance for highly non-generic monomial ideals. The second one is an incremental algorithm, which computes decompositions of ideals by adding one generator at a time. Our analysis shows that the second algorithm is more efficient than the first one for generic monomial ideals. Furthermore, the time complexity of the second algorithm is at most $O(n^2p\ell)$ where $n$ is the number of variables, $p$ is the number of minimal generators and $\ell$ is the number of irreducible components. Another novelty of the second algorithm is that, for generic monomial ideals, the intermediate storage is always bounded by the final output size which may be exponential in the input size.

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

↑