Sage has a package called 4ti2 ("sage -i 4ti2" will install it, at least if your Sage installation is compiled from source, other, which gives you a tool to compute with groebner bases of binomial ideals (more precisely, toric ideals, but this is more or less the same) see http://www.4ti2.de/groebner.html In particular the universal GB of toric ideals are known as Graver bases, see e.g. p.60 of https://homepages.warwick.ac.uk/staff/D.Maclagan/papers/indialectures.pdf.gz and they can be computed by 4ti2, see http://www.4ti2.de/graver.html
HTH Dima On Saturday, December 24, 2016 at 1:03:20 PM UTC, NITIN DARKUNDE wrote: > > Dear group members, > I have found out a grobner basis of an ideal associated to some > binary linear code using sage. Output contains 2127 polynomials > (binomials) in 19 variables( I used degrevlex order). Is there any command > in sage via which one can compute Universal Grobner basis and Graver basis > of an ideal with which we started? > -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To post to this group, send email to sage-support@googlegroups.com. Visit this group at https://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.