HOW TO COMPUTE THE STANLEY DEPTH OF A MODULE

Abstract

In this paper we introduce an algorithm for computing the Stanley depth of a finitely generated multigraded module M over the polynomial ring K[X-1,..., X-n]. As an application, we give an example of a module whose Stanley depth is strictly greater than the depth of its syzygy module. In particular, we obtain complete answers for two open questions raised by Herzog. Moreover, we show that the question whether M has Stanley depth at least r can be reduced to the question whether a certain combinatorially defined polytope P contains a Z(n)-lattice point.