The facet ideals of matching complexes of line graphs (Q2082539)

Let \(G\) be a simple graph with the vertex set \(V(G)\) and edge set \(E(G).\) A subset \(M \subseteq E(G)\) is said to be a matching of \(G\) if it contains no adjacent edges. A collection of all matchings of \(G\) forms a simplicial complex, called to be the matching complex of \(G.\) Let \(\Delta\) be a simplicial complex on the vertex set \(V = \{x_i \mid 1 \leq i \leq n\}.\) Let Facets\((\Delta)\) denote a collection of all its facets (maximal faces under inclusion). By identifying the vertex \(x_i\) with the variable \(x_i\) in the polynomial ring \(S = k[x_1, \ldots, x_n]\) over a field \(k\), one can associate \(\Delta\) with a square-free monomial ideals of \(S\), \(F(\Delta) = ( \prod_{i=1}^{s} x_{l_i} \mid \{x_{l_1}, \ldots, x_{l_s} \} \in \mathrm{ Facets }(\Delta)),\) which is called to be the facet ideal of \(\Delta.\) Let \(n\) be a positive integer and let \(L_n\) denote the line graph with \(n\) edges. Let \(\mathcal{F}(L_n)\) denote the facet ideal of the matching complex of \(L_n.\) In the paper under review, the authors provide the irreducible decomposition and some exact formulas for the projective dimension and regularity of \(\mathcal{F}(L_n).\) In particular, they prove: {Theorem 4.2.} When \(n=1,\) \(\mathrm{projdim}(\mathcal{F}(L_1))=0\) and \(\mathrm{reg}(\mathcal{F}(L_1))=1.\) When \(n \geq 2,\) \(\mathrm{projdim}(\mathcal{F}(L_n)) \leq \lceil \frac{n-1}{3} \rceil\) and \(\mathrm{reg}(\mathcal{F}(L_n)) = n - \lceil \frac{n}{3} \rceil.\)