Algebraic properties of the binomial edge ideal of complete bipartite graph
arXiv:1301.0789
Abstract
Let denote the binomial edge ideal of a connected undirected graph on vertices. This is the ideal generated by the binomials in the polynomial ring where is an edge of . We study the arithmetic properties of for , 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 .
15 pages, Accepted in An. St. Univ. Ovidius Constanta, Ser. Mat