Depth and Krull dimension of Binomial edge ideals
Takayuki Hibi, Sara Saeedi Madani
Abstract
Let JG denote the binomial edge ideal of a finite graph G in the polynomial ring S. We determine all triples (n,t,d) with n≥ 3 for which there exists a finite connected graph G on n vertices with depth(S/JG)=t and (S/JG)=d.
Create a lesson
Related papers
On the Stable category of maximal Cohen-Macaulay modules over Gorenstein rings-II
Tony J. Puthenpurakal
Symbolic powers of the ideal ofn general points in Pn-1
Ralf Fröberg, Boris Shapiro
Density functions for filtrations of graded ideals
Suprajo Das, Hoang Le Truong
Finitistic injective dimension exceeding finitistic projective dimension for a commutative ring
Liang Chen
A criterion for determinantal presentations of numerical semigroup rings
Satoshi Murai, Kou Takahashi
Normality of ideals beyond the standard graded setting: families from numerical semigroup rings
Naoyuki Matsuoka