An algorithm to compute the Hilbert depth

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.

to appear in: Journal of Symbolic Computation

References in corpus (2)

• Lexsegment ideals of Hilbert depth 1
• How to compute the Hilbert depth of a graded ideal

Cited by in corpus (2)

• The behavior of Stanley depth under polarization
• How to compute the Hilbert depth of a graded ideal