Preprint
Article

Cohen-Macaulayness of Vertex Splittable Monomial Ideals

Altmetrics

Downloads

106

Views

32

Comments

0

A peer-reviewed article of this preprint also exists.

This version is not peer-reviewed

Submitted:

09 February 2024

Posted:

09 February 2024

You are already at the latest version

Alerts
Abstract
The Cohen-Macaulay vertex splittable ideals are characterized. As a consequence, we recover several Cohen-Macaulay classifications of families of monomial ideals known in the literature by new simpler combinatorial proofs.
Keywords: 
Subject: Computer Science and Mathematics  -   Algebra and Number Theory

1. Introduction

Inspired by the notion of vertex decomposable simplicial complexes, in [21] Moradi and Khosh-Ahang introduced the notion of vertex splittable monomial ideals. In this article, we characterize the Cohen-Macaulay vertex splittable monomial ideals (Theorem 1). Our result provides a simple, but very neat and effective, inductive strategy to classify Cohen-Macaulay monomial ideals. As a consequence, we recover the Cohen-Macaulay classifications of (vector-spread) strongly stable ideals, and (componentwise) polymatroidal ideals. Finally, a new characterization of bi-Cohen-Macaulay graphs is presented (Theorem 4).

2. Vertex Splittable Monomial Ideals

Let S = K [ x 1 , , x n ] be the polynomial ring over a field K, and let I S be a monomial ideal. We say that I is Cohen-Macaulay if S / I is a Cohen-Macaulay ring. We denote by G ( I ) the unique minimal monomial generating set of I. We recall the following notion [21].
Definition 1.
The ideal I is called vertex splittable if it can be obtained by the following recursive procedure.
(i)
If u is a monomial and I = ( u ) , I = 0 or I = S , then I is vertex splittable.
(ii)
If there exists a variable x i and vertex splittable ideals I 1 S and I 2 K [ x 1 , , x i 1 ,
x i + 1 , , x n ] such that I = x i I 1 + I 2 , I 2 I 1 and G ( I ) is the union of G ( x i I 1 ) and G ( I 2 ) , then I is vertex splittable. In this case, we say that I = x i I 1 + I 2 is a vertex splitting of I and x i is a splitting vertex of I.
In contrast to arbitrary monomial ideals ([2], Page 236), the Cohen-Macaulayness of S / I , where I is vertex splittable, is independent from the field K. Indeed, the Krull dimension of S / I does not depend on K. Furthermore, by [21], Theorem 2.4, vertex splittable ideals have linear quotients. Hence, depth S / I is also independent from K [17], Corollary 8.2.2.
For recent applications of vertex splittings see the papers [4,5,6,22].

3. A Cohen-Macaulay Criterion

