Next Article in Journal
Population Feasibility State Guided Autonomous Constrained Multi-Objective Evolutionary Optimization
Previous Article in Journal
Profiling Social Sentiment in Times of Health Emergencies with Information from Social Networks and Official Statistics
Previous Article in Special Issue
Depth and Stanley Depth of the Edge Ideals of r-Fold Bristled Graphs of Some Graphs
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Cohen–Macaulayness of Vertex Splittable Monomial Ideals

by
Marilena Crupi
*,†,‡ and
Antonino Ficarra
†,‡
Department of Mathematics and Computer Sciences, Physics and Earth Sciences, University of Messina, Viale Ferdinando Stagno d’Alcontres 31, 98166 Messina, Italy
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
These authors are members of GNSAGA of INDAM (Italy).
Submission received: 8 February 2024 / Revised: 12 March 2024 / Accepted: 16 March 2024 / Published: 20 March 2024
(This article belongs to the Special Issue Combinatorics and Computation in Commutative Algebra)

Abstract

:
In this paper, we give a new criterion for the Cohen–Macaulayness of vertex splittable ideals, a family of monomial ideals recently introduced by Moradi and Khosh-Ahang. Our result relies on a Betti splitting of the ideal and provides an inductive way of checking the Cohen–Macaulay property. As a result, we obtain characterizations for Gorenstein, level and pseudo-Gorenstein vertex splittable ideals. Furthermore, we provide new and simpler combinatorial proofs of known Cohen–Macaulay criteria for several families of monomial ideals, such as (vector-spread) strongly stable ideals and (componentwise) polymatroidals. Finally, we characterize the family of bi-Cohen–Macaulay graphs by the novel criterion for the Cohen–Macaulayness of vertex splittable ideals.

1. Introduction

Let S = K [ x 1 , , x n ] be the polynomial ring with coefficients in a field K. In [1], Moradi and Khosh-Ahang introduced the notion of a vertex splittable ideal, an algebraic analog of the vertex decomposability property of a simplicial complex. In more detail, let Δ be a simplicial complex and let F be a face of Δ . One can associate with Δ two special simplicial complexes: the deletion of F, defined as del Δ ( F ) = { G Δ : F G = } , and the link of F, defined as lk Δ ( F ) = { G Δ : F G = , F G Δ } . For F = { x } , one sets del Δ ( { x } ) = del Δ ( x ) and lk Δ ( { x } ) = lk Δ ( x ) . The notion of vertex decomposition was introduced by Provan and Billera [2] for a pure simplicial complex, and afterwards, it was extended to nonpure complexes by Bjo r ̈ ner and Wachs [3]. A vertex decomposable simplicial complex  Δ is recursively defined as follows: Δ is a simplex or Δ has some vertex x such that (1) both del Δ x and lk Δ x are vertex decomposable, and (2) there is no face of lk Δ x which is also a facet of del Δ x . An ideal I of S is called vertex decomposable if I = I Δ , with Δ being a vertex decomposable simplicial complex. We recall that I Δ is the Stanley–Reisner ideal of Δ over K, that is, the ideal of S generated by the squarefree monomial x F = x j F x j , for all F Δ . It is well-known that for a simplicial complex Δ , the following implications hold: vertex decomposableshellablesequentially Cohen–Macaulay (see, for instance, [4]). Moreover, there exist characterizations of shellable, sequentially Cohen–Macaulay and Cohen–Macaulay complexes Δ via the Alexander dual ideals I Δ (see [5] [Theorem 1.4], [6] [Theorem 2.1], [7] [Theorem 3], respectively), where Δ = { X F : F Δ } is the Alexander dual simplicial complex associated with Δ .
Inspired by the above results, in [1], Moradi and Khosh-Ahang asked and solved the following question: Is it possible to characterize a vertex decomposable simplicial complex Δ by means of I Δ ? For this aim, they introduced the notion of the vertex splittable monomial ideal (Definition 1) and proved that a simplicial complex Δ is vertex decomposable if and only if I Δ is a vertex splittable ideal [1] [Theorem 2.3]. Moreover, the authors in [1] proved that a vertex splittable ideal has a Betti splitting (see Definition 2 and Theorem 1).
Determining when a monomial ideal is Cohen–Macaulay is a fundamental and challenging problem in commutative algebra. Motivated by this and the results of [1], in this paper, we tackle the Cohen–Macaulayness of vertex splittable ideals. Our main contribution (Theorem 2) is a new characterization of the Cohen–Macaulayness of a vertex splittable ideal in terms of a Betti splitting. This new criterion provides a neat and effective inductive strategy to determine when a vertex splittable ideal is Cohen–Macaulay.
This article is organized as follows. In Section 2.2, we recall relevant definitions and auxiliary results that we will use later on. In Section 3, we state a new criterion for the Cohen–Macaulayness of vertex splittable ideals (Theorem 2). As a consequence, we obtain characterizations for Gorenstein, level and pseudo-Gorenstein Cohen–Macaulay vertex splittable ideals (Corollary 1). The results in this section will be used in the subsequent section (Section 4), where we recover some interesting Cohen–Macaulay classifications of families of monomial ideals: (vector-spread) strongly stable ideals and (componentwise) polymatroidal ideals. Moreover, a new characterization of bi-Cohen–Macaulay graphs is presented (Theorem 6). Finally, Section 5 contains our conclusions and perspectives.

