On the Stanley depth and size of monomial ideals
S. A. Seyed Fakhari

TL;DR
This paper introduces a recursive method to estimate the Stanley depth of monomial ideals in polynomial rings and proves a lower bound related to the size of the ideal for certain classes.
Contribution
It provides a recursive formula for lower bounds of Stanley depth and establishes a new inequality linking Stanley depth and size for specific monomial ideals.
Findings
Recursive formula for Stanley depth lower bounds
Proof of Stanley depth ≥ size for certain monomial ideals
Enhanced understanding of Stanley depth in relation to ideal size
Abstract
Let be a field and be the polynomial ring in variables over the field . For every monomial ideal , We provide a recursive formula to determine a lower bound for the Stanley depth of . We use this formula to prove the inequality for a particular class of monomial ideals.
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.
