Comparing symbolic powers of edge ideals of weighted oriented graphs

DOI10.1007/S10801-022-01118-1MaRDI QIDQ2164980zbMATH OpenOpenAlexFDO

Authors Mousumi Mandal, Dipak Kumar Pradhan

Publication date 18 August 2022

Published in Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2105.11429

edge ideal even cycle induced odd cycle sink vertex star graph symbolic power weighted oriented graph

Signed and weighted graphs (05C22) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38) Combinatorial aspects of commutative algebra (05E40)

Abstract: Let

D

be a weighted oriented graph and

I (D)

be its edge ideal. If

D

contains an induced odd cycle of length

2 n + 1

, under certain condition we show that

{I (D)}^{(n + 1)} e q {I (D)}^{n + 1}

. We give necessary and sufficient condition for the equality of ordinary and symbolic powers of edge ideal of a weighted oriented graph having each edge in some induced odd cycle of it. We 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^{p r i m e}

be the weighted oriented graph obtained from

D

after replacing the weights of vertices with non-trivial weights which are sinks, by trivial weights. We show that the symbolic powers of

I (D)

and

I (D^{p r i m e})

behave in a similar way. Finally, if

D

is any weighted oriented star graph, we show that

{I (D)}^{(s)} = {I (D)}^{s}

for all

s g e q 2.

Review text

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.

Recommendations

Cites work

Cited in

(9)

This page was built for publication: Comparing symbolic powers of edge ideals of weighted oriented graphs

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