Binomial edge ideals with quadratic Gröbner bases

Authors Marilena Crupi, Giancarlo Rinaldo

Publication date 22 November 2011

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1007.4383, http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p211.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

binomial ideal edge ideal Gröbner basis

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Combinatorial aspects of simplicial complexes (05E45) Structure, classification theorems for modules and ideals in commutative rings (13C05) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)

Abstract: Let

G

be a simple graph on the vertex set

V (G) = [n] = 1, ..., n

and edge ideal

E (G)

. We consider the class of closed graphs. A closed graph is a simple graph satisfying the following property: for all edges

i, j

and

k, e l l

with

i < j

and

k < e l l

one has

j, e l l i n E (G)

if

i = k

, and

i, k i n E (G)

if

j = e l l

. We state some criteria for the closedness of a graph

G

that do not depend necessarily from the labelling of its vertex set. Consequently, if

S = K [x_{1}, ..., x_{n}, y_{1}, ..., y_{n}]

is a polynomial ring in

2 n

variables with coefficients in a field

K

, we obtain some criteria for the Koszulness of the quotient algebra

S / J_{G}

, where

J_{G}

is the binomial edge ideal of

S

i.e. the ideal generated by the binomials

f_{i j} = x_{i} y_{j} - x_{j} y_{i}

such that

i < j

and

i, j

is an edge of

G

(cite{HH}).

Review text

Given a simple undirected graph \(G\) on \([n]\), the binomial edge ideal associated to \(G\) is the ideal \(J_G \subset S=K[x_1, \ldots, x_n, y_1, \ldots, y_n]\) generated by the binomials \(x_iy_j - x_jy_i\) for each edge \(\{i,j\}\) in \(G\). These ideals were introduced by \textit{J. Herzog, T. Hibi, F. Hreinsdóttir, T. Kahle}, and \textit{J. Rauh} [Adv. Appl. Math. 45, No. 3, 317--333 (2010; Zbl 1196.13018)], wherein they proved that \(J_G\) has a quadratic Gröbner basis under the lexicographic order if and only if \(G\) is closed, i.e., the edges satisfy a simple but technical condition, with respect to the given labeling of the vertices. These ideals were also independently studied by \textit{M. Ohtani} [Commun. Algebra 39, No. 3, 905--917 (2011; Zbl 1225.13028)]. The authors define a graph to be closed if it is closed with respect to some labeling of the vertices. They prove that a graph is closed if and only if its binomial edge ideal has a quadratic Gröbner basis with respect to some term order. Moreover, the authors show that closedness of a graph is characterized by its clique complex, although an order on the facets of the clique complex must then be considered.

Recommendations

Cited in

(25)

This page was built for publication: Binomial edge ideals with quadratic Gröbner bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648403)