Let m = ( x 1 , , x n ) be the unique maximal homogeneous ideal of S.
Theorem 1.
Let I S be a vertex splittable monomial ideal such that I m 2 and let x i be a splitting vertex of I. Then, the following conditions are equivalent.
(a)
I is Cohen-Macaulay.
(b)
( I : x i ) , ( I , x i ) are Cohen-Macaulay and depth S / ( I : x i ) = depth S / ( I , x i ) .
Proof. 
We may assume i = 1 . Let I = x 1 I 1 + I 2 be the vertex splitting of I. Since I = x i I 1 + I 2 is a Betti splitting [21, Theorem 2.8], then [12, Corollary 2.2(b)] together with the Auslander-Buchsbaum formula, implies
depth S / I = min { depth S / ( x 1 I 1 ) , depth S / I 2 , depth S / ( x 1 I 1 I 2 ) 1 } .
Notice that depth S / x 1 I 1 = depth S / I 1 and x 1 I 1 I 2 = x 1 ( I 1 I 2 ) = x 1 I 2 , because I 2 I 1 and x 1 does not divide any minimal monomial generator of I 2 . Consequently, depth S / ( x 1 I 1 I 2 ) = depth S / ( x 1 I 2 ) = depth S / I 2 , and so
depth S / I = min { depth S / I 1 , depth S / I 2 1 } .
We have the short exact sequence
0 S / ( I : x 1 ) S / I S / ( I , x 1 ) 0 .
Notice that ( I : x 1 ) = ( x 1 I 1 + I 2 ) : x 1 = ( x 1 I 1 : x 1 ) + ( I 2 : x 1 ) = I 1 + I 2 = I 1 , because x 1 does not divide any minimal monomial generator of I 2 and I 2 I 1 . Since I m 2 , we have x 1 I . Thus I 1 S . Moreover, ( I , x 1 ) = ( x 1 I 1 + I 2 , x 1 ) = ( I 2 , x 1 ) and so we obtain the short exact sequence
0 S / I 1 S / I S / ( I 2 , x 1 ) 0 .
Hence dim S / I = max { dim S / I 1 , dim S / ( I 2 , x 1 ) } . Since S / ( I 2 , x 1 ) K [ x 2 , , x n ] / I 2 we obtain that dim S / ( I 2 , x 1 ) = dim K [ x 2 , , x n ] / I 2 = dim S / I 2 1 . Hence,
dim S / I = max { dim S / I 1 , dim S / I 2 1 } .
(a)⇒(b) Suppose that I is Cohen-Macaulay. By equations (1) and (2) we have
dim S / I dim S / I 1 depth S / I 1 depth S / I = dim S / I ,
and
dim S / I dim S / I 2 1 depth S / I 2 1 depth S / I = dim S / I .
Hence S / I 1 , S / I 2 are Cohen-Macaulay and depth S / I 1 = depth S / I = depth S / I 2 1 .
(b)⇒(a) Conversely, assume that S / I 1 and S / I 2 are Cohen-Macaulay and that depth S / I 1 = depth S / I 2 1 . Then,
min { depth S / I 1 , depth S / I 2 1 } = depth S / I 1 ,
and
max { dim S / I 1 , dim S / I 2 1 } = dim S / I 1 .
Equations (1) and (2) imply that depth S / I = depth S / I 1 = dim S / I 1 = dim S / I and so S / I is Cohen-Macaulay. □
The assumption I m 2 stated in Theorem 1 can always be fulfilled. Indeed, if G ( I ) = { x t + 1 , , x n , u 1 , , u m } where u 1 , , u m are monomials of degree 2 , then S / I K [ x 1 , , x t ] / ( u 1 , , u m ) and ( u 1 , , u m ) ( x 1 , , x t ) 2 .
Let I S be a graded Cohen-Macaulay ideal, and let p = pd ( S / I ) be the projective dimension of S / I . The Cohen-Macaulay type of S / I is defined as the integer C M t y p e ( S / I ) = β p ( S / I ) . It is well-known that S / I is Gorenstein if and only C M t y p e ( S / I ) = 1 . We say that I is Gorenstein if S / I is such.
By [18, Corollary 2.17] the graded Betti number β p , p + reg S / I ( S / I ) is always non-zero. Here reg S / I is the Castelnuovo-Mumford regularity of S / I . We say that S / I is level if and only if β p ( S / I ) = β p , p + reg S / I ( S / I ) . Following [8], we say that S / I is pseudo-Gorenstein if and only if β p , p + reg S / I ( S / I ) = 1 . Hence S / I is Gorenstein if and only if it is both level and pseudo-Gorenstein.
Finally, for a finitely generated graded S-module M, we denote by H m i ( M ) the ith local cohomology module of M with support on m .
Corollary 1.
Let I S be a vertex splittable Cohen-Macaulay ideal such that I m 2 and let I = x i I 1 + I 2 be a vertex splitting of I. Then, the following statements hold.
(a)
C M t y p e ( S / I ) = C M t y p e ( S / I 1 ) + C M t y p e ( S / I 2 ) .
(b)
S / I is Gorenstein if and only if I is a principal ideal.
(c)
S / I is level if and only if S / I 1 and S / I 2 are level and reg S / I 1 + 1 = reg S / I 2 .
(d)
S / I is pseudo-Gorenstein if and only if
(i)
either S / I 1 is pseudo-Gorenstein and reg S / I 1 + 1 > reg S / I 2 , or
(ii)
S / I 2 is pseudo-Gorenstein and reg S / I 1 + 1 < reg S / I 2 .
(e)
H m dim S / I ( S / I ) / H m dim S / I ( S / ( I : x i ) ) H m dim S / I ( S / ( I , x i ) ) .
Proof. 
We may assume that x i = x 1 . Since S / I is Cohen-Macaulay, Theorem 1 guarantees that S / I 1 , S / I 2 are Cohen-Macaulay and depth S / I 1 = depth S / I 2 1 . Hence pd S / I 1 = pd S / I 2 + 1 . Let p = pd S / I 1 . In particular, we have p = pd S / I . Now, by [21, Remark 2.10] we have for all j
β p , p + j ( S / I ) = β p , p + j 1 ( S / I 1 ) + β p , p + j ( S / I 2 ) + β p 1 , p 1 + j ( S / I 2 ) .
Since pd S / I 2 = p 1 , the above formula simplifies to
β p , p + j ( S / I ) = β p , p + j 1 ( S / I 1 ) + β p 1 , p 1 + j ( S / I 2 ) .
From this formula we deduce that
reg S / I = max { reg S / I 1 + 1 reg S / I 2 } .
(a) The assertion follows immediately by equation (3).
(b) In the proof of Theorem 1 we noted that I 1 0 , S . Thus C M t y p e ( S / I 1 ) 1 . By (a), it follows that I is Gorenstein if and only if C M t y p e ( S / I 1 ) = 1 , that is I 1 is Gorenstein, and C M t y p e ( S / I 2 ) = 0 , that is I 2 = 0 . But, if I 2 = 0 then depth S / I 2 = depth S = n , and so by formula (1) and Theorem 1(b) we obtain that depth S / I = depth S / I 1 = depth S / I 2 1 = n 1 . Thus pd I = 0 , and this is possible if and only if I is a principal ideal.
(c) Assume that S / I is level. Then β p , p + j ( S / I ) 0 only for j = reg S / I . Since reg S / I = max { reg S / I 1 + 1 , reg S / I 2 } and β p , p + reg S / I 1 ( S / I 1 ) , β p 1 , p 1 + reg S / I 2 ( S / I 2 ) are both non-zero, we deduce from formula (3) that reg S / I 1 + 1 = reg S / I 2 and that S / I 1 , S / I 2 must be level. Conversely, if reg S / I 1 + 1 = reg S / I 2 and S / I 1 , S / I 2 are level, we deduce from formula (3) that S / I is level.
(d) Assume that S / I is pseudo-Gorenstein. Then β p , p + reg S / I ( S / I ) = 1 . Since reg S / I = max { reg S / I 1 + 1 , reg S / I 2 } and β p , p + reg S / I 1 ( S / I 1 ) , β p 1 , p 1 + reg S / I 2 ( S / I 2 ) are both non-zero, we deduce from formula (3) that either S / I 1 is pseudo-Gorenstein and reg S / I 1 + 1 > reg S / I 2 , or S / I 2 is pseudo-Gorenstein and reg S / I 1 + 1 < reg S / I 2 . The converse can be proved in a similar way.
(e) Since S / I is Cohen-Macaulay, Theorem 1 implies that S / ( I : x i ) and S / ( I , x i ) are Cohen-Macaulay and dim S / ( I : x i ) = dim S / ( I , x i ) = dim S / I . As shown in the proof of Theorem 1 we have the short exact sequence
0 S / ( I : x i ) S / I S / ( I , x i ) 0 .
This sequence induces the long exact sequence of local cohomology modules:
H m i 1 ( S / ( I , x i ) ) H m i ( S / ( I : x i ) ) H m i ( S / I ) H m i ( S / ( I , x i ) ) .
Let M be a finitely generated Cohen-Macaulay S-module. By Grothendieck’s vanishing theorem [2, Theorem 5.3.7], H m i ( M ) 0 if and only if i = depth M = dim M . Thus, the above exact sequence simplifies to
0 H m dim S / I ( S / ( I : x i ) ) H m dim S / I ( S / I ) H m dim S / I ( S / ( I , x i ) ) 0 ,
and the assertion follows. □
It is clear that any ideal I S generated by a subset of the variables of S is Gorenstein and vertex splittable. Hence, Corollary 1 implies immediately
Corollary 2.
The only Gorenstein vertex splittable ideals of S are the principal monomial ideals and the ideals generated by a subset of the variables.

