中文

路图路径理想幂的深度与 Stanley 深度

交换代数 2023-03-03 v1

摘要

In,m:=(x1x2xm,  x2x3xm+1,  ,  xnm+1xn)I_{n,m}:=(x_1x_2\cdots x_m,\; x_2x_3\cdots x_{m+1},\; \ldots,\; x_{n-m+1}\cdots x_n) 为长度为 nn 的路图在环 S=K[x1,,xn]S=K[x_1,\ldots,x_n] 中的 mm-路径理想。我们证明:depth(S/In,mt)={nt+2nt+2m+1nt+2m+1,tn+1mm1,t>n+1m, 对所有 t1.\mathtt{depth}(S/I_{n,m}^t)=\begin{cases} n-t+2 - \left\lfloor \frac{n-t+2}{m+1} \right\rfloor - \left\lceil \frac{n-t+2}{m+1} \right\rceil, & t \leq n+1-m \\ m-1,& t > n+1-m \end{cases},\text{ 对所有 }t\geq 1. 此外,我们证明对所有 t1t\geq 1,有 depth(S/In,m)sdepth(S/In,mt)depth(S/In,mt)\mathtt{depth}(S/I_{n,m}) \geq \mathtt{sdepth}(S/I_{n,m}^t) \geq \mathtt{depth}(S/I_{n,m}^t)sdepth(In,mt)depth(In,mt)\mathtt{sdepth}(I_{n,m}^t)\geq \mathtt{depth}(I_{n,m}^t)

关键词

引用

@article{arxiv.2303.01132,
  title  = {Depth and Stanley depth of powers of the path ideal of a path graph},
  author = {Silviu Balanescu and Mircea Cimpoeas},
  journal= {arXiv preprint arXiv:2303.01132},
  year   = {2023}
}

备注

16 pages