Next Article in Journal
k-Rainbow Domination Number of P3Pn
Next Article in Special Issue
Linear Operators That Preserve the Genus of a Graph
Previous Article in Journal
Further Results on the Resistance-Harary Index of Unicyclic Graphs
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Stanley Depth of Edge Ideals of Some Wheel-Related Graphs

1
School of Mathematics and Physics, Anhui Jianzhu University, Hefei 230601, China
2
Department od Mathematics, Division of Science and Technology, University of Education, Lahore 54000, Pakistan
3
Department of Mathematics, COMSATS University Islamabad, Vehari Campus 61100, Pakistan
4
Department of Mathematics, COMSATS University Islamabad, Lahore Campus 54000, Pakistan
*
Author to whom correspondence should be addressed.
Mathematics 2019, 7(2), 202; https://doi.org/10.3390/math7020202
Submission received: 28 December 2018 / Revised: 4 February 2019 / Accepted: 6 February 2019 / Published: 21 February 2019
(This article belongs to the Special Issue Algebra and Discrete Mathematics)

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 m t h -power of a wheel graph, for m 3 , 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 S = K [ x 1 , x 2 , . . . , x n ] be a polynomial ring in n variables over a field K and M be finitely generated Z n -graded S-module. For a homogeneous element q M and a subset Z { x 1 , x 2 , . . . , x n } , q K [ Z ] denotes the K-subspace of M generated by all homogeneous elements of the form q v , where v is a monomial in K [ Z ] . The space q K [ Z ] is Z n -graded K-subspace and is called S t a n l e y s p a c e of dimension | Z | if it is a free K [ Z ] -module, where | Z | denotes the cardinality of Z. A decomposition of M as a finite direct sum of Z n -graded K-vector spaces is called Stanley decomposition.
D : M = j = 1 s q j K [ Z j ]
where each q j K [ Z j ] is a Stanley space of M. The number
sdepth ( D ) = min { | Z j | : j = 1 , 2 , 3 , . . . , s }
is called Stanley depth of decomposition D and the quantity
sdepth ( M ) = max { sdepth ( D ) | D i s a S t a n l e y d e c o m p o s i t i o n o f M }
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 N n -graded K-algebra ( R 0 = K ) and let M be a finitely generated Z n -graded R-module. Then there exist finitely many subalgebras S 1 , . . . , S t of R, each generated by algebraically independent N n -homogeneous elements of R, and there exist Z n -homogeneous elements η 1 , . . . , η t of M, such that
M = i = 1 t η i S i
where d i m ( S i ) d e p t h ( M ) for all i, and where η i S i is a free S i -module and where i = 1 t is finite direct sum of modules η i S i .“ The direct sum of modules is a new module defined as i I M i = { ( m i M i ) i I m i = 0 for but finitely many i } .
In [2], the authors found an upper bound for the Stanley depth of S / Q Q , where S is polynomial ring and Q , Q are monomial primary ideals and also showed that this conjecture holds for Q 1 Q 2 and S / Q 1 Q 2 Q 3 , where Q 1 , Q 2 , Q 3 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 M = I / J , where J I S 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 I ( P n ) denote the edge ideal associated with path on n vertices. Then bounds and values for Stanley depth and depth for module S / I ( P n ) 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 S m = K [ x 1 , x 2 , x 3 , . . . , x m ] , supp ( u ) = { i : x i | u } and supp ( J ) = { i : x i | v for some v G ( J ) } where G ( J ) 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 S = K [ x 1 , x 2 ] and I = ( x 1 3 , x 1 2 x 2 , x 2 2 ) be a monomial ideal. Since we know that one module can have many Stanley decompositions, see for example Figure 1.
In the Figure 1, decomposition D 1 of I is shown graphically given as,
D 1 : I = x 1 3 K [ x 1 ] x 1 2 x 2 K [ x 1 ] x 2 2 K [ x 1 , x 2 ] .
Now we give another decomposition to explain further. In the Figure 2, decomposition D 2 of I is shown graphically as
D 2 : I = x 2 2 K [ x 2 ] x 1 x 2 2 K [ x 2 ] x 1 2 x 2 K [ x 2 ] x 1 3 K [ x 1 , x 2 ] .
Clearly the s d e p t h ( I ) = 1 because in decomposition D 2 of I, Stanley spaces have dimensions 1 , 1 , 1 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 S / I is given as
D : S / I = K x 1 K x 1 2 K x 2 K x 1 x 2 K ,
hence, we see that s d e p t h ( S / I ) = 0 .
Definition 1.
Edge ideal: Let G = ( V ( G ) , E ( G ) ) be a graph with edge set E ( G ) and vertex set V ( G ) = { 1 , 2 , . . . , n } then the edge ideal associated with G is the square free monomial ideal of S, defined as
I ( G ) = ( x l x k : { l , k } E ( G ) ) .
Definition 2.
m t h -power of wheel graph: Let n 5 and W n m be a m t h -power of wheel on n vertices, then the edge ideal of m t h -power of Wheel is
( I ( W n m ) ) = ( x 1 x n , x 2 x n , x 3 x n , . . . , x n 1 x n , x 1 x 2 , x 2 x 3 , . . . , x n 1 x 1 , x 1 x 3 , x 2 x 4 , . . . , x n 1 x 2 , x 1 x 4 , x 2 x 5 , . . . , x n 1 x 3 , . . . , x 1 x m , x 2 x m + 1 , . . . , x n 1 x m 1 , x 1 x m + 1 , x 2 x m + 2 , . . . , x n 1 x m ) .
An example of graph of I ( W 7 2 ) is given in Figure 3.
Definition 3.
Gear graph: The gear graph G n , where n { 5 , 7 , 9 , . . . , } consists of cycle of n 1 vertices and the vertex n joins with vertices 1 , 3 , 5 , 7 , . . . , n 1 .
The edge ideal I ( G n ) of the gear graph is defined as
I ( G n ) = ( x 1 x 2 , x 2 x 3 , x 3 x 4 , . . . , x n 2 x n 1 , x n 1 x 1 , x 1 x n , x 3 x n , x 5 x n , . . . , x n 2 x n ) .
The graph of I ( G 11 ) is given in Figure 4.
Definition 4.
Anti-web gear graph: The anti-web gear graph denoted by A W G n , where n { 9 , 11 , 13 . . . , } consists of cycle of n 1 vertices and also the edges joining vertices having distance two between them on this cycle. And the vertex n joins with vertices 1 , 3 , 5 , 7 , . . . , n 2 . The order of this graph is n.
The edge ideal I ( A W G n ) of the Gear graph is defined as
I ( A W G n ) = ( x 1 x 2 , x 2 x 3 , x 3 x 4 , . . . , x n 2 x n 1 , x n 1 x 1 , x 1 x 3 , x 2 x 4 , x 3 x 5 , . . . , x n 2 x 1 , x n 1 x 2 , x 1 x n , x 3 x n , x 5 x n , . . . , x n 2 x n ) .
The graph of I ( A W G 9 ) is given in Figure 5.
Following important Lemmas will play significant role in our computation. A short exact sequence of Modules is 0 M 1 M 2 M 3 0 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 0 U V W 0 be a short exact sequence of Z n -graded S-modules. Then
sdepth ( V ) min { sdepth ( U ) , sdepth ( W ) } .
Lemma 2
([12]). Let J S be a square free monomial ideal such that s u p p ( J ) = [ n ] , let w = x j 1 x j 2 x j 3 . . . x j t S / J , such that, x i w I , for all i [ n ] s u p p ( w ) . Then sdepth ( S / J ) t .
For example is S = K [ x 1 , x 2 , x 3 , . . . , x n ] is a polynomial ring in n variables over a field K and I ( P n 3 ) is a cube of path whose ideal is given as
I ( P n 3 ) = ( x 1 x 2 , x 2 x 3 , . . . , x n 1 x n , x 1 x 3 , x 2 x 4 , . . . , x n 2 x n , x 1 x 4 , x 2 x 5 , . . . , x n 3 x n ) .
Then Stanley decomposition for the following cases by [7] is given as
I f n = 3 . T h e n , S / I ( P 3 3 ) = K [ x 1 ] x 2 K [ x 2 ] x 3 K [ x 3 ] . I f n = 4 . T h e n , S / I ( P 4 3 ) = K [ x 1 ] x 2 K [ x 2 ] x 3 K [ x 3 ] x 4 K [ x 4 ] . I f n = 5 . T h e n , S / I ( P 5 3 ) = K [ x 1 , x 5 ] x 2 K [ x 2 ] x 3 K [ x 3 ] x 4 K [ x 4 ] .
In this paper we are interested in computing Stanley depth of the quotient of m t h -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 n 6 , and I ( W n m ) be an ideal of wheel graph on n vertices, then sdepth ( S / I ( W n m ) ) = 1 .
Proof. 
The ideal of m t h -power of Wheel graph is given as
( I ( W n m ) ) = ( x 1 x n , x 2 x n , x 3 x n , . . . , x n 1 x n , x 1 x 2 , x 2 x 3 , . . . , x n 1 x 1 , x 1 x 3 , x 2 x 4 , . . . , x n 1 x 2 , x 1 x 4 , x 2 x 5 , . . . , x n 1 x 3 , . . . , x 1 x m , x 2 x m + 1 , . . . , x n 1 x m 1 , x 1 x m + 1 , x 2 x m + 2 , . . . , x n 1 x m ) .
Now consider a short exact sequence by taking functions ψ : ( I ( W n m ) : x n ) ( I ( W n m ) ) such that ψ ( r ) = x n r is a multiplication by x n and φ : ( I ( W n m ) ) ( I ( W n m ) , x n ) such that φ ( r ) = r . Throughout this paper we use similar kind of functions to make our sequence of modules short exact.
0 S / ( I ( W n m ) : x n ) S / ( I ( W n m ) ) S / ( I ( W n m ) , x n ) 0 .
by Lemma 1
sdepth ( S / ( I ( W n m ) ) ) min { sdepth ( S / ( W n m ) : x n ) ) , sdepth ( S / ( I ( W n m ) , x n ) ) } .
Here
( I ( W n m ) : x n ) = ( x 1 , x 2 , x 3 , x 4 , . . . , x n 1 ) . S o ( S / ( I ( W n m ) : x n ) ) K [ x n ] .
Hence sdepth ( S / ( I ( W n m ) : x n ) ) = 1 .
And
( I ( W n m ) , x n ) = ( x 1 x 2 , x 2 x 3 , . . . , x n 1 x 1 , x 1 x 3 , x 2 x 4 , . . . , x n 1 x 2 , x 1 x 4 , x 2 x 5 , . . . , x n 1 x 3 , . . . , x 1 x m , x 2 x m + 1 , . . . , x n 1 x m 1 , x 1 x m + 1 , x 2 x m + 2 , . . . , x n 1 x m , x n ) .
where S / ( I ( W n m ) , x n ) S n 1 / I ( C n 1 m ) and sdepth ( S / ( I ( W n m ) , x n ) ) = sdepth ( S n 1 / I ( C n 1 m ) ) ( n 1 ) m 2 m + 1 by [19].
Here ( n 1 ) m 2 m + 1 1 , because if n 1 m then we have two cases. If n 1 = 2 k , where k 3 then we can check that I ( C 2 k m ) = I ( C 2 k k ) . And if n 1 = 2 k + 1 , then can see that I ( C 2 k + 1 m ) = I ( C 2 k + 1 k ) , so we get the desired result for both these cases. So sdepth ( S / ( I ( W n m ) : x n ) ) = 1 sdepth ( S / ( I ( W n m ) , x n ) ) . This implies that sdepth ( S / ( I ( W n m ) ) ) sdepth ( S / ( I ( W n m ) : x n ) ) = 1 . We get the other inequality by Proposition 2.7 in [14]. Hence sdepth ( S / ( I ( W n m ) ) ) = sdepth ( S / ( I ( W n m ) : x n ) ) = 1 . □
Theorem 2.
Let n 5 and is an odd number, then sdepth ( S / I ( G n ) ) n 2 3 .
Proof. 
We have
I ( G n ) = ( x 1 x 2 , x 2 x 3 , x 3 x 4 , . . . , x n 2 x n 1 , x n 1 x 1 , x 1 x n , x 3 x n , x 5 x n , . . . , x n 2 x n ) .
Consider the following short exact sequence
0 S / ( I ( G n ) : x n ) S / I ( G n ) S / ( I ( G n ) , x n ) 0 .
By Lemma 1
sdepth ( S / ( I ( G n ) ) min { sdepth ( S / ( I ( G n ) : x n ) ) , sdepth ( S / ( I ( G n ) , x n ) ) } .
Here
( I ( G n ) , x n ) = ( x 1 x 2 , x 2 x 3 , x 3 x 4 , . . . , x n 2 x n 1 , x n 1 x 1 , x n ) .
So S / ( I ( G n ) , x n ) S n 1 / I ( C n 1 ) . Hence by Theorem 1.9 of [11] sdepth ( S / ( I ( G n ) , x n ) ) n 2 3 .
And
( I ( G n ) : x n ) = ( x 1 , x 3 , x 5 , . . . , x n 2 ) .
So we have S / ( I ( G n ) : x n ) K [ x 2 , x 4 , x 6 , . . . , x n 1 , x n ] .
Hence sdepth ( S / ( I ( G n ) : x n ) ) n 2 .
So we get sdepth ( S / ( I ( G n ) ) sdepth ( S / ( I ( G n ) , x n ) ) , sdepth ( S / ( I ( G n ) ) n 2 3 . □
Theorem 3.
Let n 5 , then sdepth ( S / ( I ( G n ) ) ) = n 3 , for n 0 (mod 3).
The sdepth ( S / ( I ( G n ) ) ) = n 3 − 1, for n 1 (mod 3).
And when n 2 (mod 3), then n 2 3 sdepth ( S / ( I ( G n ) ) ) n 3 .
Proof. 
We prove this result by the following three cases.
Case 1: When n = 3 q , where q { 3 , 5 , 7 , . . . } . Then by Theorem 2 we can see sdepth ( S / ( I ( G n ) ) n 3 .
Now we have to show the other inequality.
Since w = x 1 x 4 x 7 . . . x ( 3 ( q 2 ) + 1 ) x 3 ( q 1 ) + 1 S / ( I ( G n ) ) , but x i w I ( G n ) , for all i [ n ] supp ( w ) , therefore by Lemma 2, sdepth ( S / ( I ( G n ) ) ) q = n 3 .
Case 2: When n = 3 q + 1 , where q { 2 , 4 , 6 , . . . } . Then by Theorem 2 we can see sdepth ( S / ( I ( G n ) ) ( 3 q + 1 ) 2 3 = q = n 3 1 .
Now to prove the other inequality.
Since w = x 1 x 4 x 7 . . . x ( 3 ( q 2 ) + 1 ) x 3 ( q 1 ) + 1 S / ( I ( G n ) ) , but x i w I ( G n ) , for all i [ n ] supp ( w ) , therefore by Lemma 2, sdepth ( S / ( I ( G n ) ) ) q = n 3 1 .
Case 3: When n = 3 q + 2 , where q { 1 , 3 , 5 , 7 , . . . } . Then by Theorem 2 we can see sdepth ( S / ( I ( G n ) ) n 2 3 .
To show the other inequality.
Since w = x 1 x 4 x 7 . . . x ( 3 ( q 1 ) + 1 ) x 3 q S / ( I ( G n ) ) , but x i w I ( G n ) , for all i [ n ] supp ( w ) , therefore by Lemma 2, sdepth ( S / ( I ( G n ) ) ) q + 1 = n 3 . □
Theorem 4.
Let n 9 and is an odd number, then sdepth ( S / I ( A W G n ) ) n 3 5 .
Proof. 
We have
I ( A W G n ) = ( x 1 x 2 , x 2 x 3 , x 3 x 4 , . . . , x n 2 x n 1 , x n 1 x 1 , x 1 x 3 , x 2 x 4 , . . . , x n 2 x 1 , x n 1 x 2 , x 1 x n , x 3 x n , . . . , x n 2 x n ) .
Consider the following short exact sequence
0 S / ( I ( A W G n ) : x n ) S / I ( A W G n ) S / ( I ( A W G n ) , x n ) 0 .
Here
( I ( A W G n ) : x n ) = ( x 1 , x 3 , x 5 , . . . , x n 2 ) .
So ( S / ( I ( A W G n ) : x n ) ) K [ x 2 , x 4 , x 6 , . . . , x n 1 , x n ] .
We get sdepth ( S / ( I ( A W G n ) : x n ) ) n 2 , and
( I ( A W G n ) , x n ) = ( x 1 x 2 , x 2 x 3 , x 3 x 4 , . . . , x n 2 x n 1 , x n 1 x 1 , x 1 x 3 , x 2 x 4 , . . . , x n 2 x 1 , x n 1 x 2 , x n ) .
So we have ( S / ( I ( A W G n ) , x n ) ) S n 1 / I ( C n 1 2 ) , where I ( C n 1 2 is a square cycle on n 1 vertices. By using [8,12] we get sdepth ( S / ( I ( A W G n ) , x n ) ) n 3 5 . By applying Lemma 1 we have
sdepth ( S / ( I ( A W G n ) ) min { sdepth ( S / ( I ( A W G n ) : x n ) ) , sdepth ( S / ( I ( A W G n ) , x n ) ) } .
So we get sdepth ( S / ( I ( A W G n ) ) ) sdepth ( S / ( I ( A W G n ) , x n ) ) .
Hence sdepth ( S / ( I ( A W G n ) ) ) n 3 5 . □
Theorem 5.
Let n 9 and is an odd number, then sdepth ( S / ( I ( A W G n ) ) ) = n 5 , when n 0 , 4 (mod 5).
For n 1 (mod 5), the sdepth ( S / ( I ( A W G n ) ) ) = n 5 1 .
And when n 2 , 3 (mod 5), then n 5 1 sdepth ( S / ( I ( A W G n ) ) ) n 5 .
Proof. 
We will prove this result by following cases.
Case 1: When n = 5 q , where q { 3 , 5 , 7 , . . . } . Then by Theorem 4 we can see sdepth ( S / ( I ( A W G n ) ) n 5 .
Now we have to show the other inequality.
Since w = x 1 x 6 x 11 . . . x ( 5 ( q 1 ) + 1 ) S / ( I ( A W G n ) ) , but x i w I ( A W G n ) , for all i [ n ] supp ( w ) , therefore by Lemma 2, sdepth ( S / ( I ( A W G n ) ) ) q = n 5 .
Case 2: When n = 5 q + 1 , where q { 2 , 4 , 6 , . . . } . Then by Theorem 4 we can see sdepth ( S / ( I ( A W G n ) ) n 5 1 .
Now to show the other inequality.
Since w = x 1 x 6 x 11 . . . x ( 5 ( q 1 ) + 1 ) S / ( I ( A W G n ) ) , but x i w I ( A W G n ) , for all i [ n ] supp ( w ) , therefore by Lemma 2, sdepth ( S / ( I ( A W G n ) ) ) q = n 5 1 .
Case 3: When n = 5 q + 2 , where q { 3 , 5 , 7 , . . . } . Then by Theorem 4 we can see sdepth ( S / ( I ( A W G n ) ) n 5 1 .
Now we have to show the other inequality.
Since w = x 1 x 6 x 11 . . . x ( 5 ( q 1 ) + 1 ) x ( 5 ( q ) 1 ) S / ( I ( A W G n ) ) , but x i w I ( A W G n ) , for all i [ n ] supp ( w ) , therefore by Lemma 2, sdepth ( S / ( I ( A W G n ) ) ) q + 1 = n 5 .
Case 4: When n = 5 q + 3 , where q { 2 , 4 , 6 , . . . } . Then by Theorem 4 we can see sdepth ( S / ( I ( A W G n ) ) n 5 1 .
Now we have to show the other inequality. Since w = x 1 x 6 x 11 . . . x ( 5 ( q 1 ) + 1 ) x 5 q S / ( I ( A W G n ) ) , but x i w I ( A W G n ) , for all i [ n ] supp ( w ) , therefore by Lemma 2, sdepth ( S / ( I ( A W G n ) ) ) q + 1 = n 5 .
Case 5: When n = 5 q + 4 , where q { 1 , 3 , 5 , . . . } . Then by Theorem 4 we can see sdepth ( S / ( I ( A W G n ) ) n 5 .
Now we have to show the other inequality.
Since w = x 1 x 6 x 11 . . . x ( 5 ( q 1 ) + 1 ) x ( 5 q ) + 1 S / ( I ( A W G n ) ) , but x i w I ( A W G n ) , for all i [ n ] supp ( w ) , therefore by Lemma 2, sdepth ( S / ( I ( A W G n ) ) ) q + 1 = n 5 . □

4. Examples

Now we give some examples of our main results.
Example 1.
Let I ( W 7 2 ) be an edge ideal of square wheel graph as shown in Figure 3, then we have to show that sdepth ( S / I ( W 7 2 ) ) = 1 . The edge ideal of the square wheel graph is given as
I ( W 7 2 ) = ( x 1 x 7 , x 2 x 7 , x 3 x 7 , . . . , x 6 x 7 , x 1 x 2 , x 2 x 3 , x 3 x 4 , . . . , x 6 x 1 , x 1 x 3 , x 2 x 4 , x 3 x 5 , . . . , x 6 x 2 ) .
Now consider a short exact sequence
0 S / ( I ( W 7 2 ) : x 7 ) S / ( I ( W 7 2 ) ) S / ( I ( W 7 2 ) , x 7 ) 0
by Lemma 1
sdepth ( S / ( I ( W 7 2 ) ) ) min { sdepth ( S / ( I ( W 7 2 ) : x 7 ) ) , sdepth ( S / ( I ( W 7 2 ) , x 7 ) ) } .
Here
( I ( W 7 2 ) : x 7 ) = ( x 1 , x 2 , x 3 , x 4 , . . . , x 6 ) .
So ( S / ( I ( W 7 ) : x 7 ) ) K [ x 7 ] .
Hence sdepth ( S / ( I ( W 7 2 ) : x 7 ) ) = 1 .
And ( I ( W 7 2 ) , x 7 ) = ( x 1 x 2 , x 2 x 3 , x 3 x 4 , . . . , x 6 x 1 , x 1 x 3 , x 2 x 4 , x 3 x 5 , . . . , x 6 x 2 , x 7 )
where S / ( I ( W 7 2 ) , x 7 ) S 6 / I ( C 6 2 )
and sdepth ( S / ( I ( W 7 2 ) , x 7 ) ) = sdepth ( S 6 / I ( C 6 2 ) ) 6 2 5 by [12].
Here 6 2 5 1 .
So we have sdepth ( S / ( I ( W 7 2 ) : x 7 ) ) = 1 sdepth ( S / ( I ( W 7 2 ) , x 7 ) ) .
This implies that sdepth ( S / ( I ( W 7 2 ) ) ) sdepth ( S / ( I ( W 7 2 ) : x 7 ) ) = 1 .
We get the other inequality from [14] (Proposition 2.7).
Hence,
sdepth ( S / ( I ( W 7 2 ) ) ) = sdepth ( S / ( I ( W 7 2 ) : x 7 ) ) = 1 .
Example 2.
Let I ( G 11 ) is the gear graph on 11 vertices.
Then 3 sdepth ( S / I ( G 11 ) ) 4 .
The graph of I ( G 11 ) is given in Figure 4
We have
I ( G 11 ) = ( x 1 x 2 , x 2 x 3 , x 3 x 4 , . . . , x 9 x 10 , x 10 x 1 , x 1 x 11 , x 3 x 11 , x 5 x 11 , . . . , x 7 x 11 ) .
Consider the following short exact sequence
0 S / ( I ( G 11 ) : x 11 ) S / I ( G 11 ) S / ( I ( G 11 ) , x 11 ) 0 .
By Lemma 1
sdepth ( S / ( I ( G 11 ) ) min { sdepth ( S / ( I ( G 11 ) : x 11 ) ) , sdepth ( S / ( I ( G 11 ) , x 11 ) ) } .
Here
( I ( G 11 ) , x 11 ) = ( x 1 x 2 , x 2 x 3 , x 3 x 4 , . . . , x 9 x 10 , x 10 x 1 , x 11 ) .
So S / ( I ( G 11 ) , x 11 ) S 10 / I ( C 10 ) . Hence by Proposition 1.8 of [11] sdepth ( S / ( I ( G 11 ) , x 11 ) ) 9 3 = 3 .
And
( I ( G 11 ) : x 11 ) = ( x 1 , x 3 , x 5 , . . . , x 9 ) .
So we have S / ( I ( G 11 ) : x 11 ) K [ x 2 , x 4 , x 6 , . . . , x 10 , x 11 ] .
Hence sdepth ( S / ( I ( G 11 ) : x 11 ) ) 11 2 .
So we get sdepth ( S / ( I ( G 11 ) ) sdepth ( S / ( I ( G 11 ) , x 11 ) ) ,
sdepth ( S / ( I ( G 11 ) ) 3 .
Now we have to show the other inequality.
Since w = x 1 x 4 x 7 x 9 S / ( I ( G 11 ) ) , but x i w I ( G 11 ) , for all i [ 9 ] supp ( w ) , therefore by Lemma 2, sdepth ( S / ( I ( G 11 ) ) ) 4 .
Example 3.
Let I ( A W G 9 ) is the anti-web gear graph on 9 vertices, then sdepth ( S / I ( A W G 9 ) ) = 2 .
The graph of I ( A W G 9 ) is given in fig 2.3.
We have
I ( A W G 9 ) = ( x 1 x 2 , x 2 x 3 , x 3 x 4 , . . . , x 7 x 8 , x 8 x 1 , x 1 x 3 , x 2 x 4 , . . . , x 7 x 1 , x 8 x 2 , x 1 x 9 , x 3 x 9 , . . . , x 9 x 9 ) .
Consider the following short exact sequence
0 S / ( I ( A W G 9 ) : x 9 ) S / I ( A W G 9 ) S / ( I ( A W G 9 ) , x 9 ) 0 .
Here
( I ( A W G 9 ) : x 9 ) = ( x 1 , x 3 , x 5 , . . . , x 7 ) .
So ( S / ( I ( A W G 9 ) : x 9 ) ) K [ x 2 , x 4 , x 6 , . . . , x 8 , x 9 ] .
We get sdepth ( S / ( I ( A W G 9 ) : x 9 ) ) 9 2 = 5 .
And
( I ( A W G 11 ) , x 9 ) = ( x 1 x 2 , x 2 x 3 , x 3 x 4 , . . . , x 7 x 8 , x 8 x 1 , x 1 x 3 , x 2 x 4 , . . . , x 7 x 1 , x 8 x 2 , x 9 ) .
So we have ( S / ( I ( A W G 9 ) , x 9 ) ) S 8 / I ( C 8 2 ) , where I ( C 8 2 is a square cycle on 8 vertices. By using (Ishaq et al., 2017) we get sdepth ( S / ( I ( A W G 9 ) , x 9 ) ) 6 5 = 2 .
By applying Lemma 1 we have
sdepth ( S / ( I ( A W G 9 ) ) min { sdepth ( S / ( I ( A W G 9 ) : x 9 ) ) , sdepth ( S / ( I ( A W G 9 ) , x 9 ) ) } .
So we get sdepth ( S / ( I ( A W G 9 ) ) ) sdepth ( S / ( I ( A W G 9 ) , x 9 ) ) .
Hence sdepth ( S / ( I ( A W G 9 ) ) ) 6 5 = 2 .
Now to show the other inequality.
Since w = x 1 x 6 S / ( I ( A W G 9 ) ) , but x i w I ( A W G 9 ) , for all i [ 9 ] supp ( w ) , therefore by Lemma 2, sdepth ( S / ( I ( A W G 9 ) ) ) 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 m t h -power of wheel graph, for m 3 , 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 m t h p o w e r of wheel graph.
Theorem 6.
Let n 6 , and I ( W n m ) be an ideal of wheel graph on n vertices, then sdepth ( S / I ( W n m ) ) = 1 .
Next we give the lower bound for the sdepth of anti-web gear graph having odd numbers of vertices.
Theorem 7.
Let n 9 and is an odd number, then sdepth ( S / I ( A W G n ) ) n 3 5 .
In the following theorem, we give the lower and upper bounds for sdepth of gear graph for particular cases.
Theorem 8.
Let n 5 , then sdepth ( S / ( I ( G n ) ) ) = n 3 , for n 0 (mod 3).
The sdepth ( S / ( I ( G n ) ) ) = n 3 -1, for n 1 (mod 3).
And when n 2 (mod 3), then n 2 3 sdepth ( S / ( I ( G n ) ) ) n 3 .
Now in next theorem we give lower bound for odd number of vertices in gear graph.
Theorem 9.
Let n 5 and is an odd number, then sdepth ( S / I ( G n ) ) n 2 3 .
Following result describes sharp tight bounds for the sdepth of Anti-web gear graph having odd number of vertices.
Theorem 10.
Let n 9 and is an odd number, then sdepth ( S / ( I ( A W G n ) ) ) = n 5 , when n 0 , 4 (mod 5).
For n 1 (mod 5), the sdepth ( S / ( I ( A W G n ) ) ) = n 5 1 .
And when n 2 , 3 (mod 5), then n 5 1 sdepth ( S / ( I ( A W G n ) ) ) n 5 .
At the same time, we pose natural open problems about the exact values of Stanley depth of the quotient of edge ideal associated with m t h - 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

  1. Stanley, R.P. Linear diophantine equations and local cohomology. Invent. Math. 1982, 68, 175–193. [Google Scholar] [CrossRef]
  2. Popescu, D.; Qureshi, M.I. Computing the Stanley depth. J. Algebra 2010, 323, 2943–2959. [Google Scholar] [CrossRef] [Green Version]
  3. Ishaq, M.; Qureshi, M.I. Stanley depth of Edge ideals. Studia Scientiarum Mathematicarum Hungarica 2012, 49, 501–508. [Google Scholar] [CrossRef]
  4. 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]
  5. 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]
  6. 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]
  7. 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] [Green Version]
  8. Rinaldo, G. An algorithm to compute the Stanley depth of monomials ideals. Le Mathematiche 2008, LXIII, 243–256. [Google Scholar]
  9. CoCoATeam, CoCoA: A System for Doing Computations in Commutative Algebra. Available online: http://cocoa.dima.unige.it (accessed on 10 December 2018).
  10. Rauf, A. Depth and sdepth of multigraded module. Commun. Algebra 2010, 38, 773–784. [Google Scholar] [CrossRef]
  11. 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]
  12. 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]
  13. 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).
  14. Cimpoeas, M. Several inequalities regarding Stanley depth. Rom. J. Math. Comput. Sci. 2012, 2, 28–40. [Google Scholar]
  15. 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]
  16. 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] [Green Version]
  17. Cimpoeas, M. Stanley depth of monomial ideals with small number of generators. Cent. Eur. J. Math. 2009, 7, 629–634. [Google Scholar] [CrossRef] [Green Version]
  18. Villarreal, R.H. Monomial algebras. In Monographs and Textbooks in Pure and Applied Mathematics; Marcel Dekker, Inc.: New York, NY, USA, 2001. [Google Scholar]
  19. 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]
Figure 1. Decomposition D 1 .
Figure 1. Decomposition D 1 .
Mathematics 07 00202 g001
Figure 2. Decomposition D 2 .
Figure 2. Decomposition D 2 .
Mathematics 07 00202 g002
Figure 3. Graph of I ( W 7 2 ) .
Figure 3. Graph of I ( W 7 2 ) .
Mathematics 07 00202 g003
Figure 4. Graph of I ( G 11 ) .
Figure 4. Graph of I ( G 11 ) .
Mathematics 07 00202 g004
Figure 5. Graph of I ( A W G 9 ) .
Figure 5. Graph of I ( A W G 9 ) .
Mathematics 07 00202 g005

Share and Cite

MDPI and ACS Style

Liu, J.-B.; Munir, M.; Farooki, R.; Imran Qureshi, M.; Muneer, Q. Stanley Depth of Edge Ideals of Some Wheel-Related Graphs. Mathematics 2019, 7, 202. https://doi.org/10.3390/math7020202

AMA Style

Liu J-B, Munir M, Farooki R, Imran Qureshi M, Muneer Q. Stanley Depth of Edge Ideals of Some Wheel-Related Graphs. Mathematics. 2019; 7(2):202. https://doi.org/10.3390/math7020202

Chicago/Turabian Style

Liu, Jia-Bao, Mobeen Munir, Raheel Farooki, Muhammad Imran Qureshi, and Quratulien Muneer. 2019. "Stanley Depth of Edge Ideals of Some Wheel-Related Graphs" Mathematics 7, no. 2: 202. https://doi.org/10.3390/math7020202

APA Style

Liu, J. -B., Munir, M., Farooki, R., Imran Qureshi, M., & Muneer, Q. (2019). Stanley Depth of Edge Ideals of Some Wheel-Related Graphs. Mathematics, 7(2), 202. https://doi.org/10.3390/math7020202

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

Article Metrics

Back to TopTop