Stanley depth and complete k-partite hypergraphs

MaRDI QIDQ6224768zbMATH OpenFDO

Authors Muhammad Ishaq, Muhammad Imran Qureshi

Publication date 13 April 2011

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial aspects of simplicial complexes (05E45) Dimension theory, depth, related commutative rings (catenary, etc.) (13C15) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

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.

This page was built for publication: Stanley depth and complete $k$-partite hypergraphs

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