Depth and Stanley depth of the path ideal associated to an $n$-cyclic graph
Guangjun Zhu

TL;DR
This paper calculates the depth and Stanley depth of quotient rings from path ideals of length 3 in n-cyclic graphs, providing formulas and bounds based on modular arithmetic conditions.
Contribution
It offers new formulas and bounds for depth and Stanley depth of path ideals in cyclic graphs, expanding understanding of their algebraic properties.
Findings
Exact formulas for depth when n ≠ 1 mod 4
Tight bounds for Stanley depth when n ≡ 0,3 mod 4
Formulas for depth and Stanley depth of path ideals of lengths n-1 and n
Abstract
We compute the depth and Stanley depth for the quotient ring of the path ideal of length associated to a -cyclic graph, given some precise formulas for depth when , tight bounds when and for Stanley depth when , tight bounds when . Also, we give some formulas for depth and Stanley depth of a quotient of the path ideals of length and .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Polynomial and algebraic computation · Cholinesterase and Neurodegenerative Diseases
