Depth and Stanley depth of symbolic powers of cover ideals of graphs
S. A. Seyed Fakhari

TL;DR
This paper investigates the depth and Stanley depth of symbolic powers of cover ideals of graphs, proving their non-increasing nature, convergence, and conditions under which Stanley's inequality holds, with implications for algebraic graph theory.
Contribution
It establishes the non-increasing and convergent behavior of depth and Stanley depth sequences for symbolic powers of cover ideals, and proves Stanley's inequality for large powers, providing new insights and an alternative proof for existing results.
Findings
Sequences of Stanley depth are non-increasing and converge.
Stanley's inequality holds for symbolic powers beyond a certain threshold.
Provides an alternative proof for the depth formula of symbolic powers.
Abstract
Let be a graph with vertices and let be the polynomial ring in variables over a field . Assume that is the cover ideal of and is its -th symbolic power. We prove that the sequences and are non-increasing and hence convergent. Suppose that denotes the ordered matching number of . We show that for every integer , the modules and satisfy the Stanley's inequality. We also provide an alternative proof for \cite[Theorem 3.4]{hktt} which states that , for every integer .
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.
