Abstract:We compute the Stanley depth for the quotient ring of a square free Veronese ideal and we give some bounds for the Stanley depth of a square free Veronese ideal. In particular, it follows that both satisfy the Stanley's conjecture.
“…I(P n,3 ) = I(P n,3 ) ∩ R n ⊕ ⊕ n−1 l=1 y n−l (I(P n,3 ) ∩ R l : y n−l )R l ⊕ y n (I(P n,3 ) : y n )S n, 3 . Therefore where J 2 := (x n−2 , z n−2 , x n−1 , z n−1 , x n−3 , y n−3 , z n−3 ), using the same arguments as in case (1) we have sdepth((I(P n,3 ) ∩ R 2 : y n−2 )R 2 ) > ⌈ n 3 ⌉.…”
Section: Definitions and Notationmentioning
confidence: 99%
“…Let n ≥ 3, if n ≡ 0, 2 (mod 3), then depth(S n,3 /I(C n,3 )) = sdepth(S n,3 /I(C n,3 )) = ⌈ n−1 3 ⌉, and if n ≡ 1 (mod 3), then ⌈ n−1 3 ⌉ ≤ depth(S n,3 /I(C n,3 )), sdepth(S n,3 /I(C n,3 )) ≤ ⌈ n 3 ⌉. Proof.We first prove the result for depth.…”
mentioning
confidence: 99%
“…Let n ≥ 6, if n ≡ 0 (mod 3), then sdepth(S ⋄ n,3 /I(C ⋄ n,3 )) = ⌈ n−2 3 ⌉. Otherwise, ⌈ n−2 3 ⌉ ≤ sdepth(S ⋄ n,3 /I(C ⋄ n,3 )) ≤ ⌈ n 3 ⌉.…”
mentioning
confidence: 99%
“….4) 0 −→ S ⋄ n,3 /(I(C ⋄ n,3 ) : z 1 ) ·z1 − − → S ⋄ n,3 /I(C ⋄ n,3 ) −→ S ⋄ n,3 /(I(C ⋄ n,3 ), z 1 ) −→ 0, by Lemma 2.5 sdepth(S ⋄ n,3 /I(C ⋄ n,3 )) ≥ min{sdepth(S ⋄ n,3 /(I(C ⋄ n,3 ) : z 1 )), sdepth(S ⋄ n,3 /(I(C ⋄ n,3 ), z 1 ))}.…”
In this paper we study depth and Stanley depth of the edge ideals and quotient rings of the edge ideals, associated to classes of graphs obtained by taking the strong product of two graphs. We consider the cases when either both graphs are arbitrary paths or one is an arbitrary path and the other is an arbitrary cycle. We give exact formulae for values of depth and Stanley depth for some subclasses. We also give some sharp upper bounds for depth and Stanley depth in the general cases.
“…I(P n,3 ) = I(P n,3 ) ∩ R n ⊕ ⊕ n−1 l=1 y n−l (I(P n,3 ) ∩ R l : y n−l )R l ⊕ y n (I(P n,3 ) : y n )S n, 3 . Therefore where J 2 := (x n−2 , z n−2 , x n−1 , z n−1 , x n−3 , y n−3 , z n−3 ), using the same arguments as in case (1) we have sdepth((I(P n,3 ) ∩ R 2 : y n−2 )R 2 ) > ⌈ n 3 ⌉.…”
Section: Definitions and Notationmentioning
confidence: 99%
“…Let n ≥ 3, if n ≡ 0, 2 (mod 3), then depth(S n,3 /I(C n,3 )) = sdepth(S n,3 /I(C n,3 )) = ⌈ n−1 3 ⌉, and if n ≡ 1 (mod 3), then ⌈ n−1 3 ⌉ ≤ depth(S n,3 /I(C n,3 )), sdepth(S n,3 /I(C n,3 )) ≤ ⌈ n 3 ⌉. Proof.We first prove the result for depth.…”
mentioning
confidence: 99%
“…Let n ≥ 6, if n ≡ 0 (mod 3), then sdepth(S ⋄ n,3 /I(C ⋄ n,3 )) = ⌈ n−2 3 ⌉. Otherwise, ⌈ n−2 3 ⌉ ≤ sdepth(S ⋄ n,3 /I(C ⋄ n,3 )) ≤ ⌈ n 3 ⌉.…”
mentioning
confidence: 99%
“….4) 0 −→ S ⋄ n,3 /(I(C ⋄ n,3 ) : z 1 ) ·z1 − − → S ⋄ n,3 /I(C ⋄ n,3 ) −→ S ⋄ n,3 /(I(C ⋄ n,3 ), z 1 ) −→ 0, by Lemma 2.5 sdepth(S ⋄ n,3 /I(C ⋄ n,3 )) ≥ min{sdepth(S ⋄ n,3 /(I(C ⋄ n,3 ) : z 1 )), sdepth(S ⋄ n,3 /(I(C ⋄ n,3 ), z 1 ))}.…”
In this paper we study depth and Stanley depth of the edge ideals and quotient rings of the edge ideals, associated to classes of graphs obtained by taking the strong product of two graphs. We consider the cases when either both graphs are arbitrary paths or one is an arbitrary path and the other is an arbitrary cycle. We give exact formulae for values of depth and Stanley depth for some subclasses. We also give some sharp upper bounds for depth and Stanley depth in the general cases.
“…Remark 1.3. The (multigraded) Stanley depth of I n,d has been conjectured (see [6] and [10]) to be equal to d + n d+1 / n d . M. Keller et al [10] and M. Ge et al [8] partially confirmed this conjecture but it is still open.…”
In this paper, we obtain explicit formulas for the Hilbert series and Hilbert depth of squarefree Veronese ideals in a standard graded polynomial ring.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.