An algorithm for computing the universal Gr\"obner Basis of graph ideals

Authors Yannis C. Stamatiou, Christos Tatakis

Publication date 27 July 2013

Graph algorithms (graph-theoretic aspects) (05C85) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Symbolic computation and algebraic computation (68W30)

Abstract: The universal Gr"obner basis of an ideal is a Gr"obner basis with respect to all term orders simultaneously. The aim of this paper is to present an algorithmic approach to compute the universal Gr"obner basis for the toric ideal corresponding to an undirected graph, based on the theoretically knowledge of this set and on a recent, efficiently computable algorithmic characterization of the Graver basis of the ideal.

This page was built for publication: An algorithm for computing the universal Gr\"obner Basis of graph ideals

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