arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1206.1735math.AC
收藏

单式代数的分解:应用与算法

Decomposition of Monomial Algebras: Applications and Algorithms

Janko Boehm, David Eisenbud, Max Joachim Nitsche

摘要:

考虑域K上正仿射半群环环的有限扩张K[A] \subseteq K[B],我们在[1]中发展了一个算法,将K[B]分解为K[A]中单项式理想的直和.通过计算由分解得到的齐次半群环的正则性,我们在一系列用标准方法无法处理的新情况下证实了Eisenbud-Goto猜想。在这里,我们首先说明了这种技术和它的实现在我们的Macaulay 2包MonomialAlgebras通过计算分解和正则性一步一步的一个明确的例子。然后,我们重点研究了单纯半群环的环论性质。从[1]中给出的特征,我们开发并证明了显式算法测试性质,如Buchsbaum,Cohen-Macaulay,Gorenstein,正规和非正规,所有这些都意味着Eisenbud-Goto猜想。所有算法都在我们的Macaulay 2包中实现。

英文摘要:

Considering finite extensions K[A] \subseteq K[B] of positive affine semigroup rings over a field K we have developed in [1] an algorithm to decompose K[B] as a direct sum of monomial ideals in K[A]. By computing the regularity of homogeneous semigroup rings from the decomposition we have confirmed the Eisenbud-Goto conjecture in a range of new cases not tractable by standard methods. Here we first illustrate this technique and its implementation in our Macaulay2 package MonomialAlgebras by computing the decomposition and the regularity step by step for an explicit example. We then focus on ring-theoretic properties of simplicial semigroup rings. From the characterizations given in [1] we develop and prove explicit algorithms testing properties like Buchsbaum, Cohen-Macaulay, Gorenstein, normal, and seminormal, all of which imply the Eisenbud-Goto conjecture. All algorithms are implemented in our Macaulay2 package.

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

↑