Algebraic properties of the binomial edge ideal of complete bipartite graph
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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.