2000 character limit reached
On the quasi-depth of squarefree monomial ideals and the sdepth of the monomial ideal of independent sets of a graph
Published 22 Nov 2015 in math.AC and math.CO | (1511.06974v2)
Abstract: If $J\subset I$ are two monomials ideals, we give a practical upper bound for the Stanley depth of $J/I$, which we call it the \emph{quasi-depth} of $J/I$. 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.
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.