How to compute the Hilbert depth of a graded ideal

Abstract

We give two algorithms for computing the Hilbert depth of a graded ideal in the polynomial ring. These algorithms work efficiently for (squarefree) lex ideals. As a consequence, we construct counterexamples to some conjectures made by Shen in [Sh2].