Enrique Reyes, Jonathan Toledo : On the strong persistence property for monomial ideals, 293-305


Let $I$ be the edge ideal associated to a graph with loops, a weighted graph or a clutter. In this paper we study when $I$ has the strong persistence property, this is $(I^{k+1}\colon I) = I^k$ for each $k\geq 1$.

Key Words: Strong persistence property, monomial ideals, clutters, weighted graphs, graphs with loops.

2010 Mathematics Subject Classification: Primary 13C13
Secondary 13A30, 05C25, 05C65