English

Depth and Extremal Betti Number of Binomial Edge Ideals

Commutative Algebra 2019-10-07 v2

Abstract

Let GG be a simple graph on the vertex set [n][n] and JGJ_G be the corresponding binomial edge ideal. Let G=vHG=v*H be the cone of vv on HH. In this article, we compute all the Betti numbers of JGJ_G in terms of Betti number of JHJ_H and as a consequence, we get the Betti diagram of wheel graph. Also, we study Cohen-Macaulay defect of S/JGS/J_G in terms of Cohen-Macaulay defect of SH/JHS_H/J_H and using this we construct a graph with Cohen-Macaulay defect qq for any q1q\geq 1. We obtain the depth of binomial edge ideal of join of graphs. Also, we prove that for any pair (r,b)(r,b) of positive integers with 1b<r1\leq b< r, there exists a connected graph GG such that reg(S/JG)=rreg(S/J_G)=r and the number of extremal Betti number of S/JGS/J_G is bb.

Keywords

Cite

@article{arxiv.1904.00829,
  title  = {Depth and Extremal Betti Number of Binomial Edge Ideals},
  author = {Arvind Kumar and Rajib Sarkar},
  journal= {arXiv preprint arXiv:1904.00829},
  year   = {2019}
}

Comments

16 pages, Typos corrected, To appear in Mathematische Nachrichten