An algorithm for computing the universal Gröbner Basis of graph ideals. Issue 2 (3rd April 2019)

• Record Type: Journal Article
• Authors: Stamatiou, Yannis C.; Tatakis, Christos
• Is Part Of: International journal of computer mathematics. Volume 4:Issue 2(2019)
• Page Start: 67
• Page End: 75
• Publication Date: 2019-04-03
• Subjects: Algorithms -- universal Gröbner basis -- complexity -- Graver basis -- toric ideals of graphs -- Gröbner bases; Primary 14M25 -- 68Q40 -- 68W30 -- 13P10 -- 05C85; Computer systems -- Periodicals; Computer systems; Periodicals; 004
• DOI: 10.1080/23799927.2019.1609585
• Languages: English
• ISSNs: 2379-9927

Abstract

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