Binomial edge ideals and conditional independence statements

  title={Binomial edge ideals and conditional independence statements},
  author={J{\"u}rgen Herzog and Takayuki Hibi and Freyja Hreinsd{\'o}ttir and Thomas Kahle and Johannes Rauh},
  journal={Adv. Appl. Math.},
Binomial Edge Ideals and Related Ideals
In this chapter we consider classes of binomial ideals which are naturally attached to finite simple graphs. The first of these classes are the binomial edge ideals. These ideals may also be viewed
Generalized binomial edge ideals
  • J. Rauh
  • Mathematics
    Adv. Appl. Math.
  • 2013
Cohen–Macaulay binomial edge ideals and accessible graphs
The cut sets of a graph are special sets of vertices whose removal disconnects the graph. They are fundamental in the study of binomial edge ideals, since they encode their minimal primary
Combinatorial And Arithmetic Study Of Binomial Edge Ideal
Let JG denote the binomial edge ideal of a connected undirected graph G 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;
Algebraic properties of the binomial edge ideal of a 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,
Binomial edge ideals of regularity 3
Almost complete intersection binomial edge ideals and their Rees algebras
Some Computations for Binomial Edge Ideals and Koszul Duality
We make some observations on binomial edge ideals, with the characterization of their Koszulness as motivation. Inspired by results of Ene, Herzog and Hibi, we discuss building Koszul graphs from


Binomial Ideals
We investigate the structure of ideals generated by binomials (polynomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many
Distributive Lattices, Bipartite Graphs and Alexander Duality
A certain squarefree monomial ideal HP arising from a finite partially ordered set P will be studied from viewpoints of both commutative algbera and combinatorics. First, it is proved that the
Graphs and Ideals Generated by Some 2-Minors
Let G be a finite graph on [n] = {1, 2,…, n}, X a 2 × n matrix of indeterminates over a field K, and S = K[X] a polynomial ring over K. In this article, we study about ideals I G of S generated by
Acyclic orientations of graphs
Cohen-macaulay graphs
For a graph G we consider its associated ideal I(G). We uncover large classes of Cohen-Macaulay (=CM) graphs, in particular the full subclass of CM trees is presented. A formula for the Krull
Lattice Walks and Primary Decomposition
This paper shows how primary decompositions of an ideal can give useful descriptions of components of a graph arising in problems from combinatorics, statistics, and operations research. We begin
Digraphs - theory, algorithms and applications
Digraphs is an essential, comprehensive reference for undergraduate and graduate students, and researchers in mathematics, operations research and computer science, and it will also prove invaluable to specialists in related areas, such as meteorology, physics and computational biology.
The binomial ideal of the intersection axiom for conditional probabilities
The binomial ideal associated with the intersection axiom of conditional probability is shown to be radical and is expressed as an intersection of toric prime ideals. This solves a problem in
Mathematical Essays in honor of Gian-Carlo Rota
Rotafest prgramme MacMahon's partition analysis - I the lecture hall partition theorem, George E.Andrews the cd-index of zonotypes and arrangements, Louis J. Billera, Richard Ehrenbor and margar