Stanley depth and complete $k$-partite hypergraphs

Details Stanley depth and complete $k$-partite hypergraphs Stanley depth and complete $k$-partite hypergraphs

2011-04-13

arxiv.org/abs/1104.2412v2

Mathematics

Commutative Algebra

The paper is going to appear in Communications in Algebra with changed title "Upper and lower bounds for the Stanley depth of

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Stanley depth and complete $k$-partite hypergraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Stanley depth and complete $k$-partite hypergraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stanley depth and complete $k$-partite hypergraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-217859