An Algorithm for Computing the Multigraded Hilbert Depth of a Module
From MaRDI portal
(Redirected from Publication:5249308)
Abstract: A method for computing the multigraded Hilbert depth of a module was presented in [16]. In this paper we improve the method and we introduce an effective algorithm for performing the computations. In a particular case, the algorithm may also be easily adapted for computing the Stanley depth of the module. We further present interesting examples which were found with the help of an experimental implementation of the algorithm. Thus, we completely solve several open problems proposed by Herzog in [12].
Recommendations
- scientific article; zbMATH DE number 7149458
- Multiplicity computation of graded modules
- Combinatorial algorithms for computing degenerations of modules of finite dimension
- On the asymptotic depth of multigraded modules
- Hilbert depth of graded modules over polynomial rings in two variables
- An algorithm to compute the Hilbert depth
- Hilbert Coefficients and the Depths of Associated Graded Rings
- An algorithm for computing weight multiplicities in irreducible modules for complex semisimple Lie algebras
- An algorithm for computing graded algebras
Cites work
- A survey on Stanley depth
- An algorithm to compute the Hilbert depth
- An introduction to Hilbert depth
- Finite filtrations of modules and shellable multicomplexes
- Hilbert depth of graded modules over polynomial rings in two variables
- How to compute the multigraded Hilbert depth of a module
- How to compute the Stanley depth of a monomial ideal
- Linear Diophantine equations and local cohomology
- Normaliz: Algorithms for affine monoids and rational cones
- On a conjecture of R. P. Stanley. I: Monomial ideals
- On a conjecture of R. P. Stanley. II: Quotients modulo monomial ideals
- Polytopes, Rings, and K-Theory
- Remarks on Hilbert series of graded modules over polynomial rings
- Stanley conjecture in small embedding dimension
- Stanley decompositions and Hilbert depth in the Koszul complex
- Stanley decompositions and partitionable simplicial complexes
- Stanley depth of complete intersection monomial ideals and upper-discrete partitions
- Stanley depth of multigraded modules
- The Alexander duality functors and local duality with monomial support
Cited in
(12)- An algorithm to compute the Hilbert depth
- Combinatorial reductions for the Stanley depth of I and S/I
- A non-partitionable Cohen-Macaulay simplicial complex
- LCM Lattices and Stanley Depth: A First Computational Approach
- How to compute the Stanley depth of a module
- How to compute the multigraded Hilbert depth of a module
- Four generated, squarefree, monomial ideals
- An introduction to Hilbert depth
- Stanley depth and simplicial spanning trees
- A non-partitionable Cohen-Macaulay simplicial complex
- scientific article; zbMATH DE number 7149458 (Why is no real title available?)
- Betti posets and the Stanley depth
This page was built for publication: An Algorithm for Computing the Multigraded Hilbert Depth of a Module
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249308)
