Cohen-Macaulay, shellable and unmixed clutters with a perfect matching of König type (Q2481813)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Cohen-Macaulay, shellable and unmixed clutters with a perfect matching of König type
scientific article

    Statements

    Cohen-Macaulay, shellable and unmixed clutters with a perfect matching of König type (English)
    0 references
    0 references
    0 references
    0 references
    15 April 2008
    0 references
    The authors study simplicial complexes whose Stanley-Reisner ideals are described by a special type of hypergraphs called clutter. A clutter \({\mathcal C}\) with finite vertex set \(X = \{x_1,\ldots, x_n\}\) is a family of subset of \(X\), called edges, none of which is included in another. Let \(R = K[x_1,\ldots, x_n]\) be a polynomial ring over a field \(K\). Then we can associate to \({\mathcal C}\) the edge ideal \(I({\mathcal C})\subset R\), which is generated by all squarefree monomials \(\prod_{x_i\in e}x_i\) for edges \(e\) of \({\mathcal C}\). The edge ideal \(I({\mathcal C})\) is also called facet ideal in the literature. Then we can consider the simplicial complex \(\Delta_{\mathcal C}\) corresponding this squarefree monomial ideal. We say that \({\mathcal C}\) is unmixed, Cohen-Macaulay and shellable, if \(\Delta_{\mathcal C}\) is pure, Cohen-Macaulay and shellable. The main interest of this paper is which families of clutters have these properties. A perfect matching of König type of \({\mathcal C}\) is a collection \(e_1,\ldots, e_g\) of pairwise disjoint edges whose union is \(X\) and \(g= \text{ height}(I({\mathcal C}))\). For a clutter with this kind of perfect matching, the authors give a combinatorial characterization of unmixedness (Theorem~2.9). Moreover, they give several conditions for an unmixed clutter with a perfect matching to be pure shellable (Theorem~2.8,~2.15 and 2.16). The authors also introduce the notion of complete admissible clutter, which is a subclass of the clutters with perfect matchings, and show that if \({\mathcal C}\) is a complete admissible clutter with the same size of edges, then (i) the simplicial complex generated by the edges of \({\mathcal C}\) is shellable (Theorem~3.7), and (ii) \(R/I({\mathcal C})\) is Cohen-Macaulay and has a linear resolution (Theorem~3.12). Finally, the authors characterizes bipartite graphs \(G\) with a perfect matching of König type \(e_1,\ldots, e_g\) such that the \(g\)th pure skeleton of \(\Delta_G\) is pure shellable (Theorem~4.3).
    0 references
    clutters with König property
    0 references
    facet ideal
    0 references
    shellability
    0 references

    Identifiers

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