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 [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/sage-support.
For more options, visit https://groups.google.com/d/optout.
