Symbolic powers in weighted oriented graphs

preprint2021arXivOpen access

Abstract

Let DD be a weighted oriented graph with the underlying graph GG when vertices with non-trivial weights are sinks and I(D),I(G)I(D), I(G) be the edge ideals corresponding to DD and G,G, respectively. We give explicit description of the symbolic powers of I(D)I(D) using the concept of strong vertex covers. We show that the ordinary and symbolic powers of I(D)I(D) and I(G)I(G) behave in a similar way. We provide a description for symbolic powers and Waldschmidt constant of I(D)I(D) for certain classes of weighted oriented graphs. When DD is a weighted oriented odd cycle we compute $\reg (I(D)^{(s)}/I(D)^s)$ and prove $\reg I(D)^{(s)}\leq\reg I(D)^s$ and show that equality holds when there is only one vertex with non-trivial weight.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.