Depth and Stanley depth of powers of the path ideal of a path graph
Abstract
Let In,m:=(x1x2·s xm,\; x2x3·s xm+1,\; …,\; xn-m+1·s xn) be the m-path ideal of the path graph of length n, in the ring S=K[x1,…,xn]. We prove that: depth(S/In,mt)=cases n-t+2 - n-t+2m+1 - n-t+2m+1 , & t ≤ n+1-m \\ m-1,& t > n+1-m cases, for all t≥ 1. Also, we prove that depth(S/In,m) ≥ sdepth(S/In,mt) ≥ depth(S/In,mt) and sdepth(In,mt)≥ depth(In,mt), for all 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.