Computing the Stanley depth (Q975099)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Computing the Stanley depth
scientific article

    Statements

    Computing the Stanley depth (English)
    0 references
    0 references
    0 references
    8 June 2010
    0 references
    Let \(S=k[x_1,\dots,x_n]\) be a polynomial ring and \(Q_1,Q_2,Q_3\) be three monomial ideals of \(S\). The paper under review, concentrates to compute lower and upper bounds for the Stanley depth of \(S/(Q_1\cap Q_2)\), \(Q_1\cap Q_2\) or \(S/(Q_1\cap Q_2\cap Q_3)\) in the case where \(Q_i\)'s are primary or particularly irreducible monomial ideals. The bounds are linear functions of the dimensions of the quotient rings \(S/Q_i\)'s, therefore the fact that primary monomial ideals are Cohen-Macaulay plays a role to prove \textit{R. P. Stanley}'s conjecture [Invent. Math. 68, 175--193 (1982; Zbl 0516.10009)] in some special cases. A careful study of supp\((Q_1)\) and supp\((Q_2)\) enables the authors to obtain an upper bound for \(\text{sdepth}_S(S/(Q_1\cap Q_2)\) where \(Q_1\) and \(Q_2\) are primary monomial ideals with different radicals (Theorem 2.3). On the other hand using the fact that any irreducible ideal is a pure power of variables (hence complete intersection), the authors prove that the mentioned upper bound attained if the ideals are irreducible (Theorem 1.5), some results on the Stanley depth of complete intersections applied to this proof; see [\textit{Y. H. Shen}, J. Algebra 321, No. 4, 1285--1292 (2009; Zbl 1167.13010)]. In section 4, a lower bound for \(\text{sdepth}_S(Q_1\cap Q_2)\) is presented and it is mentioned in some general examples that these lower bounds are sharper than the previous estimations. In the final section the Stanley's conjecture is proven for \(Q_1\cap Q_2\) and \(S/(Q_1\cap Q_2\cap Q_3)\) provided that \(Q_i\)'s are irreducible monomial ideals.
    0 references
    monomial ideals
    0 references
    Stanley decompositions
    0 references
    Stanley depth
    0 references

    Identifiers