Algebraic properties of the binomial edge ideal of complete bipartite graph

preprint2013arXivOpen access

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 xiyj−xjyi,1≤i<j≤n,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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.