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

Lcm-格和Stanley深度:第一种计算方法

Lcm-lattices and Stanley depth: a first computational approach

Bogdan Ichim, Lukas Katthän, Julio José Moyano-Fernández

摘要:

令$\mathbb{K}$为域,并且令$S=\mathbb{K}[X_1, ..., X_n]$为多项式环。设$I$是$S$的单项式理想,至多有5个生成元.在本文中,我们提出了一个计算实验,使我们能够证明,$\mathrm{depth}_S S/I = \mathrm{sdepth}_S S/I < \mathrm{sdepth}_S I$。这表明Stanley猜想对$S/I$和$I$成立,如果$I$可以由至多5个单项式生成。这个结果也为赫尔佐格的一个猜想提供了额外的计算证据。

英文摘要:

Let $\mathbb{K}$ be a field, and let $S=\mathbb{K}[X_1, ..., X_n]$ be the polynomial ring. Let $I$ be a monomial ideal of $S$ with up to 5 generators. In this paper, we present a computational experiment which allows us to prove that $\mathrm{depth}_S S/I = \mathrm{sdepth}_S S/I < \mathrm{sdepth}_S I$. This shows that the Stanley conjecture is true for $S/I$ and $I$, if $I$ can be generated by at most 5 monomials. The result also brings additional computational evidence for a conjecture made by Herzog.

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

↑