Comparision between regularity of small symbolic powers and ordinary powers of an edge ideal

Abstract

Let G be a simple graph and I its edge ideal. We prove that reg(I(s)) = reg(Is) for s = 2,3, where I(s) is the s-th symbolic power of I. As a consequence, we prove the following bounds align* reg Is & reg I + 2s - 2, for s = 2,3, reg I(s) & reg I + 2s - 2, for s = 2,3,4. align*

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…