An algorithm to compute the Hilbert depth (Q2252116)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6317500
Language Label Description Also known as
default for all languages
No label defined
    English
    An algorithm to compute the Hilbert depth
    scientific article; zbMATH DE number 6317500

      Statements

      An algorithm to compute the Hilbert depth (English)
      0 references
      0 references
      16 July 2014
      0 references
      Let \(R= k[x_1,\ldots,x_n]\) be the polynomial ring in \(n\) variables over a field \(k\), which is assumed to be \(\mathbb{Z}\)-graded, and \(M\) a \(\mathbb{Z}\)-graded \(R\)-module. The author gives an algorithm for computing the Hilbert depth of \(M\). He also shows that the Hilbert depth of the direct sum of a module and \(\mathfrak{m}\) is in general strictly greater than the Hilbert depth of \(\mathfrak{m}\), where \(\mathfrak{m}\) is the maximal graded ideal of \(R\). This gives a partial answer to a question posed by Herzog.
      0 references
      depth
      0 references
      Hilbert depth
      0 references
      Stanley depth
      0 references
      0 references
      0 references

      Identifiers