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

Koszul复形中的Stanley分解和Hilbert深度

Stanley decompositions and Hilbert depth in the Koszul complex

Winfried Bruns, Christian Krattenthaler, Jan Uliczka

摘要:

多项式环上多阶模$M$的Stanley分解是近年来研究的热点.有一个自然的深度概念,与斯坦利分解,称为斯坦利深度。Stanley解释说,模块$M$的Stanley深度总是至少为$M$的(经典)深度。在本文中,我们引入了一种较弱的分解类型,我们称之为希尔伯特分解,因为它只依赖于$M$的希尔伯特函数,以及类似的深度概念,称为希尔伯特深度。由于斯坦利分解是希尔伯特分解,后者为斯坦利分解的存在性设置了上界。希尔伯特分解的优点是它们更容易找到。我们测试我们的新概念上的syzygy模块的剩余类域的$K[X_1,...,X_n]$(通常确定与$K$)。对$k$次合冲模写出$M(n,k)$,证明了M(n,1)的Hilbert深度为$\lfloor(n+1)/2\rfloor$ .进一步证明了对于$n > k \ge \lfloor n/2\rfloor$,$M(n,k)$的Hilbert深度等于$n-1$ .我们推测斯坦利深度也是如此。对于范围$n/2 > k > 1$,似乎不可能得出希尔伯特深度的简洁公式。相反,我们提供了非常精确的渐近结果,因为$n$变得很大。

英文摘要:

Stanley decompositions of multigraded modules $M$ over polynomials rings have been discussed intensively in recent years. There is a natural notion of depth that goes with a Stanley decomposition, called the Stanley depth. Stanley conjectured that the Stanley depth of a module $M$ is always at least the (classical) depth of $M$. In this paper we introduce a weaker type of decomposition, which we call Hilbert decomposition, since it only depends on the Hilbert function of $M$, and an analogous notion of depth, called Hilbert depth. Since Stanley decompositions are Hilbert decompositions, the latter set upper bounds to the existence of Stanley decompositions. The advantage of Hilbert decompositions is that they are easier to find. We test our new notion on the syzygy modules of the residue class field of $K[X_1,...,X_n]$ (as usual identified with $K$). Writing $M(n,k)$ for the $k$-th syzygy module, we show that theHilbert depth of M(n,1) is $\lfloor(n+1)/2\rfloor$. Furthermore, we show that, for $n > k \ge \lfloor n/2\rfloor$, the Hilbert depth of $M(n,k)$ is equal to $n-1$. We conjecture that the same holds for the Stanley depth. For the range $n/2 > k > 1$, it seems impossible to come up with a compact formula for the Hilbert depth. Instead, we provide very precise asymptotic results as $n$ becomes large.

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

↑