8 citations · 26 across the 10 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.AC2013
An algorithm for computing the universal Gröbner Basis of graph ideals
Yannis C. Stamatiou, Christos Tatakis
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 th…
math.AC2013★ 5 cited
Graver degrees are not polynomially bounded by true circuit degrees
Christos Tatakis, Apostolos Thoma
Let be a toric ideal. We prove that the degrees of the elements of the Graver basis of are not polynomially bounded by the true degrees of the circuits of .