Linear syzygy graph and linear resolution
Abstract
For each squarefree monomial ideal I⊂ S = k[x1,…, xn] , we associate a simple graph GI by using the first linear syzygies of I. In cases, where GI is a cycle or a tree, we show the following are equivalent: (a) I has a linear resolution (b) I has linear quotients (c) I is a variable-decomposable ideal In addition, with the same assumption on GI, we characterize all monomial ideals with a linear resolution. Using our results, we characterize all Cohen-Macaulay codimension 2 monomial ideals with a linear resolution. As an other application of our results, we also characterize all Cohen-Macaulay simplicail complexes in cases that G GI is a cycle or a tree.
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.