Stanley depth and complete $k$-partite hypergraphs
Commutative Algebra
2012-02-29 v2 Combinatorics
Abstract
We give an upper bound for the Stanley depth of the edge ideal of a complete -partite hypergraph and as an application we give an upper bound for the Stanley depth of a monomial ideal in a polynomial ring . We also give a lower and an upper bound for the cyclic module associated to the complete -partite hypergraph.
Keywords
Cite
@article{arxiv.1104.2412,
title = {Stanley depth and complete $k$-partite hypergraphs},
author = {Muhammad Ishaq and Muhammad Imran Qureshi},
journal= {arXiv preprint arXiv:1104.2412},
year = {2012}
}
Comments
The paper is going to appear in Communications in Algebra with changed title "Upper and lower bounds for the Stanley depth of certain classes of monomial ideals and their residue class rings "