English

Algebraic properties of the binomial edge ideal of complete bipartite graph

Commutative Algebra 2013-01-07 v1

Abstract

Let JGJ_G denote the binomial edge ideal of a connected undirected graph on nn vertices. This is the ideal generated by the binomials xiyjxjyi,1i<jn,x_iy_j - x_jy_i, 1\leq i < j \leq n, in the polynomial ring S=K[x1,...,xn,y1,...,yn]S= K[x_1,...,x_n,y_1,...,y_n] where {i,j}\{i,j\} is an edge of GG. We study the arithmetic properties of S/JGS/J_G for GG, the complete bipartite graph. In particular we compute dimensions, depths, Castelnuovo-Mumford regularities, Hilbert functions and multiplicities of them. As main results we give an explicit description of the modules of deficiencies, the duals of local cohomology modules, and prove the purity of the minimal free resolution of S/JGS/J_G.

Keywords

Cite

@article{arxiv.1301.0789,
  title  = {Algebraic properties of the binomial edge ideal of complete bipartite graph},
  author = {Peter Schenzel and Sohail Zafar},
  journal= {arXiv preprint arXiv:1301.0789},
  year   = {2013}
}

Comments

15 pages, Accepted in An. St. Univ. Ovidius Constanta, Ser. Mat