How to compute the Hilbert depth of a graded ideal

2013/08/14 by Ri-Xiang Chen, Chen, Ri-Xiang
Computer Science · Mathematics · #13D02 #Algebraic Geometry and Number Theory #Commutative Algebra (math.AC) #Commutative Algebra and Its Applications #FOS: Mathematics #Polynomial and algebraic computation #Primary 13D40 #Secondary 13C13

paper · pdf · doi:10.48550/arxiv.1308.3205

openalex publication_date 2013/08/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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 \citeB:Sh2.

Citations

• An algorithm to compute the Hilbert depth

Related

• Lexsegment ideals of Hilbert depth 1
• On Two Classes of Closely Related Monomial Ideals
• Remarks on the Hilbert depth of powers of the maximal graded ideal
• On the Hilbert depth of monomial ideals
• An algorithm to compute the Hilbert depth