Depth and Stanley depth of powers of the path ideal of a cycle graph. II
Abstract
Let Jn,m:=(x1x2·s xm,\; x2x3·s xm+1,\; …,\; xn-m+1·s xn,\; xn-m+2·s xnx1, …, xnx1·s xm-1) be the m-path ideal of the cycle graph of length n, in the ring of polynomials S=K[x1,…,xn]. As a continuation of arxiv:2303.15032v2, we prove several new results regarding depth(S/Jn,mt) and sdepth(S/Jn,mt), where t≥ 1.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.