How to compute the Hilbert depth of a graded ideal
Commutative Algebra
2014-03-05 v2
Abstract
We give two algorithms for computing the Hilbert depth of a \emph{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 \cite{B:Sh2}.
Cite
@article{arxiv.1308.3205,
title = {How to compute the Hilbert depth of a graded ideal},
author = {Ri-Xiang Chen},
journal= {arXiv preprint arXiv:1308.3205},
year = {2014}
}
Comments
In this new version, we have added some materials about comparing Algorithm 2.16 to Popescu's algorithm and Bruns et al's algorithm