Abstract
Stanley depth is a geometric invariant of the module and is related to an algebraic invariant called depth of the module. We compute Stanley depth of the quotient of edge ideals associated with some familiar families of wheel-related graphs. In particular, we establish general closed formulas for Stanley depth of quotient of edge ideals associated with the -power of a wheel graph, for , gear graphs and anti-web gear graphs.
1. Introduction
Richard P. Stanley is famous for his contribution to combinatorial aspects of algebra and geometry. Simplicial complexes are critical objects in combinatorics; two of the most important such complexes are partitionable and Cohen–Macauly complexes. Stanley introduced the famous conjecture relating these two complexes and hence, introduced the notion of Stanley depth in 1982 in [1]. Stanley Depth is a geometric invariant of module. The Stanley conjecture is interesting in the sense that it compares a combinatorial invariant with a homological invariant of module. Stanley depth gained attention of algebraists in 2006 when J. Herzog and D. Popescu studied this conjecture. Afterwards, a number of articles have been published in which this conjecture has been discussed for different cases. Let be a polynomial ring in n variables over a field K and M be finitely generated -graded S-module. For a homogeneous element and a subset , denotes the K-subspace of M generated by all homogeneous elements of the form , where v is a monomial in . The space is -graded K-subspace and is called of dimension if it is a free -module, where denotes the cardinality of Z. A decomposition of M as a finite direct sum of -graded K-vector spaces is called Stanley decomposition.
where each is a Stanley space of M. The number
is called Stanley depth of decomposition and the quantity
is called Stanley depth of M.
Richard P. Stanley [1] in his article “Linear Diophantine equation and local cohomology” stated this conjecture, in a generalized way, as follows:
Let R be a finitely generated -graded K-algebra () and let M be a finitely generated -graded R-module. Then there exist finitely many subalgebras of R, each generated by algebraically independent -homogeneous elements of R, and there exist -homogeneous elements of M, such that
where for all i, and where is a free -module and where is finite direct sum of modules .“ The direct sum of modules is a new module defined as for but finitely many .
In [2], the authors found an upper bound for the Stanley depth of , where S is polynomial ring and are monomial primary ideals and also showed that this conjecture holds for and , where are monomial irreducible ideals. In [3], authors found upper bound for Stanley depth of edge ideals of k-partite complete graph and s-uniform complete bipartite hyper = graph. In [4], authors found upper bound for the Stanley depth of edge ideals of complete graph and complete bipartite graph when some variables are added as generators. In [5], the authors gave the lower and upper bound for the cyclic module associated with the complete k-partite hyper-graph. Duval et al. disproved this conjecture in [6]. A method to compute Stanley depth for the module M, where M is of the form , where are monomial ideals, was given by Herzog, Vladoiu and Zheng in [7]. Rinaldo developed this method into an algorithm in [8] which is implemented in CoCoA [9]. In [10], Rauf proved some important basic results regrading depth and Stanley depth of multi-graded module. Stanley depth of the edge ideal associated with some graphs have been subject matter of recent results. In [11], Cimpoeas computed Stanley depth of the edge ideal of line and cycles. Iqbal et al. computed Depth and sdepth of edge ideals of square paths and square cycles in [12]. Stanley depth of edge ideals of general powers of path ideals is computed in [13]. In [14], Cimpoeas proved several inequalities regarding computation of Stanley depth. Let denote the edge ideal associated with path on n vertices. Then bounds and values for Stanley depth and depth for module are given in [11,12,13]. Stanley depth of the quotient of edge ideal associated with wheel graph and square wheel graph is computed in [15]. In paper [16], Biro et al. discussed interval partition associated with partially ordered set which is required to find Stanley depth, and also how this interval partition is used to find out Stanley depth. Cimpoeas, in [17] discussed Stanley depth of modules having small number of generators. For the friendly introduction to commutative algebra, we refer readers to [18].
We set , and where denotes the unique minimal set of monomial generators of the monomial ideal J for the rest of this article.
2. Example
We explain Stanley decomposition and Stanley depth with the help of an example. We present some graphical representations which are used to construct a particular Stanley decomposition which are explained briefly in [7].
Let and be a monomial ideal. Since we know that one module can have many Stanley decompositions, see for example Figure 1.
Figure 1.
Decomposition .
Now we give another decomposition to explain further. In the Figure 2, decomposition of I is shown graphically as
Figure 2.
Decomposition .
Clearly the because in decomposition of I, Stanley spaces have dimensions and 2 respectively. So the smallest in all these dimensions is 1 and called Stanley depth of I. For further and detailed reading, we refer to [7].
The Stanley decomposition of is given as
hence, we see that .
Definition 1.
Edge ideal: Let be a graph with edge set and vertex set then the edge ideal associated with G is the square free monomial ideal of S, defined as
Definition 2.
-power of wheel graph: Let and be a -power of wheel on n vertices, then the edge ideal of -power of Wheel is
An example of graph of is given in Figure 3.
Figure 3.
Graph of .
Definition 3.
Gear graph: The gear graph , where consists of cycle of vertices and the vertex n joins with vertices .
The edge ideal of the gear graph is defined as
The graph of is given in Figure 4.
Figure 4.
Graph of .
Definition 4.
Anti-web gear graph: The anti-web gear graph denoted by , where consists of cycle of vertices and also the edges joining vertices having distance two between them on this cycle. And the vertex n joins with vertices . The order of this graph is n.
The edge ideal of the Gear graph is defined as
The graph of is given in Figure 5.
Figure 5.
Graph of .
Following important Lemmas will play significant role in our computation. A short exact sequence of Modules is where arrows are maps such that the third map is surjective, second map is injective along with the property that kernel of the third map is same as that of image of second map.
Lemma 1
([10]). Let be a short exact sequence of -graded S-modules. Then
Lemma 2
([12]). Let be a square free monomial ideal such that , let , such that, , for all . Then .
For example is is a polynomial ring in n variables over a field K and is a cube of path whose ideal is given as
Then Stanley decomposition for the following cases by [7] is given as
In this paper we are interested in computing Stanley depth of the quotient of -power of Wheel graph, gear graph and anti-web gear graph.
3. Main Result
In this section we are going to compute our main results.
Theorem 1.
Let , and be an ideal of wheel graph on n vertices, then sdepth .
Proof.
The ideal of -power of Wheel graph is given as
Now consider a short exact sequence by taking functions such that is a multiplication by and such that . Throughout this paper we use similar kind of functions to make our sequence of modules short exact.
by Lemma 1
Here
Hence .
And
where
and by [19].
Here because if then we have two cases. If , where then we can check that . And if , then can see that , so we get the desired result for both these cases. So . This implies that We get the other inequality by Proposition 2.7 in [14]. Hence . □
Theorem 2.
Let and is an odd number, then sdepth .
Proof.
We have
Consider the following short exact sequence
By Lemma 1
Here
So Hence by Theorem 1.9 of [11] sdepth
And
So we have
Hence sdepth .
So we get sdepth sdepth sdepth . □
Theorem 3.
Let , then sdepth , for (mod 3).
The sdepth − 1, for (mod 3).
And when (mod 3), then sdepth .
Proof.
We prove this result by the following three cases.
Case 1: When , where . Then by Theorem 2 we can see sdepth
Now we have to show the other inequality.
Since , but , for all , therefore by Lemma 2, .
Case 2: When , where . Then by Theorem 2 we can see sdepth
Now to prove the other inequality.
Since , but , for all , therefore by Lemma 2, .
Case 3: When , where . Then by Theorem 2 we can see sdepth .
To show the other inequality.
Since , but , for all , therefore by Lemma 2, . □
Theorem 4.
Let and is an odd number, then sdepth .
Proof.
We have
Consider the following short exact sequence
Here
So
We get sdepth ,
and
So we have , where is a square cycle on vertices. By using [8,12] we get sdepth . By applying Lemma 1 we have
So we get sdepth sdepth .
Hence sdepth . □
Theorem 5.
Let and is an odd number, then sdepth , when (mod 5).
For (mod 5), the sdepth
And when (mod 5), then sdepth
Proof.
We will prove this result by following cases.
Case 1: When , where . Then by Theorem 4 we can see sdepth .
Now we have to show the other inequality.
Since , but , for all , therefore by Lemma 2, .
Case 2: When , where . Then by Theorem 4 we can see sdepth .
Now to show the other inequality.
Since , but , for all , therefore by Lemma 2, .
Case 3: When , where . Then by Theorem 4 we can see sdepth .
Now we have to show the other inequality.
Since , but , for all , therefore by Lemma 2, .
Case 4: When , where . Then by Theorem 4 we can see sdepth .
Now we have to show the other inequality. Since , but , for all , therefore by Lemma 2, .
Case 5: When , where . Then by Theorem 4 we can see sdepth .
Now we have to show the other inequality.
Since , but , for all , therefore by Lemma 2, . □
4. Examples
Now we give some examples of our main results.
Example 1.
Let be an edge ideal of square wheel graph as shown in Figure 3, then we have to show that sdepth . The edge ideal of the square wheel graph is given as
Now consider a short exact sequence
by Lemma 1
Here
So
Hence .
And
where
and by [12].
Here
So we have .
This implies that .
We get the other inequality from [14] (Proposition 2.7).
Hence,
.
Example 2.
Let is the gear graph on 11 vertices.
Then sdepth .
The graph of is given in Figure 4
We have
Consider the following short exact sequence
By Lemma 1
Here
So Hence by Proposition 1.8 of [11] sdepth
And
So we have
Hence sdepth .
So we get sdepth sdepth
sdepth .
Now we have to show the other inequality.
Since , but , for all , therefore by Lemma 2, .
Example 3.
Let is the anti-web gear graph on 9 vertices, then sdepth .
The graph of is given in fig 2.3.
We have
Consider the following short exact sequence
Here
So
We get sdepth .
And
So we have , where is a square cycle on 8 vertices. By using (Ishaq et al., 2017) we get sdepth .
By applying Lemma 1 we have
So we get sdepth sdepth .
Hence sdepth .
Now to show the other inequality.
Since , but , for all , therefore by Lemma 2, .
5. Conclusions and Open Problems
In this article, we have computed the Stanley depth of the quotient of edge ideals associated with some familiar families of wheel-related graphs. In particular we establish general closed formulas for Stanley depth of quotient of edge ideals associated with -power of wheel graph, for , gear graphs and anti-web gear graphs and arrive at the following closed formulas.
In the following theorem, we give exact value of Stanley depth of of wheel graph.
Theorem 6.
Let , and be an ideal of wheel graph on n vertices, then sdepth .
Next we give the lower bound for the sdepth of anti-web gear graph having odd numbers of vertices.
Theorem 7.
Let and is an odd number, then sdepth .
In the following theorem, we give the lower and upper bounds for sdepth of gear graph for particular cases.
Theorem 8.
Let , then sdepth , for (mod 3).
The sdepth -1, for (mod 3).
And when (mod 3), then sdepth .
Now in next theorem we give lower bound for odd number of vertices in gear graph.
Theorem 9.
Let and is an odd number, then sdepth .
Following result describes sharp tight bounds for the sdepth of Anti-web gear graph having odd number of vertices.
Theorem 10.
Let and is an odd number, then sdepth , when (mod 5).
For (mod 5), the sdepth
And when (mod 5), then sdepth
At the same time, we pose natural open problems about the exact values of Stanley depth of the quotient of edge ideal associated with - power of gear and anti-web gear graphs.
Author Contributions
J.-B.L. wrote, M.M. and R.F. drafted the manuscript whereas M.I.Q. and Q.M. made corrections. All authors read and approved the final manuscript.
Funding
This research was funded by the China Postdoctoral Science Foundation under Grant 2017M621579; the Postdoctoral Science Foundation of Jiangsu Province under Grant 1701081B; Project of Anhui Jianzhu University under Grant no. 2016QD116 and 2017dc03.
Acknowledgments
We are thankful to Muhammad Ishaq for his fruitful discussion about the problem.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Stanley, R.P. Linear diophantine equations and local cohomology. Invent. Math. 1982, 68, 175–193. [Google Scholar] [CrossRef]
- Popescu, D.; Qureshi, M.I. Computing the Stanley depth. J. Algebra 2010, 323, 2943–2959. [Google Scholar] [CrossRef]
- Ishaq, M.; Qureshi, M.I. Stanley depth of Edge ideals. Studia Scientiarum Mathematicarum Hungarica 2012, 49, 501–508. [Google Scholar] [CrossRef]
- Cipu, M.; Qureshi, M.I. On the behaviour of Stanley depth under variable adjunction. Bull. Math. Soc. Sc. Math. Roumanie 2012, 55, 129–146. [Google Scholar]
- Ishaq, M.; Qureshi, M.I. Upper and Lower bound for the Stanley depth of certain classes of monomial ideals and their residue classes rings. Commun. Algebra 2013, 41, 1107–1116. [Google Scholar] [CrossRef]
- Duval, A.M.; Goeckneker, B.; Klivans, C.J.; Martine, J.L. A non-partitionable Cohen-Macaulay simplicial complex. Adv. Math. 2016, 299, 381–395. [Google Scholar] [CrossRef]
- Herzog, J.; Vladoiu, M.; Zheng, X. How to compute the Stanley depth of a monomial ideal. J. Algebra 2009, 322, 3151–3169. [Google Scholar] [CrossRef]
- Rinaldo, G. An algorithm to compute the Stanley depth of monomials ideals. Le Mathematiche 2008, LXIII, 243–256. [Google Scholar]
- CoCoATeam, CoCoA: A System for Doing Computations in Commutative Algebra. Available online: http://cocoa.dima.unige.it (accessed on 10 December 2018).
- Rauf, A. Depth and sdepth of multigraded module. Commun. Algebra 2010, 38, 773–784. [Google Scholar] [CrossRef]
- Cimpoeas, M. On the Stanley depth of edge ideals of line and cyclic graphs. Rom. J. Math. Comput. Sci. 2015, 5, 70–75. [Google Scholar]
- Iqbal, Z.; Ishaq, M.; Aamir, M. Depth and Stanley depth of edge ideals of square paths and square cycles. Commun. Algebra 2017, 46, 1188–1198. [Google Scholar] [CrossRef]
- Stefan, A. Stanley Depth of Powers of the Path Ideal. arXiv, 2014; arXiv:1409.6072. Available online: http://arxiv.org/pdf/1409.6072.pdf (accessed on 10 December 2018).
- Cimpoeas, M. Several inequalities regarding Stanley depth. Rom. J. Math. Comput. Sci. 2012, 2, 28–40. [Google Scholar]
- Munir, M.; Farooki, R. Stanley depth of the edge ideals of the wheel and square wheel graph. Open J. Math. Sci. 2019, in press. [Google Scholar]
- Biro, C.; Howard, D.M.; Keller, M.T.; Trotter, W.T.; Young, S.J. Interval partitions and Stanley depth. J. Comb. Theory Ser. A 2010, 117, 475–482. [Google Scholar] [CrossRef]
- Cimpoeas, M. Stanley depth of monomial ideals with small number of generators. Cent. Eur. J. Math. 2009, 7, 629–634. [Google Scholar] [CrossRef]
- Villarreal, R.H. Monomial algebras. In Monographs and Textbooks in Pure and Applied Mathematics; Marcel Dekker, Inc.: New York, NY, USA, 2001. [Google Scholar]
- Iqbal, Z.; Ishaq, M. Depth and stanley depth of the edge ideals of the poewrs of paths and cycles. arXiv, 2017; arXiv:1710.0599v1. [Google Scholar]
© 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).




