2018-03-22 23:44:59 +0100 | received badge | ● Notable Question (source) |

2018-03-22 23:44:59 +0100 | received badge | ● Popular Question (source) |

2010-10-14 23:11:12 +0100 | received badge | ● Student (source) |

2010-10-14 23:11:11 +0100 | received badge | ● Scholar (source) |

2010-08-23 17:07:44 +0100 | marked best answer | Implementing different groebner_basis() algorithms With the current Groebner basis commands in Sage, there is not a good way to do this. None of the underlying methods like As a workaround, you can do something like the following: I've made this ticket #9789. |

2010-08-23 15:28:46 +0100 | asked a question | Implementing different groebner_basis() algorithms I'm not sure if this is the correct forum to ask this type of question, but I'll try anyway. I am curious if there is a way to do the following in Sage. I would like a way to make a Groebner basis calculation to not worry about calculations involving polynomials of too high degree. Macaulay2's gb command has the ability to specify this with an option called HardDegreeLimit, for instance. The Sage documentation on groebner_basis seems to imply that I can use Macaulay2's gb command with this option, but I don't know how to make it work. Singular's std command also has a degBound option, but I again don't know how to use this in my Sage implementation. |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.