Normally torsion-free edge ideals of weighted oriented graphs

TL;DR

This paper characterizes when the edge ideal of a weighted oriented graph is normally torsion-free, linking algebraic properties to graph structure and vertex weights, with implications for symbolic and ordinary power equality.

Contribution

It provides a complete classification of normally torsion-free edge ideals of weighted oriented graphs based on vertex weights and underlying graph structure.

Findings

$I^2=I^{(2)}$ iff vertices with weight >1 are sinks and $G$ has no triangles

$I^n=I^{(n)}$ for all $n$ iff vertices with weight >1 are sinks and $G$ is bipartite

Necessary conditions for equality of powers using polyhedral geometry

Abstract

Let $I=I(D)$ be the edge ideal of a weighted oriented graph $D$, let $G$ be the underlying graph of $D$, and let $I^{(n)}$ be the $n$-th symbolic power of $I$ defined using the minimal primes of $I$. We prove that $I^2=I^{(2)}$ if and only if (i) every vertex of $D$ with weight greater than $1$ is a sink and (ii) $G$ has no triangles. As a consequence, using a result of Mandal and Pradhan, and the classification of normally torsion-free edge ideals of graphs, it follows that $I^n=I^{(n)}$ for all $n\geq 1$ if and only if (a) every vertex of $D$ with weight greater than $1$ is a sink and (b) $G$ is bipartite. If $I$ has no embedded primes, conditions (a) and (b) classify when $I$ is normally torsion-free. Using polyhedral geometry and integral closure, we give necessary conditions for the equality of ordinary and symbolic powers of monomial ideals with a minimal irreducible decomposition. Then, we classify when the Alexander dual of the edge ideal of a weighted oriented graph is normally torsion-free.