On May 29, 2:09 am, javier <vengor...@gmail.com> wrote: > 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?
Yes, that was exactly my impression as well. Though I thought maybe the "celing log log D" would become just "ceiling log(degree)" It seemed to be that one of the logs came from the observation that 2 is the smallest prime, which would not be useful (or applicable) in the case of polynomials. But I have not gone back to double-check my work, nor yet attempted to actually implement it. Rob -- 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
