I am a member of the Singular group and working on standard bases over rings. Therefore as a test case we have implemented standard bases for Z/2^n[x_1,...x_k] and the corresponding polynomial arithmetic.
As we plan to allow this computations for Z/n[x_1,...,x_k], we will implement corresponding polynomial arithmetic. If this is of interest for you, I can bring forward this implementation in the schedule. It is not really difficult, as Z/2^n is present. The minor points are handling division, gcd and lcm. At the moment, we allow division by zero divisors, if possible, even if it may not be unique. ... Oliver Wienand --~--~---------~--~----~------------~-------~--~----~ 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://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
