On the Stanley depth of powers of monomial ideals
S. A. Seyed Fakhari

TL;DR
This paper surveys recent research on the Stanley depth of powers, integral closures, and symbolic powers of monomial ideals, exploring cases where Stanley's conjecture holds or fails.
Contribution
It compiles recent findings on the behavior of Stanley depth for various powers of monomial ideals, highlighting conditions where the conjecture is valid or invalid.
Findings
Stanley's conjecture is disproved in general but may hold for high powers.
Recent results show the Stanley depth of powers can stabilize or follow specific patterns.
The survey summarizes conditions under which Stanley's inequality is true for monomial ideals.
Abstract
Let be a field and be the polynomial ring in variables over . In 1982, R. Stanley associated a combinatorial invariant to any finitely generated -graded -module which is now called Stanley depth. Stanley conjectured that this invariant is an upper bound for the depth of module. Stanley's conjecture has been disproved by Duval et al. \cite{abcj}, and the counterexample is a quotient of squarefree monomial ideals. On the other hand, there are evidences showing that Stanley's inequality can be true for high powers of monomial ideals. In this survey article, we collect the recent results in this direction. More precisely, we investigate the Stanley depth of powers, integral closure of powers and symbolic powers of monomial ideals.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Polynomial and algebraic computation · Algebraic structures and combinatorial models
On the Stanley depth of powers of monomial ideals
S. A. Seyed Fakhari
S. A. Seyed Fakhari, School of Mathematics, Statistics and Computer Science, College of Science, University of Tehran, Tehran, Iran, and Institute of Mathematics, Vietnam Academy of Science and Technology, 18 Hoang Quoc Viet, Hanoi, Vietnam.
Abstract.
Let be a field and be the polynomial ring in variables over . In 1982, R. Stanley associated a combinatorial invariant to any finitely generated -graded -module which is now called Stanley depth. Stanley conjectured that this invariant is an upper bound for the depth of module. Stanley’s conjecture has been disproved by Duval et al. [10], and the counterexample is a quotient of squarefree monomial ideals. On the other hand, there are evidences showing that Stanley’s inequality can be true for high powers of monomial ideals. In this survey article, we collect the recent results in this direction. More precisely, we investigate the Stanley depth of powers, integral closure of powers and symbolic powers of monomial ideals.
Key words and phrases:
Complete intersection, Cover ideal, Depth, Edge ideal, Integral closure, Polymatroidal ideal, Stanley depth, Stanley’s inequality, Symbolic power
2000 Mathematics Subject Classification:
13C15, 05E40, 13B22, 13C13, 05E99
This research is partially funded by the Simons Foundation Grant Targeted for Institute of Mathematics, Vietnam Academy of Science and Technology.
1. Introduction
Let be a field and let be the polynomial ring in variables over . Let be a finitely generated -graded -module. Also, let be a homogeneous element and . The -subspace generated by all elements , with a monomial in , is called a Stanley space of dimension , if it is a free -module. Here, as usual, denotes the number of elements of . A decomposition of as a finite direct sum of Stanley spaces is called a Stanley decomposition of . The minimum dimension of a Stanley space in is called the Stanley depth of and is denoted by . The quantity
[TABLE]
is called the Stanley depth of . As a convention, we set , when is the zero module. For a reader friendly introduction to Stanley depth, we refer to [26].
Example 1.1**.**
Consider the ideal in the polynomial ring . Then
[TABLE]
is a Stanley decomposition for , with . One can also write other Stanley decompositions for . For example,
[TABLE]
and
[TABLE]
It is clear that . It follows from the definition of Stanley depth that and it can be easily verified that indeed the equality holds, i.e., .
We say that a -graded -module satisfies Stanley’s inequality if
[TABLE]
In fact, Stanley [40] conjectured that the above inequality holds for every finitely generated -graded -module. Stanley’s conjecture has been disproved by Duval, Goeckner, Klivans and Martin [10]. In fact they construct a non-partitionable Cohen-Macaulay simplicial complex, and then using a result of Herzog, Soleyman Jahan and Yassemi [16, Corollary 4.5] deduce that the Stanley Reisner ring of this simplicial complex does not satisfy Stanley’s inequality. In particular, the counterexample given in [10] lives in the category of squarefree monomial ideals. Thus, one can still ask whether Stanley’s inequality holds for non-squarefree monomial ideals. Of particular interest is the validity of Stanley’s inequality for high powers of monomial ideals. In this survey article we review the recent developments in this regard. In 2013, Herzog [12] published his nice survey on Stanley depth. In fact we complement his survey by collecting the results obtained since then with focus on powers of monomial ideals.
2. Ordinary powers
In this section, we consider the ordinary powers of monomial ideal. As we explained in introduction, it is natural to ask whether the high powers of monomial ideals satisfy Stanley’s inequality. In fact, this question was posed in [34].
Question 2.1** ([34], Question 1.1).**
Let be a monomial ideal. Is it true that and satisfy Stanley’s inequality for every integer ?
In the following subsections we will see that Question 2.1 has positive answer when belongs to interesting classes of monomial ideals.
2.1. Maximal ideal and complete intersections
Let denote the maximal ideal of . It is clear that for every integer , . Hence, satisfies Stanley’s inequality, for any . Indeed, since is an Artinian ring, we also have , for every integer . On the other hand, and by [12, Corollary 24], we know that the Stanley depth of any monomial ideal is at least one. This implies that satisfies Stanley’s inequality for every integer . However, computing the exact value of Stanley depth of is not easy. In 2010, Biró, Howard, Keller, Trotter and Young [2] proved that . Cimpoeaş [8] determined an upper bound for the Stanley depth of powers of . More precisely, he proved the following results.
Theorem 2.2** ([8], Theorem 2.2).**
For every integer , we have
[TABLE]
In particular, for every integer , we have .
Cimpoeaş [8] also conjectured that the inequality obtained in the above theorem is indeed equality, i.e.,
[TABLE]
for every .
In 2018, Cimpoeaş [9] extended Theorem 2.2 by determining bounds for the Stanley depth of complete intersection monomial ideals.
Theorem 2.3** ([9], Proposition 2.14 and Theorem 2.15).**
Let be a complete intersection monomial ideal which is minimally generated by monomials.
- (i)
For every integer , we have
[TABLE]
In particular, if , then .
- (ii)
For every integer , we have
[TABLE]
As an immediate consequence of Theorem 2.3, we conclude that for any complete intersection monomial ideal and every integer , the modules, and satisfy Stanley’s inequality. In particular, Question 2.1 has positive answer in this case.
2.2. Polymatroidal ideals
We begin this subsection by recalling the definition of polymatroidal ideals.
Definition 2.4**.**
Let be a monomial ideal of which is generated in a single degree and assume that is the set of minimal monomial generators of . The ideal is called polymatroidal if the following exchange condition is satisfied: For monomials and belonging to and for every with , one has with such that .
Weakly polymatroidal ideals are generalization of polymatroidal ideals and they are defined as follows.
Definition 2.5** ([23], Definition 1.1).**
A monomial ideal of is called weakly polymatroidal if for every two monomials and in such that and for some , there exists such that .
It is obvious that any polymatroidal ideal is weakly polymatroidal.
Let be a weakly polymatroidal ideal. In [31, Theorem 2.4], we proved that satisfies Stanley’s inequality. We also know from [13, Theorem 12.6.3] that every power of a polymatroidal ideal is again a polymatroidal ideal. As a consequence, for any polymatroidal ideal and any integer , the module satisfies Stanley’s inequality. It is natural to ask whether satisfies Stanley’s inequality. Before answering this question, we recall the concept of having linear quotiens, introduced in [17].
Definition 2.6**.**
Let be a monomial ideal and assume that is the set of minimal monomial generators of . We say that has linear quotients if there is a linear order on , with the property that for every , the ideal is generated by a subset of the variables.
Soleyman Jahan [39] proves that Stanley’s inequality holds for any monomial ideal which has linear quotients. On the other hand, by [23, Theorem 1.3], we know that any weakly polymatroidal ideal has linear quotients. This implies that every weakly polymatroidal ideal satisfies Stanley’s inequality. Since every power of a polymatroidal ideal is again a polymatroidal ideal, we deduce that for any polymatroidal ideal and any integer , the ideal satisfies Stanley’s inequality.
By the above argument, we know that Question 2.1 has positive answer for polymatroidal ideals. This result was also obtained in [28].
Let be a monomial ideal of with Rees algebra . The -algebra is called the fibre ring and its Krull dimension is called the analytic spread of , denoted by . A classical result by Burch [5] states that
[TABLE]
By a theorem of Brodmann [3], is constant for large . We call this constant value the limit depth of , and denote it by . Brodmann improved the Burch’s inequality by showing that
[TABLE]
We know from [15, Corollary 3.5] that equality occurs in the above inequality, if is a polymatroidal ideal. In fact, we will see in the next section that equality holds in Burch’s inequality for a larger class of ideals, namely, the class of normal ideals.
Inspired by the limit behavior of depth of powers of ideals, Herzog [12] proposed the following conjecture.
Conjecture 2.7** ([12], Conjecture 59).**
For every monomial ideal , the sequence is convergent.
This conjecture is widely open. However, by Theorem 2.3, it has positive answer for complete intersections. Also, we will see in Section 4 that the assertion of this conjecture is true for any normally torsionfree squarefree monomial ideal.
Let be a weakly polymatroidal ideal which is generated in a single degree. We know from [28, Theorem 2.5] that . Since and satisfy Stanley’s inequality, it follows that
[TABLE]
Restricting to the class of polymatroidal ideals, for any integer and any polymatroidal ideal , we have
[TABLE]
Indeed, we expect that the equality holds in the above inequality for every . In other words, not only we believe that Conjecture 2.7 is true for every polymatroidal ideal , but we also have a prediction for the limit value of the Stanley depth of powers of .
Conjecture 2.8**.**
Let be a polymatroidal ideal. Then
[TABLE]
for any integer .
2.3. Edge ideals
There is a natural correspondence between quadratic squarefree monomial ideals of and finite simple graphs with vertices. To every simple graph with vertex set V(G)=\big{\{}x_{1},\ldots,x_{n}\big{\}} and edge set , we associate its edge ideal defined by
[TABLE]
Stanley depth of powers of edge ideals has been studied in [1], [11], [27] and [33]. Before reviewing the main results of these papers, we mention the following result of Trung, concerning the depth of high powers of edge ideals.
Theorem 2.9** ([41], Theorems 4.4 and 4.6).**
Let be a graph with vertices and bipartite connected components. Then for every integer , we have
[TABLE]
Note that by [43, Page 50], for every graph with vertices and bipartite connected components, we have . Thus, Theorem 2.9, essentially say that
[TABLE]
i.e., equality occurs in Burch’s inequality.
Pournaki, Yassemi and the author [27] studied the Stanley depth of , where is a forest (i.e., a graph with no cycle). They proved that for every forest with connected components and any integer , we have
[TABLE]
This together with Theorem 2.9 implies that for any forest with vertices, the module satisfies Stanley’s inequality for any integer . This result was then extended in [33], to any arbitrary graph, as follows.
Theorem 2.10** ([33], Theorem 2.3 and Corollary 2.5).**
Let be a graph with vertices and bipartite connected components. Then for every integer , we have . In particular, satisfies Stanley’s inequality for any integer .
We know from the above theorem that for any graph , the module satisfies Stanley’s inequality for . But how about ? By Theorem 2.9, in order to prove Stanley’s inequality for high powers of , we need to prove , for every integer . We do know whether this inequality holds for any arbitrary graph. However, we have a partial result, as follows. We recall that for any graph and every subset , the graph has vertex set and edge set .
Theorem 2.11** ([33], Theorem 3.1).**
Let be a graph and assume that is a connected component of with at least one edge. Suppose that is the number of bipartite connected components of . Then for every integer , we have
[TABLE]
where .
Assume that has a non-bipartite connected component and call it . Then by [12, Corollary 24], for every integer , we have . Thus, it follows from Theorem 2.11 that in this case, , where is the number of bipartite connected components of and is an arbitrary positive integer. Assume now that is a bipartite graph. Using Theorem 2.11, in order to prove the inequality , it is enough to prove it only for the class of connected bipartite graphs. Thus, we raise the following question.
Question 2.12** ([33], Question 3.3).**
Let be a connected bipartite graph (with at least one edge) and suppose is an integer. Is it true that ?
We investigated this question in [37] and proved that it has positive answer for small . More precisely, we proved the following result.
Theorem 2.13** ([37], Theorem 3.4).**
Let be a connected bipartite graph (with at least one edge) and let be a positive integer. Suppose has no cycle of length at most . Then for every positive integer , we have .
Theorem 2.13, in particular implies that , for any integer , provided that is a tree (i.e., a connected forest). Combining this result with Theorem 2.11 implies that if is a bipartite graph and at least one of the connected components of is a tree, then for every integer , we have , where is the number of (bipartite) connected components of . All of all, we obtain the following theorem.
Theorem 2.14** ([33], Corollary 3.6).**
Assume that is a graph with vertices, such that
- (i)
* is a non-bipartite graph, or*
- (ii)
at least one of the connected components of is a tree with at least one edge.
Then for every integer , the ideal satisfies Stanley’s inequality.
Let be a monomial ideal. We know by [14, Theorem 1.2] that the sequence is convergent and moreover,
[TABLE]
Therefore, using Theorem 2.9, we conclude that for any graph ,
[TABLE]
where is the number of bipartite connected components of . In [33], we also studied the Stanley depth of and proved that it satisfies Stanley’s inequality for any . In fact, we proved the following result.
Theorem 2.15** ([33], Theorem 2.2 and Corollary 2.6).**
Let be a graph and suppose is the number of bipartite connected components of . Then for every integer , we have . In particular, satisfies Stanley’s inequality, for every integer .
We mention that in the special case, when is a forest, Theorem 2.15 was proved in [1, Theorem 3.1].
The diameter of a connected graph is the maximum distance between any two vertices. Here, the distance between two vertices is the minimum length of a path connecting the vertices.
Fouli and Morey [11] studied the Stanley depth of small powers of edge ideals and determined a lower bound for it.
Theorem 2.16** ([11], Theorem 4.18).**
Assume that is a graph with connected components and let denote the maximum of the diameters of the connected components of . Then for every integer , we have
[TABLE]
Fouli and Morey [11, Corollary 3.3, Theorems 4.4 and 4.13] also show that the inequality of Theorem 2.16 remains true, if one replaces sdepth with depth.
3. Integral closure of powers
The study of Stanley depth of integral closure of powers of monomial ideals was initiated in [29] and continued in [37]. Before stating the results of theses paper, we recall some definitions and basic facts from the theory of integral closure.
Let be an arbitrary ideal. An element is integral over , if there exists an equation
[TABLE]
The set of elements in which are integral over is the integral closure of . It is known that the integral closure of a monomial ideal is a monomial ideal generated by all monomials for which there exists an integer such that (see [13, Theorem 1.4.2]). The ideal is integrally closed, if , and is normal if all powers of are integrally closed. By [44, Theorem 3.3.18], a monomial ideal is normal if and only if the Rees algebra is a normal ring.
We first notice that there is no general inequality between the Stanley depth of and that of . This will be illustrated in the following examples.
Example 3.1** ([29], Example 1.2).**
Let be a monomial ideal in the polynomial ring . It is not difficult to see that . Then the maximal ideal is an associated prime of and it follows from [18, Proposition 1.3] that . Since is not an associated prime of , it follows from [4, Proposition 2.13] that . Thus, in this example .
Example 3.2** ([29], Example 1.3).**
Let be a monomial ideal in the polynomial ring . The maximal ideal is not an associated prime of and hence, using [4, Proposition 2.13], we conclude that . On the other, we know from [22, Theorem 2.4] that is an associated prime of and therefore, [18, Proposition 1.3] implies that . Thus, in this example .
Although there is no general inequality between and , but we will see in the following theorem that the Stanley depth of provides an upper bound for the Stanley depth of the quotient ring of some powers of .
Theorem 3.3** ([29], Theorem 2.8).**
Let be two monomial ideals in . Then there exists an integer , such that for every
[TABLE]
In particular, we have the following corollary.
Corollary 3.4**.**
Let be a monomial ideal. Then there exist integers , such that for every
[TABLE]
and
[TABLE]
We mention that the assertions of Corollary 3.4 remain true if one replaces sdepth with depth, [37, Theorem 4.5].
In Question 2.1, we asked whether the high powers of an ideal satisfy Stanley’s inequality. One can ask a similar question by replacing with its integral closure. This question is posed in [37].
Question 3.5** ([37], Question 1.2).**
Let be a monomial ideal. Is it true that and satisfy Stanley’s inequality for every integer ?
Before we focus on the above question, we recall the following result of Hoa and Trung concerning the depth of integral closure of high powers of monomial ideals.
Theorem 3.6** ([20], Lemma 1.5).**
Let be a monomial ideal of . Then , for every integer .
According to the above theorem, Question 3.5 is equivalent to the following question.
Question 3.7** ([37], Question 1.3).**
Let be a monomial ideal. Is it true that the inequalities and hold, for every integer ?
Let be a monomial ideal of and assume that (resp. ), for every integer . It follows from Corollary 3.4 that (resp. ), for every integer . Thus, the answers of Questions 3.5 and 3.7 are positive for . This argument together with Theorem 2.3 implies the following result, concerning the Stanley depth of integral closure of powers complete intersection monomial ideals.
Theorem 3.8**.**
Let be a complete intersection monomial ideal which is minimally generated by monomials.
- (i)
For every integer , we have.
- (ii)
For every integer , we have
[TABLE]
Note that in part (ii) of the above theorem, we use the fact that for any complete intersection monomial ideal and any integer , the dimension of is , where is the number of minimal monomial generators of .
Restricting to edge ideals, combining the above argument with Theorems 2.10 and 2.14 implies the following results.
Theorem 3.9** ([37], Theorem 3.2).**
Let be a graph and suppose that is the number of bipartite connected components of . Then for every integer , we have . In particular, satisfies Stanley’s inequality for every integer .
Theorem 3.10** ([37], Theorem 3.3).**
Let be a non-bipartite graph and suppose that is the number of bipartite connected components of . Then for every integer , we have . In particular, satisfies Stanley’s inequality for every integer .
Assume that is a bipartite graph. We know from [13, Theorem 1.4.6 and Corollary 10.3.17] that for any integer , the equality holds. Therefore, satisfies Stanley’s inequality if and only if satisfies that inequality. Because of this reason, we exclude the case of bipartite graphs in Theorem 3.10.
Let be a monomial ideal. It is also reasonable to study the depth and the Stanley depth of . In [37], we proved the following result about the depth of these modules for large .
Theorem 3.11** ([37], Theorem 4.1).**
For any nonzero monomial ideal , the sequence is convergent and moreover,
[TABLE]
According to Theorem 3.11, in order to prove that satisfies Stanley’s inequality, for , we must show that , for high .
Let be a monomial ideal of with , for every integer , say for . We fix an integer . By Corollary 3.4, there exists an integer with such that
[TABLE]
On the other hand, as -vector spaces, we have
[TABLE]
By the definition of Stanley depth we conclude that
[TABLE]
where the last inequality follows from the assumption. Therefore,
[TABLE]
Hence, satisfies Stanley’s inequality, for . In particular cases, it follows from Theorems 2.3 and 2.15 that satisfies Stanley’s inequality, for every integer , if is either a complete intersection monomial ideal or an edge ideal.
Let be a normal ideal. By [13, Proposition 10.3.2],
[TABLE]
Hence, if and satisfy Stanley’s inequality for large , we must have
[TABLE]
In fact, in [29], we conjectured that the above inequalities hold in a more general setting.
Conjecture 3.12** ([29], Conjecture 2.6).**
Let be an integrally closed monomial ideal. Then and .
The following example shows that the inequalities of Conjecture 3.12 do not necessarily hold, if is not integrally closed.
Example 3.13** ([29], Example 2.5).**
Consider the ideal in the polynomial ring . Then . But is an associated prime of and therefore, we conclude from [18, Proposition 1.3] that and by [21, Corollary 1.2], . This shows that the inequalities and do not hold for .
As we mentioned in Section 2, the inequalities of Conjecture 3.12 are true for any polymatroidal ideal (we know from [15, Theorem 3.4] that any polymatroidal ideal is integrally closed). Also, in [30, Corollary 3.4], we verified Conjecture 3.12 for any squarefree monomial ideal which is generated in a single degree.
We close this section by the following result which permits us to compare the Stanley depth of integral closure of a monomial ideal and its powers.
Theorem 3.14** ([29], Theorem 2.8).**
Let be two monomial ideals in . Then for every integer
[TABLE]
The following corollary is an immediate consequence of Theorem 3.14.
Corollary 3.15**.**
Let be a monomial ideal. Then for every integer ,
[TABLE]
and
[TABLE]
We mention that the inequalities of Corollary 3.15 remain true, if one replaces sdepth with depth and this has been proved by Hoa and Trung [20, Lemma 2.5].
4. Symbolic powers
In this section, we collect the recent results concerning the Stanley depth of symbolic powers of squarefree monomial ideals. We first recall the definition of symbolic powers and then we continue in two subsections.
Definition 4.1**.**
Let be an ideal of and let denote the set of minimal primes of . For every integer , the -th symbolic power of , denoted by , is defined to be
[TABLE]
Let be a squarefree monomial ideal in and suppose that has the irredundant primary decomposition
[TABLE]
where each is a prime ideal generated by a subset of the variables of . It follows from [13, Proposition 1.4.4] that for every integer ,
[TABLE]
4.1. Asymptotic behavior of Stanley depth of symbolic powers
Let be a squarefree monomial ideal. As we mentioned in Section 2, based on the limit behavior of depth of powers of , Herzog [12] conjectured that the Stanley depth of is constant for large (see Conjecture 2.7). On the other hand, it is known that if one replaces the ordinary powers by symbolic powers, then again the depth function stabilizes. In fact, Hoa, Kimura, Terai and Trung [19] are even able to compute the limit value of this function. In order to state their result, we need the following definition.
Definition 4.2**.**
Suppose is a squarefree monomial ideal and let be the symbolic Rees ring of . The Krull dimension of is called the symbolic analytic spread of and is denoted by .
Let be a squarefree monomial ideal. Varbaro [42, Proposition 2.4] showed that
[TABLE]
In [19], Hoa, Kimura, Terai and Trung proved that the minimum and the limit of the sequence coincide. Indeed, they showed the following stronger result. In the following theorem, denotes the maximum height of associated primes of .
Theorem 4.3** ([19], Theorem 2.4).**
Let be a squarefree monomial ideal of . Then , for every integer .
As the depth function of symbolic powers of a squarefree monomial ideal is eventually constant, one may ask whether the same is true for the Stanley depth. In other words, whether an analogue of Conjecture 2.7 is true, if one replaces the ordinary power with symbolic power. In [38], we gave a positive answer to this question. In fact, we have something more. First, we will see in the following theorem that one can compare the Stanley depth of certain symbolic powers of a squarefree monomial ideal.
Theorem 4.4** ([38], Theorem 4.2).**
Let be a squarefree monomial ideal. Suppose that and are positive integers. Then for every integer with , we have
[TABLE]
We recall that in the special case of , the inequalities of Theorem 4.4 were also proved in [35, Corollary 3.2]. We also mention that the assertions of Theorem 4.4 are true, if one replaces sdepth with depth and this is proved independently by Nguyen and Trung [25, Theorem 2.7], Montaño and Núñez-Betancourt [24, Theorem 3.4], and the author [38, Theorem 3.3].
As an immediate consequences of Theorem 4.4, we obtain the following result.
Corollary 4.5** ([38], Corollary 4.3).**
For every squarefree monomial ideal , we have
[TABLE]
and
[TABLE]
Assume that is a squarefree monomial ideal and set
[TABLE]
Let be the smallest integer with . If , then by Theorem 4.4, for every integer , we have . Now, suppose . Again by Theorem 4.4, we have . For every integer , we write , where and are positive integers and . As , we conclude that . It then follows from Theorem 4.4 that
[TABLE]
By the choice of , we conclude that for every integer , the equality holds. Therefore, the sequence is convergent and
[TABLE]
Similarly, one proves that the sequence is convergent and
[TABLE]
Therefore, we have the following result.
Theorem 4.6** ([38], Theorem 4.4).**
For every squarefree monomial ideal , the sequences and are convergent. Moreover,
[TABLE]
and
[TABLE]
A squarefree monomial ideal is called normally torsionfree, if , for every integer . It is immediate from Theorem 4.6 that for any normally torsionfree squarefree monomial ideal , the sequences and are convergent. In particular, Conjecture 2.7 is true for normally torsionfree squarefree monomial ideals.
Let be a squarefree monomial ideal. The smallest integer such that for all is called the index of depth stability of powers of and is denoted by . Similarly, one can define the index of depth stability of symbolic powers by replacing the ordinary powers with symbolic powers. The index of depth stability of symbolic powers is denoted by . By Theorem 4.3, we have
[TABLE]
According to Theorem 4.6, one can also define the indices of sdepth stability of symbolic powers, i.e.,
[TABLE]
[TABLE]
We also define the following quantities.
[TABLE]
[TABLE]
The argument before Theorem 4.6, also proves the following proposition.
Proposition 4.7** ([38], Corollary 4.5).**
For every squarefree monomial ideal , we have
[TABLE]
and
[TABLE]
As we mentioned above, the assertions of Theorem 4.4 are true also for the depth. Thus, a similar argument, as we explained above Theorem 4.6, implies that the inequalities of Proposition 4.7, remain true, if one replaces Stanley depth with depth. This has been already observed in [38, Theorem 3.6].
Let be a squarefree monomial ideal. We know from Theorem 4.6 that the sequences and are convergent. Now, it is natural to ask the following question.
Question 4.8**.**
Let be a squarefree monomial ideal. How can one describe the limits of the sequences and ?
Question 4.8 is widely open. We know the answer only for very special classes of ideals. For example, assume that is a squarefree complete intersection monomial ideal. It is easy to check that for any integer , the equality holds. Therefore, using Theorem 2.3, we conclude that
[TABLE]
and
[TABLE]
where is the number of minimal monomial generators of (which is also equal to ).
We are also able to compute the limit of the sequence , where is the Stanley-Reisner ideal of a matroid. We first recall some basic definitions from the theory of Stanley-Reisner rings.
A simplicial complex on the set of vertices is a collection of subsets of which is closed under taking subsets; that is, if and , then also . Every element is called a face of . The dimension of a face is defined to be . The dimension of which is denoted by , is defined to be , where . The Stanley-Reisner ideal of is defined as
[TABLE]
Definition 4.9**.**
A simplicial complex is called matroid if for every pair of faces with , there is a vertex such that is a face of .
As we mentioned above, there are some information about the limit of the Stanley depth function of symbolic powers of Stanley-Reisner ideal of a matroid.
Theorem 4.10** ([38], Theorem 4.7).**
Let be a matroid. Then
[TABLE]
and
[TABLE]
4.2. Cover ideals
Let be a graph with vertex set V(G)=\big{\{}x_{1},\ldots,x_{n}\big{\}}. A subset of is called a vertex cover of if every edge of is incident to at least one vertex of . A vertex cover is called a minimal vertex cover of if no proper subset of is a vertex cover of . The cover ideal of is a squarefree monomial ideal of which is defined as
[TABLE]
It is easy to see that cover ideal is the Alexander dual of edge ideal, i.e.,
[TABLE]
Let be a squarefree monomial ideal. In Question 2.1, we asked whether and satisfy Stanley’s inequality for every integer . One can also ask the similar question for symbolic powers.
Question 4.11** ([34], Question 1.2).**
Let be a monomial ideal. Is it true that and satisfy Stanley’s inequality for every integer ?
In this subsection, we investigate the above question for cover ideals, By Theorem 4.3, in order to know whether the high symbolic powers of cover ideals satisfy Stanley’s inequality, we need to compute their symbolic analytic spread. This has been done by Constantinescu and Varbaro [7]. Indeed, they provide a combinatorial description for the symbolic analytic spread of . To state their result, we need to recall some notions from graph theory.
Let be a graph. A matching in is a set of edges such that no two different edges share a common vertex. A subset of is called an independent subset of if there are no edges among the vertices of . Let be a nonempty matching of . We say that is an ordered matching of if the following conditions hold.
- (1)
is an independent subset of vertices of ; and
- (2)
implies that .
The ordered matching number of , denoted by , is defined to be
[TABLE]
Theorem 4.12** ([7], Theorem 2.8).**
For any graph ,
[TABLE]
As a consequence of Theorems 4.3 and 4.12, for any graph with vertices we have
[TABLE]
Hoa, Kimura, Terai and Trung [19], determined a linear upper bound for the index of depth stability of symbolic powers of cover ideals. In [34], we provided an alternative proof for their result.
Theorem 4.13** ([19], Theorem 3.4 and [34], Theorem 3.1).**
Let be a graph with vertices. Then for every integer , we have
[TABLE]
In [34], we also proved that high symbolic powers of cover ideals satisfy Stanley’s inequality. Indeed, we proved the following result.
Theorem 4.14** ([34], Theorem 3.5 and Corollary 3.6).**
Let be a graph with vertices. Then for every integer , we have
[TABLE]
In particular, and satisfy the Stanley s inequality, for every integer .
The assertions of Theorem 4.14 for the special case of bipartite graphs was also proved in [32].
Let be a graph with vertices. We say is very well-covered if is an even integer and moreover, every vertex cover of has size . The graph is called Cohen-Macaulay if the ring is Cohen-Macaulay. We know from Theorem 4.14 that for any graph , the modules and satisfy the Stanley s inequality, for . However, in the case of Cohen-Macaulay very well-covered graphs, we have something more.
Proposition 4.15** ([36], Corollary 3.8).**
Let be a Cohen-Macaulay very well-covered graph. Then and satisfy Stanley’s inequality, for every integer .
In Question 4.8, we asked about the limit values of the sequences and , where is a squarefree monomial ideal. For the case of cover ideals, we pose the following conjecture.
Conjecture 4.16**.**
Let be a graph with vertices. Then
[TABLE]
and
[TABLE]
Let be a squarefree monomial ideal. According to Theorem 4.3, the sequence is convergent. The situation is even better if is a cover ideal. In fact, Hoa, Kimura, Terai and Trung [19, Theorem 3.2] proved that the above sequence is non-increasing for cover ideals. In other words, for every graph and any integer , we have
[TABLE]
We recall that the above inequality for bipartite graphs was also proved by in [6, Theorem 3.2].
We close this article by mentioning that the above inequality is true if one replaces depth with sdepth. In fact, we have the following result.
Theorem 4.17** ([34], Theorem 3.3).**
Let be a graph. Then for every integer , we have
- (i)
, and
- (ii)
.
Acknowledgment
The author is grateful to Siamak Yassemi for encouraging him to write this survey article.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Alipour, S. A. Seyed Fakhari, S. Yassemi, Stanley depth of factor of polymatroidal ideals and edge ideal of forests, Arch. Math. (Basel) , 105 (2015), 323–332.
- 2[2] C. Biró, D. M. Howard, M. T. Keller, W. T. Trotter, S. J. Young, Interval partitions and Stanley depth, J. Combin. Theory, Ser. A 117 (2010), 475–482.
- 3[3] M. Brodmann, The asymptotic nature of the analytic spread, Math. Proc. Cambridge Philos. Soc. 86 (1979), no. 1, 35–39.
- 4[4] W. Bruns, C. Krattenthaler, J. Uliczka, Stanley decompositions and Hilbert depth in the Koszul complex. J. Commut. Algebra 2 (2010), 327–357.
- 5[5] L. Burch, Codimension and analytic spread, Proc. Cambridge Philos. Soc. 72 (1972), 369–373.
- 6[6] A. Constantinescu, M. R. Pournaki, S. A. Seyed Fakhari, N. Terai, S. Yassemi, Cohen-Macaulayness and limit behavior of depth for powers of cover ideals, Comm. Algebra , 43 (2015), 143–157.
- 7[7] A. Constantinescu, M. Varbaro, Koszulness, Krull dimension, and other properties of graph-related algebras, J. Algebraic Combin. 34 (2011), no. 3, 375–400.
- 8[8] M. Cimpoeaş, Some remarks on the Stanley depth for multigraded modules, Le Mathematiche LXIII (2008), 165–171.
