
In this paper, we study depth and Stanley depth of the quotient rings of the edge ideals associated to triangular and multi triangular snake and triangular and multi triangular ouroboros snake graphs. In some cases, we find exact values, otherwise, we find tight bounds. We also find lower bounds for the edge ideals of triangular and multi triangular snake and ouroboros snake graphs and prove a conjecture of Herzog for all edge ideals we considered.
Citation: Malik Muhammad Suleman Shahid, Muhammad Ishaq, Anuwat Jirawattanapanit, Khanyaluck Subkrajang. Depth and Stanley depth of the edge ideals of multi triangular snake and multi triangular ouroboros snake graphs[J]. AIMS Mathematics, 2022, 7(9): 16449-16463. doi: 10.3934/math.2022900
[1] | Naeem Ud Din, Muhammad Ishaq, Zunaira Sajid . Values and bounds for depth and Stanley depth of some classes of edge ideals. AIMS Mathematics, 2021, 6(8): 8544-8566. doi: 10.3934/math.2021496 |
[2] | Zahid Iqbal, Muhammad Ishaq . Depth and Stanley depth of edge ideals associated to some line graphs. AIMS Mathematics, 2019, 4(3): 686-698. doi: 10.3934/math.2019.3.686 |
[3] | Tazeen Ayesha, Muhammad Ishaq . Some algebraic invariants of the edge ideals of perfect $ [h, d] $-ary trees and some unicyclic graphs. AIMS Mathematics, 2023, 8(5): 10947-10977. doi: 10.3934/math.2023555 |
[4] | Bakhtawar Shaukat, Muhammad Ishaq, Ahtsham Ul Haq . Algebraic invariants of edge ideals of some circulant graphs. AIMS Mathematics, 2024, 9(1): 868-895. doi: 10.3934/math.2024044 |
[5] | Fatma Salama, Randa M. Abo Elanin . On total edge irregularity strength for some special types of uniform theta snake graphs. AIMS Mathematics, 2021, 6(8): 8127-8148. doi: 10.3934/math.2021471 |
[6] | Mohra Zayed, Ali Ahmad, Muhammad Faisal Nadeem, Muhammad Azeem . The comparative study of resolving parameters for a family of ladder networks. AIMS Mathematics, 2022, 7(9): 16569-16589. doi: 10.3934/math.2022908 |
[7] | Mohammad Hamidi, Florentin Smarandache . Valued-inverse Dombi neutrosophic graph and application. AIMS Mathematics, 2023, 8(11): 26614-26631. doi: 10.3934/math.20231361 |
[8] | Wei Lu, Yuangang Li, Yixiu Kong, Liangli Yang . Generalized triangular Pythagorean fuzzy weighted Bonferroni operators and their application in multi-attribute decision-making. AIMS Mathematics, 2023, 8(12): 28376-28397. doi: 10.3934/math.20231452 |
[9] | Xinfeng Liang, Mengya Zhang . Triangular algebras with nonlinear higher Lie n-derivation by local actions. AIMS Mathematics, 2024, 9(2): 2549-2583. doi: 10.3934/math.2024126 |
[10] | Shama Liaqat, Zeeshan Saleem Mufti, Yilun Shang . Newly defined fuzzy Misbalance Prodeg Index with application in multi-criteria decision-making. AIMS Mathematics, 2024, 9(8): 20193-20220. doi: 10.3934/math.2024984 |
In this paper, we study depth and Stanley depth of the quotient rings of the edge ideals associated to triangular and multi triangular snake and triangular and multi triangular ouroboros snake graphs. In some cases, we find exact values, otherwise, we find tight bounds. We also find lower bounds for the edge ideals of triangular and multi triangular snake and ouroboros snake graphs and prove a conjecture of Herzog for all edge ideals we considered.
Let S:=K[x1,…,xr] be a polynomial algebra over a filed K. Let X be a finitely generated Zr-graded S-module. A Stanley decomposition of X is a presentation of K-vector space X as a finite direct sum
T:X=a⨁f=1zfK[Wf], |
where zf∈X is a homogeneous element and Wf⊂{x1,…,xr} and zfK[Wf] is the K-subspace of X generated by all elements zfb, where b is a monomial in K[Wf]. The Zr-graded K-subspace zfK[Wf]⊂X is called a Stanley space of dimension |Wf|, if zfK[Wf] is a free K[Wf]-module. Define
sdepth(T)=min{|Wf|:f=1,…,a},and |
sdepth(X)=max{sdepth(T):TisaStanleydecompositionofX}. |
The number sdepth(T) is called the Stanley depth of decomposition T and sdepth(X) is called the Stanley depth of X. Let R be a local noetherian ring with a unique maximal ideal m and X be a finitely generated R-module. The common length of all maximal X-sequences in m is called the depth of X. Stanley conjectured in [27] that for a Zr-graded module X, sdepth(X)≥depth(X). Afterwards, a number of articles have been published in which this conjecture has been discussed for different cases. This conjecture was disproved by Duval et al. in [8]. Stanley depth gained attention when Herzog et al. gave an algorithm in [10] for computing sdepth(X) for module of the type X=Q2/Q1, where Q1⊂Q2⊂S are monomial ideals. Though the algorithm is useful for studying Stanley depth in some special cases, but computing Stanley depth by using this algorithm is a hard combinatorial problem, in general. In [24], Rinaldo gave a computer implementation for this algorithm, in the computer algebra system CoCoA. This algorithm is useful only when the ring has small number of variables. Therefore, it's worth giving values and bounds for Stanley depth of some classes of modules. For some literature related to depth and Stanley depth the readers are referred to [7,12,14,15,16,20,22,23]. Herzog conjectured in [11]:
Conjecture 1.1. (Herzog) Let Q⊂S be a monomial ideal. Then sdepth(Q)≥sdepth(S/Q).
The above conjecture has been proved in some special cases; see for instance [13,17,21,23]. In this paper we study depth and Stanley depth of the edge ideals and their residue class rings for some classes of graphs which we call multi triangular snake graphs and multi triangular ouroboros snake graphs. We find the exact values of depth and Stanley depth of the cyclic module associated to the triangular and multi triangular snake graphs, when n≡1(mod2) and give tight bounds when n≡0(mod2). We also find the exact values of depth and Stanley depth of cyclic modules associated to the triangular and multi triangular ouraboros snake graphs. In the last section of this paper we give a lower bound for Stanley depth of edge ideal of triangular and multi triangular snake and ouraboros snake graphs and we prove the the Conjecture 2.11 for the edge ideal of all classes of graphs we considered. The use of the computer algebra system CoCoA [28] is gratefully acknowledged.
Let G=(V(G),E(G)) be a graph with vertex set V(G) and edge set E(G). A graph is called simple if it has no loops and no multiple edges. In this paper we consider only simple graphs. If V(G)={x1,x2,…,xr} and S=K[x1,x2,…,xr], then the edge ideal I(G) of the graph G is the ideal of S generated by all monomials of the form xixj such that {xi,xj}⊂E(G). Note that by abuse of notation, xi will denote both a vertex of a graph G and the corresponding variable of the given polynomial ring. For a given graph G, K[V(G)] will denote the polynomial ring whose variables are the vertices of the graph G. If G is a graph on {x1,x2,…,xr} vertices, then G is called a path if E(G)={{xi,xi+1}:i=1,2,…,r−1}. A path on r vertices is usually denoted by Pr. The number of edges in the path Pr is called the length of Pr. Let G be a connected graph. If xi,xj∈V(G) then the distance between xi and xj is the length of the shortest path between xi and xj, denoted by d(xi,xj). The maximum distance between any two vertices of a graph G is called the diameter of G and is denoted by diam(G). A vertex in a connected graph is a cutvertex if removing it (and edges through it) disconnects the graph.
Definition 2.1. A block of a graph G is a maximal connected subgraph of G that has no cut vertex. If G itself is connected and has no cut vertex, then G is a block.
Definition 2.2. ([6]) The blockcutvertex graph of a connected graph G, denoted bc(G), is a graph whose vertices are the blocks and cut vertices of G. The edges of bc(G) join cut vertices with those blocks to which they belong.
An example of the block cut vertex graph bc(G), associated to a graph G, is given in Figure 1.
Definition 2.3. ([25]) A triangularsnake is a connected graph in which all blocks are triangles and the block cut point (or block cut vertex) graph is a path. If we have n blocks in a triangular snake graph then this graph is denoted by Δn.
Definition 2.4. ([26]) Let n≥1 and m≥2, then Δn,m is a triangular snake with n blocks and every block has m number of triangles with one common edge.
Let m,n≥1. We call Δn,m an m-triangular snake. In particular, if m=1, then Δn,1=Δn is a triangular snake, and if m≥2, then we call Δn,m a multi triangular snake. For i∈{1,2,…,n}, the vertices in the i-th block that are connected by the common edge of the m triangles in Δn,m are labeled as yi and yi+1, while the remaining vertices in the i-th block of Δn,m are labeled by {ui1,ui2,…,uim}, see Figure 2 for examples and labeling of Δn,m. Let Sn,m:=K[V(Δn,m)] be the ring of polynomials whose variables are the vertices of Δn,m. Clearly, |V(Δn,m)|=nm+n+1 and |E(Δn,m)|=2nm+n. For some more types of snake graphs, we refer readers to [18,19].
Let us consider a super graph Δ∗n,m of the graph Δn,m. For m≥2, the vertex and edge sets of Δ∗n,m are V(Δ∗n,m)=V(Δn,m)⋃{u(n+1)1,u(n+1)2,…,u(n+1)m} and E(Δ∗n,m)=E(Δn,m)⋃{yn+1u(n+1)1,yn+1u(n+1)2,…,yn+1u(n+1)m,}. See Figure 2 for example of Δ∗n,m.
Definition 2.5. The vertices x1 and x2 in a graph G are said to be fusedormergedoridentified, if x1 and x2 are replaced by a single new vertex x, such that, every edge that was adjacent to either x1 or x2 or both, is adjacent to x.
If we fuse vertices y1 and yn+1 in the Δn,m graph, we get a new graph denoted Ωn,m, we call Ωn,m an m−triangularouraborossnake. In particular, if m=1, then we call Ωn,1 a triangular ouroboros snake, and if m≥2, then we call Ωn,m a multi triangular ouroboros snake. For i∈{1,2,…,n}, the vertices of degree two in the i-th block of Ωn,m are labeled as {ui1,ui2,…,uim}, while the remaining vertices in the i-th block for i∈{2,…,n−1} are labeled by yi and yi+1. The fused vertex v in Ωn,m is labeled as y1. Clearly, |V(Ωn,m)|=nm+n and |E(Ωn,m)|=2nm+n. Let us consider a super graph Δ∗∗n,m of the graph Δ∗n,m. The vertex and edge sets of Δ∗∗n,m are V(Δ∗∗n,m)=V(Δ∗n,m)⋃{q1,q2,…,qm} and E(Δ∗∗n,m)=E(Δ∗n,m)⋃{y1q1,y1q2,…,y1qm}. See Figure 3 for examples of Δ∗∗n,m and Ωm,n.
Definition 2.6. Let k≥2. A k-star denoted Sk is a graph on k vertices, in which one vertex has degree k−1 and all other vertices have degree 1.
The following theorem give the values of depth and Stanley depth for the cyclic module associated to a k-star.
Theorem 2.7. ([1,Theorem 2.6]) Let Sk be a {k-{star}}. If Q=I(Sk), then depth(K[V(Sk)]/Q)=sdepth(K[V(Sk)]/Q)=1.
Now we recall two lemmas that play a key role in proofs of our main theorems.
Lemma 2.8. ([23,Lemma 2.2])For a short exact sequence 0→U1→U2→U3→0 of Zn-graded S-modules, we have
sdepth(U2)≥min{sdepth(U1),sdepth(U3)}. |
Lemma 2.9. (Depth Lemma) If 0→U1→U2→U3→0 is a short exact sequence of modules over alocal ring S, or a Noetherian graded ring with S0 local, then
(1) depth(U2)≥min{depth(U1),depth(U3)}.
(2) depth(U1)≥min{depth(U2),depth(U3)+1}.
(3) depth(U3)≥min{depth(U1)−1,depth(U2)}.
We have the following intresting result of Biro et. al. for the graded maximal ideal of S.
Theorem 2.10. ([2,Theorem 2.2])Let m=(x1,x2,…,xr) be the graded maximal ideal of S. Then sdepth(m)=⌈r2⌉, where ⌈t⌉, with t∈Q, denotes the smallest integer which is not less than t.
The following corollaries and lemmas are frequently used in this paper.
Corollary 2.11. ([3,Corollary 1.3])Let Q be a monomial ideal of S. Then sdepth(S/Q)≤sdepth(S/(Q:q)) for all monomials q∉Q.
Corollary 2.12. ([23,Corollary 1.3]) Let Q be a monomial ideal of S. Then depth(S/Q)≤depth(S/(Q:q)) for all monomials q∉Q.
Lemma 2.13. ([10,Lemma 3.6])Let Q1⊂Q2 be a monomial ideals of S and S′=S[xr+1] be the polynomial ring in variable xr+1 over S. Then depth(Q2S′/Q1S′)=depth(Q2/Q1)+1 and sdepth(Q1S′/Q1S′)=sdepth(Q2/Q1)+1.
Lemma 2.14. ([13,Lemma 4.1])Let A1 and A2 be two non-empty subsets of {x1,x2,…,xr} and A1∩A2=∅. If Q1⊂K[A1]andQ2⊂K[A2] are squarefree monomial ideals such that sdepthK[A1](Q1)>sdepth(K[A1]/Q1). Then
sdepthK[A1∪A2](Q1+Q2)≥sdepth(K[A1]/Q1)+sdepthK[A2](Q2). |
Fouli et al. gave the following lower bound for depth and Stanley depth of S/I(G).
Theorem 2.15. ([9,Theorems 3.1 and 4.18])Let G be a connected graph. If Q=I(G)⊂S and δ=diam(G), then depth(S/Q),sdepth(S/Q)≥⌈δ+13⌉.
We end this section with the following elementary lemma for the Stanley depth of I(Sk).
Lemma 2.16. Let k≥2. If Q=I(Sk), then sdepthK[V(Sk)](Q)=1+⌈k−12⌉.
Proof. Since Q=I(Sk)=(xy1,xy2,…,xyk−1), then Q=xQ′ and Q′=(I:x)=(y1,y2,…,yk−1). By Lemma 2.13 and Theorem 2.10, we have sdepthK[V(Sk)](Q)=sdepthK[V(Sk)](Q′)=sdepthT(Q′)+1, where T=K[y1,y2,…,yk−1]. Now using [4,Theorem 1.1], we get sdepthK[V(Sk)](Q)=⌈k−12⌉+1.
In this section we find the value of depth and Stanley depth of the cyclic module Sn,m/I(Δn,m) when n≡1(mod2), and give tight bounds when n≡0(mod2). For this purpose, we first find depth and Stanley depth of the cyclic module S∗n,m/I(Δ∗n,m). We will use these results in our main proofs.
Lemma 3.1. Let n,m≥1. Then depth(S∗n,m/I(Δ∗n,m))=sdepth(S∗n,m/I(Δ∗n,m))=⌈n+12⌉.
Proof. Let us consider two sets, An,m:={yn,un1,un2,…,unm,u(n+1)1,u(n+1)2,…,u(n+1)m} and A′n,m:={u(n+1)1,u(n+1)2,…,u(n+1)m}. We have the following short exact sequence:
0⟶S∗n,m/(I(Δ∗n,m):yn+1)⋅yn+1→S∗n,m/I(Δ∗n,m)⟶S∗n,m/(I(Δ∗n,m),yn+1)⟶0. |
If n=1, then (I(Δ∗1,m):y2)=(A1,m) and S∗1,m/(I(Δ∗1,m):y2)≅K[y2], so depth(S∗1,m/(I(Δ∗1,m):y2))=1. Since (I(Δ∗1,m),y2)=(I(Sm+1),y2) and S∗1,m/(I(Δ∗1,m),y2)≅K[V(Sm+1)]/I(Sm+1)[A′1,m], thus by Theorem 2.7 and Lemma 2.13, we get depth(S∗1,m/(I(Δ∗1,m),y2))=1+m. Hence by Depth Lemma depth(S∗1,m/I(Δ∗1,m))=1, as required. If n=2, then (I(Δ∗2,m):y3)=(I(Sm+1),A2,m) and S∗2,m/(I(Δ∗2,m):y3)≅K[V(Sm+1)]/I(Sm+1)[y3], again by Lemma 2.13 and Theorem 2.7 depth(S∗2,m/(I(Δ∗2,m):y3))=1+1=2. Also we have, (I(Δ∗2,m),y3)=(I(Δ∗1,m),y3) and S∗2,m/(I(Δ∗2,m),y3)≅S∗1,m/I(Δ∗1,m)[A′2,m], thus by case n=1 and Lemma 2.13, depth(S∗2,m/(I(Δ∗2,m),y3))=1+m. Hence by Depth Lemma, depth(S∗2,m/I(Δ∗2,m))=2, this proves the result for n=2. Let n≥3. We have (I(Δ∗n,m):yn+1)=(I(Δ∗n−2,m),An,m) and (I(Δ∗n,m),yn+1)=(I(Δ∗n−1,m),yn+1), thus S∗n,m/(I(Δ∗n,m):yn+1)≅S∗n−2,m/I(Δ∗n−2,m)[yn+1] and S∗n,m/(I(Δ∗n,m),yn+1)≅S∗n−1,m/I(Δ∗n−1,m)[A′n,m]. Now by induction on n and Lemma 2.13 we get depth(S∗n,m/(I(Δ∗n,m):yn+1))=⌈n−12⌉+1=⌈n+12⌉ and depth(S∗n,m/(I(Δ∗n,m),yn+1))=⌈n2⌉+m=⌈n+2m2⌉. Hence by Depth Lemma depth(S∗n,m/I(Δ∗n,m))=⌈n+12⌉.
Applying Lemma 2.8 instead of Depth Lemma on the above short exact sequence and proceeding on the same lines we get, sdepth(S∗n,m/(I(Δ∗n,m)))≥⌈n+12⌉. Now we prove that this lower bound is an upper bound as well. Since yn+1∉I(Δ∗n,m), by Corollary 2.11, we get sdepth(S∗n,m/I(Δ∗n,m))≤sdepth(S∗n,m/(I(Δ∗n,m):yn+1)). Using the same arguments as we used in the case of depth, sdepth(S∗1,m/(I(Δ∗1,m):y2))=1 and sdepth(S∗2,m/(I(Δ∗2,m):y3))=2. This implies that sdepth(S∗n,m/I(Δ∗n,m))≤⌈n+12⌉, for n=1,2. Let n≥3. Then sdepth(S∗n,m/I(Δ∗n,m))≤sdepth(S∗n,m/(I(Δ∗n,m):yn+1))=sdepth(S∗n−2,m/I(Δ∗n−2,m)[yn+1]). The proof follows by applying induction on n.
Theorem 3.2. Let n,m≥1. Then ⌈n2⌉≤depth(Sn,m/I(Δn,m)),sdepth(Sn,m/I(Δn,m))≤⌈n+12⌉.
Proof. Let Bn,m:={yn,un1,un2,…,unm} be a set of variables. Consider the following short exact sequence:
0⟶Sn,m/(I(Δn,m):yn+1)⋅yn+1→Sn,m/I(Δn,m)⟶Sn,m/(I(Δn,m),yn+1)⟶0. |
If n=1, then (I(Δ1,m):y2)=(B1,m) and S1,m/(I(Δ1,m):y2)≅K[y2], so depth(S1,m/(I(Δ1,m):y2))=1. Also (I(Δ1,m),y2)=(I(Sm+1),y2), that is, S1,m/(I(Δ1,m),y2)≅K[V(Sm+1)]/I(Sm+1), so by Theorem 2.7 depth(S1,m/(I(Δ1,m),y2))=1. Hence by Depth Lemma depth(S1,m/I(Δ1,m))=1. If n=2, then (I(Δ2,m):y3)=(I(Sm+1),B2,m), and S2,m/(I(Δ2,m):y3)≅K[V(Sm+1)]/I(Sm+1)[y3]. By Lemma 2.13 and Theorem 2.7 depth(S2,m/(I(Δ2,m):y3))=2. We have (I(Δ2,m),y3)=(I(Δ∗1,m),y3) and S2,m/(I(Δ2,m),y3)≅S∗1,m/I(Δ∗1,m), thus by case n=1, depth(S2,m/(I(Δ2,m),y3))=1. Applying Depth Lemma, we get depth(S2,m/I(Δ2,m))≥1. Since y3∉I(Δ2,m), by Corollary 2.12, we get depth(S2,m/I(Δ2,m))≤depth(S2,m/(I(Δ2,m):y3)). This shows that depth(S2,m/I(Δ2,m))≤2, which proves the result for n=2. Let n≥3. We have (I(Δn,m):yn+1)=(I(Δ∗n−2,m),Bn,m), that is, Sn,m/(I(Δn,m):yn+1)≅(S∗n−2,m/(I(Δ∗n−2,m)))[yn+1]. Also we have that (I(Δn,m),yn+1)=(I(Δ∗n−1,m),yn+1) and Sn,m/I(Δn,m),yn+1)≅S∗n−1,m/(I(Δ∗n−1,m). By Lemmas 3.1 and 2.13 we have depth(Sn,m/(I(Δn,m):yn+1))=⌈n+12⌉, depth(Sn,m/(I(Δn,m),yn+1))=⌈n2⌉ and by Depth Lemma, depth(Sn,m/I(Δn,m))≥⌈n2⌉. For the upper bound since yn+1∉I(Δn,m) by Corollary 2.12, we get depth(Sn,m/I(Δn,m))≤depth(Sn,m/(I(Δn,m):yn+1))=⌈n+12⌉.
Proof for Stanley depth is similar we use Lemma 2.8 instead of Depth Lemma and Corollary 2.11 instead of Corollary 2.12.
Corollary 3.3. If n≡1(mod2), then depth(Sn,m/I(Δn,m))=sdepth(Sn,m/I(Δn,m))=⌈n+12⌉.
Remark 3.4. If n≥2 and m≥1, then our Theorem 3.2 says that depth(Sn,m/I(Δn,m)),sdepth(Sn,m/I(Δn,m))∈{⌈n2⌉,⌈n+12⌉\big\}. Whereas, one of the existing known bound for theses modules is given in Theorem 2.15, that is, depth(Sn,m/I(Δn,m)),sdepth(Sn,m/I(Δn,m))≥⌈diam(Δn,m)+13⌉=⌈n+13⌉. This means that this bound is far away form the actual value for large values of n.
In this section we find out the exact value of depth and Stanley depth of the cyclic module Tn,m/I(Ωn,m). For this purpose we first find depth and Stanley depth of the cyclic module S∗∗n,m/I(Δ∗∗n,m) associated to the super graph Δ∗∗n,m of Δ∗n,m. These results will be used in our main proofs.
Lemma 4.1. Let n,m≥1. Then
depth(S∗∗n,m/I(Δ∗∗n,m))=sdepth(S∗∗n,m/I(Δ∗∗n,m))={⌈n+22⌉,n≡0(mod2);⌈n+12⌉+m,n≡1(mod2). |
Proof. Let An,m and A′n,m the sets as defined in Theorem 3.1. Consider the following short exact sequence:
0⟶S∗∗n,m/(I(Δ∗∗n,m):yn+1)⋅yn+1→S∗∗n,m/I(Δ∗∗n,m)⟶S∗∗n,m/(I(Δ∗∗n,m),yn+1)⟶0. |
If n=1, then (I(Δ∗∗1,m):y2)=(A1,m) and (I(Δ∗∗1,m),y2)=(I(S2m+1),y2). We have S∗∗1,m/(I(Δ∗∗1,m):y2)≅K[y2,q1,q2,…,qm], and depth(S∗∗1,m/(I(Δ∗∗1,m):y2))=m+1. Also we have S∗∗1,m/(I(Δ∗∗1,m),y2)≅K[V(S2m+1)]/I(S2m+1)[A′1,m], so by using Theorem 2.7 and Lemma 2.13 we get depth(S∗∗1,m/(I(Δ∗∗1,m),y2))=1+m. Hence by Depth Lemma depth(S∗∗1,m/I(Δ∗∗1,m))=1+m. If n=2, then (I(Δ∗∗2,m):y3)=(I(S2m+1),A2,m) and (I(Δ∗∗2,m),y3)=(I(Δ∗∗1,m),y3), we have that S∗∗2,m/(I(Δ∗∗2,m):y3)≅K[V(S2m+1)]/I(S2m+1)[y3], and S∗∗2,m/(I(Δ∗∗2,m),y3)≅S∗∗1,m/I(Δ∗∗1,m)[A′2,m]. Thus by Lemma 2.13 and Theorem 2.7, depth(S∗∗2,m/(I(Δ∗∗2,m):y3))=1+1=2. By Lemma 2.13 and case n=1, we have depth(S∗∗2,m/(I(Δ∗∗2,m),y3))=m+1+m=2m+1. Hence by Depth Lemma depth(S∗∗2,m/I(Δ∗∗2,m))=2. Let n≥3. We have (I(Δ∗∗n,m):yn+1)=(I(Δ∗∗n−2,m),An,m) and (I(Δ∗∗n,m),yn+1)=(I(Δ∗∗n−1,m),yn+1) it is easy to see that S∗∗n,m/(I(Δ∗∗n,m):yn+1)≅(S∗∗n−2,m/(I(Δ∗∗n−2,m)))[yn+1] and S∗∗n,m/(I(Δ∗∗n,m),yn+1)≅S∗∗n−1,m/I(Δ∗∗n−1,m)[A′n,m]. Thus by Lemma 2.13 we have
depth(S∗∗n,m/(I(Δ∗∗n,m):yn+1))=depth(S∗∗n−2,m/(I(Δ∗∗n−2,m)))+1 |
and
depth(S∗∗n,m/(I(Δ∗∗n,m),yn+1))=depth(S∗∗n−1,m/(I(Δ∗∗n−1,m)))+m. |
Case 1. If n≡0(mod2). Since n−2≡0(mod2) and n−1≡1(mod2) thus by induction on n, depth(S∗∗n,m/(I(Δ∗∗n,m):yn+1))=⌈n−2+22⌉+1=⌈n+22⌉, and depth(S∗∗n,m/(I(Δ∗∗n,m),yn+1))=⌈n+12⌉+m. Applying Depth Lemma we get depth(S∗∗n,m/I(Δ∗∗n,m))=⌈n+22⌉.
Case 2. If n≡1(mod2). Since n−2≡1(mod2) and n−1≡0(mod2) thus by induction on n, depth(S∗∗n,m/(I(Δ∗∗n,m):yn+1))=⌈n−12⌉+1+m=⌈n+12⌉+m and depth(S∗∗n,m/(I(Δ∗∗n,m),yn+1))=⌈n+12⌉+m. Again by Depth Lemma depth(S∗∗n,m/I(Δ∗∗n,m))=⌈n+12⌉+m.
If n=1, then proof for Stanley depth is similar to the proof for depth. If n=2, then we use Lemma 2.8 on the short exact sequence and get sdepth(S∗∗2,m/(I(Δ∗∗2,m)))≥2. Now by using Corollary 2.11 we have sdepth(S∗∗2,m/(I(Δ∗∗2,m)))≤sdepth(S∗∗2,m/(I(Δ∗∗2,m):y3)). Using Lemma 2.13 and Theorem 2.7, we have sdepth(S∗∗n,m/(I(Δ∗∗n,m):y3))=sdepth(K[V(S2m+1)]/I(S2m+1)[y3])=1+1=2, this completes the proof for case n=2. Let n≥3.
sdepth(S∗∗n,m/(I(Δ∗∗n,m):yn+1))=sdepth(S∗∗n−2,m/I(Δ∗∗n−2,m))+1 |
and
sdepth(S∗∗n,m/(I(Δ∗∗n,m),yn+1))=sdepth(S∗∗n−1,m/I(Δ∗∗n−1,m))+m. |
Case 1. If n≡0(mod2). Since n−2≡0(mod2) and n−1≡1(mod2) thus by induction on n, sdepth(S∗∗n,m/(I(Δ∗∗n,m):yn+1))=⌈n−2+22⌉+1=⌈n+22⌉, and sdepth(S∗∗n,m/(I(Δ∗∗n,m),yn+1))=⌈n+12⌉+m. By Lemma 2.8 we get sdepth(S∗∗n,m/I(Δ∗∗n,m))≥⌈n+22⌉ and by Corollary 2.11 we have sdepth(S∗∗n,m/I(Δ∗∗n,m))≤⌈n+22⌉.
Case 2. If n≡1(mod2). Since n−2≡1(mod2) and n−1≡0(mod2) thus by induction on n, sdepth(S∗∗n,m/(I(Δ∗∗n,m):yn+1))=⌈n−12⌉+1+m=⌈n+12⌉+m and sdepth(S∗∗n,m/(I(Δ∗∗n,m),yn+1))=⌈n+12⌉+m. By Lemma 2.8 we have sdepth(S∗∗n,m/I(Δ∗∗n,m))≥⌈n+12⌉+m and by Corollary 2.11 we have sdepth(S∗∗n,m/I(Δ∗∗n,m))≤⌈n+12⌉+m.
Theorem 4.2. Let n≥3 and m≥1. Then
depth(Tn,m/I(Ωn,m))=sdepth(Tn,m/I(Ωn,m))={⌈n2⌉,n≡0(mod2);⌈n−12⌉+m,n≡1(mod2). |
Proof. Consider the short exact sequence
0⟶Tn,m/(I(Ωn,m):y1)⋅y1→Tn,m/I(Ωn,m)⟶Tn,m/(I(Ωn,m),y1)⟶0. |
Let n=3. Clearly, T3,m/(I(Ω3,m):y1)≅K[y1,u21,u22,…,u2m], and T3,m/(I(Ω3,m),y1)≅S∗∗1,m/I(Δ∗∗1,m). We have depth(T3,m/(I(Ω3,m):y1))=m+1 and by Lemma 4.1, depth(T3,m/(I(Ω3,m),y1))=m+1. Hence by Depth Lemma depth(T3,m/I(Ω3,m))=m+1=m+⌈3−12⌉. If n=4, then T4,m/(I(Ω4,m):y1)≅(K[V(S2m+1)]/I(S2m+1))[y1] and T4,m/(I(Ω4,m),y1)≅S∗∗2,m/I(Δ∗∗2,m), by Lemmas 2.13, 4.1 and Theorem 2.7 depth(T4,m/(I(Ω4,m):y1))=1+1=2 and depth(T4,m/(I(Ω4,m),y1))=2. By Depth Lemma depth(T4,m/I(Ω4,m))=2=⌈42⌉. If n≥5, then Tn,m/(I(Ωn,m):y1)≅(S∗∗n−4,m/I(Δ∗∗n−4,m))[y1] and Tn,m/(I(Ωn,m),y1)≅S∗∗n−2,m/I(Δ∗∗n−2,m) By Lemma 2.13, depth(Tn,m/(I(Ωn,m):y1))=depth(S∗∗n−4,m/(I(Δ∗∗n−4,m)))+1 and similarly depth(Tn,m/(I(Ωn,m),y1))=depth(S∗∗n−2,m/I(Δ∗∗n−2,m)).
Case 1. If n≡0(mod2). Since n−4≡0(mod2) and n−2≡0(mod2) thus by Lemma 4.1, depth(Tn,m/I(Ωn,m):y1)=⌈n−22⌉+1=⌈n2⌉ and depth(Tn,m/I(Ωn,m),y1)=⌈n2⌉. Using Depth Lemma we get depth(Tn,m/I(Ωn,m))=⌈n2⌉.
Case 2. If n≡1(mod2). Since n−4≡1(mod2) and n−2≡1(mod2) thus by Lemma 4.1, depth(Tn,m/I(Ωn,m):y1)=⌈n−12⌉+m and depth(Tn,m/I(Ωn,m),y1)=⌈n−12⌉+m. Again by Depth Lemma we get depth(Tn,m/I(Ωn,m))=⌈n−12⌉+m.
When n=3, applying Lemma 2.8 instead of Depth Lemma and Lemma 4.1 and conclude that sdepth(T3,m/(I(Ω3,m)))≥m+1. For the upper bound since y1∉I(Ω3,m) by Corollary 2.11, we get sdepth(T3,m/I(Ω3,m))≤sdepth(T3,m/(I(Ω3,m):y1)). This implies that sdepth(T3,m/I(Ω3,m))≤m+1 and the result follows. When n=4, using Lemma 2.8, Corollary 2.11, Theorem 2.7, Lemmas 2.13 and 4.1 and proceeding with the same manner, we conclude that sdepth(T4,m/I(Ω4,m))=2=⌈42⌉. If n≥5, then
sdepth(Tn,m/(I(Ωn,m):y1))=sdepth(S∗∗n−4,m/(I(Δ∗∗n−4,m)))+1. |
and
sdepth(Tn,m/(I(Ωn,m),y1))=sdepth(S∗∗n−2,m/I(Δ∗∗n−2,m)). |
Proof for Stanley depth is similar we use Corollary 2.11 and Lemma 2.8 instead of Depth Lemma.
Remark 4.3. In Theorem 4.2 we have exact values for depth and Stanley depth of Tn,m/I(Ωn,m). By Theorem 2.15, we have depth(Tn,m/I(Ωn,m)),sdepth(Tn,m/I(Ωn,m))≥⌈diam(Ωn,m)3⌉. Since diam(Ωn,m)=⌈n2⌉ so we have depth(Tn,m/I(Ωn,m)),sdepth(Tn,m/I(Ωn,m))≥⌈n+26⌉. This shows that the bound given in Theorem 2.15 is too weak in this case.
In this section, we find sharp lower bounds for the edge ideal of triangular and multi triangular snake and ouroboros snake graphs. These lower bounds are good enough to show that the Conjecture 2.11 holds in all cases.
Lemma 5.1. Let n,m≥1. Then sdepth(I(Δ∗n,m))≥sdepth(S∗n,m/I(Δ∗n,m))+1+m=⌈n+12⌉+1+m.
Proof. Let us define a set, An,m={yn,un1,un2,…,unm,u(n+1)1,u(n+2)2,…,u(n+1)m}. As yn+1∉I(Δ∗n,m), we have
I(Δ∗n,m)=I(Δ∗n,m)∩¯Sn,m⨁yn+1(I(Δ∗n,m):yn)S∗n,m,where¯Sn,m=S∗n,m/(yn+1). |
Let n=1. We have I(Δ∗1,m)∩¯S1,m=(I(Sm+1))¯S1,mand(I(Δ∗1,m):y2)S∗1,m=(A1,m)S∗1,m. Therefore
sdepth(I(Δ∗1,m))≥min{sdepth(I(Sm+1))¯S1,m,sdepth(A1,m)S∗1,m}. |
By using Lemma 2.13 and Theorem 2.10, sdepth((A1,m)S∗1,m)=⌈2m+12⌉+1=m+2. Also by Lemmas 2.16 and 2.13, we get
sdepth((I(Sm+1))¯S1,m)=sdepth((I(Sm+1))(K[V(Sm+1)]))+m=1+⌈m2⌉+m. |
Thus sdepth(I(Δ∗1,m))≥m+2=⌈1+12⌉+1+m. Let n=2. We get I(¯S2,m(Δ∗1,m))¯S2,m and (I(Δ∗2,m):y3)S∗2,m=(I(Sm+1),A2,m)¯S2,m[y3]. This implies sdepth(I(Δ∗2,m))≥min{sdepth(I(Δ∗1,m))¯S2,m,sdepth(I(Sm+1),A2,m)¯S2,m[y3]}. Now Lemma 2.13 and by [3,Theorem 1.3],
sdepth((I(Sm+1),A2,m)¯S2,m[y3])≥min{sdepth((I(Sm+1))K[V(Sm+1)])+2m+1,sdepth((A2,m)K[A2,m])+sdepth(K[V(Sm+1)]/I(Sm+1))}+1. |
Now using Lemma 2.16, Theorems 2.10 and 2.7, we have
sdepth((I(Sm+1),A2,m)¯S2,m[y3])≥min{⌈5m+42⌉,⌈2m+32⌉}+1=⌈2m+52⌉. |
Also by the case n=1 and Lemma 2.13, we get
sdepth((I(Δ∗1,m))¯S2,m)=sdepth((I(Δ∗1,m))S∗1,m)+m≥2m+2. |
Thus
sdepth(I(Δ∗2,m))≥⌈2m+52⌉=⌈2m+2+32⌉=⌈2+12⌉+1+m. |
Let n≥3. We have I(Δ∗n,m)∩¯Sn,m=(I(Δ∗n−1,m))¯Sn,m,and(I(Δ∗n,m):yn+1)S∗n,m=((I(Δ∗n−2,m),An,m)¯Sn,m[yn+1]).Thus by induction on n, Lemmas 2.14 and 2.13, we have sdepth((I(Δ∗n−2,m),An,m)¯Sn,m[yn+1])≥sdepth((S∗n−2,m/I(Δ∗n−2,m))S∗n−2,m)+sdepth((An,m)K[An,m])+1. Now by Theorem 2.10, and Proposition 3.1, we have sdepth((I(Δ∗n−2,m),An,m)¯Sn,m[yn+1])≥⌈n−12⌉+⌈2m+12⌉+1=⌈n+12⌉+⌈2m+12⌉=⌈n+12⌉+m+1. Moreover, by induction on n and Lemma 2.13, we get
sdepth((I(Δ∗n−1,m))¯Sn,m)=sdepth((I(Δ∗n−1,m))S∗n−1,m)+m≥⌈n2⌉+1+m+m>⌈n+12⌉+1+m. |
Thus
sdepth(I(Δ∗n,m))≥⌈n+12⌉+1+m. |
Theorem 5.2. If n=1 and m≥1, then sdepth(I(Δ1,m))≥sdepth(S1,m/I(Δ1,m))+⌈m2⌉=1+⌈m2⌉. And if n≥2 and m≥1, then sdepth(I(Δn,m))≥⌈n+12⌉+⌈m+12⌉≥sdepth(Sn,m/I(Δn,m))+⌈m+12⌉.
Proof. Let Bn,m={yn,un1,un2,…,unm}. As yn+1∉I(Δn,m), thus we have
I(Δn,m)=I(Δn,m)∩S′n,m⨁yn+1(I(Δn,m):yn+1)Sn,m,whereS′n,m=Sn,m/(yn+1). |
Case 1. Let n=1. We have I(Δ1,m)∩S′1,m=I(Sm+1)S′1,mand(I(Δ1,m):y2)S1,m=((B1,m)S1,m). Thus sdepth(I(Δ1,m))≥min{sdepth(I(Sm+1))S′1,m,sdepth((B1,m)S1,m)}. By Lemma 2.13, we have sdepth((B1,m)S1,m)=⌈m+12⌉+1=⌈m+32⌉. Now by Lemma 2.16, we have sdepth((I(Δ∗1,m))S1,m)=sdepth((I(Sm+1)K[V(Sm+1)]))=1+⌈m2⌉. Hence,sdepth(I(Δ1,m))≥1+⌈m2⌉.
Case 2. Let n=2. We get I(Δ2,m)∩S′2,m=(I(Δ∗1,m))S′2,m and (I(Δ2,m):y3)S2,m=((I(Sm+1),B2,m)S′2,m[y3]). Thus
sdepth(I(Δ2,m))≥min{sdepth(I(Δ∗1,m))S′2,m,sdepth((I(Sm+1),B2,m)S′2,m[y3])}. |
By Lemma 2.13 and [3,Theorem 1.3],
sdepth((I(Sm+1),B2,m)S′2,m[y3])≥min{sdepth((I(Sm+1))K[V(Sm+1)])+m+1,sdepth((B2,m)K[B2,m])+sdepth((K[V(Sm+1)]/I(Sm+1))K[V(Sm+1)])}+1. |
Now by Theorems 2.10 and 2.7, we get
sdepth((I(Sm+1),B2,m)S′2,m[y3])≥min{⌈3m+42⌉,⌈m+32⌉}+1=⌈m+52⌉. |
Now by Lemma 5.1, we have sdepth((I(Δ∗1,m))S′2,m)=sdepth((I(Δ∗1,m))S∗1,m)≥m+2. Hence
sdepth(I(Δ2,m))≥⌈m+52⌉=⌈2+12⌉+⌈m+12⌉. |
Finally, consider n≥3. We have I(Δn,m)∩S′n,m=(I(Δ∗n−1,m))S′n,mand(I(Δn,m):yn+1)Sn,m=((I(Δ∗n−2,m),Bn,m)S′n,m[yn+1]). By Lemma 5.1, Lemmas 2.14 and 2.13, we have
sdepth((I(Δ∗n−2,m),Bn,m)S′n,m[yn+1])≥sdepth((S∗n−2,m/I(Δ∗n−2,m))S∗n−2,m)+sdepth((Bn,m)K[Bn,m])+1. |
Now by Theorem 2.10 and Lemma 3.1, we obtain
sdepth((I(Δ∗n−2,m),Bn,m)S′n,m[yn+1])≥⌈n−12⌉+⌈m+12⌉+1=⌈n+12⌉+⌈m+12⌉. |
Also by Lemma 5.1, we get
sdepth((I(Δ∗n−1,m))S′n,m)=sdepth((I(Δ∗n−1,m))S∗n−1,m)≥⌈n2⌉+1+m≥⌈m+12⌉+⌈n+12⌉. |
To sum up
sdepth(I(Δn,m))≥⌈n+12⌉+⌈m+12⌉. |
Lemma 5.3. Let n=1 and m≥1, then sdepth(I(Δ∗∗1,m))≥2m+1. Let n≥2 and m≥1. If n≡0(mod2), then sdepth(I(Δ∗∗n,m))≥sdepth(S∗∗n,m/I(Δ∗∗n,m))+1+m=⌈n+22⌉+1+m. And if n≡1(mod2), then sdepth(I(Δ∗∗n,m))≥sdepth(S∗∗n,m/I(Δ∗∗n,m))+2m=⌈n+12⌉+1+2m.
Proof. Let An,m={yn,un1,un2,…,unm,u(n+1)1,u(n+1)2,…,u(n+1)m}. As yn+1∉I(Δ∗∗n,m), therefore we have
I(Δ∗∗n,m)=I(Δ∗∗n,m)∩S″n,m⨁yn+1(I(Δ∗∗n,m):yn+1)S∗∗n,m,whereS″n,m=S∗∗n,m/(yn+1). |
Case 1. Let n=1. We have I(Δ∗∗1,m)∩S″1,m=I(S2m+1)S″1,m and (I(Δ∗∗1,m):y2)S∗∗1,m=(A1,m)S∗∗1,m. Therefore, sdepth(I(Δ∗∗1,m))≥min{sdepth(I(S2m+1)S″1,m),sdepth((A1,m)S∗∗1,m)}. By Lemma 2.13 and Theorem 2.10 we have
sdepth(A1,m)S∗∗1,m=sdepth((A1,m)K[A1,m])+m+1=⌈2m+12⌉+m+1=2m+2. |
Now by Lemmas 2.16 and 2.13, we get
sdepth(I(S2m+1)S″1,m)=sdepth(I(S2m+1)K[V(S2m+1)])+m=1+⌈2m2⌉+m=2m+1. |
As a result sdepth(I(Δ∗∗1,m))≥2m+1.
Case 2. Now we will prove this result by induction on n. Let n=2. I(Δ∗∗2,m)∩S″2,m=(I(Δ∗∗1,m))S″2,mand(I(Δ∗∗2,m):y3)S∗∗2,m=(I(S2m+1,A2,m)S″2,m[y3]). Consequently
sdepth(I(Δ∗∗2,m))≥min{sdepth((I(Δ∗∗1,m))S″2,m),sdepth(I(S2m+1,A2,m)S″2,m[y3])}. |
By Lemma 2.13 and [3,Theorem 1.3],
sdepth(I(S2m+1,A2,m)S″2,m[y3])≥min{sdepth((I(S2m+1)K[V(S2m+1)])+2m+1,sdepth((A2,m)K[A2,m])+sdepth((K[V(S2m+1)]/I(S2m+1)K[V(S2m+1)])}+1. |
Now by Lemma 2.16, Theorems 2.10 and 2.7, we have
sdepth(I(S2m+1,A2,m)S″2,m[y3])≥min{m+1+2m+1,⌈2m+12⌉+1=m+2}+1=m+3. |
Now by the Case 1 and Lemma 2.13, we get sdepth((I(Δ∗∗1,m))S″2,m)=sdepth((I(Δ∗∗1,m))S∗∗1,m)+m≥3m+1. Tosumup,sdepth(I(Δ∗∗2,m))≥m+3. In general, for n≥3. We have
I(Δ∗∗n,m)∩S″n,m=(I(Δ∗∗n−1,m))S″n,mand(I(Δ∗∗n,m):yn+1)S∗∗n,m=((I(Δ∗∗n−2,m),An,m)S″n,m[yn+1]). |
By induction on n, Lemmas 2.14 and 2.13,
sdepth((I(Δ∗∗n−2,m),An,m)S″n,m[yn+1])≥sdepth((S∗∗n−2,m/I(Δ∗∗n−2,m))S∗∗n−2,m)+sdepth(An,mK[An,m])+1. |
Case 2(a). If n≡0(mod2), then n−1≡1(mod2) and n−2≡0(mod2). By Theorem 2.10 and Lemma 4.1, we have sdepth((I(Δ∗∗n−2,m),An,m)S″n,m[yn+1])≥⌈n2⌉+m+1+1=⌈n+22⌉+m+1. Also by induction on n and Lemma 2.13, we get
sdepth((I(Δ∗∗n−1,m))S″n,m)=sdepth((I(Δ∗∗n−1,m))S∗∗n−1,m)+m≥⌈n+22⌉+3m>⌈n+22⌉+m+1. |
Thus sdepth(I(Δ∗∗n,m))≥⌈n+22⌉+1+m.
Case 2(b). If n≡1(mod2), then n−1≡0(mod2) and n−2≡1(mod2). By Theorem 2.10 and Lemma 4.1, we have sdepth((I(Δ∗∗n−2,m),An,m)S″n,m[yn+1])≥⌈n−12⌉+m+m+1+1=⌈n+12⌉+2m+1. Also by induction on n and Lemma 2.13, we get
sdepth((I(Δ∗∗n−1,m))S″n,m)=sdepth((I(Δ∗∗n−1,m))S∗∗n−1,m)+m≥⌈n+12⌉+1+2m. |
Thus sdepth(I(Δ∗∗n,m))=⌈n+12⌉+1+2m.
Theorem 5.4. Let n=3 and m≥1. Then sdepth(I(Ω3,m))≥sdepth(T3,m/I(Ω3,m))+m=2m+1. Let n≥4 and m≥1.
sdepth(I(Ωn,m))≥sdepth(Tn,m/I(Ωn,m))+1+m={⌈n2⌉+1+m,n≡0(mod2);⌈n+12⌉+2m,n≡1(mod2). |
Proof. Let Cn,m={y2,yn,u11,u12,…,um,un1,un2,…,unm}. Since y1∉I(Ωn,m), so we have
I(Ωn,m)=I(Ωn,m)∩T′n,m⨁y1(I(Ωn,m):y1)Tn,m,whereT′n,m=Tn,m/(y1). |
Let n=3. It can be seen that I(Ω3,m)∩T′3,m≅(I(Δ∗∗1,m))T′3,m and I(Ω3,m):y1)T3,m≅(C3,m)T3,m. Hence
sdepth(I(Ω3,m))≥min{sdepth((I(Δ∗∗1,m))T′3,m),sdepth((C3,m)T3,m)}. |
By Lemma 2.13 and by Theorem 2.10, sdepth((C3,m)T3,m)=sdepth((C3,m)K[C3,m])+m+1=2m+1. AlsobyLemma5.3,sdepth((I(Δ∗∗1,m))T′3,m)=sdepth((I(Δ∗∗1,m))S∗∗1,m)≥2m+1. Thussdepth(I(Ω3,m))≥2m+1. Let n=4. we get I(Ω4,m)∩T′4,m=(I(Δ∗∗2,m))T′4,mand(I(Ω4,m):y1)T4,m=((I(S2m+1),C4,m)T′4,m[y1]). Thus
sdepth(I(Ω4,m))≥min{sdepth((I(Δ∗∗2,m))T′4,m),sdepth((I(S2m+1),C4,m)T′4,m[y1])}. |
By Lemma 2.13 and [3,Theorem 1.3],
sdepth((I(S2m+1),C4,m)T′4,m[y1])≥min{sdepth((I(S2m+1))K[V(S2m+1)])+2m+2,sdepth((C4,m)K[C4,m])+sdepth((K[V(S2m+1)]/I(S2m+1))K[V(S2m+1)])}+1. |
And by Lemma 2.16, Theorems 2.10 and 2.7, we have
sdepth((I(S2m+1),C4,m)T′4,m[y1])≥min{3m+3,m+1+1}+1=m+3. |
Now by Lemma 5.3, we get sdepth((I(Δ∗∗2,m))T′4,m)≅sdepth((I(Δ∗∗2,m))S∗∗2,m)≥m+3. Thus sdepth(I(Ω4,m))≥m+3. In general, for n≥5. It is clear that
I(Ωn,m)∩T′n,m=(I(Δ∗∗n−2,m))T′n,mand((I(Ωn,m):y1)Tn,m)=((I(Δ∗∗n−4,m),Cn,m)T′n,m[y1]). |
By Lemmas 5.3, 2.14 and 2.13, we have
sdepth((I(Δ∗∗n−4,m),Cn,m)T′n,m[y1])≥sdepth((S∗∗n−4,m/I(Δ∗∗n−4,m))S∗∗n−4,m)+sdepth((Cn,m)K[Cn,m])+1. |
Case 1. if n≡0(mod2), then n−2≡0(mod2) and n−4≡0(mod2). By Theorem 2.10 and Lemma 4.1 sdepth((I(Δ∗∗n−4,m),Cn,m)T′n,m[y1])≥⌈n−22⌉+m+1+1=⌈n2⌉+m+1. Also by Lemma 5.3, sdepth((I(Δ∗∗n−2,m))T′n,m)≅sdepth((I(Δ∗∗n−2,m))S∗∗n−2,m)≥⌈n2⌉+1+m. Thus sdepth(I(Ωn,m))≥⌈n2⌉+1+m.
Case 2. If n≡1(mod2), then n−2≡1(mod2) and n−4≡1(mod2). By Theorem 2.10 and Lemma 4.1 sdepth((I(Δ∗∗n−4,m),Cn,m)T′n,m[y1])≥⌈n−32⌉+m+m+1+1=⌈n+12⌉+2m. Also by Lemma 5.3, sdepth((I(Δ∗∗n−2,m))T′n,m)≅sdepth((I(Δ∗∗n−2,m))T∗n−2,m)≥⌈n−12⌉+1+2m=⌈n+12⌉+2m. Thus sdepth(I(Ωn,m))≥⌈n+12⌉+2m.
In this paper we consider the residue class rings of the edge ideals associated to the triangular and multi triangular snake and ouroboros snake graphs. In most of the cases, we give precise values for depth and Stanley depth of these residue class rings. We also prove that Stanley depth of the edge ideal of any graph considered in this paper is an upper bounds for the Stanley depth of its residue class ring.
The authors declare that there is no conflict of interest in this paper.
[1] | A. Alipour, A. Tehranian, Depth and Stanley depth of edge ideals of star graphs, Int. J. Appl. Math. Stat., 56 (2017), 63–69. |
[2] |
C. Biro, D. M. Howard, M. T. Keller, W. T. Trotter, S. J. Young, Interval partitions and Stanley depth, J. Comb. Theory A, 117 (2010), 475–482. https://doi.org/10.1016/j.jcta.2009.07.008 doi: 10.1016/j.jcta.2009.07.008
![]() |
[3] | M. Cimpoeas, Several inequalities regarding Stanley depth, Rom. J. Math. Comput. Sci., 2 (2012), 28–40. |
[4] |
M. Cimpoeas, Stanley depth of monomial ideals with small number of generators, Cent. Eur. J. Math., 7 (2009), 629–634. https://doi.org/10.2478/s11533-009-0037-0 doi: 10.2478/s11533-009-0037-0
![]() |
[5] |
M. Cimpoeas, On the Stanley depth of edge ideals of line and cyclic graphs, Rom. J. Math. Comput. Sci., 5 (2015), 70–75. https://doi.org/10.2478/s11533-009-0037-0 doi: 10.2478/s11533-009-0037-0
![]() |
[6] |
B. Curtis, Block-cutvertex trees and block-cutvertex partitions, Discrete Math., 256 (2002), 35–54. https://doi.org/10.1016/S0012-365X(01)00461-7 doi: 10.1016/S0012-365X(01)00461-7
![]() |
[7] | N. U. Din, M. Ishaq, Z. Sajid, Values and bounds for depth and Stanley depth of some classes of edge ideals, AIMS Math., 6 (2021), 8544–8566. |
[8] |
A. M. Duval, B. Goeckneker, C. J. Klivans, J. L. Martine, A non-partitionable Cohen-Macaulay simplicial complex, Adv. Math., 299 (2016), 381–395. https://doi.org/10.1016/j.aim.2016.05.011 doi: 10.1016/j.aim.2016.05.011
![]() |
[9] |
L. Fouli, S. Morey, A lower bound for depths of powers of edge ideals, J. Algebr. Comb., 42 (2015), 829–848. https://doi.org/10.1007/s10801-015-0604-3 doi: 10.1007/s10801-015-0604-3
![]() |
[10] |
J. Herzog, M. Vladoiu, X. Zheng, How to compute the Stanley depth of a monomial ideal, J. Algebra, 322 (2009), 3151–3169. https://doi.org/10.1016/j.jalgebra.2008.01.006 doi: 10.1016/j.jalgebra.2008.01.006
![]() |
[11] | J. Herzog, A survey on Stanley depth, Springer, Heidelberg, 2083 (2013), 335. |
[12] |
Z. Iqbal, M. Ishaq, Depth and Stanley depth of edge ideals associated to some line graphs, AIMS Math., 4 (2019), 686–698. https://doi.org/10.3934/math.2019.3.686 doi: 10.3934/math.2019.3.686
![]() |
[13] |
Z. Iqbal, M. Ishaq, M. A. Binyamin, Depth and Stanley depth of the edge ideals of the strong product of some graphs, Hacet. J. Math. Stat., 50 (2021), 92–109. https://doi.org/10.15672/hujms.638033 doi: 10.15672/hujms.638033
![]() |
[14] |
M. Ishaq, M. I. Qureshi, Upper and lower bounds for the Stanley depth of certain classes of monomial ideals and their residue class rings, Commun. Algebra, 41 (2013), 1107–1116. https://doi.org/10.1080/00927872.2011.630708 doi: 10.1080/00927872.2011.630708
![]() |
[15] |
M. Ishaq, Values and bounds for the Stanley depth, Carpath. J. Math., 27 (2011), 217–224. https://doi.org/10.37193/CJM.2011.02.06 doi: 10.37193/CJM.2011.02.06
![]() |
[16] |
A. Iqbal, M. Ishaq, Depth and Stanley depth of the quotient rings of edge ideals of some lobster trees and unicyclic graphs, Turk. J. Math., 46 (2022), 1886–1896. https://doi.org/10.55730/1300-0098.3239 doi: 10.55730/1300-0098.3239
![]() |
[17] |
M. T. Keller, S. J. Young, Combinatorial reductions for the Stanley depth of I and S/I, Electron J. Comb., 24 (2017), 1–16. https://doi.org/10.48550/arXiv.1702.00781 doi: 10.48550/arXiv.1702.00781
![]() |
[18] |
P. Mahalank, B. K. Majhi, S. Delen, I. N. Cangul, Zagreb indices of square snake graphs, Montes Taurus J. Pure Appl. Math., 3 (2021), 165–171. https://doi.org/10.37236/6783 doi: 10.37236/6783
![]() |
[19] |
P. Mahalank, B. K. Majhi, I. N. Cangul, Several zagreb indices of double square snake graphs, Creat. Math. Inform., 30 (2021), 181–188. https://doi.org/10.37193/CMI.2021.02.08 doi: 10.37193/CMI.2021.02.08
![]() |
[20] | A. Popescu, Special Stanley decomposition, Bull. Math. Soc. Sci. Math. Roumanie, 52 (2010), 363–372. |
[21] |
D. Popescu, M. I. Qureshi, Computing the Stanley depth, J. Algebra, 323 (2010), 2943–2959. https://doi.org/10.1016/j.jalgebra.2009.11.025 doi: 10.1016/j.jalgebra.2009.11.025
![]() |
[22] |
M. R. Pournaki, S. Fakhari, S. Yassemi, Stanley depth of powers of the edge ideals of a forest, P. Am. Math. Soc., 141 (2013), 3327–3336. https://doi.org/10.1090/S0002-9939-2013-11594-7 doi: 10.1090/S0002-9939-2013-11594-7
![]() |
[23] |
A. Rauf, Depth and Stanley depth of multigraded modules, Commun. Algebra, 38 (2010), 773–784. https://doi.org/10.1080/00927870902829056 doi: 10.1080/00927870902829056
![]() |
[24] | G. Rinaldo, An algorithm to compute the Stanley depth of monomial ideals, Le Mat., 63 (2008), 243–256. |
[25] | A. Rosa, Cyclic Steiner triple systems and labelings of triangular cacti, Scientia, 5 (1967), 87–95. |
[26] |
P. Selvaraju, P. Balaganesan, L. Vasu, M. L. Suresh, Even sequential harmonious labeling of some cycle related graphs, Int. J. Pure Appl. Math., 97 (2014), 395–407. https://doi.org/10.12732/ijpam.v97i4.2 doi: 10.12732/ijpam.v97i4.2
![]() |
[27] |
R. P. Stanley, Linear Diophantine equations and local cohomology, Invent. Math., 68 (1982), 175–193. https://doi.org/10.1007/BF01394054 doi: 10.1007/BF01394054
![]() |
[28] | CoCoA Team, CoCoA: A system for doing computations in commutative algebra. Available from: http://cocoa.dima.unige.it. |