Comparing symbolic powers of edge ideals of weighted oriented graphs (Q2164980)

Let \(D\) be a weighted oriented graph and \(I(D)\) be its edge ideal. If \(D\) contains an induced odd cycle of length \(2n+1\), under certain condition it is shown that \(I(D)^{(n+1)} \neq I(D)^n+1\). The necessary and sufficient condition for the equality of ordinary and symbolic powers of edge ideals of weighted oriented graphs having each edge in some induced odd cycle of it is given by the authors. In general, even for monomial ideals comparison of ordinary and symbolic powers is a difficult problem. As the edge ideal of a weighted oriented graph depends upon both the orientation of edges and weights on vertices, it is actually difficult to get the necessary and sufficient conditions, even for a particular class of weighted oriented graphs. The authors characterize the weighted naturally oriented unicyclic graphs with unique odd cycles and weighted naturally oriented even cycles for the equality of ordinary and symbolic powers of their edge ideals. Let \(D^\prime\) be the weighted-oriented graph obtained from \(D\) after replacing the weights of vertices with non-trivial weights which are sinks, by trivial weights. One of the interesting results is that the symbolic powers of \(I(D)\) and \(I(D^\prime )\) behave in a similar way. Also, if \(D\) is any weighted oriented star graph, the authors show that \(I(D) (s) = I(D) s\) for all \(s\geq 2\). The paper has much useful information on weighted-oriented graphs and edge ideals.