The linear strand of determinantal facet ideals (Q2396618)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    The linear strand of determinantal facet ideals
    scientific article

      Statements

      The linear strand of determinantal facet ideals (English)
      0 references
      0 references
      0 references
      0 references
      24 May 2017
      0 references
      The authors study ideals generated by an arbitrary set of maximal minors of an \((m \times n)\)-matrix of indeterminates. These ideals have first been studied when \(m=2\), in which case the set of minors (which is a set of binomials) is in bijection with the edges of a graph \(G\) is called the binomial edge ideal of \(G\). When \(m \geq 3\), these ideals are called determinantal facet ideals. Here their generators are in bijection with the facets of a pure simplicial complex of dimension \(m-1\). Let \(X\) be an \((m \times n)\)-matrix of indeterminates, and let \(J\) be the ideal generated by a set \(S\) of maximal minors of \(X\). The authors construct the linear strand of the resolution of \(J\). This linear strand is determined by the clique complex of the \(m\)-clutter corresponding to the set \(S\). The authors then are able to obtain explicit formulas for the graded Betti numbers \(\beta_{i,{i+m}}(J)\) for all \(i \geq 0\). They are also able to determine all sets \(S\) for which \(J\) has a linear resolution. The paper was motivated by a conjecture posed by \textit{D. Kiani} and \textit{S. S. Madani} [Collect. Math. 65, No. 3, 331--340 (2014; Zbl 1317.05196)]. In this paper, the authors not only prove this conjecture but also prove an analogous statement for determinantal facet ideals.
      0 references
      resolutions
      0 references
      determinantal facet ideals
      0 references
      binomial edge ideals
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references