Comparison of symbolic and ordinary powers of parity binomial edge ideals

Abstract

In this paper, we investigate when symbolic and ordinary powers of the parity binomial edge ideal of a graph fail to be equal. It turns out that if ${\mathcal{I}}_G$ is the parity binomial edge ideal of a graph $G$, then in each of the following cases the symbolic power ${\mathcal{I}}_G^{(t)}$ and the ordinary power ${\mathcal{I}}_G^t$ are not equal for some $t$: (i) the clique number of $G$ is greater than 3; (ii) $G$ has a net; or (iii) $G$ has a PT as an induced subgraph.

References in corpus (6)

• On the containment problem
• Equality of ordinary and symbolic powers of Stanley-Reisner ideals
• Regularity of powers of quadratic sequences with applications to binomial ideals
• Parity binomial edge ideals
• On the symbolic powers of binomial edge ideals
• On the Equality of Symbolic and Ordinary Powers of Binomial Edge Ideals