Regularity of symbolic powers of square-free monomial ideals
Abstract
We study the regularity of symbolic powers of square-free monomial ideals. We prove that if I = I is the Stanley-Reisner ideal of a simplicial complex , then (I(n)) ≤slant δ(n-1) +b for all n≥slant 1, where δ = n∞ (I(n))/n, and b = \(I) is a subcomplex of with () ⊂eq ()\. This bound is sharp for any n. When I = I(G) is the edge ideal of a simple graph G, we obtain a general linear upper bound (I(n)) ≤slant 2n + (G)-1, where (G) is the ordered matching number of G.
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.