Powers of Monomial Ideals and Combinatorics
Abstract.
This is an exposition of some new results on associated primes and the depth of different kinds of powers of monomial ideals in order to show a deep connection between commutative algebra and some objects in combinatorics such as simplicial complexes, integral points in polytopes and graphs.
Key words and phrases:
Associated prime, depth, monomial ideal, integral closure, simplicial complex, integer linear programming1991 Mathematics Subject Classification:
13D45, 05C90Introduction
The interaction between commutative algebra and combinatorics has a long history. It goes back at least to Macaulay’s article [37]. Stanley’s solution of the so-called Upper Bound Conjecture for spheres gives a new impulse for the study in this direction. Since then, many books devoted to various topics of this interaction are published, see, e.g., [56, 8, 65, 22, 41]. People even talk about the birth of a new area of mathematics called “Combinatorial Commutative Algebra”.
This exposition is based on my talk at the “Third International Congress in Algebras and Combinatorics (ICAC 2017)” held Hong Kong. The aim of the workshop is clear from its title: to know better about the interaction between various areas of mathematics, which include associative algebra, commutative algebra and combinatorics. So, the purpose of this paper is to provide some further interaction from current research interest. Two basic notions in commutative algebra are concerned here: the associated primes and the depth of a (graded or local) ring. Associated prime ideals of a ring play a role like prime divisors of a natural number in the Number Theory, while the depth measures how far the ring from being Cohen-Macaulay.
For simplicity, we work with homogeneous ideals in a polynomial ring . On the way to give a counter-example to Conjecture 2.1 in [47], Brodmann [5] proves that becomes stable for . This stable set is denoted by . Since associated primes are closely related to the depth, almost at the same time Brodmann [6] proves that becomes constant for all . This constant is denoted by . It is however not known, when the sequences and become stable, and it is little known about and . Therefore, it is of great interest to bound the least place (resp. ) when the stability of (resp. ) occurs (see Definition 1.6 and Definition 1.2), as well as to determine and . For an arbitrary ideal, these problems are very difficult, because it is not known how to compute all associated primes of a ring and there is no effective way to compute the depth. Only few restricted results were obtained in the general case, see [40, 53] and [44, Theorem 2.2].
Luckily, in the case of monomial ideals (i.e. ideals generated by monomials) one can use combinatorics to compute associated primes as well as the depth. Even it is not a trivial task, it opens up a way to use combinatorics to deal with these problems. This paper is mainly devoted to bounding and for monomial ideals. This topic attracts many researchers during the last decade. From this study some times one can get surprising relationships between seemingly unrelated notions of commutative algebra and combinatorics. For an example, [58, Theorem 1.2] states that the ring is Cohen-Macaulay for some fixed if and only if the simplicial complex is a complete intersection (see Theorem 3.19). Together with stating some main results we also give some hints for their proofs. Techniques from combinatorics used to obtain results presented in this paper are so broad, that in the most cases we cannot go to the details. We only explain in more details how the existence of integer solutions of systems of linear constrains related to bounding and . Besides these two problems, we also list some results on properties of the sequences and , because they are useful in determining and . Similar problems for integral closures of powers as well as symbolic powers are also considered in this paper.
We would like to mention that recently there is an intensive research on the so-called Castelnuovo-Mumford regularity of monomial ideals, which also involves a lot of combinatorics. The interested readers can consult the survey paper [2].
The paper is organized as follows. In Section 1 we recall some basic notions and facts from commutative algebra and formulate two main problems considered in this paper. In particular, the above mentioned Brodmann’s results are stated here. Section 2 is devoted to bounding . This section is divided to three subsections: bounds on and are presented in the first two subsections. These bounds are huge ones. Good bounds on these invariants for some classes of monomial ideals are given in the last subsection. The stability of the depth function is presented in Section 3. The first three subsections are devoted to three kind of powers. The last subsection is concerning with Cohen-Macaulay property of square-free monomials ideals.
1. Preliminaries
Let be either a Noetherian local ring with maximal ideal and , or a standard graded finitely generated -algebra with graded maximal ideal , where is an infinite field (standard grading means such that , for all and is generated by over ). A non-zero divisor is called an -regular element. A sequence of elements of is called -regular sequence if is an -regular element for , and . Then all maximal -regular sequences in have the same length and this length is called the depth of , denoted by . Moreover, in the graded case, one can choose a maximal -regular sequence consisting of homogeneous elements. Rees [49] showes that
One can also define by using local cohomology:
The reader can consult the book [7] for the definition and a detailed algebraic introduction to Grothendieck’s local cohomology theory.
The Krull dimension of and are two basic invariants of . One has . When the equality holds, is called a Cohen-Macaulay ring. “The notion of (local) Cohen-Macaulay ring is a workhorse of Commutative Algebra”, see [8, p. 56]. This explains the importance of depth.
It is in general not easy to determine the exact value of . Therefore, the following simple result of Brodmann [6] is of great interest.
Theorem 1.1.
([6, Theorem 2]) Let be a proper ideal, which is assumed to be graded if is graded. Then
(i) is constant for all .
(ii) Denote the above constant by . Let be the Rees algebra of . Then
where is the analytic spread of .
In fact, Brodmann’s result was formulated for modules. Brodmann’s proof as well as a new proof by Herzog and Hibi (see [21, Theorem 1.1]) are based on the Noetherian property of the Rees algebra . As a corollary of these proofs, one has a similar statement for the so-called integral closures of powers of an ideal. Recall that the integral closure of an arbitrary ideal of is the set of elements in that satisfy an integral relation
where for . This is an ideal of and is denoted by . In the local case, assume in addition that is complete. Then the algebra is a module-finite extension of . So, Brodmann’s result implies that also is constant for all .
Definition 1.2.
For an ideal , set
In the local case, assume in addition that is complete. Set
The proofs of Brodmann and Herzog-Hibi give no information on when the functions and become stable. Therefore, the following problem attracts attention of many researchers:
Problem 1. Give upper bounds on and in terms of other invariants of and .
Until now there is no approach to solve this problem in the general setting as above. The reason is that there is no effective way to compute depth. Therefore all known nontrivial results until now are dealing with monomial ideals in a polynomial ring. These results will be summarized in Section 3. Below we describe one of the main tools to be used.
For the moment, let be a polynomial ring with indeterminate . A monomial ideal of is an ideal generated by monomials , where . In this case one can effectively describe the local cohomology module , where . Let us recall it here.
Since is an -graded algebra, is an -graded module over , i.e. , such that . Each -component can be computed via the reduced simplicial homology.
Recall that a simplicial complex on the finite set is a collection of subsets of such that whenever for some . Notice that we do not impose the condition that for all . An element of is called a face. A simplicial complex is defined by the set of its facets (i.e. maximal faces) - denoted by . In this case we also write . To each monomial ideal we can associate a simplicial complex defined by
Thus is defined upto the radical of . This notation was first introduced for the so-called Stanley-Reisner ideals, which are generated by square-free monomials, see [56, Chapter 2].
For every , we define its co-support to be the set . For a subset of , let be the localization of at . Set
(1.1) |
We set for all , for all , and . Thanks to [17, Lemma 1.1] we may reformulate Takayama’s result as follows.
Theorem 1.3.
([57, Theorem 2.2])
It was shown in [42, Lemma 1.3] that is a subcomplex of . As a consequence, provided . Assume that . Then, by [31, Lemma1.2],
where the link of a face of a simplicial complex is defined by
Using this remark, one can see that in the case of Stanley-Reisner ideals, Takayama’s formula is exactly the famous Hochster’s formula, see [56, Theorem 4.1]. Hochster’s formula plays crucial role in the theory of Stanley-Reisner ideals, where one can find rich interaction between commutative algebra and combinatorics (see, e.g., [8, 56]). We will see in this paper, that Takayama’s theorem is very useful in the study of some invariants of powers of monomial ideals.
Another important notion in commutative algebra is the set of associated primes of a ring. Now we go back to an arbitrary Noetherian ring . Recall that a prime ideal is called an associated prime if is the annihilator for some . The set of associated primes of is written as . One can say that this set has a central position in commutative algebra like prime divisors of a natural number in number theory. However, it is difficult to compute . Therefore the following result by Brodmann is very nice and also finds a lot of application:
Theorem 1.4.
[5] Let be a proper ideal. Then the set is stable for all .
The research of Brodmann was motivated by a Conjecture of Ratliff in [47] which says that for all . Note that already in [40, Page 80], there is an example constructed to show that the sequence is not monotone. For integral closures, extending a result by McAdam and Eakin [40, Props. 7 and 18], Ratliff shows that a stronger result holds
Theorem 1.5.
[48, Theorems 2.4 and 2.7] Let be a proper ideal. Then the sequence of sets is increasing and becomes stable when .
We would like to know when the sequences and become stable. For that, we need
Definition 1.6.
For a proper ideal of a Noetherian ring , set
and
Problem 2. Give upper bounds on and in terms of other invariants of and .
In the general case this problem seems to be very hard, because there is no effective way to compute the sets and . However, the prime divisors of a monomial ideal are easily to be found. Therefore one can solve Problem 2 for monomial ideals. This will be summarized in Section 2.
2. Stability of associated primes
From now on, let , and a proper monomial ideal of . If , then for a positive integer and , we set
Denote the monomial obtained from by setting . Let be the ideal of generated by all monomials such that . Since any associated prime of a monomial ideal is generated by a subset of variables and there is a monomial such that , one can easily show
Remark 2.2.
On one side, Lemma 2.1 allows us to do induction on the number of variables. On the other side, in order to study the stability of the set of associated primes, it reduces to checking if or , respectively.
2.1. Associated primes of integral closures of powers
One can identify a monomial with the integer point . For a subset , the exponent set of is
So a monomial ideal is completely defined by its exponent set . Then, we can geometrically describe by using its Newton polyhedron.
Definition 2.3.
Let be a monomial ideal of . The Newton polyhedron of is , the convex hull of the exponent set of in the space .
The above equalities say that (exponents of) all monomials of form the set of integer points in (while we do not know which points among them do not belong to ), and the Newton polytope of is just a multiple of .
Remark 2.4.
By the definition of and (2.1) it follows that if and only if there is and for all , where form the canonical basis of .
Let denote the minimal monomial generating system of and
the maximal generating degree of . Using convex analysis and lineal algebra, one can show
Lemma 2.5.
([61, Lemma 6], [32, Lemma 2.2]) The Newton polyhedron is the set of solutions of a system of inequalities of the form
(2.2) |
such that each hyperplane with the equation defines a facet of , which contains affinely independent points of and is parallel to vectors of the canonical basis. Furthermore, we can choose for all ; and if we write , then
where is the number of non-zero coordinates of .
Now one can give an effective necessary condition for for some . It follows from Remark 2.4 and Lemma 2.5.
Lemma 2.6.
Lemma 2.7.
Let be a monomial ideal in with . If for some , then for all
Proof.
(Sketch): Let . Since the sequence is increasing by Theorem 1.5, it suffices to show that . As , by Lemma 2.6, there is a supporting hyperplane of , say , of the form such that all coordinates of are positive. By Lemma 2.5, this hyperplane passes through affinely independent points of , say . Denote the barycenter of the simplex by , and let . Then one can show that and for all . Hence the lemma follows from Remark 2.4. ∎
The first bound on is given in [61, Theorem 16]. It is then improved as follows.
Theorem 2.8.
[32, Theorem 2.7] Let be a monomial ideal of . Then
This theorem almost immediately follows from Lemma 2.6 and Remark 2.2 by using induction on (based on Lemma 2.1).
Remark 2.9.
By [4, Theorem 2.3], we can compute in terms of geometry of .
Example 2.10.
Proof.
(Sketch): In this example, by Lemma 2.6, for . On the other hand, the projection of into the hyperplane of the first coordinates form a simplex, say . Using Lemma 2.5 and Remark 2.4, one can show that if for a fix , then the simplex must contain integer points of the form , where are unit vectors of . The simplex is so far from being “regular”, that only its big multiples satisfy this combinatorial property. ∎
Question 3. Assume that is a square-free monomial ideal. Is there a linear upper bound on in term of ?
2.2. Associated primes of powers
In the sequel, by abuse of terminology, for a linear functional
where , we say that is a homogeneous linear constraint, while is a linear constraint. Unlike integer closures, it is much more difficult to describe the set of monomials in by linear constrains. However, we have the following observation:
Assume that the monomials generate the ideal . Then a monomial if and only if there are nonnegative integers , such that and is divisible by
This is equivalent to
for all .
From this observation, if and only is it is a part of an integer solution of a system of linear constrains in variables. Unfortunately this correspondence is not one-to-one, so that we cannot reverse a constrain in order to get a criterion for . Nevertheless this observation is useful in finding an upper bound on in [28].
The next observation is that in this case thanks to Lemma 2.1(i), it is easier to work with than with , because the quotient modules , , can be put together in the so-called associated graded ring of :
Further, if and only if the local cohomology module . This local cohomology can be computed as follows (see [28, Lemma 3.2])
Using the above observation, one can associate the family of ) to a set of integer solutions of linear constrains in variables. If we denote the set of integer solutions of the corresponding system of homogeneous linear constrains by , then is a semigroup, so that is a ring, and is a -module. One can prove that is isomorphic to a quotient of ([28, Lemma 3.4]). Using linear algebra and Caratheodory’s Theorem (see, e.g. [52, Corollary 7.1(i)]) one can show that the maximal generating degree of over is bounded by
where , the number of minimal generators of (see [28, Proposition 3.1]). From that one obtains
Proposition 2.11.
[28, Proposition 3.2] Let be an integer. Then
In order to get the reverse inclusion we use another local cohomology module. Recall that the Rees algebra . Let . The local cohomology module is also a -graded -module. Let
(This number is to be taken as if .) It is related to the so-called Castelnuovo-Mumford regularity of (see, e.g., [53]). Then S. McAdam and P. Eakin show that for all (see [40, pp. 71, 72], and also [53, Proposition 2.4]). Now one can again use (another) system of linear constrains to show
Proposition 2.12.
[28, Proposition 3.3] We have
Theorem 2.13.
[28, Theorem 3.1] We have
Of course, one can bound in terms of and . But then the resulted bound would be a double exponential bound. In spite of Theorem 2.8, we would like to ask:
Question 4. i) Is there an upper bound on of the order ?
ii) Assume that is a square-free monomial ideal. Is there a linear upper bound on in term of ?
No that using Example 1, one can construct an example to show that in the worst case, an upper bound on much be at least of the order (provided that is fixed), see [28, Example 3.1].
Another interesting problem is to find the stable set for . There is not much progress in this direction. However, Bayati, Herzog and Rinaldo can completely solve a kind of reverse problem: In [3] they prove that any set of nonzero monomial prime ideals can be realized as the stable set of associated primes of a monomial ideal.
2.3. Case of edge ideals and square-free monomial ideals
There are some partial classes of monomial ideals where is bounded by a linear function of , that gives a partial affirmative answer to Question 4. The best results are obtained for square-free monomial ideals whose generators are all of degree two. Then one can associate such an ideal to a graph. More precisely, let be a simple undirected graph with the vertex set and the edge set . The ideal
is called edge ideal. Recall that is bipartite if such that and there is no edge connecting two vertices of the same set . In our terminology, one can reformulate [54, Theorem 5.9] as follows.
Theorem 2.14.
The graph is bipartite if and only if .
The following result is a reformulation of [9, Corollary 2.2], which reduces the problem of bounding to the case of connected graphs.
Lemma 2.15.
Assume that are connected components of . Then
Recall that a cycle in a graph is a sequence of different vertices such that for all , where . The number is called the length of . It is an elementary fact in the graph theory that is bipartite if and only if does not contain odd cycles.
Theorem 2.16.
[9, Lemma 3.1, Proposition 4.2] Assume that is non-bipartite connected graph. Let be the smallest odd cycle contained in ().
(i) If is a cycle (of length ), then ,
(ii) If is not a cycle, then .
The proofs of the above results in [9] are quite long, but they are of combinatorial nature and do not require much from the graph theory. Even the above bound is quite good, by using other invariants, one can get a better bound. For an example, in the situation of Theorem 2.16(ii), if has vertices of degree one, then (see [9, Corollary 4.3]).
If we set to be the set of minimal associated primes of , then for all . An element from is called an embedded associated prime. Therefore, in order to study the stability of , it suffices to study embedded associated primes.
In [27], using the Takayama’s Theorem 1.3, Hien, Lam and N. V. Trung show that embedded primes of are characterized by the existence of (vertex) weighted graphs with special matching properties, see [27, Theorem 2.4]. There are (infinite) many weighted graphs with the base graph . Using techniques in the graph theory, they can give necessary or sufficient conditions for an ideal generated by a subset of variables to be an embedded associated primes of in terms of vertex covers of which contain certain types of subgraphs of , see [27, Theorem 2.10, Theorem 3.5]. From that they derive a stronger bound on , see [27, Corollary 3.7] and also [27, Example 3.8]. Moreover, their method gives an algorithm to compute for a fixed integer . This was done for in [27] and for in [26].
In [36], after extending some results in the graph theory, Lam and N. V. Trung are able to characterize the existence of weighted graphs with special matching properties in terms of the so-called generalized ear decompositions of the base graph . Using this notion they give a new upper bound on (see [36, Theorem 4.7]). Moreover, they can give a precise formula for . In order to formulate their results one needs to introduce some rather technical notions on graphs. Therefore we do not go to the details here. We only want to state the following nice main result of [38], that they can derive as an immediate consequence of their results.
Theorem 2.17.
This property does not hold for square-free monomial ideals. Using a counter-example in combinatorics, Kaiser et al. constructed a square-free monomial ideal in 12 variables such that is a proper subset of , see [35, Theorem 11].
For an arbitrary monomial , the sequence is even not necessarily monotone. The first example is given in page 549 of [22]. Recently, there is given a general construction of monomials ideals for which the non-monotonicity of can be arbitrarily long.
Theorem 2.18.
[19, Corollary 6.8] Let be any finite set of positive integers. Then there exists a monomial ideal in a polynomial ring such that if and only if .
The ascending property of Ass, that means , is also referred as the persistence property (with respect to associated ideals). This property is important in finding the stable set .
For arbitrary square-free monomial ideals there are some interesting results given in [14, 15, 18, 24], that relate to combinatorics. In order to say about their study we need to introduce some notions.
The set of bases of a polymatroid of rank based on is a set of integer points satisfying the following conditions:
-
•
for all ,
-
•
(Exchange property) For all for which for some i, there exists such that and .
A monomial ideal is called a polymatroidal ideal, if there exists a set of bases of a polymatroid, such that .
Theorem 2.19.
[24, Proposition 2.4 and Theorem 4.1] Let be a polymatroidal ideal. Then satisfies persistence property and .
A simple hypergraph is a pair of the vertex set and an edge set , where . We assume that has no isolated vertices, each has at least two elements and that for all . When the all have cardinality two, then is a simple graph. The ideal generated by all square-free monomials , is called edge ideal of and denoted by . For a very special class of , Ha and Morey determine the least number such that and for all , see [18, Theorem 4.6].
A vertex cover of is a subset of such that if , then . A vertex cover is minimal if no proper subset is also a vertex cover. Denote the cover ideal of , which is generated by the square-free monomials corresponding to the minimal vertex covers of . Francisco, Ha and Van Tuyl propose a conjecture related to the chromatic number of a graph , and prove the persistence property of provided that the conjecture holds (see [14, Theorem 2.6]). In another paper, they give an explicit description of all associated primes of , for any fixed number , in terms of the coloring properties of hypergraphs arising from , see [15, Corollary 4.5]. From this description they give a lower bound on .
Recall that a -coloring of is any partition of into disjoint sets such that for every , we have for all . The are called the color classes. The chromatic number of , denoted , is the minimal such that has a -coloring.
Proposition 2.20.
[15, Corollary 4.9] .
Inspired by this result they pose the following question:
Question 5 [15, Question 4.10]. For each integer , does there exist a hypergraph such that the stabilization of associated primes occurs at ?
As one can see from the above discussion, all results concerning the existence of a linear bounding on and the persistence property are given for very special squaree-free monomial ideals. Nevertheless, these results establish surprising relationships between some seemingly unrelated notions of commutative algebra and combinatorics and raise many more problems and questions. Thus, they will stimulate intensive investigation in the near future.
3. Stability of Depth
3.1. Depth of powers of integral closures
Due to some reasons, we can completely solve Problem 1 for . First, as an immediate consequence of Theorem 1.3, one can get the following “quasi-decreasing” property of the depth function . We don’t know if this property holds for integral closures of powers of an arbitrary homogeneous ideal.
Lemma 3.1.
[32, Lemma 2.5] For any monomial ideal of , we have
-
(1)
.
-
(2)
where denotes the analytic spread of .
Proof.
(Sketch): For proving the first statement one can set . Then, using Theorem 1.3 and the fact that for any , and , one can quickly show that implies .
Question 6. Is the depth function decreasing?
As we can see from Theorem 1.3, in order to study the local cohomology module, we need to have an effective description of . In the case of integral closures, we do have it. Keeping the notations in Lemma 2.5, we set .
Lemma 3.2.
[32, Lemma 3.1] For any and , we have
The following lemma is the main step in the proof of Theorem 3.5.
Lemma 3.3.
[32, Lemma 3.2] Let and . Assume that for some . If , then
Proof.
Remark 3.4.
From the above sketch of proof we can see that the main technique is to find a number such that contains an integer point for all , or equivalently that the system of linear constrains in (3.1) do have integer solutions. This is related to the research carried out by Ehrhart in [12, 13], where he shows that the number of integer points in the closure is a quasi-polynomial!
Using Lemma 3.3, Theorem 1.3 and induction on , one can prove the following main result of this subsection.
Theorem 3.5.
[32, Theorem 3.3] Let be a monomial ideal of . Then
It seems that this bound is too big. However, Example 2.10 shows that an upper bound on must be at least of the order .
Question 7. Is is bounded by a function of the order ?
3.2. Depth of symbolic powers
The -th symbolic power of an ideal is the ideal
In other words, is the intersection of the primary components of associated to the minimal primes of .
When is algebraically closed and is a radical ideal, Nagata and Zariski showed that consists of polynomials in whose partial derivatives of orders up to vanish on the zero set of . Therefore, symbolic powers of an ideal carry richer geometric structures and more subtle information than ordinary powers!
Unlike the ordinary powers, the behavior of is much more mysterious. If is a monomial ideal, then the symbolic Rees algebra is finitely generated (see [23, Theorem 3.2]). Then Brodmann’s Theorem 1.1 implies that is periodically constant for . Very recently D. H. Nguyen and N. V. Trung are able to construct monomial ideals for which is not constant for , see [46, Theorem 5.4]. Moreover, they can show
Theorem 3.6.
[46, Theorem 5.1] Let be an arbitrary asymptotically periodic positive numerical function. Given a field , there exist a polynomial ring over a purely transcendental extension of and a homogeneous ideal such that for all .
The construction in [46] only gives non monomial ideals. Therefore we would like to ask:
Question 8. Does Theorem 3.6 hold for the class of monomial ideals?
From now until the rest of this subsection, assume that is a square-free monomial ideal. Let . The correspondence is one-to-one, and we also write for . Assume that . Then
where is the prime ideal of generated by variables with , and
In this case, it immediately follows from [30, Theorem 4.7] that is constant for all . Hence, for a Stanley-Reisner ideal , we can introduce the following notation.
Definition 3.7.
Let be a square-free monomial ideal . Set
We can define the symbolic analytic spread of by
Let be the big height of .
Theorem 3.8.
[29, Theorem 2.4] Let be a Stanley-Reisner ideal of . Then:
-
(1)
for all ;
-
(2)
for all .
In particular, .
The idea of the proof of this theorem is similar to that of Theorem 3.5, because in this case we can also effectively compute .
Lemma 3.9.
([42, Lemma 1.3]) For all and , we have
We think that this bound is too big. Therefore, we would like to ask
Question 9. Assume that is a square-free monomial ideal .
(i) Is the depth function decreasing?
(ii) Is there a linear bound on in terms of ?
Note that the “quasi-decreasing property” of can be proved similarly to Lemma 3.1. There are some partial positive answers to this question. As a corollary of [42, Theorems 2.3 and 2.4] (also see [31, Lemma 2.1]), we get
Proposition 3.10.
Assume that . Then is decreasing and .
Let be a simple graph with the vertex set . Then the cover ideal
It is clear that every unmixed squarefree monomial ideal of height two is uniquely correspondent to a cover ideal of a graph and vice verse. Using the so-called polarization technique one can show the non-increasing property of . Note that this property does not hold for the sequence on ordinary powers of (see [35, Theorem 13]). The graph constructed there has 12 vertices and while .
Theorem 3.11.
[29, Theorem 3.2] Let be a simple graph. Then for ,
In order to formulate an effective bound on we recall some terminology from the graph theory. A set is a matching of if any two distinct edges of have no vertex in common. Let be a nonempty matching of . According to [10], we say that is an ordered matching if:
-
(1)
is a set of independent vertices,
-
(2)
implies .
Example 3.12.
In the graph , the subset is a matching, but not an ordered matching, since the first property above would imply and . Then, and the second property above would not hold.
In the graph , by setting , is an ordered matching.
Definition 3.13.
The ordered matching number of is:
Then we have
Theorem 3.14.
The proof of this theorem is based on Takayama’s Theorem 1.3 and Lemma 3.9. Note that this bound is sharp, see [29, Proposition 3.6].
In [25] Herzog and Vladoiu describe some classes of square-free monomial ideals with constant depth function, i.e. their .
3.3. Depth of powers
Unlike the case of integral closures of an arbitrary monomial ideal and symbolic powers of square-free monomial ideals, the behavior of depth function of a monomial ideal is very bad until it reaches the stability. This is first observed by Herzog and Hibi [21]. A more complicated picture is given in [1]. Very recently Ha et al. obtain the following surprising result, which completely solves the problem of the initial behavior of the depth function.
Theorem 3.15.
[19, Theorem 6.7] Let be any convergent non-negative numerical function. Then there exists a monomial ideal in such that for all .
This maybe is a reason why Problem 1 for is much more difficult than for . Example 3.1 in [28] constructed from Example 2.10 shows that the bound (if exists) must be at least of the order . However for the case of edge ideals there is a nice bound established by T. N. Trung [62]. Recall that a leaf in a graph is a vertex of degree one and a leaf edge is an edge incident with a leaf. For an example, in Figure 3, leafs are: the vertex in and the vertex in , and edge leafs are: the edge in and in . A connected graph is called a tree if it contains no cycles. We use the symbols and to denote the number of edges and leaf edges of , respectively.
Theorem 3.16.
[62, Theorem 4.6]. Let be all connected bipartite components and all connected non-bipartite components of . Let be the maximal length of cycles of ( if has no cycle), and let be the maximal length of odd cycles of . Then
The proof is quite long and complicate. First, the author studies connected graphs. From properties of it turns out that for all provided is bipartite (see Theorem 2.14) and for all if is non-bipartite [9, Corollary 3.4]. In the case of connected non-bipartite graphs, the proof intensively uses the construction developed in [9]. When is a connected bipartite graph, thanks to Theorem 2.14, for all . Hence, one can apply Lemma 3.9 to describe . A key point in [62] is to show that for all , see [62, Lemma 3.1 and 3.3]. There the Takayama’s Theorem 1.3 is used only to show that is disconnected, but Lemma 3.9 is very important. Some results in graph theory are also needed. Finally, the following result allows to reduce the problem to connected components of .
Below are some other partial solutions to Problem 1.
-
(1)
[21, Corollary 3.4]. The square-free Veronese ideal of degree in the variables , is the ideal of generated by all square-free monomials in of degree . Let and let be the square-free Veronese ideal of degree in variables. Then
In particular, .
-
(2)
[21, Corollary 3.8]. Let be a finite partially ordered set (called poset for short). A poset ideal of is a subset such that if , and , then . In particular, the empty set as well as itself is a poset ideal of . Write for the finite poset which consists of all poset ideals of , ordered by inclusion.
Let be a finite poset and . Consider the square-free monomial ideal
Then and , where is the so-called rank of .
-
(3)
[24, Theorem 4.1]. Let be a polymatroidal ideal. Then .
-
(4)
Let be a hypergraph. The incident mtrix of has rows and columns such that if and otherwise. A hypergraph is said to be unimodular if every square submatrix of its incident matrix has determinant equal to or . Then [20, Theorem 2.3 and Theorem 3.2] state that is non-decreasing and , provided is an unimodular hypergraph.
3.4. Cohen-Macaulay property of powers
In this case, the depth gets its maximal value, and obtained results look nicest. Recall that a matroid is a simplicial complex with the following property: If and , then there is such that .
Theorem 3.18.
[58, Theorem 1.1] Let be a simplicial complex. Then the following conditions are equivalent:
-
(1)
is Cohen-Macaulay for every ;
-
(2)
is Cohen-Macaulay for some ;
-
(3)
is a matroid.
The equivalence are independently proved by Minh and N.V. Trung [43, Theorem 3.5] and by Varbaro [63, Theorem 2.1]. In the approach of [43], Lemma 3.9 plays an important role. It allows them to use tool from linear programming to show that the Cohen-Macaulayness of all symbolic powers characterizes matroid complexes.
We say that is a complete intersection if is a complete intersection. This is equivalent to the property that no two minimal non-faces of share a comon vertex. Since is Cohen-Macaulay if and only if and is Cohen-Macaulay, using Theorem 3.18, Terai and N. V. Trung can prove
Theorem 3.19.
[58, Theorem 1.2]) Let be a simplicial complex. Then the following conditions are equivalent:
-
(1)
is Cohen-Macaulay for every ;
-
(2)
is Cohen-Macaulay for some ;
-
(3)
is a complete intersection.
The idea for the proof of in both theorems above comes from the fact that matroid and complete intersection complexes can be characterized by properties of their links. The main technical result of [58] shows that a complex with is a matroid if and only if it is connected and locally a matroid. A similar result on complete intersection are proved in [60, Theorem 1.5].
It is worth to mention that the Cohen-Macaulay property of the second (ordinary or symbolic) power of a Stanley-Resiner ideal is completely different and is still not completely understood, see [34, 33, 51, 59, 60].
Theorem 3.20.
[32, Theorem 4.1] Let be a monomial ideal of . The following conditions are equivalent
-
(1)
is a Cohen-Macaulay ring for all ,
-
(2)
is a Cohen-Macaulay ring for some ,
-
(3)
is an equimultiple ideal of .
Following the idea of the proof of Theorem 3.19 we also get a similar result for the integral closures.
Theorem 3.21.
[32, Theorem 4.7] Let be a simplicial complex. Then the following conditions are equivalent:
-
(1)
is Cohen-Macaulay for every ;
-
(2)
is Cohen-Macaulay for some ;
-
(3)
is a complete intersection;
-
(4)
is an equimultipe ideal.
The property that the Cohen-Macaulayness of for some forces that for all is very specific for square-free monomial ideals. For an arbitrary monomial ideal, the picture is much more complicate, as shown by the following example.
Example 3.22.
[32, Example 1] Let and . Then
-
(1)
is Cohen-Macaulay for each ;
-
(2)
is not Cohen-Macaulay for any .
Note that and in this case.
Acknowledgment
This work is partially supported by the Project
VAST.HTQT.NHAT.01/16-18. I would like to thank Prof. K. P. Shum for inviting me to be a keynote speaker at the Third International Congress in Algebras and Combinatorics (ICAC 2017), Hong Kong, where I had chance to give this lecture to a broad audience.
References
- [1] S. Bandari, J. Herzog and T.Hibi, Monomial ideals whose depth function has any given number of strict local maxima. Ark. Mat. 52 (2014), 11-19.
- [2] A. Banerjee, S. Beyarslan and H. T. Ha, Regularity of Edge Ideals and Their Powers, arXiv:1712.00887.
- [3] S. Bayati, J. Herzog, and G. Rinaldo, On the stable set of associated prime ideals of a monomial ideal. Arch. Math. (Basel) 98 (2012), 213-217.
- [4] C. Bivia-Ausina, The analytic spread of monomial ideals. Comm. Algebra, 31 (2003), 3487-3496.
- [5] M. Brodmann, Asymptotic stability of . Proc. Amer. Math. Soc. 74 (1979), no. 1, 16-18.
- [6] M. P. Brodmann, The Asymptotic Nature of the Analytic Spread. Math. Proc. Cambridge Philos Soc. 86 (1979), 35-39.
- [7] M. P. Brodmann and R. Y. Sharp, Local cohomology. An algebraic introduction with geometric applications. Second edition. Cambridge Studies in Advanced Mathematics, 136. Cambridge University Press, Cambridge, 2013.
- [8] W. Bruns and J. Herzog, Cohen-Macaulay rings. Cambridge Studies in Advanced Mathematics, 39. Cambridge University Press, Cambridge, 1993.
- [9] J. Chen, S. Morey, A. Sung, The stable set of associated primes of the ideal of a graph. Rocky Mountain J. Math. 32(2002), no. 1, 71-89.
- [10] A. Constantinescu and M. Varbaro, Koszulness, Krull dimension, and other properties of graph-related algebras. J. Algebr. Comb. 34 (2011), 375-400.
- [11] D. Eisenbud and C. Huneke, Cohen-Macaulay Rees Algebras and their Specializations. J. Algebra 81 (1983) 202-224.
- [12] Ehrhart, E. Sur un problème de géométrie diophantienne linéaire. I. Polyèdres et réseaux. (French) J. Reine Angew. Math. 226 (1967), 1-29.
- [13] Ehrhart, E. Sur un problème de géométrie diophantienne linéaire. II. Systémes diophantiens linéaires. (French) J. Reine Angew. Math. 227 (1967), 25-49.
- [14] C. A. Francisco, H. T. Ha and A. Van Tuyl, A conjecture on critical graphs and connections to the persistence of associated primes. Discrete Math. 310 (2010), 2176-2182.
- [15] C. A. Francisco, H. T. Ha and A. Van Tuyl, Colorings of hypergraphs, perfect graphs, and associated primes of powers of monomial ideals. J. Algebra 331 (2011), 224-242.
- [16] L. Fouli, and S. Morey, A lower bound for depths of powers of edge ideals. J. Algebraic Combin. 42 (2015), 829-848.
- [17] D. H. Giang and L. T. Hoa, On local cohomology of a tetrahedral curve. Acta Math. Vietnam., 35 (2010), 229-241.
- [18] H. T. Ha and S. Morey Embedded associated primes of powers of square-free monomial ideals. J. Pure Appl. Algebra 214 (2010), 301-308.
- [19] H. T. Ha, D. H. Nguyen, N. V. Trung and T. N. Trung, Symbolic powers of sums of ideals. Preprint ArXiv:1702.01766.
- [20] N. T. Hang and T. N. Trung, The behavior of depth functions of cover ideals of unimodular hypergraphs. Ark. Mat. 55 (2017), 89-104.
- [21] J. Herzog and T. Hibi, The Depth of Powers of an Ideal. J. Algebra 291 (2005), 534-550.
- [22] J. Herzog and T. Hibi, Monomial ideals. Graduate Texts in Mathematics, 260. Springer-Verlag London, Ltd., London, 2011.
- [23] J. Herzog, T. Hibi and N. V. Trung, Symbolic powers of monomial ideals and vertex cover algebra. Adv. Math. 210 (2007), 304-322.
- [24] J. Herzog and A. A. Qureshi, Persistence and stability properties of powers of ideals. J. Pure Appl. Algebra 219 (2015), 530-542.
- [25] J. Herzog and M. Vladoiu Squarefree monomial ideals with constant depth function. J. Pure and Appl. Algebra, 217 (2013), 1764-1772.
- [26] H. T. T. Hien and H. M. Lam, Combinatorial characterizations of the saturation and the associated primes of the fourth power of edge ideals. Acta Math. Vietnam. 40 (2015), 511-526.
- [27] H. T. T. Hien, H. M. Lam and N. V. Trung, Saturation and associated primes of powers of edge ideals. J. Algebra 439 (2015), 225-244.
- [28] L. T. Hoa, Stability of associated primes of monomial ideals. Vietnam. J. Math. 34 (2006), 473-487.
- [29] L. T. Hoa, K. Kimura, N. Terai and T. N. Trung, Stability of depths of symbolic powers of Stanley-Reisner ideals. J. Algebra 473 (2017), 307-323.
- [30] L. T. Hoa and T. N. Trung, Partial Castelnuovo-Mumford regularities of sums and intersections of powers of monomial ideals. Math. Proc. Cambridge Philos Soc. 149 (2010), 1-18.
- [31] L. T. Hoa and T. N. Trung, Castelnuovo-Mumford regularity of symbolic powers of two-dimensional square-free monomial ideals. J. Commut. Algebra 8 (2016), 77- 88.
- [32] L. T. Hoa and T. N. Trung, Stability of Depth and Cohen-Macaulayness of Integral Closures of Powers of Monomial Ideals. Acta Math. Vietnam. 43 (2018), 67-81.
- [33] D. T. Hoang, N. C. Minh and T. N. Trung Combinatorial characterizations of the Cohen-Macaulayness of the second power of edge ideals. J. Combin. Theory Ser. A 120 (2013), 1073-1086.
- [34] D. T. Hoang and T. N. Trung, A͡ characterization of triangle-free Gorenstein graphs and Cohen-Macaulayness of second powers of edge ideals. J. Algebraic Combin. 43 (2016), 325-338.
- [35] T. Kaiser, M. Stehlik and R. Skrekovski, Replication in critical graphs and the persistence of monomial ideals. J. Combin. Theory Ser. A 123 (2014), 239-251.
- [36] H. M. Lam and N. V. Trung, Associated primes of powers of edge ideals and ear decompositions of graphs. arXiv:1506.01483.
- [37] F. S. Macaulay, Some properties of enumeration in the theory of modular systems. Proc. London Math. Soc. 26 (1927), 531-555.
- [38] J. Martinez-Bernal, S. Morey and R. H. Villarreal, Associated primes of powers of edge ideals. Collect. Math. 63 (2012), 361-374.
- [39] S. McAdam, Asymptotic prime divisors. Lecture Notes in Mathematics, 1023. Springer-Verlag, Berlin, 1983.
- [40] S. McAdam and P. Eakin, The asymptotic Ass. J. Algebra 61 (1979), 71-81.
- [41] E. Miller and B. Sturmfels, Combinatorial commutative algebra. Graduate Texts in Mathematics, 227. Springer-Verlag, 2005.
- [42] N. C. Minh and N. V. Trung, Cohen-Macaulayness of powers of two-dimensional square-free monomial ideals. J. Algebra 322 (2009), 4219-4227.
- [43] N. C. Minh and N. V. Trung, Cohen-Macaulayness of monomial ideals and symbolic powers of Stanley-Reisner ideals. Adv. Math. 226 (2011), 1285-1306.
- [44] S. Morey, Stability of associated primes and equality of ordinary and symbolic powers of ideals. Comm. Algebra 27(1999), 3221-3231.
- [45] S. Morey, Depths of powers of the edge ideal of a tree. Comm. Algebra 38 (2010), 4042-4055.
- [46] D. H. Nguyen and N. V. Trung, Depth function of symbolic powers of homogeneous ideals, Preprint 2018.
- [47] L. J. Ratliff, Jr., On prime divisors of In, n large. Michigan Math. J. 23 (1976), 337-352.
- [48] L. J. Ratliff, Jr., On asymptotic prime divisors. Pacific J. Math. 111 (1984), 395-413.
- [49] D. Rees, The grade of an ideal or module. Proc. Cambridge Philos. Soc. 53 (1957), 28-42.
- [50] L. Reid, L. G. Roberts and M. A. Vitulli, Some results on normal homogeneous ideals. Comm. Algebra 31 (2003), 4485-4506.
- [51] G. Rinaldo, N. Terai, and K.-I. Yoshida, On the second powers of Stanley-Reisner ideals. J. Commut. Algebra 3 (2011), 405-430.
- [52] A. Schrijver, Theory of linear and integer programming. John Wiley Sons, 1998.
- [53] R. Y. Sharp, Convergence of sequences of sets of associated primes, Proc. Amer. Math. Soc. 131(2003), 3009-3017.
- [54] A. Simis, W. V. Vasconcelos, R. H. Villarreal, On the ideal theory of graphs. J. Algebra 167 (1994), 389-416.
- [55] R. Stanley, The upper bound conjecture and Cohen-Macaulay rings. Studies in Appl. Math. 54 (1975), 135-142.
- [56] R. Stanley, Combinatorics and commutative algebra. Second edition. Progress in Mathematics, 41. Birkhäuser, 1996.
- [57] Y. Takayama, Combinatorial characterizations of generalized Cohen-Macaulay monomial ideals. Bull. Math. Soc. Sci. Math. Roumanie (N.S.) 48 (2005), 327-344.
- [58] N. Terai and N. V. Trung, Cohen-Macaulayness of large powers of Stanley-Reisner ideals. Adv. Math. 229 (2012), 711-730.
- [59] N. Terai and N. V.Trung, On the associated primes and the depth of the second power of square-free monomial ideals. J. Pure Appl. Algebra 218 (2014), 1117-1129.
- [60] N. Terai and K. Yoshida, Locally complete intersection Stanley-Reisner ideals. Illinois J. Math. 53 (2009), 413-429.
- [61] T. N. Trung, Stability of associated primes of integral closures of monomial ideals. J. Combin. Ser. A., 116 (2009), 44-54.
- [62] T. N. Trung, Stability of depths of powers of edge ideals. J. Algebra 452 (2016), 157-187.
- [63] M. Varbaro, Symbolic powers and matroids. Proc. Amer. Math. Soc. 139 (2011), 2357-2366.
- [64] W. Vasconcelos, Integral closure: Rees algebras, multiplicities, algorithms. Springer Monographs in Mathematics. Springer, New York, 2005.
- [65] R. H. Villarreal, Monomial algebras. Second edition. Monographs and Research Notes in Mathematics. CRC Press, Boca Raton, FL, 2015. xviii+686 pp.