Depth and Stanley depth of powers of the path ideal of a cycle graph
Commutative Algebra
2024-02-06 v3
Abstract
Let Jn,m:=(x1x2⋯xm,x2x3⋯xm+1,…,xn−m+1⋯xn,xn−m+2⋯xnx1,…,xnx1⋯xm−1) be the m-path ideal of the cycle graph of length n, in the ring S=K[x1,…,xn]. Let d=gcd(n,m). We prove that depth(S/Jn,mt)≤d−1 for all t≥n−1. We show that sdepth(S/Jn,n−1t)=depth(S/Jn,n−1t)=max{n−t−1,0} for all t≥1. Also, we give some bounds for depth(S/Jn,mt) and sdepth(S/Jn,mt), where t≥1.
Cite
@article{arxiv.2303.15032,
title = {Depth and Stanley depth of powers of the path ideal of a cycle graph},
author = {Silviu Balanescu and Mircea Cimpoeas},
journal= {arXiv preprint arXiv:2303.15032},
year = {2024}
}
Comments
15 pages; correction of the main theorem