How to compute the Stanley depth of a monomial ideal
By Jürgen Herzog, Marius Vladoiu, Xinxian Zheng. 2007
173 citations recorded by the source corpus.
Let $J\subset I$ be monomial ideals. We show that the Stanley depth of $I/J$ can be computed in a finite number of steps. We also introduce the $\fdepth$ of a monomial ideal which is defined in terms of prime filtrations and show that it can also be computed in a finite number of steps. In both cases it is shown that these invariants can be determined by considering partitions of suitable finite posets into intervals.
Subfields: Algebra and Number Theory, Computational Mechanics, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/ddf8ede0d13e62c77edd970e6797c25db21761da
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Algebra and Number Theory
In Computational Theory and Mathematics
Citations in the corpus
- Depth and Stanley Depth of Multigraded Modules (2008, background): “The conjecture is discussed in some special cases in [7], [2], [9], [13], [1], [12] [4], [5].”