2. Preliminaries

In this section, we recall the basic notions and notations we will use in the body of the paper [1,8].
Let S = K [ x 1 , , x n ] be a polynomial ring in n variables over a field K with the standard grading, i.e., each deg x i = 1 . For any finitely generated graded S-module M, there exists the unique minimal graded free S-resolution
F : 0 F p d p F p 1 d p 1 d 2 F 1 d 1 F 0 d 0 M 0 ,
with F i = j S ( j ) β i , j . The numbers β i , j = β i , j ( M ) are called the graded Betti numbers of M, while β i ( M ) = j β i , j ( M ) are called the total Betti numbers of M. Recall that the projective dimension and the Castelnuovo–Mumford regularity of M are defined as follows:
pd M = max { i : β i ( M ) 0 } , reg M = max j i : β i , j ( M ) 0 , for some i and j .
More precisely, the projective dimension pd ( M ) is the length of a minimal graded free resolution of the finitely generated graded S-module M.

2.1. Cohen–Macaulay Property

In this subsection, we introduce the notion of the Cohen–Macaulay ring and some related notions.
Firstly, let m = ( x 1 , , x n ) be the unique maximal homogeneous ideal of S, and let M be a finitely generated graded S-module M.
A sequence f = f 1 , ,   f d of homogeneous elements of m is called an M-sequence if the following criteria are met:
(1)
the multiplication map M / ( f 1 , , f i 1 ) M f i M / ( f 1 , , f i ) M is injective for all i.
(2)
M / ( f ) M 0 .
The length of a maximal homogeneous M-sequence is called the depth of M. By the Auslander–Buchsbaum formula (see, for instance, [9]), we have
depth M + pd M = n .
A finitely generated graded S-module M is called a Cohen–Macaulay module (CM module for short) if depth M = dim M , where dim M is the Krull dimension of M [9]. Let I be a graded ideal of S; the graded ring S / I is said to be CM if S / I , viewed as an S-module, is CM. The graded ideal I is called a CM ideal.
Let I S be a graded CM ideal, and let p = pd ( S / I ) be the projective dimension of S / I . The Cohen–Macaulay type (CM type for short) 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 if C M - t y p e ( S / I ) = 1 . We say that I is Gorenstein if S / I is such.
By [10] [Corollary 2.17], the graded Betti number β p , p + reg S / I ( S / I ) is always nonzero. We say that S / I is level if and only if β p ( S / I ) = β p , p + reg S / I ( S / I ) . Following [11], 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.
For more details on this subject, see, for instance, [9,10,12,13].

2.2. Vertex Splittable Monomial Ideals

