pith. sign in

arxiv: 1104.2412 · v2 · pith:X2DFIIHSnew · submitted 2011-04-13 · 🧮 math.AC · math.CO

Stanley depth and complete k-partite hypergraphs

classification 🧮 math.AC math.CO
keywords boundcompletedepthgivepartitestanleyupperhypergraph
0
0 comments X
read the original 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 paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.