Name
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 Grobner basis can be computed by studying paths in the graph. Since these Grobner bases are square-free, 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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.aam.2012.08.009 | Advances in Applied Mathematics |
Keywords | Field | DocType |
generalized binomial edge ideal,irreducible component,grobner basis,binomial ideal,connected component,grobner base,binomial edge ideal,combinatorial problem,conditional independence ideal,finite vertex set,graphs | Discrete mathematics,Combinatorics,Fractional ideal,Binomial approximation,Primary decomposition,Gaussian binomial coefficient,Connected component,Gröbner basis,Binomial coefficient,Boolean prime ideal theorem,Mathematics | Journal |
Volume | Issue | ISSN |
50 | 3 | Advances in applied mathematics, 50 (2013) 3, p. 409-414 |
Citations | PageRank | References |
1 | 0.43 | 2 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Johannes Rauh | 1 | 152 | 16.63 |