Regularity of powers of edge ideals of Cohen-Macaulay weighted oriented forests

A weighted oriented graph is a graph \(D = (V(D), E(D),w)\), where \(V(D)\) is its vertex set, \(E(D) = \{(x, y) \ | \ \text{there is an edge from } x \text{ to } y\}\) is its edge set and \(w\) is its weight function which assigns a weight \(w(x)\) to each vertex \(x\) of \(D\). The underlying graph \(G\) of \(D\) is a simple graph with \(V(G) = V(D)\) and \(E(G) = \{\{x, y\} \ |\ (x, y)\in E(D)\}\). A vertex \(x\) of \(D\) is called a sink if there is no vertex \(y\) with \((x,y)\in E(D)\). Let \(V(D) = \{x_1, \dots , x_n\}\) and \(R = K[x_1, \dots , x_n]\), a polynomial ring over a field \(K\). Then the edge ideal of \(D\) is defined as the ideal \[ I (D) = \langle x_i x_j^{w(x_j)} \ | \ (x_i , x_j) \in E(D)\rangle. \] In the paper under review, the regularity of powers of \(I(D)\) is computed where \(D\) is a Cohen-Macaulay weighted oriented forest. In fact firstly the result is gained for the first power and then inductively it is shown: Let \(D\) be a weighted oriented unmixed forest (equivalently Cohen-Macaulay forest). Let \(\{\{x_1, y_1\}, \dots , \{x_r , y_r \}\}\) be a perfect matching in the underlying graph \(G\) of \(D\). Suppose \(y_1, \dots, y_r\) are sinks. Then for any \(k \geq 1\), \begin{align*} \mathrm{reg}(I (D)^k ) = \max \{ &(k - 1)(\max \{ w(y_{i_j})\} + 1) + \sum_{j=1}^s w(y_{i_j}) + 1 :\\ & \text{none of the edges } \{x_{i_j} , y_{i_j} \} \text{ being adjacent}\}. \end{align*} Recall that two edges are said to be adjacent if there exists an edge between them.

Recommendations

Cites work

Cited in

(2)

This page was built for publication: Regularity of powers of edge ideals of Cohen-Macaulay weighted oriented forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6083976)