4. Families of Cohen-Macaulay Vertex Splittable Ideals

In this section, by using Theorem 1 we recover in a simple and very effective manner several Cohen-Macaulay classification of families of monomial ideals. We use the fact that if I = x i I 1 + I 2 is a vertex splitting, then I 1 , I 2 are vertex splittable ideals that, in good cases, belong again to a given family of vertex splittable monomial ideals, and to which one may apply inductive arguments.

4.1. (Vector-Spread) Strongly Stable Ideals

Strongly stable monomial ideals are fundamental in Commutative Algebra, because if K has characteristic zero, then they appear as generic initial ideals [17]. In [9], the concept of strongly stable ideal has been generalized to that of t -spread strongly stable ideal.
Let d 2 , t = ( t 1 , , t d 1 ) Z 0 d 1 be a ( d 1 ) tuple, and let u = x i 1 x i S be a monomial, with 1 i 1 i n and d . We say that u is t -spread if
i j + 1 i j t j for   all j = 1 , , 1 .
A monomial ideal I S is called t -spread if G ( I ) consists of t -spread monomials. A t -spread ideal I S is called t -spread strongly stable if for all t -spread monomials u I and all i < j such that x j divides u and x i ( u / x j ) is t -spread, then x i ( u / x j ) I . For t = ( 0 , , 0 ) and t = ( 1 , , 1 ) , we obtain the strongly stable and the squarefree strongly stable ideals. In [3] we classified the Cohen-Macaulay t -spread strongly stable ideals. We recover this result using Theorem 1.
Corollary 3.
Let I S be a t -spread strongly stable ideal such that I m 2 . Then I is Cohen-Macaulay if and only if there exists d such that
x n ( t 1 + t 2 + t 1 ) x n ( t 2 + t 3 + t 1 ) x n t 1 x n G ( I ) .
Proof. 
Firstly, we prove that I is vertex splittable. If I is a principal ideal, then it is vertex splittable. Suppose now that | G ( I ) | > 1 . We can write I = x 1 I 1 + I 2 , where G ( I 1 ) = { u / x 1 : u G ( I ) , x 1 d i v i d e s u } and G ( I 2 ) = G ( I ) G ( x 1 I 1 ) . It is immediate to see that I 1 S is ( t 2 , , t d 1 ) -spread strongly stable and that I 2 is a t -spread strongly stable ideal of K [ x 2 , , x n ] . By induction on n and on the highest degree of a generator of I, we have that I 1 and I 2 are vertex splittable. Hence, so is I.
We may suppose that x n divides some minimal generator of I. Otherwise, we can consider I as a monomial ideal of a smaller polynomial ring. If I is principal, then we have I = ( u ) = ( x 1 x 1 + t 1 x 1 + t 1 + + t 1 ) , with n = 1 + t 1 + + t 1 , and d . Otherwise, if I is not principal, then pd S / I > 1 and we can write I = x 1 I 1 + I 2 as above. By Theorem 1, I 2 is Cohen-Macaulay and pd S / I 2 = pd S / I + 1 > 1 . Thus I 2 0 . Hence, by induction there exists d such that
x n ( t 1 + + t 1 ) x n t 1 x n G ( I 2 ) .
Since G ( I 2 ) G ( I ) , the assertion follows. □

