arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0906.4873math.AC
收藏

二项式理想的分解

Decompositions of Binomial Ideals

Thomas Kahle

摘要:

我们提出二项式,计算机代数系统Macaulay2,专门众所周知的算法二项式理想的包。这些经常出现在代数统计和交换代数,它表明,显着加速计算,如准素分解是可能的。虽然实现算法的中心部分可以追溯到Eisenbud和Sturmfels(1996),但我们还讨论了计算二项式理想的最小素数的新算法。所有分解都充分利用了二项式理想中的组合结构,为了证明这种方法的强大功能,我们展示了如何使用二项式来计算Evans等人的交换出生和死亡理想的准素分解,其中,有一个比喻,叫做“以德报怨”。

英文摘要:

We present Binomials, a package for the computer algebra system Macaulay2, which specializes well known algorithms to binomial ideals. These come up frequently in algebraic statistics and commutative algebra, and it is shown that significant speedup of computations like primary decomposition is possible. While central parts of the implemented algorithms go back to Eisenbud and Sturmfels (1996), we also discuss a new algorithm for computing the minimal primes of a binomial ideal. All decompositions make significant use of combinatorial structure found in binomial ideals, and to demonstrate the power of this approach we show how Binomials was used to compute primary decompositions of commuting birth and death ideals of Evans et al., yielding a counterexample for a conjecture therein.

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

↑