Rooted order on minimal generators of powers of some cover ideals (Q2134240)

Let \(S=\Bbbk[x_1,\ldots,x_n]\) be the polynomial ring in \(n\) variables over a field \(\Bbbk\). To every simple graph \(G\) with vertex set \(V(G)=\{x_1, \ldots, x_n\}\) and edge set \(E(G)\), one associates its edge ideal \(I(G)\) defined by \[ I(G)=\big(x_ix_j: \{x_i,x_j\}\in E(G)\big). \] In the paper under review, the author studies the Alexander dual of edge ideals. Namely, the ideal \[ J(G)=\bigcap_{\{x_i, x_j\}\in E(G)}(x_i, x_j), \] which is called the cover ideal of \(G\). The reason for this naming is that \(J(G)\) is minimally generated by squarefree monomials corresponding to the minimal vertex covers of \(G\). In this paper, the author defines a total order, called rooted order, on minimal generating set of \(J(P_n)^s\) where \(P_n\) is the path graph on \(n\) vertices. It is shown that each power of \(J(P_n)\) has linear quotients with respect to the rooted order. Moreover, the author characterizes minimal generating set of \(J(P_n)^s\) for \(s\geq 3\) in terms of minimal generating set of \(J(P_n)^2\). The author also discusses the extension of the concept of rooted order to chordal graphs. Computational examples suggest that such order gives linear quotients for powers of cover ideals of chordal graphs as well.