Work

An algorithm for computing the universal Gröbner Basis of graph ideals

Year: 2013

Type: preprint

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 theoretically knowledge of this set and on a recent, efficiently computable algorithmic characterization of the Graver basis of the ideal.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1307.7224

Authors: Stamatiou, Yannis C., Tatakis, Christos

Institutions: Computer Technology Institute and Press “DIOPHANTUS”, University of Patras, University of Ioannina

Language: English

Topic: Polynomial and algebraic computation

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2949642491

Cites: 10

Cited by:

Related to: 10