I have been looking at the paper and at first glance don't see any reason that would prevent the stabilization algorithm from working over any Euclidean domain, as there you have division with remainder, gcd, xgcd, all ideals are principal, sum of ideals is generated by the gcd and so on. The only obvious change that I see is that in the Split algorithm ceil(log log D) should be replaced by something like ceil(log log N(D)) where N is the Euclidean norm (which would be the degree in your case for polynomials over a field). Or am I missing something?
Cheers J On 28 mayo, 21:41, Rob Beezer <goo...@beezer.cotse.net> wrote: > On May 25, 2:22 pm, John Cremona <john.crem...@gmail.com> wrote: > > > If no-one else is more explicit I'll look for a reference tomorrow. > > For the record, off-list John Cremona pointed me to "Fast Algorithms > for Linear Algebra mod N" by Storjohann and Mulders, where this is > called "stablization of p and q mod r" and there is an > (apparently efficient) algorithm given (for integers). > > Thanks, John. -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
