An Algorithm for Computing the Multigraded Hilbert Depth of a Module

DOI10.1080/10586458.2014.908753zbMATH Open1312.13024arXiv1304.7215OpenAlexW2089738413MaRDI QIDQ5249308FDOQ5249308

Authors: Andrei Zarojanu, Bogdan Ichim 

Publication date: 30 April 2015

Published in: Experimental Mathematics (Search for Journal in Brave)

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].

Full work available at URL: https://arxiv.org/abs/1304.7215

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

zbMATH Keywords

computational experimentsStanley depthHilbert depth

Mathematics Subject Classification ID

Combinatorial aspects of commutative algebra (05E40) Theory of modules and ideals in commutative rings (13C99) Hilbert-Samuel and Hilbert-Kunz functions; Poincaré series (13D40) Computational aspects and applications of commutative rings (13P99)

Cites Work

• Polytopes, Rings, and K-Theory
• Normaliz: Algorithms for affine monoids and rational cones
• On a conjecture of R. P. Stanley. I: Monomial ideals
• Stanley decompositions and partitionable simplicial complexes
• Linear Diophantine equations and local cohomology
• The Alexander duality functors and local duality with monomial support
• How to compute the Stanley depth of a monomial ideal
• A survey on Stanley depth
• Hilbert depth of graded modules over polynomial rings in two variables
• Remarks on Hilbert series of graded modules over polynomial rings
• Finite filtrations of modules and shellable multicomplexes
• Stanley depth of complete intersection monomial ideals and upper-discrete partitions
• How to compute the multigraded Hilbert depth of a module
• Stanley decompositions and Hilbert depth in the Koszul complex
• On a conjecture of R. P. Stanley. II: Quotients modulo monomial ideals
• Stanley depth of multigraded modules
• Stanley conjecture in small embedding dimension
• An algorithm to compute the Hilbert depth
• An introduction to Hilbert depth

Cited In (12)

• Combinatorial reductions for the Stanley depth of \(I\) and \(S/I\)
• Four generated, squarefree, monomial ideals
• LCM Lattices and Stanley Depth: A First Computational Approach
• A non-partitionable Cohen-Macaulay simplicial complex
• Betti posets and the Stanley depth
• How to compute the Stanley depth of a module
• How to compute the multigraded Hilbert depth of a module
• An algorithm to compute the Hilbert depth
• Stanley depth and simplicial spanning trees
• Title not available (Why is that?)
• A non-partitionable Cohen-Macaulay simplicial complex
• An introduction to Hilbert depth

Uses Software

• CoCoA
• Hdepth

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)