Symbolic powers in weighted oriented graphs
Mousumi Mandal, Dipak Kumar Pradhan

TL;DR
This paper characterizes symbolic powers of edge ideals in weighted oriented graphs, showing their similarities to underlying graphs and providing explicit formulas and bounds for specific graph classes.
Contribution
It offers explicit descriptions of symbolic powers using strong vertex covers and compares their behavior to ordinary powers, including bounds on regularity.
Findings
Explicit description of symbolic powers using strong vertex covers.
Similarity in behavior between symbolic and ordinary powers of ideals.
Bounds on regularity of symbolic powers with equality conditions.
Abstract
Let be a weighted oriented graph with the underlying graph when vertices with non-trivial weights are sinks and be the edge ideals corresponding to and respectively. We give explicit description of the symbolic powers of using the concept of strong vertex covers. We show that the ordinary and symbolic powers of and behave in a similar way. We provide a description for symbolic powers and Waldschmidt constant of for certain classes of weighted oriented graphs. When is a weighted oriented odd cycle we compute and prove and show that equality holds when there is only one vertex with non-trivial weight.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
