2000 character limit reached
On the Stanley depth and size of monomial ideals
Published 12 Mar 2015 in math.AC and math.CO | (1503.03736v2)
Abstract: Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,...,x_n]$ be the polynomial ring in $n$ variables over the field $\mathbb{K}$. For every monomial ideal $I\subset S$, We provide a recursive formula to determine a lower bound for the Stanley depth of $S/I$. We use this formula to prove the inequality ${\rm sdepth}(S/I)\geq {\rm size}(I)$ for a particular class of monomial ideals.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.