Abstract
We give an upper bound for the Stanley depth of the edge ideal of a complete k-partite hypergraph and as an application we give an upper bound for the Stanley depth of a monomial ideal in a polynomial ring S. We also give a lower and an upper bound for the cyclic module S/I associated to the complete k-partite hypergraph.
2000 Mathematics Subject Classification:
ACKNOWLEDGMENTS
The authors would like to express their gratitude to ASSMS of GC University Lahore for creating a very appropriate atmosphere for research work. This research is partially supported by HEC Pakistan.
Notes
Communicated by R. Wiegand.