An algorithm to compute the Hilbert depth
From MaRDI portal
Abstract: We present an algorithm which computes the Hilbert depth of a graded module based on a theorem of Uliczka. Connected to a Herzog's question we see that the Hilbert depth of a direct sum of modules can be strictly bigger than the Hilbert depth of all the summands.
Recommendations
Cites work
- scientific article; zbMATH DE number 1194481 (Why is no real title available?)
- How to compute the multigraded Hilbert depth of a module
- Interval partitions and Stanley depth
- Linear Diophantine equations and local cohomology
- Monomial ideals, computations and applications. Based on lectures of the conference MONICA: monomial ideals, computations and applications, CIEM, Castro Urdiales, Spain, July 2011
- Remarks on Hilbert series of graded modules over polynomial rings
- Stanley decompositions and Hilbert depth in the Koszul complex
Cited in
(10)- Four generated, squarefree, monomial ideals
- Hilbert regularity of \(\mathbb Z\)-graded modules over polynomial rings
- Hilbert depth of powers of the maximal ideal
- Stanley depth and the lcm-lattice
- How to compute the Stanley depth of a module
- scientific article; zbMATH DE number 1445286 (Why is no real title available?)
- How to compute the multigraded Hilbert depth of a module
- An Algorithm for Computing the Multigraded Hilbert Depth of a Module
- Hilbert depth of graded modules over polynomial rings in two variables
- An introduction to Hilbert depth
This page was built for publication: An algorithm to compute the Hilbert depth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2252116)
