Lexicographic and reverse lexicographic quadratic Gröbner bases of cut ideals. (March 2021)

• Record Type: Journal Article
• Authors: Sakamoto, Ryuichi
• Is Part Of: Journal of symbolic computation. Volume 103(2021)
• Page Start: 201
• Page End: 212
• Publication Date: 2021-03
• Subjects: Gröbner bases -- Cut ideals -- Finite graphs; Mathematics -- Data processing -- Periodicals; Numerical analysis -- Data processing -- Periodicals; Automatic programming (Computer science) -- Periodicals; Mathématiques -- Informatique -- Périodiques; Analyse numérique -- Informatique -- Périodiques; Programmation automatique -- Périodiques; Automatic programming (Computer science); Mathematics -- Data processing; Numerical analysis -- Data processing; Periodicals; Electronic journals; 510.285
• DOI: 10.1016/j.jsc.2019.12.004
• Languages: English
• ISSNs: 0747-7171

Abstract

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.