Stanley depth of monomial ideals with small number of generators

From MaRDI portal




Abstract: For a monomial ideal IsubsetS=K[x1,...,xn], we show that sdepth(S/I)geqng(I), where g(I) is the number of the minimal monomial generators of I. If I=vI, where vinS is a monomial, then we see that sdepth(S/I)=sdepth(S/I). We prove that if I is a monomial ideal IsubsetS minimally generated by three monomials, then I and S/I satisfy the Stanley conjecture. Given a saturated monomial ideal IsubsetK[x1,x2,x3] we show that sdepth(I)=2. As a consequence, sdepth(I)geqsdepth(K[x1,x2,x3]/I)+1 for any monomial ideal in IsubsetK[x1,x2,x3].









This page was built for publication: Stanley depth of monomial ideals with small number of generators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268524)