4.2. Componentwise Polymatroidal Ideals

For a monomial ideal I S and an integer j 0 , we denote by I j , the jth component of I, that is, the monomial ideal of S generated by all monomials of degree j belonging to I.
Let I S be a monomial generated in a single degree. We say that I is polymatroidal if the set of the exponent vectors of the minimal monomial generators of I is the set of bases of a discrete polymatroid [15]. An arbitrary monomial ideal I is called componentwise polymatroidal if the component I j is polymatroidal for all j.
Polymatroidal ideals are characterized by the exchange property [15]. For a monomial u S , let
deg x i ( u ) = max { j : x i j d i v i d e s u } .
A monomial ideal I S generated in a single degree is polymatroidal if and only if for all u , v G ( I ) and all i such that deg x i ( u ) > deg x i ( v ) , there exists j with deg x j ( u ) < deg x j ( v ) such that x j ( u / x i ) G ( I ) .
A longstanding conjecture of Bandari and Herzog predicted that componentwise polymatroidal ideals have linear quotients [1]. This conjecture has been solved recently in [10]. Inspecting the proof of that theorem, we notice the next result. For the polymatroidal case see also [20].
Proposition 1.
Componentwise polymatroidal ideals are vertex splittable.
Proof. 
We may assume that all variables x i divide some minimal monomial generator of I. It is noted in the proof of [10] that for any variable x i which divides a minimal monomial generator of minimal degree of I, we can write I = x i I 1 + I 2 , where G ( x i I 1 ) = { u G ( I ) : x i d i v i d e s u } , G ( I 2 ) = G ( I ) G ( x i I 1 ) and the following properties are satisfied:
(a)
I 2 I 1 as monomial ideals of S.
(b)
x i I 1 is a componentwise polymatroidal ideal of S.
(c)
I 2 is a componentwise polymatroidal ideal of K [ x 1 , , x i 1 , x i + 1 , , x n ] .
By induction on n and on the highest degree of a generator of I, it follows that both I 1 and I 2 are vertex splittable. Hence, so is I. □
Combining the vertex splitting presented in the above proof with the facts (b) and (c) and with Theorem 1, we obtain the following immediate corollary.
Corollary 4.
Let I S be a componentwise polymatroidal ideal and let x i be any variable dividing some minimal monomial generator of least degree of I. Suppose that I m 2 . Then, the following conditions are equivalent.
(a)
I is Cohen-Macaulay.
(b)
( I : x i ) , ( I , x i ) are Cohen-Macaulay componentwise polymatroidal ideals and depth S / ( I : x i ) = depth S / ( I , x i ) .
Corollary 5.
[11]Let I S be a polymatroidal ideal generated in degree d 2 and let x i be a variable dividing some monomial of G ( I ) . Then ( I : x i ) is polymatroidal. If, in addition, I is Cohen-Macaulay, then ( I : x i ) is also Cohen-Macaulay.
At the moment, to classify all Cohen-Macaulay componentwise polymatroidal ideals seems to be an hopeless task. Indeed, let J be any componentwise polymatroidal ideal. Let be the highest degree of a minimal monomial generator of J, and let d > be any integer. It is easy to see that I = J + m d is componentwise polymatroidal. Since dim S / I = 0 , then S / I is automatically Cohen-Macaulay.
For another example, consider the ideal I = ( x 1 2 , x 1 x 3 , x 3 2 , x 1 x 2 x 4 , x 2 x 3 x 4 , x 2 2 x 4 2 ) of S = K [ x 1 , x 2 , x 3 , x 4 ] , see [10]. One can easily check that I is a Cohen-Macaulay componentwise polymatroidal ideal. In this case, dim S / I > 0 .
Nonetheless, if I is generated in a single degree, that is, if I is actually polymatroidal, then Herzog and Hibi [16] showed that I is Cohen-Macaulay if and only if: (i) I is a principal ideal, (ii) I is a squarefree Veronese ideal I n , d , that is, it is generated by all squarefree monomials of S of a given degree d n , or (iii) I is a Veronese ideal, that is, I = m d for some integer d 1 .
The proof presented by Herzog and Hibi is based on the computation of I . We now present a different proof based on Theorem 1.
Corollary 6.
A polymatroidal I S is Cohen-Macaulay if and only if I is
(a)
a principal ideal,
(b)
a Veronese ideal, or
(c)
a squarefree Veronese ideal.
For the proof, we need the following well-known identities. For the convenience of the reader, we provide a proof that uses the vertex splittings technique.
Lemma 1.
Let n , d 1 be positive integers. Then
pd S / m d = n , and pd S / I n , d = n + 1 d .
Proof. 
Since dim S / m d = 0 we have depth S / m d = 0 and pd S / m d = n . If d = 1 , then I n , 1 = m and pd S / I n , 1 = n . If 1 < d n , we notice that I n , d = x n I n 1 , d 1 + I n 1 , d is a vertex splitting. By formula (1) and induction on n and d,
pd S / I n , d = min { pd S / I n 1 , d 1 , pd S / I n 1 , d + 1 } = min { n 1 + 1 ( d 1 ) , n 1 + 1 d + 1 } = n + d 1 ,
as wanted □
We are now ready for the proof of Corollary 6.
Proof of Corollary 6
Let I be a polymatroidal ideal. If I is principal, then it is Cohen-Macaulay. Now, let | G ( I ) | > 1 . If I = m , then I is Cohen-Macaulay. Thus, we assume that I is generated in degree d 2 , and that all variables x i divide some minimal monomial generator of I. By Proposition 1 and Corollaries 5, 5, we have a vertex splitting I = x i I 1 + I 2 for each variable x i , and I 1 and I 2 are Cohen-Macaulay polymatroidal ideals with depth S / I 1 = depth S / I 2 1 . Thus pd S / I 1 = pd S / I 2 + 1 . We may assume that x i = x n .
By induction on n and on d, it follows that I 1 is either a principal ideal, a Veronese ideal, or a squarefree Veronese ideal, and the same possibilities occur for I 2 . We distinguish the various possibilities.
Case 1. Let I 2 be a principal ideal, then pd S / I 2 = 1 . Thus pd S / I 1 = 2 .
Under this assumption, I 1 cannot be principal because pd S / I 1 = 2 1 .
Assume that I 1 is a Veronese ideal in m variables. Since all variables of S divide some monomial of G ( I ) and I 2 I 1 , then I 1 = m d or I 1 = n d , where m = ( x 1 , , x n ) and n = ( x 1 , , x n 1 ) . Thus m = n or m = n 1 . Lemma 1 implies m = pd S / I 1 = 2 . So, n = 2 or n = 3 .
If n = 2 , then I = x 2 ( x 1 , x 2 ) d 1 + ( x 1 d ) = ( x 1 , x 2 ) d which is Cohen-Macaulay and Veronese, or I = x 2 ( x 1 d 1 ) + ( x 1 d ) = x 1 d 1 ( x 1 , x 2 ) which is not Cohen-Macaulay.
Otherwise, if n = 3 then I = x 3 ( x 1 , x 2 , x 3 ) d 1 + ( u ) or else I = x 3 ( x 1 , x 2 ) d 1 + ( u ) where u K [ x 1 , x 2 ] is a monomial of degree d. If d = 2 , then one easily sees that only in the second case and for u = x 1 x 2 we have that I a Cohen-Macaulay polymatroidal ideal, which is the squarefree Veronese I 3 , 2 . Otherwise, suppose d 3 . We may assume that x 1 2 divides u. In the first case, ( I : x 1 ) = x 3 ( x 1 , x 2 , x 3 ) d 2 + ( u / x 1 ) is not principal, neither Veronese, neither squarefree Veronese. Thus, by induction ( I : x 1 ) is not a Cohen-Macaulay polymatroidal ideal, and by Corollary 5 we deduce that I is also not Cohen-Macaulay. Similarly, in the second case, we see that ( I : x 1 ) = x 3 ( x 1 , x 2 ) d 1 + ( u / x 1 ) , and thus also I, is not a Cohen-Macaulay polymatroidal ideal.
Assume now that I 1 is a squarefree Veronese ideal in m variables. Then as argued in the case 1.2 we have m = n or m = n 1 . Lemma 1 gives pd S / I 1 = m + 1 ( d 1 ) = 2 . Thus d = m . Hence d = n or d = n 1 . So I = x n I n , n 1 + ( u ) or I = x n I n 1 , n 2 + ( u ) where u K [ x 1 , , x n 1 ] is a monomial of degree d = n in the first case or d = n 1 in the second case. In the first case there is i such that x i 2 divides u. Say i = 1 . Then ( I : x 1 ) = x n ( I n , n 1 : x 1 ) + ( u / x 1 ) is not a principal ideal, neither a Veronese ideal, neither a squarefree Veronese. Therefore, by induction ( I : x 1 ) we see that is not a Cohen-Macaulay polymatroidal ideal, and by Corollary 5I is also not a Cohen-Macaulay polymatroidal ideal. Similarly, in the second case, if u = x 1 x n 1 then I = I n , n 1 is a Cohen-Macaulay squarefree Veronese ideal. Otherwise x i 2 , say with i = 1 , divides u and then, arguing as before, we see that I is not a Cohen-Macaulay polymatroidal ideal.
Case 2. Let I 2 be a Veronese ideal in m variables, then pd S / I 2 = m n 1 .
Under this assumption, I 1 cannot be principal because pd S / I 1 = m + 1 > 1 .
Assume that I 1 is a Veronese ideal in variables. Then = n or = n 1 . Lemma 1 implies that = pd S / I 1 = pd S / I 2 + 1 = m + 1 . Thus = n and m = n 1 or = n 1 and m = n 2 . In the first case I = x n m d 1 + ( x 1 , , x n 1 ) d = m d is a Cohen-Macaulay Veronese ideal. In the second case, up to relabeling we can write I = x n ( x 1 , , x n 1 ) d 1 + ( x 1 , , x n 2 ) d . But this ideal is not polymatroidal. Otherwise, by the exchange property applied to u = x n x n 1 d 1 and v = x n 2 d , we should have x n 2 x n 1 d 1 I , which is not the case.
Assume now that I 1 is a squarefree Veronese ideal in variables.Then = n or = n 1 . Lemma 1 implies that pd S / I 1 = + 1 ( d 1 ) = + 2 d = pd S / I 2 + 1 = m + 1 . Thus, either m = n + 1 d or m = n d . Up to relabeling, we have either I = x n I n , d 1 + ( x 1 , , x n + 1 d ) d or I = x n I n 1 , d 1 + ( x 1 , , x n d ) d . If d = 2 , then these ideals become either I = ( x 1 , , x n ) 2 which is a Cohen-Macaulay Veronese ideal, or I = x n ( x 1 , , x n 1 ) + ( x 1 , , x n 2 ) 2 which is not polymatroidal because the exchange property does not hold for u = x n x n 1 and v = x n 2 2 since x n 1 x n 2 I . If d 3 , then the above ideals are not polymatroidal. In the first case the exchange property does not hold for u = x n + 1 d d I 2 and v = ( x n + 2 d x n ) x n x n I 1 , otherwise x j x n + 1 d d 1 I for some n + 2 d j n , which is not the case.
Case 3. Let I 2 be a squarefree Veronese in m variables, m n 1 . Then Lemma 1 implies pd S / I 2 = m + 1 d with d m . Hence pd S / I 1 = m + 2 d .
In such a case the ideal I 1 cannot be principal because pd S / I 1 = m + 2 d > 1 .
Assume that I 1 is a Veronese ideal in variables. Then = n or = n 1 . Lemma 1 implies that = pd S / I 1 = m + 2 d . Hence either d = m n + 2 or d = m n + 3 . Since m n 1 , either d 1 or d 2 . Only the case d = 2 is possible. If d = 2 , then = m = n 1 and we have I = x n ( x 1 , , x n 1 ) + ( x 1 , , x n 1 ) 2 . This ideal is not Cohen-Macaulay, otherwise it would be height-unmixed. Indeed ( I : x n ) = ( x 1 , , x n 1 ) and ( I : x n 1 ) = ( x 1 , , x n ) are two associated primes of I having different height.
Finally, assume that I 1 is a squarefree Veronese ideal in variables.Then = n or = n 1 . Lemma 1 implies that pd S / I 1 = + 1 ( d 1 ) = + 2 d = m + 2 d . Thus = m and so either = m = n or = m = n 1 . The first case is impossible because m n 1 . In the second case, we have I = x n I n 1 , d 1 + I n 1 , d = I n , d which is a Cohen-Macaulay squarefree Veronese ideal. □

4.3. Bi-Cohen-Macaulay Graphs

Let I S be a squarefree monomial ideal. Then I may be seen as the Stanley-Reisner ideal of a unique simplicial complex on the vertex set { 1 , , n } . Attached to I is the Alexander dual I , which is again a squarefree monomial ideal. We say that I is bi-Cohen-Macaulay if both I and I are Cohen-Macaulay. By the Eagon-Reiner criterion [17, Theorem 8.1.9] I has a linear resolution if and only if I is Cohen-Macaulay. Hence, I is bi-Cohen-Macaulay if and only if it is Cohen-Macaulay with linear resolution.
Let G be a finite simple graph on the vertex set V ( G ) = { 1 , , n } with edge set E ( G ) . The edge ideal I ( G ) of G is the squarefree monomial ideal of S generated by the monomials x i x j with { i , j } E ( G ) [23]. The Alexander dual of I ( G ) is the squarefree monomial ideal of S generated by the squarefree monomial x i 1 x i t such that { i 1 , , i t } is a minimal vertex cover of G[23]. Such an ideal is denoted by J ( G ) and, since its definition, it is often called the cover ideal of G.
We say that G is a bi-Cohen-Macaulay graph if I ( G ) is bi-Cohen-Macaulay.
The edge ideals with linear resolution have been classified by Fröberg [13]. A graph G is complete if every { i , j } with i , j V ( G ) , i j , is an edge of G. The open neighbourhood of i V ( G ) is the set
N G ( i ) = { j V ( G ) : { i , j } E ( G ) } .
A graph G is called chordal if it has no induced cycles of length bigger than three. A perfect elimination order of G is an ordering v 1 , , v n of its vertex set V ( G ) such that N G i ( v i ) induces a complete subgraph on G i , where G i is the induced subgraph of G on the vertex set { i , i + 1 , , n } . Hereafter, if 1 , 2 , , n is a perfect elimination order of G, we highlight it by x 1 > x 2 > > x n .
Theorem 2. (Dirac, [7]).A finite simple graph G is chordal if and only if G admits a perfect elimination order.
The complementary graph  G c of G is the graph with vertex set V ( G c ) = V ( G ) and where { i , j } is an edge of G c if and only if { i , j } E ( G ) . A graph G is called cochordal if and only if G c is chordal.
Theorem 3. (Fröberg, [13]).Let G be a finite simple graph. Then, I ( G ) has a linear resolution if and only if G is cochordal.
We quote the next fundamental result which was proved by Moradi and Khosh-Ahang [21, Theorem 3.6, Corollary 3.8].
Proposition 2.
Let G be a finite simple graph. Then I ( G ) has linear resolution if and only if I ( G ) is vertex splittable. Furthermore, if x 1 > > x n is a perfect elimination order of G c , then
I ( G ) = x 1 ( x j : j N G ( 1 ) ) + I ( G { 1 } )
is a vertex splitting of I ( G ) .
Combining the above result with Theorem 1 we obtain the next characterization of the bi-Cohen-Macaulay graphs.
Theorem 4.
For a finite simple graph G, the following conditions are equivalent.
(a)
G is a bi-Cohen-Macaulay graph.
(b)
G c is a chordal graph with perfect elimination order x 1 > > x n and
| N G ( i ) { i , , n } | = | N G ( j ) { j , , n } | + ( j i ) ,
for all 1 i j n such that | N G ( i ) { i , , n } | , | N G ( j ) { j , , n } | > 0 .
In particular, if any of the equivalent conditions hold, then
pd S / I ( G ) = | N G ( i ) { i , , n } | + ( i 1 ) ,
for any 1 i n such that | N G ( i ) { i , , n } | > 0 .
Proof. 
We proceed by induction on n = | V ( G ) | . By Theorem 3, G must be cochordal. Fix x 1 > > x n a perfect elimination order of G c . By Proposition 2, I ( G ) = x 1 ( x j : j N G ( 1 ) ) + I ( G { 1 } ) is a vertex splitting. Applying Theorem 1, I ( G ) is Cohen-Macaulay if and only if J = ( x j : j N G ( 1 ) ) and I ( G { 1 } ) are Cohen-Macaulay and pd S / I ( G ) = pd S / J = pd S / I ( G { 1 } ) + 1 . J is Cohen-Macaulay because it is an ideal generated by variables and pd S / J = | N G ( 1 ) | . Notice that x 2 > > x n is a perfect elimination order of ( G { 1 } ) c .
If I ( G { 1 } ) = 0 , then pd S / I ( G ) = pd S / J = pd S / I ( G { 1 } ) + 1 = 1 and I ( G ) is principal, say I ( G ) = ( x 1 x 2 ) . In this case the thesis holds.
Suppose now I ( G { 1 } ) 0 . Then, by induction on n, I ( G { 1 } ) is Cohen-Macaulay if and only if
| N G { 1 } ( i ) { i , , n } | = | N G { 1 } ( j ) { j , , n } | + ( j i ) ,
for all 2 i j n such that | N G { 1 } ( i ) { i , , n } | , | N G { 1 } ( j ) { j , , n } | > 0 and moreover
pd S / I ( G { 1 } ) = | N G { 1 } ( i ) { i , , n } | + ( i 2 ) ,
for any 2 i n such that | N G { 1 } ( i ) { i , , n } | > 0 .
Notice that N G ( i ) { i , , n } = N G { 1 } ( i ) { i , , n } for all 2 i n . Thus, combining (4) and (5) with the equality pd S / I ( G ) = pd S / J = pd S / I ( G { 1 } ) + 1 , we see that I ( G ) is Cohen-Macaulay if and only if
| N G ( 1 ) | = | N G ( 1 ) { 1 , , n } | = | N G { 1 } ( i ) { i , , n } | + ( i 2 ) + 1 = | N G ( i ) { i , , n } | + ( i 1 ) ,
for all 2 i n such that | N G { 1 } ( i ) { i , , n } | > 0 .
Thus, we deduce that | N G ( i ) { i , , n } | = | N G ( j ) { j , , n } | + ( j i ) for all 1 i j n such that | N G ( i ) { i , , n } | , | N G ( j ) { j , , n } | > 0 , as desired. The inductive proof is complete. □
Notice that in the above characterization, the field K plays no role. In other words, the bi-Cohen-Macaulay property of edge ideals does not depend on the field K. This also follows from the work of Herzog and Rahimi [19, Corollary 1.2 (d)] where other classifications of the bi-Cohen-Macaulay graphs are given.
Example 1.
Consider the graph G on five vertices and its complementary graph G c depicted below in Figure 1.
Notice that x 1 > x 2 > x 3 > x 4 > x 5 is a perfect elimination order of G c , so that G c is chordal (Theorem 2). We have | N G ( i ) { i , , 5 } | > 0 only for i = 1 , 2 , 3 . It is easy to see that condition (b) of Theorem 4 is verified. Hence G is bi-Cohen-Macaulay, as one can also verify by using Macaulay2 [14].
Example 2.
Consider the graph H and its complementary graph H c depicted below in Figure 2.
As before x 1 > x 2 > x 3 > x 4 > x 5 is a perfect elimination order of H c , and H c is chordal. We have | N H ( i ) { i , , 5 } | > 0 only for i = 1 , 2 , 3 . However condition (b) of Theorem 4 is not verified. Indeed,
| N H ( 1 ) { 1 , , 5 } | = | N H ( 2 ) { 2 , , 5 } | = | { 4 , 5 } | = 2 ,
but | N H ( 1 ) { 1 , , 5 } | | N H ( 2 ) { 2 , , 5 } | + 1 . Hence H is not bi-Cohen-Macaulay. We can also verify this by using Macaulay2 [14]. Indeed J ( H ) , the cover ideal of H, is not Cohen-Macaulay.

Author Contributions

The authors have made the same contribution. All authors read and approved the final manuscript.

Funding

This research received no external funding.

Data Availability Statement

We confirm that the manuscript has no associated data.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Bandari, S.; Herzog, J. Monomial localizations and polymatroidal ideals. Eur. J. Combin. 2013, 34, 752–763. [Google Scholar] [CrossRef]
  2. Bruns, W; Herzog, J. Cohen–Macaulay rings, Cambridge University Press, 1998.
  3. Crupi, M.; Ficarra, A. Minimal resolutions of vector-spread Borel ideals. Analele Stiintifice ale Universitatii Ovidius Constanta, Seria Matematicat 2023, 31(2), 71–84.
  4. Crupi, M.; Ficarra, A. Very well–covered graphs by Betti splittings. J. Algebra 2023, 629, 76–108. [Google Scholar] [CrossRef]
  5. Crupi, M.; Ficarra, A. Very well-covered graphs via the Rees algebra. ArXiv 2023, arXiv:2305.01448v3. submitted. [Google Scholar]
  6. Deshpande, P.; Roy, A.; Singh, A.; Van Tuyl, A. Fröberg’s Theorem, vertex splittability and higher independence complexes. ArXiv, 2023; arXiv:2311.02430. [Google Scholar]
  7. Dirac, G. A On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg 1961, 38, 71–76. [Google Scholar] [CrossRef]
  8. Ene, V.; Herzog, J.; Hibi, T.; Saeedi Madani, S. Pseudo-Gorenstein and level Hibi rings. J. Algebra 2015, 431, 138–161. [Google Scholar] [CrossRef]
  9. Ficarra, A. Vector-spread monomial ideals and Eliahou–Kervaire type resolutions. J. Algebra 2023, 615, 170–204. [Google Scholar] [CrossRef]
  10. Ficarra, A. Shellability of componentwise discrete polymatroids. ArXiv, 2023; arxiv.org/abs/2312.13006, submitted. [Google Scholar]
  11. Ficarra, A. Simon’s conjecture and the v-number of monomial ideals. ArXiv, 2023; arXiv.org/abs/2309.09188, submitted. [Google Scholar]
  12. Francisco, C. A.; Ha, H. T.; Van Tuyl, A. Splittings of monomial ideals. Proc. Amer. Math. Soc. 2009, 137(10), 3271–3282. [Google Scholar] [CrossRef]
  13. Fröberg, R. On Stanley-Reisner rings. In Topics in algebra, Part 2 (Warsaw, 1988), Banach Center Publ., 26, Part 2, PWN, Warsaw, 1990, 57–70.
  14. Grayson, D.R.; Stillman, M.E. Macaulay2, a Software System for Research in Algebraic Geometry. Available online: http://www.math.uiuc.edu/Macaulay2 (accessed on 5 February 2024).
  15. Herzog, H.; Hibi, T. Discrete polymatroids. J. Algebraic Combin. 2002, 16, 239–268. [Google Scholar] [CrossRef]
  16. Herzog, H.; Hibi, T. Cohen-Macaulay polymatroidal ideals. European J. Combin. 2006, 27(4), 513–517. [Google Scholar] [CrossRef]
  17. Herzog, H.; Hibi, T. Monomial ideals; Graduate texts in Mathematics 260, Springer, 2011.
  18. Herzog, H.; Hibi, T.; Ohsugi, H. Binomial Ideals, 279; Graduate Texts in Mathematics, Springer, Cham, 2018.
  19. Herzog, J.; Rahimi, A. Bi-Cohen–Macaulay graphs. Electron. J. Combin. 2016, 23(1), #P1.11.
  20. Mafi, A.; Naderi, D.; Saremi, H. Vertex decomposability and weakly polymatroidal ideals. ArXiv, 2022; arxiv.org/abs/2201.06756. [Google Scholar]
  21. Moradi, S.; Khosh-Ahang, F. On vertex decomposable simplicial complexes and their Alexander duals. Math. Scand. 2016, 118(1), 43–56. [Google Scholar] [CrossRef]
  22. Moradi, S. Normal Rees algebras arising from vertex decomposable simplicial complexes. ArXiv, 2023; arxiv.org/abs/2311.15135. [Google Scholar]
  23. Villarreal, R. H. Monomial Algebras; Second Edition, Monographs and Research Notes in Mathematics, CRC Press, Boca Raton, FL, 2015.
Figure 1.  
Figure 1.  
Preprints 98630 g001
Figure 2.  
Figure 2.  
Preprints 98630 g002
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated