Linear syzygy graph and linear resolution

Authors Erfan Manouchehri, Ali Soleyman Jahan

Publication date 1 September 2018

Abstract: For each squarefree monomial ideal

I s u b s e t S = k [x_{1}, l d o t s, x_{n}]

, we associate a simple graph

G_{I}

by using the first linear syzygies of

I

. In cases, where

G_{I}

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

G_{I}

, 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_{D e l t a} c o n g G_{I_{D e l t a^{v e e}}}

is a cycle or a tree.

This page was built for publication: Linear syzygy graph and linear resolution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6306110)