عدد نظم توان دوم ایده آلهای یالی

Introduction

‎‎ The study of the minimal free resolution of homogenous ideals and their powers is an interesting and active area of research in commutative algebra. Two invariants which measure the complexity of the minimal free resolutions are the so-called “projective dimension” and “Castelnuovo-Mumford regularity” (or simply, regularity) of the given ideal. Projective dimension determines the length of the minimal free resolution, while regularity is defined in terms of the degree of the entries of the matrices defining the differentials of the resolution. The focus of this paper is on the regularity of powers of ideals. One of the main results in this area is obtained by Cutkosky, Herzog, Trung [7], and independently Kodiyalam [8]. They proved that for a homogenous ideal I in a polynomial ring, the regularity of powers of I is asymptotically linear. In other words, there exist integers a(I) and b(I) such that regIs=aIs+b(I) for every integer s≫0. It is known that a(I) is bounded above by the maximum degree of generators of I. Moreover, if I is generated in a single degree d, then aI=d. But in general, it is not so much known about b(I) even if I is monomial ideal. However, when I is a quadratic squarefree monomial ideal, Alilooee, Banerjee, Beyarslan and Ha [9] conjectured that bI≤regI-2. In fact, they conjectured that the inequality regIs≤2s+regI-2 holds for any integer s≥1, when I is quadratic squarefree monomial ideal. Recently, Benerjee and Nevo [10] proved this conjecture for s=2. In this paper, we provide an alternative proof for their result. While the proof in [10] is based on topological arguments and using the Hochster’s formula, our proof is purely algebraic.

Material and methods

To every simple graph G one associates a quadratic squarefree monomial ideal, called its edge ideal, whose generators are the quadratic squarefree monomials corresponding to the edges of G. This association is a strong tool in the study of squarefree monomial ideals, as one can use the combinatorial properties of G to obtain information about the algebraic and homological properties of it^, s edge ideal.

One of the main results for bounding the regularity of powers of edge ideals is obtained by Benerjee [1]. He proved that the regularity of the sth power of an edge ideal I(G) has an upper bound which is defined in terms of the regularity of its (s-1)th power and the regularity of the edge ideal of some graphs which are explicitly determined by the structure of the G. This result has an essential role in our proof.

Results and discussion

The main result of this paper states that for every graph G, with edge ideal I(G), we have regIG2≤reg(IG)+2. In order to prove this inequality, using the aforementioned result of Benerjee, we must prove that the regularity of certain colon ideals are at most regIG. To achieve this goal, we use a short exact sequence argument which allows us to estimate the regularity of the colon ideas in terms of the regularity of edge ideal of some graphs which are strictly smaller than G.

Conclusion

The following conclusions were drawn from this research.

The conjectured inequality of Alilooee, Banerjee, Beyarslan and Ha [9] is true for the case of s=2.
It is known that for every graph G with edge ideal I(G) and induced matching number ν(G), we have 2s+νG-1≤reg(IGs), for every integer s≥1. Thus, our result implies that if regIG=νG+1, then regIG2=νG+3.

The short exact sequence argument is a common technique in the study of regularity of monomial ideals. So, it would be interesting if one can prove the above-mentioned conjecture, using this method, even in the case of s=3 .