Details:
Title  Generalized binomial edge ideals  Author(s)  Johannes Rauh  Type  Article in Journal  Abstract  This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gröbner basis can be computed by studying paths in the graph. Since these Gröbner bases are squarefree, generalized binomial edge ideals are radical. To find the primary decomposition a combinatorial problem involving the connected components of subgraphs has to be solved. The irreducible components of the solution variety are all rational.  Keywords  Binomial ideals, Binomial edge ideals, Graphs, Primary decomposition, Conditional independence ideals  ISSN  01968858 
URL 
http://www.sciencedirect.com/science/article/pii/S019688581200108X 
Language  English  Journal  Advances in Applied Mathematics  Volume  50  Number  3  Pages  409  414  Year  2013  Edition  0  Translation 
No  Refereed 
No 
