Algebraic properties of the binomial edge ideal of a complete bipartite graph

By Peter Schenzel, Sohail Zafar. 2013

55 citations recorded by the source corpus.

Abstract Let JG denote the binomial edge ideal of a connected undirected graph on n vertices. This is the ideal generated by the binomials xiyj − xjyi, 1 ≤ i < j≤ n, in the polynomial ring S = K[x1, . . . , xn, y1, . . . , yn] where {i, j} is an edge of G. We study the arithmetic properties of S/JG for G, 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/JG.

Subfields: Algebra and Number Theory, Computational Theory and Mathematics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/a34dacb47411c48d1bc4cbd687c6a53cf880df80