In this subsection, we discuss the notions of vertex splittable monomial ideals and of Betti splittings.
Let I S be a monomial ideal. We denote by G ( I ) the unique minimal monomial generating set of I. We recall the following notion [1] [Definition 2.1].
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.
Remark 1.
One can observe that while in general, the Cohen–Macaulayness of S / I depends on the field K ([9] (p. 236)), if I is a vertex splittable ideal, then this is not the case. Indeed, the Krull dimension of S / I , where I is a monomial ideal, does not depend on K. Furthermore, by [1] [Theorem 2.4], vertex splittable ideals have linear quotients. Hence, depth S / I is also independent from K.
In [8], the next concept was introduced.
Definition 2.
Let I, J, L be monomial ideals of S such that G ( I ) is the disjoint union of G ( J ) and G ( L ) . We say that I = J + L is a Betti splitting if
β i , j ( I ) = β i , j ( J ) + β i , j ( L ) + β i 1 , j ( J L ) , for all i , j .
When I = J + L is a Betti splitting, important homological invariants of the ideal I are related to the invariants of the smaller ideals J and L. Indeed, in [8] [Corollary 2.2], it is proved that if I = J + L is a Betti splitting, then
pd I = max { pd J , pd L , pd ( J L ) + 1 } .
We quote the next crucial result from [1].
Theorem 1
([1] [Theorem 2.8]). Let I = x I 1 + I 2 be a vertex splitting for the monomial ideal I of S. Then I = x I 1 + I 2 is a Betti splitting.
For recent applications of vertex splittings, see the papers [14,15].
We close this subsection by introducing two families of monomial ideals: the t-spread strongly stable ideals and the (componentwise) polymatroidal ideals. We will show in Section 4 that they are families of vertex splittable ideals (see Propositions 1 and 2).
A very meaningful class of monomial ideals of the polynomial ring S is the class of strongly stable monomial ideals. They are fundamental in commutative algebra, because if K has the characteristic zero, then they appear as generic initial ideals [16]. In [17], the concept of a strongly stable ideal was generalized to that of the 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 [13].
Another fundamental family of monomial ideals of S is that of the so-called polymatroidal ideals.
Let I S be a monomial ideal 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 [13].
Polymatroidal ideals are characterized by the exchange property [13] [Theorem 2.3]. For a monomial u S , let
deg x i ( u ) = max { j : x i j divides u } .
Lemma 1.
Let I S be a monomial ideal generated in a single degree. Then I is polymatroidal if and only if the following exchange property holds: 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 ) .
An arbitrary monomial ideal I is called componentwise polymatroidal if the component I j is polymatroidal for all j. Here, for a graded ideal J S and an integer j, we denote by J j the graded ideal generated by all polynomials of degree j belonging to J.
Polymatroidal ideals are vertex splittable [18] [Lemma 2.1]. In Proposition 2, we prove the analogous case for componentwise polymatroidal ideals.

3. A Cohen–Macaulay Criterion

