Stanley depth and complete k-partite hypergraphs

2011/04/13 by Ishaq, Muhammad, Qureshi, Muhammad Imran
#05C65 #05E45 #13C15 #13F20 #13P10 #Combinatorics (math.CO) #Commutative Algebra (math.AC) #FOS: Mathematics

paper · doi:10.48550/arxiv.1104.2412

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.

Related

• Stanley depth of edge ideals
• On the Stanley depth of edge ideals of k-partite clutters
• Depth and Stanley depth of the edge ideals of the powers of paths and\n cycles
• Graph and depth of a monomial squarefree ideal
• Values and bounds of the Stanley depth