Did I screw up my last post ?
I thought that in my last post I also wrote that the computation in polynomial rings over integers
(std(), reduce(), intersect() and others ) in Singular is broken (for years and probably did never work):
for some (not for all ) input the user may and will get incorrect results. However, there is ongoing work to fix this issue.
bughunter wrote:
Bavithra wrote:
NFMora function works only for the fields. We are working on integer rings. Is there any function to reduce in integer rings ?
To my knowledge there is no educational implementation over integer rings in Singular.
I'm aware of the following educational alternative:
sagemath.org/doc/reference/polynomial_rings/sage/rings/polynomial/toy_buchberger.html
However, there is no guarantee that this implementation is not buggy, too ( I didn't check )