In this section, we introduce a new criterion for the Cohen–Macaulayness of vertex splittable ideals. As a result, we obtain characterizations for Gorenstein, level and pseudo-Gorenstein vertex splittable ideals.
The main result in the section is the following.
Theorem 2.
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 CM.
(b)
( I : x i ) , ( I , x i ) are CM, 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 (Theorem 1), then Formula (3) together with the Auslander–Buchsbaum Formula (1), 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 CM. By Equations (4) and (5), 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 CM 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 CM 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 (4) and (5) imply that depth S / I = depth S / I 1 = dim S / I 1 = dim S / I and so S / I is CM. □
The next important vanishing theorem due to Grothendieck [9] [Theorem 3.5.7] will be crucial to characterize Gorenstein, level and pseudo-Gorenstein vertex splittable ideals. If ( R , m , k ) is a Noetherian local ring and M a finitely generated R-module, we denote by H m i ( M ) the ith local cohomology module of M with support on m [9].
Theorem 3.
Let ( R , m , k ) be a Noetherian local ring and M a finitely generated R-module of depth t and dimension d. Then
(a) 
H m i ( M ) = 0 for i < t and i > d .
(b) 
H m t ( M ) 0 and H m d ( M ) 0 .
Corollary 1.
Let I S be a vertex splittable CM 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 one of the following occurs: 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 .
(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 CM, Theorem 2 guarantees that S / I 1 , S / I 2 are CM 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 [1] [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 } .
We obtain the following:
(a) The assertion follows immediately from (6).
(b) In the proof of Theorem 2 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 I 1 is Gorenstein, and I 2 = 0 . Using Formula (4) and Theorem 2 (b), we obtain depth S / I = n 1 . Since depth S / I = n pd S / I , we have pd S / I = 1 , equivalent to saying that 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 nonzero, we deduce from Formula (6) that reg S / I 1 + 1 = reg S / I 2 and that S / I 1 , S / I 2 are 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 (6) 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 nonzero, we deduce from Formula (6) 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 CM, Theorem 2 implies that S / ( I : x i ) and S / ( I , x i ) are CM and dim S / ( I : x i ) = dim S / ( I , x i ) = dim S / I . As shown in the proof of Theorem 2, 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 CM S-module. By Theorem 3, 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. □
Remark 2.
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 that 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 2, we recover in a simple and very effective manner Cohen–Macaulay criteria for several 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.
The first two families were introduced in Section 2.2.

4.1. (Vector-Spread) Strongly Stable Ideals

In [19] [Theorem 4.3], we classified the CM t -spread strongly stable ideals. Here, we recover this result using Theorem 2.
Proposition 1.
Let I S be a t -spread strongly stable ideal such that I m 2 . Then
(a)
I is vertex splittable;
(b)
I is CM 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. 
(a) We proceed by double induction on the number of variables n and the highest degree d of a generator u G ( I ) . If n = 1 , then I is a principal ideal whether or not the integer d is, and so it is vertex splittable. Suppose n > 1 . If d = 1 , then I is an ideal generated by a subset of the variables and it is clearly vertex splittable. Suppose d > 1 . We can write I = x 1 I 1 + I 2 , where G ( I 1 ) = { u / x 1 : u G ( I ) , x 1 divides u } and G ( I 2 ) = G ( I ) G ( x 1 I 1 ) . It is immediately clear 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 d, we have that I 1 and I 2 are vertex splittable. Hence, so is I.
(b) 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 2, I 2 is CM 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

In this subsection, we prove that componentwise polymatroidal ideals are also vertex splittable.
A longstanding conjecture of Bandari and Herzog predicted that componentwise polymatroidal ideals have linear quotients [20]. This conjecture was solved recently in [21] [Theorem 3.1]. Inspecting the proof of this theorem, we obtain the following:
Proposition 2.
Componentwise polymatroidal ideals are vertex splittable.
Proof. 
Let I S be a componentwise polymatroidal ideal. We prove the statement by induction on | G ( I ) | . We may assume that all variables x i divide some minimal monomial generator of I. Moreover, it holds 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 (see the proof of [21] [Theorem 3.1]):
(i)
I 2 I 1 as monomial ideals of S.
(ii)
x i I 1 is a componentwise polymatroidal ideal of S.
(iii)
I 2 is a componentwise polymatroidal ideal of K [ x 1 , , x i 1 , x i + 1 , , x n ] .
By induction, it follows that both I 1 and I 2 are vertex splittable. Hence, so is I. □
We have the following corollary.
Corollary 2.
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 CM.
(b)
( I : x i ) , ( I , x i ) are CM componentwise polymatroidal ideals and depth S / ( I : x i ) = depth S / ( I , x i ) .
Moreover, if I S is a polymatroidal ideal generated in degree d 2 and x i is a variable dividing some monomial of G ( I ) , then ( I : x i ) is polymatroidal. And, in addition, if I is CM, then ( I : x i ) is also CM.
Proof. 
It follows by combining the vertex splitting presented in the proof of Proposition with the facts (ii) and (iii) and with Theorem 2. For the last statement, see [22] [Lemma 5.6]. □
At the moment, to classify all CM componentwise polymatroidal ideals seems a hopeless task. For instance, 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 CM.
Example 1.
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 [21] [Example 3.2]. One can easily check that I is a CM componentwise polymatroidal ideal. Indeed, it is not difficult to check that I j is polymatroidal for j = 0 , 1 , 2 , 3 , 4 . For j 5 , the ideal I j = m j 4 I 4 is polymatroidal because it is the product of two polymatroidal ideals [16] [Theorem 12.6.3]. Notice that 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 [23] [Theorem 4.2] showed that I is CM 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 the criterion for Cohen–Macaulayness proved in Theorem 2.
Corollary 3.
A polymatroidal I S is CM if and only if I is one of the following:
(a)
A principal ideal.
(b)
A Veronese ideal.
(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 2.
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 (4) 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 3.
Proof of Corollary 3.
Let I be a polymatroidal ideal. We proceed by induction on | G ( I ) | . If | G ( I ) | = 1 , then I is principal and it is CM. Now, let | G ( I ) | > 1 . If I = m , then I is CM. Thus, we assume that I is generated in degree d 2 , that all variables x i divide some minimal monomial generator of I and that the greatest common divisor of the minimal monomial generators of I is one. By Proposition 2 and Corollary 2, we have a vertex splitting I = x i I 1 + I 2 for each variable x i   I 1 and I 2 are CM 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 .
Since | G ( x n I 1 ) | , | G ( I 2 ) | are strictly less than | G ( I ) | , by induction, 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 2 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 CM and Veronese, or I = x 2 ( x 1 d 1 ) + ( x 1 d ) = x 1 d 1 ( x 1 , x 2 ) , which is not CM.
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 is a CM 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, nor Veronese, nor squarefree Veronese. Thus, by induction, ( I : x 1 ) is not a CM polymatroidal ideal, and by Corollary 2, we deduce that I is also not CM. 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 CM 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 2 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 CM polymatroidal ideal, and by Corollary 2 I is also not a CM polymatroidal ideal. Similarly, in the second case, if u = x 1 x n 1 , then I = I n , n 1 is a CM 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 CM 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 2 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 CM 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 . However, this ideal is not polymatroidal. Otherwise, by the exchange property (Lemma 1) 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 2 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 CM 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 2 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 2 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 CM, 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 heights.
Finally, assume that I 1 is a squarefree Veronese ideal in variables. Then = n or = n 1 . Lemma 2 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 CM 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 (bi-CM for short) if both I and I are CM. By the Eagon–Reiner criterion [16] [Theorem 8.1.9], I has a linear resolution if and only if I is CM. Hence, I is bi-CM if and only if it is CM 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 ) [4]. 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 [4]. 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-CM graph if I ( G ) is bi-CM.
Let G be a graph. The open neighborhood 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 a 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 . For a complete graph G, we mean a graph satisfying the property that every set { i , j } with i , j V ( G ) , i j is an edge of G.
Theorem 4
([24]). A finite simple graph G is chordal if and only if G admits a perfect elimination order.
The edge ideals with linear resolution were classified by Fröberg [25]. Recall that 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 5
([25] [Theorem 1]). 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 [1] [Theorem 3.6, Corollary 3.8].
Proposition 3.
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 2, we obtain the next characterization of the bi-CM graphs.
Theorem 6.
For a finite simple graph G, the following conditions are equivalent.
(a)
G is a bi-CM 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 5, G must be cochordal. Fix x 1 > > x n , which is a perfect elimination order of G c . By Proposition 3, I ( G ) = x 1 ( x j : j N G ( 1 ) ) + I ( G { 1 } ) is a vertex splitting. Applying Theorem 2, I ( G ) is CM if and only if J = ( x j : j N G ( 1 ) ) and I ( G { 1 } ) are CM and pd S / I ( G ) = pd S / J = pd S / I ( G { 1 } ) + 1 . J is CM 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 that I ( G { 1 } ) 0 . Then, by induction on n, I ( G { 1 } ) is CM 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, by combining (7) and (8) with the equality pd S / I ( G ) = pd S / J = pd S / I ( G { 1 } ) + 1 , we see that I ( G ) is CM 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-CM property of edge ideals does not depend on the field K. This also follows from the work of Herzog and Rahimi [26] [Corollary 1.2 (d)], where other classifications of the bi-CM graphs are given.
We end this paper with a couple of examples of a bi-CM and a non-bi-CM graph.
Examples 1.
(a) 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 4). We have | N G ( i ) { i , , 5 } | > 0 only for i = 1 , 2 , 3 . It is easy to see that condition (b) of Theorem 6 is verified. Hence G is bi-CM, as one can also verify by using Macaulay2 [27].
(b) 
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 6 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-CM. We can also verify this by using Macaulay2 [27]. Indeed J ( H ) , the cover ideal of H, is not CM.

