arXiv · 1503.00910
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 $\mathbb{K}[X_1, \ldots, 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 $\mathscr{P}$ contains a $\mathbb{Z}^n$-lattice point.
Explore related subjects
Keep this discovery
Bogdan Ichim, Lukas Katthän, Julio José Moyano-Fernández. 2015-03-03. How to compute the Stanley depth of a module. https://arxiv.org/abs/1503.00910
Cite the original work for its findings. Save a collection to share your selection of sources.