> * Get the okay from Oliver Wienand the main author of the code. I think > Oliver is reading this list.
You have my okay and please ask if anything is unclear. At the moment I can only guarantee for the assumed correctness of the polynomial arithmetic, Gröbner basis and reduction (reduce, interred) over Z, Z/ m, Z/p^n. Other kernel commands may or may not work and may or may not give meaningful answers. But specially the arithmetic may have a few caveats, as I only really tested the operations for Gröbner basis. But having it in SAGE would help me a lot to better test the code. I also implemented a normal form algorithm for polynomial with respect to the ideal of polynomial defining a constant zero functions (without needing its Gröbner bases). The theory is mainly from Singmaster. And further an algorithm which explicitly constructs the bases without Buchberger or similar. I am not sure if this is of interest. ... Oliver --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