5. Conclusions and Perspectives

In view of our main Theorem 2, one can ask for a similar criterion for the sequentially Cohen–Macaulayness of vertex splittable monomial ideals.
Question 1.
Let I S be a vertex splittable ideal, and let I = x i I 1 + I 2 be a vertex splitting of I. Can we characterize the sequentially Cohen–Macaulayness of I in terms of I 1 and I 2 ?
This question could have interesting consequences for the theory of polymatroidal ideals. Indeed, a classification of the sequentially Cohen–Macaulay polymatroidal ideals has long been elusive.
On the computational side, to check if a monomial ideal is vertex splittable is far easier than to check if it admits a Betti splitting. Indeed, it is enough to check recursively Definition 1. It could be useful to write a package in Macaulay2 [27] that checks the vertex splittable property and some related properties.

Author Contributions

All authors have made the same contribution. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Data are contained within the article.

Acknowledgments

We thank the anonymous referees for their careful reading and suggestions that improve the quality of the paper.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Moradi, S.; Khosh-Ahang, F. On vertex decomposable simplicial complexes and their Alexander duals. Math. Scand. 2016, 118, 43–56. [Google Scholar] [CrossRef]
  2. Provan, J.S.; Billera, L.J. Decompositions of simplicial complexes related to diameters of convex polyhedra. Math. Oper. Res. 1980, 5, 576–594. [Google Scholar] [CrossRef]
  3. Björner, A.; Wachs, L. Wachs, Shellable nonpure complexes and posets, II. Trans. Amer. Math. Soc. 1997, 349, 3945–3975. [Google Scholar] [CrossRef]
  4. Villarreal, R.H. Monomial Algebras, 2nd ed.; Monographs and Research Notes in Mathematics; CRC Press: Boca Raton, FL, USA, 2015. [Google Scholar]
  5. Herzog, H.; Hibi, T.; Zheng, X. Dirac’s theorem on chordal graphs and Alexander duality. Eur. J. Comb. 2004, 25, 949–960. [Google Scholar] [CrossRef]
  6. Herzog, H.; Hibi, T. Componentwise linear ideals. Nagoya Math. J. 1999, 153, 141–153. [Google Scholar] [CrossRef]
  7. Eagon, J.; Reiner, V. Resolutions of Stanley-Reisner rings and Alexander duality. J. Pure Appl. Algebra 1998, 130, 265–275. [Google Scholar] [CrossRef]
  8. Francisco, C.A.; Ha, H.T.; Van Tuyl, A. Splittings of monomial ideals. Proc. Amer. Math. Soc. 2009, 137, 3271–3282. [Google Scholar] [CrossRef]
  9. Bruns, W.; Herzog, J. Cohen–Macaulay Rings; Cambridge University Press: Cambridge, UK, 1998. [Google Scholar]
  10. Herzog, H.; Hibi, T.; Ohsugi, H. Binomial Ideals; Graduate Texts in Mathematics; Springer: Cham, Switzerland, 2018; Volume 279. [Google Scholar]
  11. Ene, V.; Herzog, J.; Hibi, T.; Saeedi Madani, S. Pseudo-Gorenstein and level Hibi rings. J. Algebra 2015, 431, 138–161. [Google Scholar] [CrossRef]
  12. Ene, V.; Herzog, J. Gröbner Bases in Commutative Algebra; Graduate Studies in Mathematics; American Mathematical Society: Providence, RI, USA, 2011; Volume 130. [Google Scholar]
  13. Herzog, H.; Hibi, T. Discrete polymatroids. J. Algebr. Combin. 2002, 16, 239–268. [Google Scholar] [CrossRef]
  14. 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]
  15. Moradi, S. Normal Rees algebras arising from vertex decomposable simplicial complexes. arXiv 2023, arXiv:2311.15135. [Google Scholar]
  16. Herzog, H.; Hibi, T. Monomial Ideals; Graduate Texts in Mathematics; Springer: Berlin/Heidelberg, Germany, 2011; Volume 260. [Google Scholar]
  17. Ficarra, A. Vector-spread monomial ideals and Eliahou–Kervaire type resolutions. J. Algebra 2023, 615, 170–204. [Google Scholar] [CrossRef]
  18. Mafi, A.; Naderi, D.; Saremi, H. Vertex decomposability and weakly polymatroidal ideals. arXiv 2022, arXiv:2201.06756. [Google Scholar]
  19. Crupi, M.; Ficarra, A. Minimal resolutions of vector-spread Borel ideals. Analele Stiintifice Ale Univ. Ovidius Constanta Ser. Mat. 2023, 31, 71–84. [Google Scholar]
  20. Bandari, S.; Herzog, J. Monomial localizations and polymatroidal ideals. Eur. J. Combin. 2013, 34, 752–763. [Google Scholar] [CrossRef]
  21. Ficarra, A. Shellability of componentwise discrete polymatroids. arXiv 2023, arXiv:2312.13006. [Google Scholar]
  22. Ficarra, A. Simon’s conjecture and the v-number of monomial ideals. arXiv 2023, arXiv:2309.09188. [Google Scholar]
  23. Herzog, H.; Hibi, T. Cohen-Macaulay polymatroidal ideals. Eur. J. Combin. 2006, 27, 513–517. [Google Scholar] [CrossRef]
  24. Dirac, G.A. On rigid circuit graphs. In Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg; Springer: Berlin/Heidelberg, Germany, 1961; Volume 38, pp. 71–76. [Google Scholar]
  25. Fröberg, R. On Stanley-Reisner rings. In Topics in Algebra; Part 2 (Warsaw, 1988); Banach Center Publications: Warszawa, Poland, 1990; pp. 57–70. [Google Scholar]
  26. Herzog, J.; Rahimi, A. Bi-Cohen–Macaulay graphs. Electron. J. Combin. 2016, 23, #P1.1. [Google Scholar] [CrossRef] [PubMed]
  27. 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).
Figure 1. A bi-CM graph.
Figure 1. A bi-CM graph.
Mathematics 12 00912 g001
Figure 2. A not bi-CM graph.
Figure 2. A not bi-CM graph.
Mathematics 12 00912 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.

Share and Cite

MDPI and ACS Style

Crupi, M.; Ficarra, A. Cohen–Macaulayness of Vertex Splittable Monomial Ideals. Mathematics 2024, 12, 912. https://0-doi-org.brum.beds.ac.uk/10.3390/math12060912

AMA Style

Crupi M, Ficarra A. Cohen–Macaulayness of Vertex Splittable Monomial Ideals. Mathematics. 2024; 12(6):912. https://0-doi-org.brum.beds.ac.uk/10.3390/math12060912

Chicago/Turabian Style

Crupi, Marilena, and Antonino Ficarra. 2024. "Cohen–Macaulayness of Vertex Splittable Monomial Ideals" Mathematics 12, no. 6: 912. https://0-doi-org.brum.beds.ac.uk/10.3390/math12060912

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop