Lexicographic and reverse lexicographic quadratic Gröbner bases of cut ideals

Abstract

Hibi conjectured that if a toric ideal has a quadratic Gröbner basis, then the toric ideal has either a lexicographic or a reverse lexicographic quadratic Gröbner basis. In this paper, we present a cut ideal of a graph that serves as a counterexample to this conjecture. We also discuss the existence of a quadratic Gröbner basis of a cut ideal of a cycle. Nagel and Petrović claimed that a cut ideal of a cycle has a lexicographic quadratic Gröbner basis using the results of Chifman and Petrović. However, we point out that the results of Chifman and Petrović used by Nagel and Petrović are incorrect for cycles of length greater than or equal to 6. Hence the existence of a quadratic Gröbner basis for the cut ideal of a cycle (a ring graph) is an open question. We also provide a lexicographic quadratic Gröbner basis of a cut ideal of a cycle of length less than or equal to 7.2010 Mathematics Subject Classification. 13P10.

The $h^{*}$-polynomial of the cut polytope of $K_{2,m}$ in the lattice spanned by its vertices

“…The notion of cut ideals was introduced in [20]. The toric ring and ideal of A Cut(G) were investigated in, e.g., [5,10,9,11,14,15]. The cut ideal I G of a graph G is generated by quadratic binomials if and only if G is free of K 4 minors [5].…”

Classes of cut ideals and their Betti numbers

“…Sturmfels and Sullivant [21] started an interesting connection to algebraic geometry and commutative algebra by introducing toric cut ideals and -algebras, which have been intensively studied in the last decade. See, e.g., [7,14,16,17,18,19,20].…”