On the quasi-depth of squarefree monomial ideals and the sdepth of the monomial ideal of independent sets of a graph
Mircea Cimpoeas

TL;DR
This paper introduces the concept of quasi-depth to bound the Stanley depth of monomial ideal quotients and computes it for specific classes, also analyzing the Stanley depth of ideals from graph independent sets.
Contribution
It proposes the quasi-depth as a practical upper bound for Stanley depth and applies it to various squarefree monomial ideals and graph-related ideals.
Findings
Quasi-depth provides an effective upper bound for Stanley depth.
Computed quasi-depth for several classes of squarefree monomial ideals.
Analyzed Stanley depth of monomial ideals from graph independent sets.
Abstract
If are two monomials ideals, we give a practical upper bound for the Stanley depth of , which we call it the \emph{quasi-depth} of . Also, we compute the quasi-depth of several classes of square free monomial ideals. We also study the Stanley depth of the monomial ideal associated of the independent sets of a graph.
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 · Algebraic Geometry and Number Theory
