Generalized binomial edge ideals (Q1940424): Difference between revisions

The concept of \textit{binomial edge ideal} was introduced by \textit{J. Herzog} et al. [Adv. Appl. Math. 45, No. 3, 317--333 (2010; Zbl 1196.13018)] and also independently by \textit{M. Ohtani} [Commun. Algebra 39, No. 3, 905--917 (2011; Zbl 1225.13028)]. Let \(R = K[x_1, \dots , x_n, y_1, \dots , y_n]\) be the polynomial ring with coefficients in a field \(K\). Further, let \(G\) be a graph. The ideal of \(R\) generated by the binomials \(f_{ij} = x_iy_j- x_jy_i\) such that \(i < j\) and \(\{i, j\}\) is an edge of \(G\), is called the binomial edge ideal of \(G\). In the paper under review, the author defines the new concept of \textit{generalized binomial edge ideal} for a given graph. This arises from the study of conditional independence ideals. Furthermore, he shows that a Gröbner basis of the generalized binomial edge ideal of a graph can be determined by studying the paths in the graph. Finally, the author deals with the primary decomposition of such an ideal, and he proves that this problem is equivalent to solving a combinatorial problem related to the graph.